alphaFeedback

WorksMathematics

Beyond left-continuity: t-norms on the fuzzy unit interval induced by pairs of t-norms

AI contributions
Not recorded for this paper
View details

Abstract

We define a binary operation T1⋆T2T_1\star T_2 on the fuzzy unit interval \I by extending the natural action of T1T_1 and T2T_2 on step functions. When both T1T_1 and T2T_2 are left-continuous, this operation coincides with the tensor product of the corresponding quantales and therefore yields a t-norm on \I. Without left-continuity, the situation becomes more subtle. We prove that if at least one of the two t-norms is continuous, then T1⋆T2T_1\star T_2 is still a t-norm on \I. We also show by counterexample that continuity cannot simply be dropped. The operation \DN fails to be associative. On the other hand, TD⋆TDT_D\star T_D is a t-norm despite TDT_D being neither continuous nor left-continuous, indicating that continuity is not a necessary condition.

Introduction

Triangular norms, or t-norms, are associative, commutative, non-decreasing binary operations on the real unit interval [0,1][0,1] with neutral element 11. They were introduced in 1963 by Schweizer and Sklar [17, 18] to formulate the triangle inequality in probabilistic metric spaces. In fuzzy set theory, t-norms have been extensively used to model fuzzy intersections [1, 16] and conjunction operators in fuzzy logic [6, 11].

In 1967, Goguen introduced LL-fuzzy sets [8], where the codomain of a fuzzy set is a partially ordered set (poset) LL. Noting that the definition of a t-norm on [0,1][0,1] can be naturally extended to any bounded poset, De Cooman and Kerre generalized the concept of t-norms to bounded posets [5], thereby providing fuzzy intersection operators for Goguen’s LL-fuzzy sets.

Following Goguen’s general framework, many different types of posets LL have been employed as codomains of fuzzy sets. Among these, an important class consists of posets into which the unit interval [0,1][0,1] can be embedded as a subset, because such posets allow a more precise description of concepts with subtle fuzzy features. A prominent example is Zadeh’s type-2 fuzzy sets [20, 21], where the codomain is taken to be the set M=[0,1][0,1]\mathbb{M} = [0,1]^{[0,1]} of all fuzzy subsets of [0,1][0,1]. To extend the usual order on [0,1][0,1] to M\mathbb{M}, two compatible partial orders ⊑⊓\sqsubseteq_{\sqcap} and ⊑⊔\sqsubseteq_{\sqcup} were introduced on M\mathbb{M}, yielding the posets (M,⊑⊓)(\mathbb{M},\sqsubseteq_{\sqcap}) and (M,⊑⊔)(\mathbb{M},\sqsubseteq_{\sqcup}) [12]. Also in [12], the authors lifted t-norms on [0,1][0,1] to binary operations on these two posets by using the meet operation ∧\wedge on the codomain [0,1][0,1].

In fuzzy topology, Hutton introduced the fuzzy unit interval I(L)\mathbb{I}(L) in 1975 as a lattice-theoretic extension of the real unit interval, where LL is a complete lattice [13]. In the special case L=[0,1]L = [0,1], the fuzzy unit interval can be characterized equivalently as the collection of all right-continuous non-increasing functions f:[0,1]⟶[0,1]f : [0,1] \longrightarrow[0,1] satisfying f(1)=0f(1) = 0, which forms a subset of M\mathbb{M}. We denote this particular fuzzy unit interval by I\mathbb{I}. Endowed with the pointwise order, I\mathbb{I} is a subposet of M\mathbb{M}.

In fact, I\mathbb{I} enjoys even stronger structural properties. The unit interval [0,1][0,1] embeds into I\mathbb{I} as a complete sublattice, and I\mathbb{I} is precisely the tensor product of [0,1][0,1] with itself in the category SUP, whose objects are complete lattices and whose morphisms are supremum-preserving maps. Consequently, t-norms on I\mathbb{I} can be constructed by forming the tensor product of two quantales with the same underlying set [0,1][0,1] [7, 9, 10]. Recall that ([0,1],T)([0,1],T) is a quantale if and only if TT is left-continuous. Thus, the quantale tensor product construction of a t-norm on I\mathbb{I} requires both input t-norms to be left-continuous. This observation leads to a natural question: given two arbitrary t-norms T1T_1 and T2T_2 on [0,1][0,1] that are not necessarily left-continuous, can one still construct a t-norm on I\mathbb{I} from them?

In this paper, we give sufficient conditions under which this construction yields a t-norm. We present a general method for constructing a binary operation T1⋆T2T_1 \star T_2 on I\mathbb{I} starting from two arbitrary t-norms T1T_1 and T2T_2 on [0,1][0,1]. When both t-norms are left-continuous, this operation coincides with the quantale tensor product construction already known in the literature; the existence of the resulting unital quantale follows from [9 Theorem 4.2]. Our proof in this case is a direct verification for the unit interval, rather than a new tensor-product construction. We then prove that T1⋆T2T_1 \star T_2 is a t-norm on I\mathbb{I} whenever at least one of T1T_1, T2T_2 is continuous. We also provide examples illustrating two complementary phenomena: on the one hand, if neither component t-norm is continuous, T1⋆T2T_1 \star T_2 need not be associative and may therefore fail to be a t-norm on I\mathbb{I}; on the other hand, although the drastic product t-norm TDT_D is neither continuous nor left-continuous, TD⋆TDT_D \star T_D is still a t-norm on I\mathbb{I}.

The main associativity theorem goes beyond the case of two left-continuous components because the second component may fail left-continuity when the first is continuous. The pair (TD,TD)(T_D,T_D) shows that both components may fail left-continuity, whereas (TD,TnM)(T_D,T_{\mathrm{nM}}) shows that left-continuity of only one component does not suffice. These results provide sufficient conditions and contrasting examples, not a classification of all admissible pairs.

The paper is organized as follows. Section 2 recalls basic notions concerning fuzzy unit intervals and t-norms on [0,1][0,1]. In Section 3 we introduce the operation T1⋆T2T_1 \star T_2, establish its fundamental properties, and discuss its Archimedean-type properties. Section 4 is devoted to proving our main result: if either T1T_1 or T2T_2 is continuous, then T1⋆T2T_1 \star T_2 is a t-norm on I\mathbb{I}; two important examples are also discussed there. Section 5 concludes the paper and outlines directions for future work.

Preliminaries

Unless explicitly stated otherwise, (P,≤)(P,\leq) denotes a bounded partially ordered set. Its bottom and top elements are denoted by ⊥\bot and ⊤\top, respectively. We always assume that ⊥≠⊤\bot\ne\top.

Equipped with the usual order of real numbers, the unit interval [0,1][0,1] is a bounded partially ordered set with ⊥=0\bot=0 and ⊤=1\top=1. It is also a complete lattice. For a subset A⊆[0,1]A \subseteq[0,1], we write sup⁡A\sup A and inf⁡A\inf A for the least upper bound and greatest lower bound of AA, respectively. In particular, sup⁡∅=0\sup\varnothing=0 and inf⁡∅=1\inf\varnothing=1.

Let f:[0,1]⟶[0,1]f:[0,1]\longrightarrow[0,1] be a non-increasing function. Define

f(t−)=inf⁡s<tf(s),f(t+)=sup⁡s>tf(s)f(t^{-})=\inf_{s<t} f(s), \qquad f(t^{+})=\sup_{s>t} f(s)

for all t∈[0,1]t\in[0,1]. In particular,

f(0−)=inf⁡∅=1,f(1+)=sup⁡∅=0.f(0^{-})=\inf\varnothing=1, \qquad f(1^{+})=\sup\varnothing=0.

Hutton’s fuzzy unit interval [13] is defined by taking a general complete lattice LL as the codomain of the fuzzy sets. In the present paper we restrict to the case L=[0,1]L=[0,1].

Definition 2.1. Let MR\mathbb{M}^{R} be the set of all non-increasing maps λ:[0,1]⟶[0,1]\lambda:[0,1]\longrightarrow[0,1] with λ(0)=1\lambda(0)=1 and λ(1)=0\lambda(1)=0. Let ∼\sim be an equivalence relation on MR\mathbb{M}^{R} given by

λ∼μ⟺∀t∈[0,1], λ(t−)=μ(t−), λ(t+)=μ(t+).\lambda\sim\mu\quad\Longleftrightarrow\quad\forall t\in[0,1],\ \lambda(t^{-})=\mu(t^{-}),\ \lambda(t^{+})=\mu(t^{+}).

The quotient set MR/∼\mathbb{M}^{R}/\sim is called the fuzzy unit interval.

We denote by I\mathbb{I} the collection of all right-continuous non-increasing maps f:[0,1]⟶[0,1]f:[0,1]\longrightarrow[0,1] satisfying f(1)=0f(1)=0. Then a map f:[0,1]⟶[0,1]f:[0,1]\longrightarrow[0,1] belongs to I\mathbb{I} if and only if f(inf⁡A)=sup⁡f(A)f(\inf A)=\sup f(A) for all A⊆[0,1]A\subseteq[0,1].

Proposition 2.2. *There is a bijection between the set I\mathbb{I} and the quotient set MR/∼\mathbb{M}^{R}/\sim.

Proof. Given an element λ∈MR\lambda\in\mathbb{M}^{R}, let λˉ(t)=λ(t+)\bar{\lambda}(t)=\lambda(t^{+}) for all t∈[0,1]t \in[0,1]. Then λˉ∈I\bar{\lambda} \in\mathbb{I}. We first show that the map [λ]↦λˉ[\lambda]\mapsto\bar{\lambda} is well-defined from MR/∼\mathbb{M}^{R}/\sim to I\mathbb{I}. By the definition of the equivalence relation ∼\sim on MR\mathbb{M}^{R}, if λ∼μ\lambda\sim\mu, then clearly λˉ=μˉ\bar{\lambda}=\bar{\mu}. Thus, the assignment is independent of the choice of representatives.

To prove injectivity, assume [λ]≠[μ][\lambda]\ne[\mu]. By the definition of ∼\sim, either λ(t0+)≠μ(t0+)\lambda(t_{0}^{+})\ne\mu(t_{0}^{+}) or λ(t0−)≠μ(t0−)\lambda(t_{0}^{-})\ne\mu(t_{0}^{-}) for some t0∈[0,1]t_{0}\in[0,1]. We consider two cases:

  1. If λ(t0+)≠μ(t0+)\lambda(t_{0}^{+})\ne\mu(t_{0}^{+}) for some t0t_{0}, then clearly λˉ≠μˉ\bar{\lambda}\ne\bar{\mu}.

  1. If λ(t0−)≠μ(t0−)\lambda(t_{0}^{-})\ne\mu(t_{0}^{-}) for some t0t_{0}, without loss of generality assume λ(t0−)<μ(t0−)\lambda(t_{0}^{-})<\mu(t_{0}^{-}). Choose δ>0\delta>0 such that for all t∈(t0−δ,t0)t\in(t_{0}-\delta,t_{0}),

λ(t)<λ(t0−)+μ(t0−)2<μ(t).\lambda(t)<\frac{\lambda(t_{0}^{-})+\mu(t_{0}^{-})}{2}<\mu(t).

For all t∈(t0−δ,t0)t\in(t_{0}-\delta,t_{0}), since μ(t)\mu(t) is greater than the constant λ(t0−)+μ(t0−)2\frac{\lambda(t_{0}^{-})+\mu(t_{0}^{-})}{2}, we have λ(t0−)+μ(t0−)2≤μ(t+)\frac{\lambda(t_{0}^{-})+\mu(t_{0}^{-})}{2}\le\mu(t^{+}). Consequently, for all t∈(t0−δ,t0)t\in(t_{0}-\delta,t_{0}),

λ(t+)≤λ(t)<λ(t0−)+μ(t0−)2≤μ(t+),\lambda(t^{+})\le\lambda(t)<\frac{\lambda(t_{0}^{-})+\mu(t_{0}^{-})}{2}\le\mu(t^{+}),

which implies λˉ≠μˉ\bar{\lambda}\ne\bar{\mu}.

Thus, the map is injective.

For surjectivity, let λ∈I\lambda\in\mathbb{I} be arbitrary. Define λ~∈MR\widetilde{\lambda}\in\mathbb{M}^{R} by

λ~(t)={λ(t),t>0,1,t=0.\widetilde{\lambda}(t)= \begin{cases} \lambda(t), & t>0,\\ 1, & t=0. \end{cases}

Then λ~ˉ=λ\bar{\widetilde{\lambda}}=\lambda, showing that the map is also surjective.

Therefore, the assignment [λ]↦λˉ[\lambda]\mapsto\bar{\lambda} is a bijection as desired.

Definition 2.3. For f∈If\in\mathbb{I}, define its adjoint by

f∗(y)=inf⁡{x∈[0,1]:f(x)≤y},y∈[0,1].f^{*}(y)=\inf\{x\in[0,1]:f(x)\le y\},\qquad y\in[0,1].

The set under the infimum is nonempty because f(1)=0f(1)=0.

Lemma 2.4. For f∈If\in\mathbb{I}, the map f∗f^{*} is the unique map satisfying

f(x)≤y⟺f∗(y)≤x(x,y∈[0,1]).f(x)\le y \quad\Longleftrightarrow\quad f^{*}(y)\le x \qquad(x,y\in[0,1]).

Moreover, f∗∈If^{*}\in\mathbb{I}, (f∗)∗=f(f^{*})^{*}=f, and f≤gf\le g if and only if f∗≤g∗f^{*}\le g^{*}.

Proof. Fix yy and put Ay={x:f(x)≤y}A_y=\{x:f(x)\le y\}. Since ff takes arbitrary infima to suprema, f(inf⁡Ay)=sup⁡f(Ay)≤yf(\inf A_y)=\sup f(A_y)\le y. Thus Ay=[f∗(y),1]A_y=[f^{*}(y),1], proving the equivalence and uniqueness. For every B⊆[0,1]B\subseteq[0,1] and x∈[0,1]x\in[0,1], this equivalence gives

f∗(inf⁡B)≤x⟺f(x)≤inf⁡B⟺(∀b∈B) f∗(b)≤x⟺sup⁡b∈Bf∗(b)≤x.\begin{aligned} f^{*}(\inf B)\le x &\Longleftrightarrow f(x)\le\inf B\\ &\Longleftrightarrow(\forall b\in B)\ f^{*}(b)\le x\\ &\Longleftrightarrow\sup_{b\in B}f^{*}(b)\le x. \end{aligned}

Consequently f∗(inf⁡B)=sup⁡b∈Bf∗(b)f^{*}(\inf B)=\sup_{b\in B}f^{*}(b), including B=∅B=\varnothing, and therefore f∗∈If^{*}\in\mathbb{I}. The symmetry of the adjunction equivalence gives (f∗)∗=f(f^{*})^{*}=f. If f≤gf\le g, then {x:g(x)≤y}⊆{x:f(x)≤y}\{x:g(x)\le y\}\subseteq\{x:f(x)\le y\}, so f∗≤g∗f^{*}\le g^{*}. Applying this implication to f∗,g∗f^{*},g^{*} proves the converse.

Thus f↦f∗f\mapsto f^{*} is an order-preserving involution, hence a complete lattice automorphism.

Step functions play a fundamental role in the structure of I\mathbb{I}. For r,a∈[0,1]r,a\in[0,1], define the step function ⟨r,a⟩:[0,1]⟶[0,1]\langle r,a\rangle:[0,1]\longrightarrow[0,1] by

⟨r,a⟩(x)={a,0≤x<r,0,r≤x≤1.\langle r,a\rangle(x)= \begin{cases} a, & 0\le x<r,\\ 0, & r\le x\le1. \end{cases}

Equipped with the pointwise order, I\mathbb{I} is a complete lattice whose top and bottom elements are ⟨1,1⟩\langle1,1\rangle and ⟨0,0⟩\langle0,0\rangle, respectively. Suprema are calculated pointwise: for every family (fi)i∈J⊆I(f_i)_{i\in J}\subseteq\mathbb{I},

(sup⁡i∈Jfi)(x)=sup⁡i∈Jfi(x).\left(\sup_{i\in J} f_i\right)(x)=\sup_{i\in J}f_i(x).

Indeed, the right-hand side is non-increasing, vanishes at 11, and satisfies, for x<1x<1,

sup⁡y>xsup⁡i∈Jfi(y)=sup⁡i∈Jsup⁡y>xfi(y)=sup⁡i∈Jfi(x).\sup_{y>x}\sup_{i\in J}f_i(y)=\sup_{i\in J}\sup_{y>x}f_i(y)=\sup_{i\in J}f_i(x).

It therefore belongs to I\mathbb{I} and is the least upper bound. This also covers the empty family. Let

E:={⟨r,a⟩∣r,a∈[0,1]}.\mathcal{E}:=\{\langle r,a\rangle\mid r,a\in[0,1]\}.

The following lemma shows that E\mathcal{E} is sup-dense in I\mathbb{I}.

Lemma 2.5. (1) For all f∈If\in\mathbb{I} and all ⟨s,a⟩∈E\langle s,a\rangle\in\mathcal{E}, it holds that

⟨s,a⟩≤f⟺a≤f(s−).(1)\langle s,a\rangle\leq f\Longleftrightarrow a\leq f(s^-). \tag*{(1)}

(2) For each f∈If\in\mathbb{I}, it holds that

f=sup⁡r∈[0,1]⟨r,f(r)⟩=sup⁡r∈(0,1]⟨r,f(r−)⟩.(2)f=\sup_{r\in[0,1]}\langle r,f(r)\rangle=\sup_{r\in(0,1]}\langle r,f(r^-)\rangle. \tag*{(2)}

Consequently, for every x∈[0,1]x\in[0,1],

f(x)=sup⁡x<rf(r−).f(x)=\sup_{x<r}f(r^-).

Proof. (1) We have

⟨s,a⟩≤f⟺∀x<s, ⟨s,a⟩(x)≤f(x)⟺∀x<s, a≤f(x)⟺a≤f(s−).\begin{aligned} \langle s,a\rangle\leq f&\Longleftrightarrow\forall x<s,\ \langle s,a\rangle(x)\leq f(x)\\ &\Longleftrightarrow\forall x<s,\ a\leq f(x)\\ &\Longleftrightarrow a\leq f(s^-). \end{aligned}

(2) First, for every x∈[0,1]x\in[0,1], we have

f(x)=sup⁡r>xf(r)(since ∀A⊆[0,1], f(inf⁡A)=sup⁡f(A))=sup⁡r>x⟨r,f(r)⟩(x)(by the definition of ⟨r,f(r)⟩)=sup⁡r∈[0,1]⟨r,f(r)⟩(x).(since ⟨r,f(r)⟩(x)=0 if r≤x)\begin{aligned} f(x)&=\sup_{r>x}f(r) &&\text{(since } \forall A\subseteq[0,1],\ f(\inf A)=\sup f(A)\text{)}\\ &=\sup_{r>x}\langle r,f(r)\rangle(x) &&\text{(by the definition of }\langle r,f(r)\rangle\text{)}\\ &=\sup_{r\in[0,1]}\langle r,f(r)\rangle(x). &&\text{(since }\langle r,f(r)\rangle(x)=0\text{ if }r\leq x\text{)} \end{aligned}

Hence,

f=sup⁡r∈[0,1]⟨r,f(r)⟩.f=\sup_{r\in[0,1]}\langle r,f(r)\rangle.

Second, notice that f(r)≤f(r−)f(r)\leq f(r^-) since ff is non-increasing. By (1), it holds that

⟨r,f(r)⟩≤⟨r,f(r−)⟩≤f.\langle r,f(r)\rangle\leq\langle r,f(r^-)\rangle\leq f.

Hence,

f=sup⁡r∈[0,1]⟨r,f(r)⟩≤sup⁡r∈(0,1]⟨r,f(r−)⟩≤f,f=\sup_{r\in[0,1]}\langle r,f(r)\rangle\leq\sup_{r\in(0,1]}\langle r,f(r^-)\rangle\leq f,

so f=sup⁡r∈(0,1]⟨r,f(r−)⟩f=\sup_{r\in(0,1]}\langle r,f(r^-)\rangle. By the definition of step function,

⟨r,f(r−)⟩(x)={0,x≥r,f(r−),x<r.\langle r,f(r^-)\rangle(x)= \begin{cases} 0, & x\geq r,\\ f(r^-), & x<r. \end{cases}

Thus, it holds that

f(x)=sup⁡r∈(0,1]⟨r,f(r−)⟩(x)=sup⁡x<r⟨r,f(r−)⟩(x)=sup⁡x<rf(r−).f(x)=\sup_{r\in(0,1]}\langle r,f(r^-)\rangle(x)=\sup_{x<r}\langle r,f(r^-)\rangle(x)=\sup_{x<r}f(r^-).

Remark 2.6. A map from the product of two complete lattices to a complete lattice is a bimorphism if it preserves arbitrary suprema in each variable separately, including the empty supremum. The map

ε:[0,1]×[0,1]⟶I,ε(r,a)=⟨r,a⟩,\varepsilon: [0,1] \times[0,1] \longrightarrow\mathbb{I}, \qquad\varepsilon(r,a) = \langle r,a\rangle,

is a universal bimorphism. To see this directly, the pointwise join formula shows that ε\varepsilon preserves arbitrary suprema in each variable. Given a bimorphism φ:[0,1]×[0,1]⟶L\varphi: [0,1] \times[0,1] \longrightarrow L, where LL is a complete lattice, define

φˉ(f)=sup⁡r∈[0,1]φ(r,f(r)).\bar{\varphi}(f) = \sup_{r \in[0,1]} \varphi(r,f(r)).

For any family (fi)i∈J(f_i)_{i \in J}, preservation of suprema by φ\varphi in its second variable gives

φˉ(sup⁡ifi)=sup⁡rφ(r,sup⁡ifi(r))=sup⁡rsup⁡iφ(r,fi(r))=sup⁡isup⁡rφ(r,fi(r))=sup⁡iφˉ(fi).\bar{\varphi}\left(\sup_i f_i\right) = \sup_r \varphi\left(r,\sup_i f_i(r)\right) = \sup_r \sup_i \varphi(r,f_i(r)) = \sup_i \sup_r \varphi(r,f_i(r)) = \sup_i \bar{\varphi}(f_i).

Moreover, φ(r,0)=⊥L\varphi(r,0) = \bot_L and preservation in the first variable yield

φˉ(⟨s,a⟩)=sup⁡r≤sφ(r,a)=φ(s,a),\bar{\varphi}(\langle s,a\rangle) = \sup_{r \le s} \varphi(r,a) = \varphi(s,a),

where the case s=0s=0 uses the empty supremum. Hence φˉ∘ε=φ\bar{\varphi} \circ\varepsilon= \varphi. Uniqueness follows from f=sup⁡r⟨r,f(r)⟩f = \sup_r \langle r,f(r)\rangle and preservation of suprema. This proves that I\mathbb{I}, together with ε\varepsilon, realizes the tensor product of [0,1][0,1] with itself in SUP [3].

Let b:[0,1]×[0,1]⟶[0,1]⊗[0,1]b : [0,1] \times[0,1] \longrightarrow[0,1] \otimes[0,1] be the canonical universal bimorphism in a standard tensor-product model, such as those described via Galois connections or lower sets in [9, 19]. The universal properties give a unique complete lattice isomorphism

U:[0,1]⊗[0,1]⟶I,U(b(r,a))=⟨r,a⟩.U : [0,1] \otimes[0,1] \longrightarrow\mathbb{I}, \qquad U(b(r,a)) = \langle r,a\rangle.

Thus ε=U∘b\varepsilon= U \circ b: our map is the canonical universal bimorphism expressed in the step-function realization of the same tensor product. The map ε\varepsilon is not injective, since ⟨r,0⟩=⟨0,a⟩=⊥\langle r,0\rangle= \langle0,a\rangle= \bot for all r,ar,a. Thus ε\varepsilon is not an embedding of the product poset [0,1]×[0,1][0,1] \times[0,1].

Remark 2.7. Since there exists a bijection between the set MR/∼\mathbb{M}^{\mathbb{R}}/\sim and I\mathbb{I}, we often take I\mathbb{I} to represent the fuzzy unit interval. In fact, adopting the set I\mathbb{I} to denote the fuzzy unit interval offers some advantages. Specifically, it allows us to more explicitly reveal its close relationships with the following two mathematical objects.

  1. I\mathbb{I} is a subset of the codomain of type-2 fuzzy sets. Recall from [12, 20, 21] that the set M=[0,1][0,1]\mathbb{M} = [0,1]^{[0,1]}, consisting of all fuzzy subsets of [0,1][0,1], is the codomain of type-2 fuzzy sets introduced by Zadeh. Clearly, I\mathbb{I} is a subset of M\mathbb{M}. Moreover, equipped with the pointwise order on I\mathbb{I}, the inclusion map I↪M\mathbb{I} \hookrightarrow\mathbb{M} is also an order embedding with respect to both orders ⊑⊓\sqsubseteq_{\sqcap} and ⊑⊔\sqsubseteq_{\sqcup}.

  1. I\mathbb{I} is isomorphic to Δ+\Delta^+. Recall from [18] that Δ+\Delta^+ is the set of all distance distribution functions. That is, for all F∈Δ+F \in\Delta^+, FF is a non-decreasing map from [0,∞][0,\infty] to [0,1][0,1] such that F(0)=0F(0) = 0, F(∞)=1F(\infty) = 1 and FF is left-continuous on (0,∞)(0,\infty). Notice that x↦−ln⁡xx \mapsto-\ln x is an isomorphism between ([0,1],≤)([0,1],\le) and ([0,∞],≥)([0,\infty],\ge). This order isomorphism gives rise to an isomorphism

Φ:Δ+⟶I,Φ(F)(x)={F(−ln⁡x),0<x≤1,F(∞),x=0.\Phi: \Delta^+ \longrightarrow\mathbb{I}, \qquad\Phi(F)(x) = \begin{cases} F(-\ln x), & 0 < x \le1,\\ F(\infty), & x = 0. \end{cases}

Definition 2.8. [5] Let (P,≤)(P,\le) be a bounded partially ordered set. A triangular norm, or t-norm, on (P,≤)(P,\le) is a binary operation T:P×P⟶PT : P \times P \longrightarrow P satisfying the following conditions:

(T1) ∀x∈P,T(x,⊤)=T(⊤,x)=x\forall x \in P, T(x,\top) = T(\top,x) = x,

(T2) ∀x,y∈P,T(x,y)=T(y,x)\forall x,y \in P, T(x,y) = T(y,x),

(T3) ∀x,y,z∈P,T(T(x,y),z)=T(x,T(y,z))\forall x,y,z \in P, T(T(x,y),z) = T(x,T(y,z)),

(T4) ∀x,x′,y,y′∈P,x≤x′,y≤y′⟹T(x,y)≤T(x′,y′)\forall x,x',y,y' \in P, x \le x', y \le y' \Longrightarrow T(x,y) \le T(x',y').

There are some important basic t-norms on the interval [0,1][0,1]; see, e.g., [2, 14]. We list them below:

  • minimum: TM(x,y)=min⁡{x,y}T_M(x,y)=\min\{x,y\},

  • product: TP(x,y)=x⋅yT_P(x,y)=x\cdot y,

  • Łukasiewicz t-norm: TL(x,y)=max⁡{x+y−1,0}T_L(x,y)=\max\{x+y-1,0\},

  • drastic product: TD(x,y)={min⁡{x,y},max⁡{x,y}=1,0,max⁡{x,y}<1,T_D(x,y)=\begin{cases}\min\{x,y\}, & \max\{x,y\}=1,\\ 0, & \max\{x,y\}<1,\end{cases}

  • the nilpotent minimum t-norm: TnM(x,y)={min⁡{x,y},x+y>1,0,x+y≤1.T^{\mathrm{nM}}(x,y)=\begin{cases}\min\{x,y\}, & x+y>1,\\ 0, & x+y\le1.\end{cases}

The t-norms TMT_M, TPT_P and TLT_L are continuous. The nilpotent minimum t-norm TnMT^{\mathrm{nM}} is left-continuous but not continuous, whereas the drastic product TDT_D is not left-continuous.

Operations on the fuzzy unit interval induced by pairs of t-norms

Given t-norms T1T_1 and T2T_2 on [0,1][0,1], we obtain a binary operation

T1⋆T2:E×E→E,T1⋆T2(⟨r,a⟩,⟨s,b⟩)=⟨T1(r,s),T2(a,b)⟩.(3)T_1\star T_2:\mathcal{E}\times\mathcal{E}\to\mathcal{E},\qquad T_1\star T_2(\langle r,a\rangle,\langle s,b\rangle)=\langle T_1(r,s),T_2(a,b)\rangle. \tag*{(3)}

This prescription is independent of the representation of a step function. Indeed, every nonzero step has unique parameters r,a>0r,a>0, whereas ⟨r,a⟩=⊥\langle r,a\rangle=\bot precisely when r=0r=0 or a=0a=0. Since every t-norm satisfies T(0,t)=0T(0,t)=0, a zero input always gives the zero step, independently of its parameters. For nonzero steps, ⟨r,a⟩≤⟨s,b⟩\langle r,a\rangle\le\langle s,b\rangle is equivalent to r≤sr\le s and a≤ba\le b. Consequently the operation on E\mathcal{E} is monotone. Its commutativity, associativity, and neutral element ⟨1,1⟩\langle1,1\rangle follow from the corresponding properties of T1,T2T_1,T_2. Since E\mathcal{E} is a sup-dense subset of I\mathcal{I}, the operation T1⋆T2T_1\star T_2 can be naturally extended to I\mathcal{I} as follows:

T1⋆T2(f,g)=sup⁡{T1⋆T2(⟨s,a⟩,⟨t,b⟩)∣⟨s,a⟩≤f, ⟨t,b⟩≤g}=sup⁡{⟨T1(s,t),T2(a,b)⟩∣⟨s,a⟩≤f, ⟨t,b⟩≤g}.\begin{aligned} T_1\star T_2(f,g)&=\sup\{T_1\star T_2(\langle s,a\rangle,\langle t,b\rangle)\mid\langle s,a\rangle\le f,\ \langle t,b\rangle\le g\}\\ &=\sup\{\langle T_1(s,t),T_2(a,b)\rangle\mid\langle s,a\rangle\le f,\ \langle t,b\rangle\le g\}. \end{aligned}

By monotonicity, when both inputs are steps, every term in the supremum is bounded by their product in (3), and that product itself is an admissible term. Thus the extension agrees with (3) on E\mathcal{E}.

Proposition 3.1. Let T1T_1 and T2T_2 be t-norms on [0,1][0,1]. Then

(1) T1⋆T2(f,g)=T1⋆T2(g,f)T_1\star T_2(f,g)=T_1\star T_2(g,f);

(2) If f1≤f2f_1\le f_2 and g1≤g2g_1\le g_2, then T1⋆T2(f1,g1)≤T1⋆T2(f2,g2)T_1\star T_2(f_1,g_1)\le T_1\star T_2(f_2,g_2);

(3) T1⋆T2(f,⟨1,1⟩)=fT_1\star T_2(f,\langle1,1\rangle)=f.

Proof. (1) Since both T1T_1 and T2T_2 are commutative, the commutativity of T1⋆T2T_1\star T_2 follows directly from its definition.

(2) Assume that f1≤f2f_1\le f_2. For each step function ⟨r,a⟩∈E\langle r,a\rangle\in\mathcal{E}, if ⟨r,a⟩≤f1\langle r,a\rangle\le f_1 then ⟨r,a⟩≤f2\langle r,a\rangle\le f_2. Therefore, it follows that

T1⋆T2(f1,g1)≤T1⋆T2(f2,g2)T_1\star T_2(f_1,g_1)\le T_1\star T_2(f_2,g_2)

by the definition of T1⋆T2T_1\star T_2 straightforwardly.

(3) Since ⟨1,1⟩\langle1,1\rangle is the top in I\mathcal{I}, we have

T1⋆T2(f,⟨1,1⟩)=sup⁡{⟨T1(r,t),T2(a,b)⟩∣⟨r,a⟩≤f, ⟨t,b⟩≤⟨1,1⟩}=sup⁡{⟨T1(r,1),T2(a,1)⟩∣⟨r,a⟩≤f}=sup⁡{⟨r,a⟩∣a≤f(r−)}=sup⁡r∈(0,1]⟨r,f(r−)⟩=f.\begin{aligned} T_1\star T_2(f,\langle1,1\rangle)&=\sup\{\langle T_1(r,t),T_2(a,b)\rangle\mid\langle r,a\rangle\le f,\ \langle t,b\rangle\le\langle1,1\rangle\}\\ &=\sup\{\langle T_1(r,1),T_2(a,1)\rangle\mid\langle r,a\rangle\le f\}\\ &=\sup\{\langle r,a\rangle\mid a\le f(r^{-})\}\\ &=\sup_{r\in(0,1]}\langle r,f(r^{-})\rangle\\ &=f. \end{aligned}

The second equality follows from t,b≤1t,b\le1, the monotonicity of T1,T2T_1,T_2, and the fact that t=b=1t=b=1 is admissible. The last equality is Lemma 2.5(2).

Proposition 3.2. Let T1T_1 and T2T_2 be tt-norms on [0,1][0,1]. Then, for all f,g∈If,g \in\mathbb{I},

(T1⋆T2(f,g))∗=T2⋆T1(f∗,g∗).(T_1 \star T_2(f,g))^* = T_2 \star T_1(f^*,g^*).

Consequently, f↦f∗f \mapsto f^* is an order isomorphism (I,T1⋆T2)≅(I,T2⋆T1)(\mathbb{I},T_1 \star T_2) \cong(\mathbb{I},T_2 \star T_1) that intertwines the two operations.

Proof. Notice that for every step function ⟨r,a⟩∈E\langle r,a\rangle\in\mathcal{E}, one has

⟨r,a⟩∗=⟨a,r⟩.\langle r,a\rangle^* = \langle a,r\rangle.

Consequently, for every f∈If \in\mathbb{I},

⟨r,a⟩≤f⟺⟨a,r⟩≤f∗.\langle r,a\rangle\leq f \Longleftrightarrow\langle a,r\rangle\leq f^*.

By Lemma 2.4, the map f↦f∗f \mapsto f^* is an order-preserving involution, hence an order isomorphism of the complete lattice I\mathbb{I}. It therefore preserves all suprema. Hence

(T1⋆T2(f,g))∗=(sup⁡{⟨T1(r,s),T2(a,b)⟩∣⟨r,a⟩≤f, ⟨s,b⟩≤g})∗=sup⁡{⟨T1(r,s),T2(a,b)⟩∗∣⟨r,a⟩≤f, ⟨s,b⟩≤g}=sup⁡{⟨T2(a,b),T1(r,s)⟩∣⟨r,a⟩≤f, ⟨s,b⟩≤g}.\begin{aligned} (T_1 \star T_2(f,g))^* &= \left(\sup\{\langle T_1(r,s),T_2(a,b)\rangle\mid\langle r,a\rangle\leq f,\ \langle s,b\rangle\leq g\}\right)^* \\ &= \sup\{\langle T_1(r,s),T_2(a,b)\rangle^* \mid\langle r,a\rangle\leq f,\ \langle s,b\rangle\leq g\} \\ &= \sup\{\langle T_2(a,b),T_1(r,s)\rangle\mid\langle r,a\rangle\leq f,\ \langle s,b\rangle\leq g\}. \end{aligned}

By the above equivalence,

⟨r,a⟩≤f⟺⟨a,r⟩≤f∗,⟨s,b⟩≤g⟺⟨b,s⟩≤g∗.\langle r,a\rangle\leq f \Longleftrightarrow\langle a,r\rangle\leq f^*, \qquad\langle s,b\rangle\leq g \Longleftrightarrow\langle b,s\rangle\leq g^*.

Therefore,

(T1⋆T2(f,g))∗=sup⁡{⟨T2(a,b),T1(r,s)⟩∣⟨a,r⟩≤f∗, ⟨b,s⟩≤g∗}=T2⋆T1(f∗,g∗).\begin{aligned} (T_1 \star T_2(f,g))^* &= \sup\{\langle T_2(a,b),T_1(r,s)\rangle\mid\langle a,r\rangle\leq f^*,\ \langle b,s\rangle\leq g^*\} \\ &= T_2 \star T_1(f^*,g^*). \end{aligned}

Thus,

(T1⋆T2(f,g))∗=T2⋆T1(f∗,g∗).(T_1 \star T_2(f,g))^* = T_2 \star T_1(f^*,g^*).

Thus f↦f∗f \mapsto f^* yields the asserted isomorphism.

Proposition 3.3. Let T1T_1 and T2T_2 be tt-norms on [0,1][0,1]. Then, for all f,g∈If,g \in\mathbb{I} and all x∈[0,1]x \in[0,1],

T1⋆T2(f,g)(x)=sup⁡x<T1(s,t)T2(f(s−),g(t−)).T_1 \star T_2(f,g)(x) = \sup_{x<T_1(s,t)} T_2(f(s^-),g(t^-)).

Proof. By the definition of T1⋆T2T_1 \star T_2 and Lemma 2.5(1), we have

T1⋆T2(f,g)=sup⁡{⟨T1(s,t),T2(a,b)⟩∣⟨s,a⟩≤f, ⟨t,b⟩≤g}=sup⁡{⟨T1(s,t),T2(f(s−),g(t−))⟩∣s,t∈[0,1]}.\begin{aligned} T_1 \star T_2(f,g) &= \sup\{\langle T_1(s,t),T_2(a,b)\rangle\mid\langle s,a\rangle\leq f,\ \langle t,b\rangle\leq g\} \\ &= \sup\{\langle T_1(s,t),T_2(f(s^-),g(t^-))\rangle\mid s,t \in[0,1]\}. \end{aligned}

Now for all x∈[0,1]x \in[0,1] and all c∈[0,1]c \in[0,1], it holds that

c<T1⋆T2(f,g)(x)⟺∃r,s∈[0,1], c<⟨T1(r,s),T2(f(r−),g(s−))⟩(x)⟺∃r,s∈[0,1], x<T1(r,s), c<T2(f(r−),g(s−))⟺c<sup⁡x<T1(r,s)T2(f(r−),g(s−)).\begin{aligned} c < T_1 \star T_2(f,g)(x) &\Longleftrightarrow\exists r,s \in[0,1],\ c < \langle T_1(r,s),T_2(f(r^-),g(s^-))\rangle(x) \\ &\Longleftrightarrow\exists r,s \in[0,1],\ x < T_1(r,s),\ c < T_2(f(r^-),g(s^-)) \\ &\Longleftrightarrow c < \sup_{x<T_1(r,s)} T_2(f(r^-),g(s^-)). \end{aligned}

Therefore, it follows that

T1⋆T2(f,g)(x)=sup⁡x<T1(r,s)T2(f(r−),g(s−))T_1 \star T_2(f,g)(x) = \sup_{x<T_1(r,s)} T_2(f(r^-),g(s^-))

for all x∈[0,1]x \in[0,1].

If both T1T_1 and T2T_2 are left-continuous t-norms, then both ([0,1],T1)([0,1],T_1) and ([0,1],T2)([0,1],T_2) are quantales. Recall from [7, 9, 10] that the monoidal operation T1⊗T2T_1\otimes T_2 of the tensor product ([0,1],T1)⊗([0,1],T2)([0,1],T_1)\otimes([0,1],T_2) is given by

T1⊗T2(f,g)=sup⁡r,s∈[0,1]⟨T1(r,s),T2(f(r),g(s))⟩.T_1\otimes T_2(f,g)=\sup_{r,s\in[0,1]}\langle T_1(r,s),T_2(f(r),g(s))\rangle.

Particularly, for each point x∈[0,1]x\in[0,1],

T1⊗T2(f,g)(x)=sup⁡x<T1(r,s)T2(f(r),g(s)).T_1\otimes T_2(f,g)(x)=\sup_{x<T_1(r,s)}T_2(f(r),g(s)).

Theorem 3.4. Let both T1T_1 and T2T_2 be left-continuous t-norms on [0,1][0,1]. Then it holds that T1⋆T2=T1⊗T2T_1\star T_2=T_1\otimes T_2.

Proof. On the one hand, by Proposition 3.3, we obtain

T1⋆T2(f,g)(x)≥T1⊗T2(f,g)(x).T_1\star T_2(f,g)(x)\geq T_1\otimes T_2(f,g)(x).

On the other hand, for any p∈[0,1]p\in[0,1], if p<T1⋆T2(f,g)(x)p<T_1\star T_2(f,g)(x), then there exists a pair (r,s)(r,s) with T1(r,s)>xT_1(r,s)>x such that p<T2(f(r−),g(s−))p<T_2(f(r^-),g(s^-)). Since T1T_1 is left-continuous, there is a pair (r′,s′)(r',s') satisfying r′<rr'<r, s′<ss'<s and x<T1(r′,s′)≤T1(r,s)x<T_1(r',s')\leq T_1(r,s). Thus,

p<T2(f(r−),g(s−))≤T2(f(r′),g(s′))≤sup⁡x<T1(r′,s′)T2(f(r′),g(s′))=T1⊗T2(f,g)(x).p<T_2(f(r^-),g(s^-))\leq T_2(f(r'),g(s'))\leq\sup_{x<T_1(r',s')}T_2(f(r'),g(s'))=T_1\otimes T_2(f,g)(x).

Since pp is arbitrary, we conclude that

T1⋆T2(f,g)(x)≤T1⊗T2(f,g)(x).T_1\star T_2(f,g)(x)\leq T_1\otimes T_2(f,g)(x).

Therefore, we have shown that T1⋆T2=T1⊗T2T_1\star T_2=T_1\otimes T_2, as desired.

:::

Remark 3.5. (1) Assume that both T1T_1 and T2T_2 are left-continuous. Notice that the map x↦e−xx\mapsto e^{-x} gives an order isomorphism from ([0,∞],≥)([0,\infty],\geq) to ([0,1],≤)([0,1],\leq). Hence T1T_1 induces a right-continuous t-conorm LL on [0,∞][0,\infty] by

L(x,y)=−ln⁡(T1(e−x,e−y)),L(x,y)=-\ln(T_1(e^{-x},e^{-y})),

where −ln⁡0=∞-\ln0=\infty and e−∞=0e^{-\infty}=0. For r∈[0,∞]r\in[0,\infty] and p∈[0,1]p\in[0,1], let ηr,p\eta_{r,p} denote the step function written as ε(r,p)\varepsilon(r,p) in [15 Example 2.7]; explicitly,

ηr,p(x)={1,x=∞,p,r<x<∞,0,0≤x≤r,x<∞.\eta_{r,p}(x)= \begin{cases} 1, & x=\infty,\\ p, & r<x<\infty,\\ 0, & 0\leq x\leq r,\quad x<\infty. \end{cases}

Recall from Remark 2.7(2) that Φ:Δ+⟶I\Phi:\Delta^+\longrightarrow\mathbb{I} is the order isomorphism induced by the logarithmic change of variables. Under this identification, Φ(ηr,p)=⟨e−r,p⟩\Phi(\eta_{r,p})=\langle e^{-r},p\rangle. Therefore the tensor product L⊗T2L\otimes T_2 on Δ+\Delta^+ is transported to the tensor product T1⊗T2T_1\otimes T_2 on I\mathbb{I}; namely,

Φ((L⊗T2)(F,G))=(T1⊗T2)(Φ(F),Φ(G)),F,G∈Δ+.\Phi((L\otimes T_2)(F,G))=(T_1\otimes T_2)(\Phi(F),\Phi(G)),\qquad F,G\in\Delta^+.

Consequently, Theorem 3.4 gives T1⋆T2=T1⊗T2≅L⊗T2T_1\star T_2=T_1\otimes T_2\cong L\otimes T_2. Thus, in the left-continuous case, our operation is precisely the logarithmic counterpart of the tensor-product triangle function investigated in [15]. If, in addition, T1T_1 is continuous, then LL is continuous. In this case, [15 Theorem 3.18] implies that τT2,L=L⊗T2\tau_{T_2,L}=L\otimes T_2 if and only if LL satisfies the conditionally strictly increasing property

x<x′,y<y′,L(x′,y′)<∞⟹L(x,y)<L(x′,y′)(LCS)x<x',\quad y<y',\quad L(x',y')<\infty\quad\Longrightarrow\quad L(x,y)<L(x',y')\qquad\text{(LCS)}

for all x,x′,y,y′∈[0,∞]x,x',y,y'\in[0,\infty]. Under this condition, T1⋆T2T_1\star T_2 also corresponds to the classical Schweizer–Sklar triangle function τT2,L\tau_{T_2,L}.

(2) Recall from [12] that the convolution of a t-norm TT is the operation T:M×M⟶M\mathcal{T}:\mathbb{M}\times\mathbb{M}\longrightarrow\mathbb{M} defined by

T(f,g)(x)=sup⁡T(r,s)=xmin⁡{f(r),g(s)}.\mathcal{T}(f,g)(x)=\sup_{T(r,s)=x}\min\{f(r),g(s)\}.

Let TT be continuous and satisfy

u<u′,v<v′⟹T(u,v)<T(u′,v′)(u,u′,v,v′∈[0,1]).u<u',\quad v<v'\quad\Longrightarrow\quad T(u,v)<T(u',v')\qquad(u,u',v,v'\in[0,1]).

Then T⋆TM(f,g)=T(f,g)T\star T_M(f,g)=\mathcal{T}(f,g) for all f,g∈If,g\in\mathbb{I}. Indeed, Theorem 3.4 gives

(T⋆TM)(f,g)(x)=sup⁡T(r,s)>xmin⁡{f(r),g(s)}.(T\star T_M)(f,g)(x)=\sup_{T(r,s)>x}\min\{f(r),g(s)\}.

For 0≤x<10\leq x<1, continuity of TT permits lowering a coordinate until T(r,s)=xT(r,s)=x, proving that this supremum is at most T(f,g)(x)\mathcal{T}(f,g)(x). Conversely, any pair with T(r,s)=xT(r,s)=x and r,s<1r,s<1 can be approached from above by pairs with T(rn,sn)>xT(r_n,s_n)>x; right-continuity of f,gf,g gives the reverse inequality. Pairs with r=1r=1 or s=1s=1 contribute zero, and at x=1x=1 both expressions vanish. Consequently, the convolution leaves I\mathbb{I} invariant and coincides there with T⋆TMT\star T_M.

In what follows, we discuss the Archimedean property of T1⋆T2T_1\star T_2.

Let TT be a t-norm on [0,1][0,1]. For each x∈[0,1]x\in[0,1], define x1=xx_1=x and xn+1=T(xn,x)x_{n+1}=T(x_n,x) for all n≥1n\geq1. Recall that TT is Archimedean if, for all x,y∈(0,1)x,y\in(0,1), there exists n≥1n\geq1 such that xn<yx_n<y. Equivalently, inf⁡n≥1xn=0\inf_{n\geq1}x_n=0 for every x∈(0,1)x\in(0,1); see [14]. The definition of Archimedean property of t-norms on a bounded poset were proposed by De Baets and Mesiar as follows.

Definition 3.6. [4] A t-norm TT on a bounded poset (P,≤)(P,\leq) is called Archimedean if for any (x,y)∈P2(x,y)\in P^2,

(∀n≥1)(xn≥y)⟹(x=⊤ or y=⊥),(\forall n\geq1)(x_n\geq y)\Longrightarrow(x=\top\text{ or }y=\bot),

where x1=xx_1=x and xn+1=T(xn,x)x_{n+1}=T(x_n,x) for all n≥1n\geq1.

Proposition 3.7. [4] A t-norm TT on a complete lattice LL is Archimedean if and only if

(∀x∈L∖{⊤})(inf⁡n≥1xn=⊥),(\forall x\in L\setminus\{\top\})\left(\inf_{n\geq1}x_n=\bot\right),

where x1=xx_1=x and xn+1=T(xn,x)x_{n+1}=T(x_n,x) for all n≥1n\geq1.

We first establish a property of T1⋆T2T_1\star T_2 concerning finite suprema.

Lemma 3.8. Let T1T_1 and T2T_2 be t-norms on [0,1][0,1]. Then T1⋆T2T_1\star T_2 preserves finite suprema in each argument. In particular, for all f,g,h∈If,g,h\in\mathbb{I}, it holds that

T1⋆T2(sup⁡{f,g},h)=sup⁡{T1⋆T2(f,h),T1⋆T2(g,h)}.T_1\star T_2(\sup\{f,g\},h)=\sup\{T_1\star T_2(f,h),T_1\star T_2(g,h)\}.

Proof. The supremum of ff and gg is calculated pointwise. Since both functions are non-increasing, for every r∈[0,1]r\in[0,1] we have

(sup⁡{f,g})(r−)=max⁡{f(r−),g(r−)}.(\sup\{f,g\})(r^-)=\max\{f(r^-),g(r^-)\}.

Consequently, by (1), for every ⟨r,a⟩∈E\langle r,a\rangle\in\mathcal{E},

⟨r,a⟩≤sup⁡{f,g}⟺a≤max⁡{f(r−),g(r−)}\langle r,a\rangle\leq\sup\{f,g\}\Longleftrightarrow a\leq\max\{f(r^-),g(r^-)\}
⟺⟨r,a⟩≤f or ⟨r,a⟩≤g.\Longleftrightarrow\langle r,a\rangle\leq f\text{ or }\langle r,a\rangle\leq g.

Substituting this equivalence into the definition of T1⋆T2T_1\star T_2 in terms of step functions gives the required equality. Commutativity gives the same conclusion for the second argument. Moreover, T1⋆T2(⊥,h)=⊥T_1\star T_2(\bot,h)=\bot, so the empty supremum is also preserved.

Proposition 3.9. Let T1T_1 and T2T_2 be Archimedean tt-norms on [0,1][0,1]. For each f∈If \in\mathbb{I}, define

f1=f,fn+1=T1⋆T2(fn,f)(n≥1).f_1=f,\qquad f_{n+1}=T_1\star T_2(f_n,f)\quad(n\geq1).

Then, for every f<⊤f<\top, it holds that

inf⁡n≥1fn=⊥,(4)\inf_{n\geq1} f_n=\bot, \tag*{(4)}

where the infimum is taken in the complete lattice I\mathbb{I}. If T1⋆T2T_1\star T_2 is associative, then it is an Archimedean tt-norm on I\mathbb{I}.

Proof. Let f<⊤f<\top. There exist r,a∈(0,1)r,a\in(0,1) such that f(r)≤af(r)\leq a. Set

g=sup⁡{⟨r,1⟩,⟨1,a⟩}.g=\sup\{\langle r,1\rangle,\langle1,a\rangle\}.

By the monotonicity of ff and the definition of step functions, we have f≤gf\leq g. Let g1=gg_1=g and gn+1=T1⋆T2(gn,g)g_{n+1}=T_1\star T_2(g_n,g) for all n≥1n\geq1. Also, let r0=a0=1r_0=a_0=1 and define

rn+1=T1(rn,r),an+1=T2(an,a)(n≥0).r_{n+1}=T_1(r_n,r),\qquad a_{n+1}=T_2(a_n,a)\quad(n\geq0).

Since T1T_1 and T2T_2 are Archimedean, rn⟶0r_n\longrightarrow0 and an⟶0a_n\longrightarrow0.

First, we show by induction that

gn=sup⁡0≤j≤n⟨rj,an−j⟩(n≥1).(5)g_n=\sup_{0\leq j\leq n}\langle r_j,a_{n-j}\rangle\quad(n\geq1). \tag*{(5)}

For n=1n=1, the equality follows from the definition of gg. Assume that it holds for some n≥1n\geq1. By Lemma 3.8 and the formula for T1⋆T2T_1\star T_2 on step functions, we obtain

gn+1=T1⋆T2(sup⁡0≤j≤n⟨rj,an−j⟩,sup⁡{⟨r,1⟩,⟨1,a⟩})=sup⁡0≤j≤nsup⁡{⟨rj+1,an−j⟩,⟨rj,an−j+1⟩}=sup⁡0≤j≤n+1⟨rj,an+1−j⟩.\begin{aligned} g_{n+1} &=T_1\star T_2\left(\sup_{0\leq j\leq n}\langle r_j,a_{n-j}\rangle,\sup\{\langle r,1\rangle,\langle1,a\rangle\}\right)\\ &=\sup_{0\leq j\leq n}\sup\{\langle r_{j+1},a_{n-j}\rangle,\langle r_j,a_{n-j+1}\rangle\}\\ &=\sup_{0\leq j\leq n+1}\langle r_j,a_{n+1-j}\rangle. \end{aligned}

Thus (5) holds for every n≥1n\geq1.

Second, the monotonicity of T1⋆T2T_1\star T_2 gives fn≤gnf_n\leq g_n for all n≥1n\geq1. Since the sequences {rn}\{r_n\} and {an}\{a_n\} are non-increasing, (5) yields

f2n≤g2n≤sup⁡{⟨rn,1⟩,⟨1,an⟩}(n≥1).(6)f_{2n}\leq g_{2n}\leq\sup\{\langle r_n,1\rangle,\langle1,a_n\rangle\}\quad(n\geq1). \tag*{(6)}

Indeed, for each j∈{0,…,2n}j\in\{0,\ldots,2n\}, either j≥nj\geq n or 2n−j≥n2n-j\geq n.

Suppose that inf⁡k≥1fk≠⊥\inf_{k\geq1}f_k\neq\bot. There exist u,v∈(0,1]u,v\in(0,1] such that

⟨u,v⟩≤inf⁡k≥1fk.\langle u,v\rangle\leq\inf_{k\geq1}f_k.

Choose nn such that rn<ur_n<u and an<va_n<v, and take x∈(rn,u)x\in(r_n,u). From (6), we obtain

v=⟨u,v⟩(x)≤inf⁡k≥1fk(x)≤f2n(x)≤an<v,v=\langle u,v\rangle(x)\leq\inf_{k\geq1}f_k(x)\leq f_{2n}(x)\leq a_n<v,

a contradiction. This proves (4).

If T1⋆T2T_1\star T_2 is associative, by Proposition 3.1, it is a tt-norm on I\mathbb{I}. Hence, T1⋆T2T_1\star T_2 is an Archimedean tt-norm on I\mathbb{I} from Proposition 3.7.

Remark 3.10. When T1⋆T2T_1\star T_2 is associative, the sequence {fn}\{f_n\} in Proposition 3.9 consists of the powers of ff with respect to T1⋆T2T_1\star T_2. It should be pointed out that (4) does not imply the stronger condition

∀ ⊥<f,g<⊤,∃n≥1,fn≤g.\forall\ \bot<f,g<\top,\quad\exists n\geq1,\quad f_n\leq g.

In fact, take T1=T2=TPT_1=T_2=T_P. Then T1⋆T2T_1\star T_2 is a t-norm by Theorem 3.4, and both T1T_1 and T2T_2 are Archimedean. Let

f=⟨12,1⟩,g=⟨12,12⟩.f=\langle\tfrac{1}{2},1\rangle,\qquad g=\langle\tfrac{1}{2},\tfrac{1}{2}\rangle.

By the formula for T1⋆T2T_1\star T_2 on step functions, we have

fn=⟨2−n,1⟩(n≥1).f_n=\langle2^{-n},1\rangle\qquad(n\ge1).

For every n≥1n\ge1, taking x=2−n−1x=2^{-n-1} gives

fn(x)=1>12=g(x).f_n(x)=1>\tfrac{1}{2}=g(x).

Hence fn≰gf_n\nleq g for all n≥1n\ge1, even though ⊥<g<f<⊤\bot<g<f<\top.

Associativity of the induced operation

This section is devoted to the associativity of the induced operation T1⋆T2T_1\star T_2. We first prove a general sufficient condition and then examine two complementary examples which show that the condition is meaningful but not necessary.

The proof of the main theorem relies on the following approximation lemma, which allows us to pass from the pointwise formula for T1⋆T2T_1\star T_2 to the associativity identity.

Lemma 4.1. Let T1T_1 be a continuous t-norm on [0,1][0,1]. For all f,g∈If,g\in\mathbb{I} and all x,y∈[0,1]x,y\in[0,1] with x<yx<y, there exist ux,vx∈(0,1]u_x,v_x\in(0,1] such that x<T1(ux,vx)x<T_1(u_x,v_x) and T2(f(ux),g(vx))≥T1⋆T2(f,g)(y)T_2(f(u_x),g(v_x))\ge T_1\star T_2(f,g)(y).

Proof. If y=1y=1, then T1⋆T2(f,g)(y)=0T_1\star T_2(f,g)(y)=0, and the conclusion follows by taking ux=vx=1u_x=v_x=1. Henceforth assume y<1y<1.

By Proposition 3.3, set A:=T1⋆T2(f,g)(y)=sup⁡y<T1(u,v)T2(f(u),g(v))A:=T_1\star T_2(f,g)(y)=\sup_{y<T_1(u,v)}T_2(f(u),g(v)). Then there is a sequence of pairs (un,vn)(u_n,v_n) with y<T1(un,vn)y<T_1(u_n,v_n) for all nn such that

T2(f(un),g(vn))→A(n→∞).T_2(f(u_n),g(v_n))\to A\qquad(n\to\infty).

Since [0,1]2[0,1]^2 is compact, after passing to a subsequence if necessary, we may assume that un→u0u_n\to u_0 and vn→v0v_n\to v_0. Since y<T1(un,vn)≤min⁡{un,vn}y<T_1(u_n,v_n)\le\min\{u_n,v_n\} for all nn, it follows that u0,v0∈[y,1]u_0,v_0\in[y,1].

By the continuity of T1T_1,

T1(u0,v0)=lim⁡n→∞T1(un,vn)≥y>x.T_1(u_0,v_0)=\lim_{n\to\infty}T_1(u_n,v_n)\ge y>x.

The continuity of T1T_1 guarantees the existence of a small 0<δ<min⁡{u0,v0}0<\delta<\min\{u_0,v_0\} such that

T1(u0−δ,v0−δ)>x.T_1(u_0-\delta,v_0-\delta)>x.

Set ux:=u0−δu_x:=u_0-\delta and vx:=v0−δv_x:=v_0-\delta. For all sufficiently large nn, we have un>uxu_n>u_x and vn>vxv_n>v_x. Because ff and gg are non-increasing, f(un)≤f(ux)f(u_n)\le f(u_x) and g(vn)≤g(vx)g(v_n)\le g(v_x). Since T2T_2 is non-decreasing in each variable,

T2(f(un),g(vn))≤T2(f(ux),g(vx)).T_2(f(u_n),g(v_n))\le T_2(f(u_x),g(v_x)).

Passing to the limit as n→∞n\to\infty on the left side yields A≤T2(f(ux),g(vx))A\le T_2(f(u_x),g(v_x)), completing the proof.

Theorem 4.2. Suppose that at least one of T1T_1 and T2T_2 is a continuous t-norm on [0,1][0,1]. Then T1⋆T2T_1\star T_2 is a t-norm on I\mathbb{I}.

Proof. By Proposition 3.1, we need to show that T1⋆T2T_1\star T_2 is associative. By Proposition 3.2, without loss of generality, we assume that T1T_1 is continuous.

First, we show that for all f,g,h∈If,g,h\in\mathbb{I} and x∈[0,1]x\in[0,1],

T1⋆T2(T1⋆T2(f,g),h)(x)=sup⁡{T2(T2(f(u),g(v)),h(w))∣T1(T1(u,v),w)>x}.T_1\star T_2(T_1\star T_2(f,g),h)(x)=\sup\{T_2(T_2(f(u),g(v)),h(w))\mid T_1(T_1(u,v),w)>x\}.

On one hand, take any u,v,w∈[0,1]u,v,w\in[0,1] with x<T1(T1(u,v),w)x<T_1(T_1(u,v),w). Because the map T1(−,w)T_1(-,w) is continuous and x<T1(T1(u,v),w)x<T_1(T_1(u,v),w), there exists some r∈[0,1]r\in[0,1] such that

r<T1(u,v)andx<T1(r,w).r<T_1(u,v)\quad\text{and}\quad x<T_1(r,w).

It follows that

T2(f(u−),g(v−))≤sup⁡r<T1(s,t)T2(f(s−),g(t−))=T1⋆T2(f,g)(r)≤T1⋆T2(f,g)(r−)T_2(f(u^-),g(v^-)) \le\sup_{r<T_1(s,t)} T_2(f(s^-),g(t^-)) = T_1\star T_2(f,g)(r) \le T_1\star T_2(f,g)(r^-)

and

T2(T1⋆T2(f,g)(r−),h(w−))≤T2(T1⋆T2(f,g)(r−),h(w−))≤sup⁡x<T1(s,t)T2(T1⋆T2(f,g)(s−),h(t−))=T1⋆T2(T1⋆T2(f,g),h)(x).\begin{aligned} T_2(T_1\star T_2(f,g)(r^-),h(w^-)) &\le T_2(T_1\star T_2(f,g)(r^-),h(w^-))\\ &\le\sup_{x<T_1(s,t)} T_2(T_1\star T_2(f,g)(s^-),h(t^-))\\ &= T_1\star T_2(T_1\star T_2(f,g),h)(x). \end{aligned}

Taking the supremum over all admissible triples (u,v,w)(u,v,w) yields

sup⁡{T2(T2(f(u−),g(v−)),h(w−))∣T1(T1(u,v),w)>x}≤T1⋆T2(T1⋆T2(f,g),h)(x).\sup\{T_2(T_2(f(u^-),g(v^-)),h(w^-))\mid T_1(T_1(u,v),w)>x\}\le T_1\star T_2(T_1\star T_2(f,g),h)(x).

On the other hand, we prove the inequality in the opposite direction, i.e.

sup⁡x<T1(r,w)T2(T1⋆T2(f,g)(r−),h(w−))≤sup⁡{T2(T2(f(u−),g(v−)),h(w−))∣T1(T1(u,v),w)>x}.\sup_{x<T_1(r,w)} T_2(T_1\star T_2(f,g)(r^-),h(w^-))\le\sup\{T_2(T_2(f(u^-),g(v^-)),h(w^-))\mid T_1(T_1(u,v),w)>x\}.

It is sufficient to show that for any r,w∈[0,1]r,w\in[0,1] satisfying x<T1(r,w)x<T_1(r,w), there exist ur,vru_r,v_r with x<T1(T1(ur,vr),w)x<T_1(T_1(u_r,v_r),w) such that

T1⋆T2(f,g)(r−)≤T2(f(ur−),g(vr−)).T_1\star T_2(f,g)(r^-)\le T_2(f(u_r^-),g(v_r^-)).

By the continuity of T1T_1, there are real numbers s0,s1∈[0,1]s_0,s_1\in[0,1] such that

r>s0>s1andT1(r,w)>T1(s0,w)>T1(s1,w)>x.r>s_0>s_1\quad\text{and}\quad T_1(r,w)>T_1(s_0,w)>T_1(s_1,w)>x.

Since T1⋆T2(f,g)T_1\star T_2(f,g) is non-increasing, we have

T1⋆T2(f,g)(r−)=inf⁡t<rT1⋆T2(f,g)(t)≤T1⋆T2(f,g)(s0).T_1\star T_2(f,g)(r^-)=\inf_{t<r}T_1\star T_2(f,g)(t)\le T_1\star T_2(f,g)(s_0).

By Lemma 4.1, there exist u1,v1∈[0,1]u_1,v_1\in[0,1] such that

T1(u1,v1)>s1andT1⋆T2(f,g)(s0)≤T2(f(u1−),g(v1−)).T_1(u_1,v_1)>s_1\quad\text{and}\quad T_1\star T_2(f,g)(s_0)\le T_2(f(u_1^-),g(v_1^-)).

Now take ur=u1u_r=u_1 and vr=v1v_r=v_1. Then we obtain

T1(T1(ur,vr),w)≥T1(s1,w)>xT_1(T_1(u_r,v_r),w)\ge T_1(s_1,w)>x

and

T1⋆T2(f,g)(r−)≤T2(f(ur−),g(vr−))T_1\star T_2(f,g)(r^-)\le T_2(f(u_r^-),g(v_r^-))

as desired. Therefore, we have shown that

T1⋆T2(T1⋆T2(f,g),h)(x)=sup⁡{T2(T2(f(u−),g(v−)),h(w−))∣T1(T1(u,v),w)>x}.T_1\star T_2(T_1\star T_2(f,g),h)(x)=\sup\{T_2(T_2(f(u^-),g(v^-)),h(w^-))\mid T_1(T_1(u,v),w)>x\}.

Second, the equality

T1⋆T2(f,T1⋆T2(g,h))(x)=sup⁡{T2(f(u−),T2(g(v−),h(w−)))∣T1(u,T1(v,w))>x}T_1\star T_2(f,T_1\star T_2(g,h))(x)=\sup\{T_2(f(u^-),T_2(g(v^-),h(w^-)))\mid T_1(u,T_1(v,w))>x\}

can be checked similarly.

Because both T1T_1 and T2T_2 are associative, we obtain the equality

T1⋆T2(T1⋆T2(f,g),h)=T1⋆T2(f,T1⋆T2(g,h)).T_1\star T_2(T_1\star T_2(f,g),h)=T_1\star T_2(f,T_1\star T_2(g,h)).

Thus, T1⋆T2T_1\star T_2 is associative as desired.

Theorem 4.3. The operation TD⋆TDT_D\star T_D is a t-norm on the fuzzy unit interval I\mathbb{I}.

Proof. It suffices to verify associativity. If any of f,g,h∈If,g,h \in\mathbb{I} equals the neutral element ⟨1,1⟩\langle1,1\rangle, the identity

TD⋆TD(TD⋆TD(f,g),h)=TD⋆TD(f,TD⋆TD(g,h))T_D \star T_D(T_D \star T_D(f,g),h)=T_D \star T_D(f,T_D \star T_D(g,h))

follows directly from Proposition 3.1.

Assume now that none of f,g,hf,g,h is the neutral element. We first claim that

TD⋆TD(f,g)=sup⁡{⟨f∗(1−),g(1−)⟩,⟨g∗(1−),f(1−)⟩}.T_D \star T_D(f,g)=\sup\{\langle f^*(1^-),g(1^-)\rangle,\langle g^*(1^-),f(1^-)\rangle\}.

Recall that

TD⋆TD(f,g)=sup⁡{⟨TD(u,v),TD(a,b)⟩∣⟨u,a⟩≤f, ⟨v,b⟩≤g},T_D \star T_D(f,g)=\sup\{\langle T_D(u,v),T_D(a,b)\rangle\mid\langle u,a\rangle\leq f,\ \langle v,b\rangle\leq g\},

and note that ⟨TD(u,v),TD(a,b)⟩≠⟨0,0⟩\langle T_D(u,v),T_D(a,b)\rangle\neq\langle0,0\rangle iff both TD(u,v)≠0T_D(u,v)\neq0 and TD(a,b)≠0T_D(a,b)\neq0.

(i) If u=1u=1, then ⟨1,a⟩≤f\langle1,a\rangle\leq f implies a≤f(1−)<1a\leq f(1^-)<1. From TD(a,b)≠0T_D(a,b)\neq0 we obtain b=1b=1. The condition ⟨v,b⟩≤g\langle v,b\rangle\leq g implies ⟨b,v⟩≤g∗\langle b,v\rangle\leq g^*, and hence v≤g∗(b)=g∗(1−)v\leq g^*(b)=g^*(1^-). Consequently,

⟨TD(u,v),TD(a,b)⟩=⟨v,a⟩≤⟨g∗(1−),f(1−)⟩.\langle T_D(u,v),T_D(a,b)\rangle=\langle v,a\rangle\leq\langle g^*(1^-),f(1^-)\rangle.

(ii) If v=1v=1, a symmetric argument yields

⟨TD(u,v),TD(a,b)⟩≤⟨f∗(1−),g(1−)⟩.\langle T_D(u,v),T_D(a,b)\rangle\leq\langle f^*(1^-),g(1^-)\rangle.

Therefore,

TD⋆TD(f,g)≤sup⁡{⟨f∗(1−),g(1−)⟩,⟨g∗(1−),f(1−)⟩}.T_D \star T_D(f,g)\leq\sup\{\langle f^*(1^-),g(1^-)\rangle,\langle g^*(1^-),f(1^-)\rangle\}.

Now, we prove the reverse inequality. By Lemma 2.5(1), ⟨1,f∗(1−)⟩≤f∗\langle1,f^*(1^-)\rangle\leq f^* and ⟨1,g(1−)⟩≤g\langle1,g(1^-)\rangle\leq g. Besides, ⟨1,f∗(1−)⟩≤f∗\langle1,f^*(1^-)\rangle\leq f^* implies ⟨f∗(1−),1⟩≤f\langle f^*(1^-),1\rangle\leq f. Hence,

⟨f∗(1−),g(1−)⟩=⟨TD(f∗(1−),1),TD(1,g(1−))⟩=TD⋆TD(⟨f∗(1−),1⟩,⟨1,g(1−)⟩)(by xref‘(3)‘)≤TD⋆TD(f,g).\begin{aligned} \langle f^*(1^-),g(1^-)\rangle &=\langle T_D(f^*(1^-),1),T_D(1,g(1^-))\rangle\\ &=T_D\star T_D(\langle f^*(1^-),1\rangle,\langle1,g(1^-)\rangle)\quad\text{(by {xref}`(3)`)}\\ &\leq T_D\star T_D(f,g). \end{aligned}

Similarly,

⟨g∗(1−),f(1−)⟩≤TD⋆TD(g,f)=TD⋆TD(f,g),\langle g^*(1^-),f(1^-)\rangle\leq T_D\star T_D(g,f)=T_D\star T_D(f,g),

which establishes the claim.

Since f≠⟨1,1⟩f\neq\langle1,1\rangle and g≠⟨1,1⟩g\neq\langle1,1\rangle,

c=max⁡{f(1−),g(1−)}<1.c=\max\{f(1^-),g(1^-)\}<1.

Similarly, f∗≠⟨1,1⟩f^*\neq\langle1,1\rangle and g∗≠⟨1,1⟩g^*\neq\langle1,1\rangle imply

w=max⁡{f∗(1−),g∗(1−)}<1.w=\max\{f^*(1^-),g^*(1^-)\}<1.

Then by the above claim, we have

TD⋆TD(f,g)≤⟨w,c⟩.T_D\star T_D(f,g)\leq\langle w,c\rangle.

For any ⟨s,t⟩≤h<⟨1,1⟩\langle s,t\rangle\leq h<\langle1,1\rangle, either s<1s<1 or t<1t<1, thus

TD⋆TD(⟨w,c⟩,⟨s,t⟩)=⟨TD(w,s),TD(c,t)⟩=⟨0,0⟩.T_D\star T_D(\langle w,c\rangle,\langle s,t\rangle)=\langle T_D(w,s),T_D(c,t)\rangle=\langle0,0\rangle.

Therefore,

TD⋆TD(TD⋆TD(f,g),h)≤TD⋆TD(⟨w,c⟩,h)=sup⁡{⟨TD(u,s),TD(v,t)⟩∣⟨u,v⟩≤⟨w,c⟩, ⟨s,t⟩≤h}=sup⁡{⟨TD(w,s),TD(c,t)⟩∣⟨s,t⟩≤h}=⟨0,0⟩.\begin{aligned} T_D\star T_D(T_D\star T_D(f,g),h) &\leq T_D\star T_D(\langle w,c\rangle,h)\\ &=\sup\{\langle T_D(u,s),T_D(v,t)\rangle\mid\langle u,v\rangle\leq\langle w,c\rangle,\ \langle s,t\rangle\leq h\}\\ &=\sup\{\langle T_D(w,s),T_D(c,t)\rangle\mid\langle s,t\rangle\leq h\}\\ &=\langle0,0\rangle. \end{aligned}

Analogously, TD⋆TD(f,TD⋆TD(g,h))=⟨0,0⟩T_D\star T_D(f,T_D\star T_D(g,h))=\langle0,0\rangle. Consequently,

TD⋆TD(TD⋆TD(f,g),h)=TD⋆TD(f,TD⋆TD(g,h)),T_D\star T_D(T_D\star T_D(f,g),h)=T_D\star T_D(f,T_D\star T_D(g,h)),

which completes the proof of associativity.

The following example shows that T1⋆T2T_1 \star T_2 need not be associative when neither component t-norm is continuous.

Example 4.4. Neither the t-norm TDT_D nor TnMT^{\mathrm{nM}} is continuous, although TnMT^{\mathrm{nM}} is left-continuous. We show that the operation TD⋆TnMT_D \star T^{\mathrm{nM}} is not associative.

Given any a,b∈(0,1)a,b \in(0,1) with a<ba < b, let f:[0,1]⟶[0,1]f : [0,1] \longrightarrow[0,1] and h:[0,1]⟶[0,1]h : [0,1] \longrightarrow[0,1] be two strictly decreasing maps that are continuous on [0,1)[0,1), f(0)=h(0)=1f(0)=h(0)=1, f(1−)=h(1−)=0.1f(1^-)=h(1^-)=0.1, f(1)=h(1)=0f(1)=h(1)=0, and f(a)=h(b)=0.9f(a)=h(b)=0.9. Let the map g:[0,1]⟶[0,1]g : [0,1] \longrightarrow[0,1] be given by

g(x)={0.9,x∈[0,1),0,x=1.g(x)= \begin{cases} 0.9, & x \in[0,1),\\ 0, & x=1. \end{cases}

Clearly, f,g,h∈If,g,h \in\mathbb{I}. We show that

TD⋆TnM(TD⋆TnM(f,g),h)≠TD⋆TnM(f,TD⋆TnM(g,h)).T_D \star T^{\mathrm{nM}}(T_D \star T^{\mathrm{nM}}(f,g),h) \ne T_D \star T^{\mathrm{nM}}(f,T_D \star T^{\mathrm{nM}}(g,h)).

Note that x<TD(u,v)x<T_D(u,v) if and only if u=1,v>xu=1,v>x or v=1,u>xv=1,u>x. Hence for all λ,μ∈I\lambda,\mu\in\mathbb{I},

(TD⋆TnM)(λ,μ)(x)=sup⁡x<TD(u,v)TnM(λ(u−),μ(v−))=sup⁡{sup⁡v>xTnM(λ(1−),μ(v−)),sup⁡u>xTnM(λ(u−),μ(1−))}.(T_D \star T^{\mathrm{nM}})(\lambda,\mu)(x)=\sup_{x<T_D(u,v)}T^{\mathrm{nM}}(\lambda(u^-),\mu(v^-))=\sup\left\{\sup_{v>x}T^{\mathrm{nM}}(\lambda(1^-),\mu(v^-)),\sup_{u>x}T^{\mathrm{nM}}(\lambda(u^-),\mu(1^-))\right\}.

To compute F:=TD⋆TnM(f,g)F:=T_D \star T^{\mathrm{nM}}(f,g), observe that for each x∈[0,1]x\in[0,1],

sup⁡v>xTnM(f(1−),g(v−))=sup⁡v>xTnM(0.1,g(v−))=0,\sup_{v>x}T^{\mathrm{nM}}(f(1^-),g(v^-))=\sup_{v>x}T^{\mathrm{nM}}(0.1,g(v^-))=0,

and

sup⁡u>xTnM(f(u−),g(1−))=sup⁡u>xTnM(f(u−),0.9)={0.9,x∈[0,a),f(x),x∈[a,1],\sup_{u>x}T^{\mathrm{nM}}(f(u^-),g(1^-))=\sup_{u>x}T^{\mathrm{nM}}(f(u^-),0.9)= \begin{cases} 0.9, & x\in[0,a),\\ f(x), & x\in[a,1], \end{cases}

thus

F(x)={0.9,x∈[0,a),f(x),x∈[a,1].F(x)= \begin{cases} 0.9, & x\in[0,a),\\ f(x), & x\in[a,1]. \end{cases}

Similarly, H:=TD⋆TnM(g,h)H:=T_D \star T^{\mathrm{nM}}(g,h) is obtained as follows:

H(x)={0.9,x∈[0,b),h(x),x∈[b,1].H(x)= \begin{cases} 0.9, & x\in[0,b),\\ h(x), & x\in[b,1]. \end{cases}

Next, we compute TD⋆TnM(F,h)T_D \star T^{\mathrm{nM}}(F,h). For any x∈[0,1]x\in[0,1],

sup⁡u>xTnM(F(u−),h(1−))=sup⁡u>xTnM(F(u−),0.1)=0,\sup_{u>x}T^{\mathrm{nM}}(F(u^-),h(1^-))=\sup_{u>x}T^{\mathrm{nM}}(F(u^-),0.1)=0,

and

sup⁡v>xTnM(F(1−),h(v−))=sup⁡v>xTnM(0.1,h(v−))={0.1,x∈[0,b),0,x∈[b,1],\sup_{v>x}T^{\mathrm{nM}}(F(1^-),h(v^-))=\sup_{v>x}T^{\mathrm{nM}}(0.1,h(v^-))= \begin{cases} 0.1, & x\in[0,b),\\ 0, & x\in[b,1], \end{cases}

hence,

TD⋆TnM(F,h)(x)={0.1,x∈[0,b),0,x∈[b,1].T_D \star T^{\mathrm{nM}}(F,h)(x)= \begin{cases} 0.1, & x\in[0,b),\\ 0, & x\in[b,1]. \end{cases}

Similarly,

TD⋆TnM(f,H)(x)={0.1,x∈[0,a),0,x∈[a,1].T_D \star T^{\mathrm{nM}}(f,H)(x)= \begin{cases} 0.1, & x\in[0,a),\\ 0, & x\in[a,1]. \end{cases}

Therefore,

TD⋆TnM(TD⋆TnM(f,g),h)≠TD⋆TnM(f,TD⋆TnM(g,h)).T_D \star T^{\mathrm{nM}}(T_D \star T^{\mathrm{nM}}(f,g),h) \ne T_D \star T^{\mathrm{nM}}(f,T_D \star T^{\mathrm{nM}}(g,h)).

Conclusion

We have shown that for any two t-norms T1,T2T_1,T_2 on [0,1][0,1], the operation T1⋆T2T_1 \star T_2 defined on the fuzzy unit interval I\mathbb{I} is always commutative, monotone and has ⟨1,1⟩\langle1,1\rangle as its neutral element. Associativity—and hence the property of being a t-norm—holds in the following cases:

  1. At least one of T1,T2T_1,T_2 is continuous.

  2. Both T1T_1 and T2T_2 are left-continuous; in this case T1⋆T2T_1 \star T_2 is precisely the tensor product of the quantales ([0,1],T1)([0,1],T_1) and ([0,1],T2)([0,1],T_2).

The example TD⋆TDT_D \star T_D shows that neither continuity nor left-continuity is necessary. On the other hand, the case of TD⋆TnMT_D \star T^{\mathrm{nM}} shows failure of associativity, showing that the interaction between a left-continuous t-norm and a non-left-continuous t-norm can destroy associativity. For the reader’s convenience, we summarize the known cases established or recalled in this paper in the following table.

T1T_1T2T_2Is T1⋆T2T_1 \star T_2 a t-norm?
left-continuousleft-continuousyes
continuousarbitraryyes
arbitrarycontinuousyes
TDT_DTDT_Dyes
TDT_DTnMT^{\mathrm{nM}}no

Table 1.

The case of two left-continuous components belongs to the existing quantale tensor-product theory. The new associativity result permits one component to be arbitrary when the other is continuous; the drastic pair shows that even two components failing left-continuity may work. The contrasting example shows why these results do not extend to arbitrary pairs.

The Archimedean discussion in § 3 answers a separate question: two Archimedean components imply that the fixed recursive powers of each f<⊤f < \top have infimum ⊥\bot in I\mathbb{I}. If the induced operation is associative, this gives an Archimedean t-norm.

However, a complete characterization of those pairs (T1,T2)(T_1,T_2) for which T1⋆T2T_1 \star T_2 is a t-norm remains an open problem.

Acknowledgements

Rongjun Wu would like to express gratitude to the Southwest Minzu University Research Startup Funds for Grant (#RQD2021100), which supported the writing of this article. Jie Sun would like to express gratitude to the National Natural Science Foundation of China (No. 12601905) and the Southwest Minzu University Research Startup Funds for Grant (#RQD2024011). Hongliang Lai would like to express gratitude to the National Natural Science Foundation of China (No. 12671089).

References

  1. [1]C. Alsina, E. Trillas, L. Valverde, On non-distributive logical connectives for fuzzy sets theory, Bulletin pour les sous-ensembles flous et leurs applications 3 (1980) 18–29.
  2. [2]C. Alsina, M. Frank, B. Schweizer, Associative Functions: Triangular Norms and Copulas, World Scientific Press, Singapore, 2006.
  3. [3]B. Banaschewski, E. Nelson, Tensor products and bimorphisms, Canadian Mathematical Bulletin 19 (1976) 385–402.DOI
  4. [4]B. De Baets, R. Mesiar, Triangular norms on product lattices, Fuzzy Sets and Systems 104 (1999), 61–75.
  5. [5]G. De Cooman, E. Kerre, Order norms on bounded partially ordered sets, The Journal of Fuzzy Mathematics 2 (1994) 281–310.
  6. [6]D. Dubois, H. Prade, New results about properties and semantics of fuzzy set-theoretic operators, in: P.P. Wang, S.K. Chang (Eds.), Fuzzy Sets, Theory and Applications to Policy Analysis and Information Systems, Plenum Press, New York, 1980, pp. 59–75.
  7. [7]P. Eklund, J. Gutiérrez García, U. Höhle, J. Kortelainen, Semigroups in Complete Lattices: Quantales, Modules and Related Topics, Developments in Mathematics, Springer, Berlin, 2018.DOI
  8. [8]J. Goguen, L-fuzzy sets, Journal of Mathematical Analysis and Applications 18 (1967) 145–174.DOI
  9. [9]J. Gutiérrez García, U. Höhle, T. Kubiak, Tensor products of complete lattices and their application in constructing quantales, Fuzzy Sets and Systems 313 (2017) 43–60.DOI
  10. [10]J. Gutiérrez García, U. Höhle, T. Kubiak, Some characterizations of the tensor product of complete lattices with applications to quantales, Semigroup Forum 99 (2019) 303–316.DOI
  11. [11]P. Hájek, Metamathematics of Fuzzy Logic, Springer, Dordrecht, 1998.DOI
  12. [12]J. Harding, C. Walker, E. Walker, The Truth Value Algebra of Type-2 Fuzzy Sets: Order Convolutions of Functions on the Unit Interval, CRC Press, Taylor & Francis Group, 2016.
  13. [13]B. Hutton, Normality in fuzzy topological spaces, Journal of Mathematical Analysis and Applications 50 (1975) 74–79.DOI
  14. [14]E.P. Klement, R. Mesiar, E. Pap, Triangular Norms, Kluwer Academic Publishers, Dordrecht, 2000.DOI
  15. [15]H. Lai, Q. Luo, Triangle functions generated by tensor products of quantales, Fuzzy Sets and Systems 524 (2026) 109655.DOI
  16. [16]H. Prade, Unions et intersections d’ensembles flous, Bulletin pour les sous-ensembles flous et leurs applications 3 (1980) 58–62.
  17. [17]B. Schweizer, A. Sklar, Associative functions and abstract semigroups, Publicationes Mathematicae Debrecen 10 (1963) 69–81.
  18. [18]B. Schweizer, A. Sklar, Probabilistic Metric Spaces, Dover Publications, Mineola, 2005.
  19. [19]Z. Shmuely, The structure of Galois connections, Pacific Journal of Mathematics 54 (1974) 209–225.
  20. [20]L. Zadeh, The concept of a linguistic variable and its application to approximate reasoning I, Information Sciences 8 (1975) 199–249.
  21. [21]L. Zadeh, The concept of a linguistic variable and its application to approximate reasoning II, Information Sciences 8 (1975) 301–357.DOI

Paper details

vlnc:W_9amte7r2
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents