Misplaced Pages

T-norm

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Fuzzy logic concept

In mathematics, a t-norm (also T-norm or, unabbreviated, triangular norm) is a kind of binary operation used in the framework of probabilistic metric spaces and in multi-valued logic, specifically in fuzzy logic. A t-norm generalizes intersection in a lattice and conjunction in logic. The name triangular norm refers to the fact that in the framework of probabilistic metric spaces t-norms are used to generalize the triangle inequality of ordinary metric spaces.

Definition

A t-norm is a function T: × → that satisfies the following properties:

Since a t-norm is a binary algebraic operation on the interval , infix algebraic notation is also common, with the t-norm usually denoted by  ∗ {\displaystyle *} .

The defining conditions of the t-norm are exactly those of a partially ordered abelian monoid on the real unit interval . (Cf. ordered group.) The monoidal operation of any partially ordered abelian monoid L is therefore by some authors called a triangular norm on L.

Classification of t-norms

A t-norm is called continuous if it is continuous as a function, in the usual interval topology on . (Similarly for left- and right-continuity.)

A t-norm is called strict if it is continuous and strictly monotone.

A t-norm is called nilpotent if it is continuous and each x in the open interval (0, 1) is nilpotent, that is, there is a natural number n such that x ∗ {\displaystyle *} ... ∗ {\displaystyle *} x (n times) equals 0.

A t-norm ∗ {\displaystyle *} is called Archimedean if it has the Archimedean property, that is, if for each x, y in the open interval (0, 1) there is a natural number n such that x ∗ {\displaystyle *} ... ∗ {\displaystyle *} x (n times) is less than or equal to y.

The usual partial ordering of t-norms is pointwise, that is,

T1 ≤ T2   if   T1(a, b) ≤ T2(a, b) for all a, b in .

As functions, pointwise larger t-norms are sometimes called stronger than those pointwise smaller. In the semantics of fuzzy logic, however, the larger a t-norm, the weaker (in terms of logical strength) conjunction it represents.

Prominent examples

Graph of the minimum t-norm (3D and contours)
  • Minimum t-norm ⊤ m i n ( a , b ) = min { a , b } , {\displaystyle \top _{\mathrm {min} }(a,b)=\min\{a,b\},} also called the Gödel t-norm, as it is the standard semantics for conjunction in Gödel fuzzy logic. Besides that, it occurs in most t-norm based fuzzy logics as the standard semantics for weak conjunction. It is the pointwise largest t-norm (see the properties of t-norms below).
Graph of the product t-norm
  • Product t-norm ⊤ p r o d ( a , b ) = a ⋅ b {\displaystyle \top _{\mathrm {prod} }(a,b)=a\cdot b} (the ordinary product of real numbers). Besides other uses, the product t-norm is the standard semantics for strong conjunction in product fuzzy logic. It is a strict Archimedean t-norm.
Graph of the Łukasiewicz t-norm
  • Łukasiewicz t-norm ⊤ L u k ( a , b ) = max { 0 , a + b − 1 } . {\displaystyle \top _{\mathrm {Luk} }(a,b)=\max\{0,a+b-1\}.} The name comes from the fact that the t-norm is the standard semantics for strong conjunction in Łukasiewicz fuzzy logic. It is a nilpotent Archimedean t-norm, pointwise smaller than the product t-norm.
Graph of the drastic t-norm. The function is discontinuous at the lines 0 < x = 1 and 0 < y = 1.
  • Drastic t-norm
⊤ D ( a , b ) = { b if  a = 1 a if  b = 1 0 otherwise. {\displaystyle \top _{\mathrm {D} }(a,b)={\begin{cases}b&{\mbox{if }}a=1\\a&{\mbox{if }}b=1\\0&{\mbox{otherwise.}}\end{cases}}}
The name reflects the fact that the drastic t-norm is the pointwise smallest t-norm (see the properties of t-norms below). It is a right-continuous Archimedean t-norm.
Graph of the nilpotent minimum. The function is discontinuous at the line 0 < x = 1 − y < 1.
  • Nilpotent minimum
⊤ n M ( a , b ) = { min ( a , b ) if  a + b > 1 0 otherwise {\displaystyle \top _{\mathrm {nM} }(a,b)={\begin{cases}\min(a,b)&{\mbox{if }}a+b>1\\0&{\mbox{otherwise}}\end{cases}}}
is a standard example of a t-norm that is left-continuous, but not continuous. Despite its name, the nilpotent minimum is not a nilpotent t-norm.
Graph of the Hamacher product
  • Hamacher product
⊤ H 0 ( a , b ) = { 0 if  a = b = 0 a b a + b − a b otherwise {\displaystyle \top _{\mathrm {H} _{0}}(a,b)={\begin{cases}0&{\mbox{if }}a=b=0\\{\frac {ab}{a+b-ab}}&{\mbox{otherwise}}\end{cases}}}
is a strict Archimedean t-norm, and an important representative of the parametric classes of Hamacher t-norms and Schweizer–Sklar t-norms.

Properties of t-norms

The drastic t-norm is the pointwise smallest t-norm and the minimum is the pointwise largest t-norm:

⊤ D ( a , b ) ≤ ⊤ ( a , b ) ≤ ⊤ m i n ( a , b ) , {\displaystyle \top _{\mathrm {D} }(a,b)\leq \top (a,b)\leq \mathrm {\top _{min}} (a,b),} for any t-norm ⊤ {\displaystyle \top } and all a, b in .

For every t-norm T, the number 0 acts as null element: T(a, 0) = 0 for all a in .

A t-norm T has zero divisors if and only if it has nilpotent elements; each nilpotent element of T is also a zero divisor of T. The set of all nilpotent elements is an interval or .

Properties of continuous t-norms

Although real functions of two variables can be continuous in each variable without being continuous on , this is not the case with t-norms: a t-norm T is continuous if and only if it is continuous in one variable, i.e., if and only if the functions fy(x) = T(x, y) are continuous for each y in . Analogous theorems hold for left- and right-continuity of a t-norm.

A continuous t-norm is Archimedean if and only if 0 and 1 are its only idempotents.

A continuous Archimedean t-norm is strict if 0 is its only nilpotent element; otherwise it is nilpotent. By definition, moreover, a continuous Archimedean t-norm T is nilpotent if and only if each x < 1 is a nilpotent element of T. Thus with a continuous Archimedean t-norm T, either all or none of the elements of (0, 1) are nilpotent. If it is the case that all elements in (0, 1) are nilpotent, then the t-norm is isomorphic to the Łukasiewicz t-norm; i.e., there is a strictly increasing function f such that

⊤ ( x , y ) = f − 1 ( ⊤ L u k ( f ( x ) , f ( y ) ) ) . {\displaystyle \top (x,y)=f^{-1}(\top _{\mathrm {Luk} }(f(x),f(y))).}

If on the other hand it is the case that there are no nilpotent elements of T, the t-norm is isomorphic to the product t-norm. In other words, all nilpotent t-norms are isomorphic, the Łukasiewicz t-norm being their prototypical representative; and all strict t-norms are isomorphic, with the product t-norm as their prototypical example. The Łukasiewicz t-norm is itself isomorphic to the product t-norm undercut at 0.25, i.e., to the function p(x, y) = max(0.25, x ⋅ y) on .

For each continuous t-norm, the set of its idempotents is a closed subset of . Its complement—the set of all elements that are not idempotent—is therefore a union of countably many non-overlapping open intervals. The restriction of the t-norm to any of these intervals (including its endpoints) is Archimedean, and thus isomorphic either to the Łukasiewicz t-norm or the product t-norm. For such x, y that do not fall into the same open interval of non-idempotents, the t-norm evaluates to the minimum of x and y. These conditions actually give a characterization of continuous t-norms, called the Mostert–Shields theorem, since every continuous t-norm can in this way be decomposed, and the described construction always yields a continuous t-norm. The theorem can also be formulated as follows:

A t-norm is continuous if and only if it is isomorphic to an ordinal sum of the minimum, Łukasiewicz, and product t-norm.

A similar characterization theorem for non-continuous t-norms is not known (not even for left-continuous ones), only some non-exhaustive methods for the construction of t-norms have been found.

Residuum

For any left-continuous t-norm ⊤ {\displaystyle \top } , there is a unique binary operation ⇒ {\displaystyle \Rightarrow } on such that

⊤ ( z , x ) ≤ y {\displaystyle \top (z,x)\leq y} if and only if z ≤ ( x ⇒ y ) {\displaystyle z\leq (x\Rightarrow y)}

for all x, y, z in . This operation is called the residuum of the t-norm. In prefix notation, the residuum of a t-norm ⊤ {\displaystyle \top } is often denoted by ⊤ → {\displaystyle {\vec {\top }}} or by the letter R.

The interval equipped with a t-norm and its residuum forms a residuated lattice. The relation between a t-norm T and its residuum R is an instance of adjunction (specifically, a Galois connection): the residuum forms a right adjoint R(x, –) to the functor T(–, x) for each x in the lattice taken as a poset category.

In the standard semantics of t-norm based fuzzy logics, where conjunction is interpreted by a t-norm, the residuum plays the role of implication (often called R-implication).

Basic properties of residua

If ⇒ {\displaystyle \Rightarrow } is the residuum of a left-continuous t-norm ⊤ {\displaystyle \top } , then

( x ⇒ y ) = sup { z ∣ ⊤ ( z , x ) ≤ y } . {\displaystyle (x\Rightarrow y)=\sup\{z\mid \top (z,x)\leq y\}.}

Consequently, for all x, y in the unit interval,

( x ⇒ y ) = 1 {\displaystyle (x\Rightarrow y)=1} if and only if x ≤ y {\displaystyle x\leq y}

and

( 1 ⇒ y ) = y . {\displaystyle (1\Rightarrow y)=y.}

If ∗ {\displaystyle *} is a left-continuous t-norm and ⇒ {\displaystyle \Rightarrow } its residuum, then

min ( x , y ) ≥ x ∗ ( x ⇒ y ) max ( x , y ) = min ( ( x ⇒ y ) ⇒ y , ( y ⇒ x ) ⇒ x ) . {\displaystyle {\begin{array}{rcl}\min(x,y)&\geq &x*(x\Rightarrow y)\\\max(x,y)&=&\min((x\Rightarrow y)\Rightarrow y,(y\Rightarrow x)\Rightarrow x).\end{array}}}

If ∗ {\displaystyle *} is continuous, then equality holds in the former.

Residua of common left-continuous t-norms

If x ≤ y, then R(x, y) = 1 for any residuum R. The following table therefore gives the values of prominent residua only for x > y.

Residuum of the Name Value for x > y Graph
Minimum t-norm Standard Gödel implication y
Standard Gödel implication. The function is discontinuous at the line y = x < 1.
Product t-norm Goguen implication y / x
Goguen implication. The function is discontinuous at the point x = y = 0.
Łukasiewicz t-norm Standard Łukasiewicz implication 1 – x + y
Standard Łukasiewicz implication.
Nilpotent minimum Fodor implication max(1 – x, y)
Residuum of the nilpotent minimum. The function is discontinuous at the line 0 < y = x < 1.

T-conorms

T-conorms (also called S-norms) are dual to t-norms under the order-reversing operation that assigns 1 – x to x on . Given a t-norm ⊤ {\displaystyle \top } , the complementary conorm is defined by

⊥ ( a , b ) = 1 − ⊤ ( 1 − a , 1 − b ) . {\displaystyle \bot (a,b)=1-\top (1-a,1-b).}

This generalizes De Morgan's laws.

It follows that a t-conorm satisfies the following conditions, which can be used for an equivalent axiomatic definition of t-conorms independently of t-norms:

  • Commutativity: ⊥(a, b) = ⊥(b, a)
  • Monotonicity: ⊥(a, b) ≤ ⊥(c, d) if a ≤ c and b ≤ d
  • Associativity: ⊥(a, ⊥(b, c)) = ⊥(⊥(a, b), c)
  • Identity element: ⊥(a, 0) = a

T-conorms are used to represent logical disjunction in fuzzy logic and union in fuzzy set theory.

Examples of t-conorms

Important t-conorms are those dual to prominent t-norms:

Graph of the maximum t-conorm (3D and contours)
  • Maximum t-conorm ⊥ m a x ( a , b ) = max { a , b } {\displaystyle \bot _{\mathrm {max} }(a,b)=\max\{a,b\}} , dual to the minimum t-norm, is the smallest t-conorm (see the properties of t-conorms below). It is the standard semantics for disjunction in Gödel fuzzy logic and for weak disjunction in all t-norm based fuzzy logics.
Graph of the probabilistic sum
  • Probabilistic sum ⊥ s u m ( a , b ) = a + b − a ⋅ b = 1 − ( 1 − a ) ⋅ ( 1 − b ) {\displaystyle \bot _{\mathrm {sum} }(a,b)=a+b-a\cdot b=1-(1-a)\cdot (1-b)} is dual to the product t-norm. In probability theory it expresses the probability of the union of independent events. It is also the standard semantics for strong disjunction in such extensions of product fuzzy logic in which it is definable (e.g., those containing involutive negation).
Graph of the bounded sum t-conorm
  • Bounded sum ⊥ L u k ( a , b ) = min { a + b , 1 } {\displaystyle \bot _{\mathrm {Luk} }(a,b)=\min\{a+b,1\}} is dual to the Łukasiewicz t-norm. It is the standard semantics for strong disjunction in Łukasiewicz fuzzy logic.
Graph of the drastic t-conorm. The function is discontinuous at the lines 1 > x = 0 and 1 > y = 0.
  • Drastic t-conorm
⊥ D ( a , b ) = { b if  a = 0 a if  b = 0 1 otherwise, {\displaystyle \bot _{\mathrm {D} }(a,b)={\begin{cases}b&{\mbox{if }}a=0\\a&{\mbox{if }}b=0\\1&{\mbox{otherwise,}}\end{cases}}}
dual to the drastic t-norm, is the largest t-conorm (see the properties of t-conorms below).
Graph of the nilpotent maximum. The function is discontinuous at the line 0 < x = 1 – y < 1.
  • Nilpotent maximum, dual to the nilpotent minimum:
⊥ n M ( a , b ) = { max ( a , b ) if  a + b < 1 1 otherwise. {\displaystyle \bot _{\mathrm {nM} }(a,b)={\begin{cases}\max(a,b)&{\mbox{if }}a+b<1\\1&{\mbox{otherwise.}}\end{cases}}}
Graph of the Einstein sum
⊥ H 2 ( a , b ) = a + b 1 + a b {\displaystyle \bot _{\mathrm {H} _{2}}(a,b)={\frac {a+b}{1+ab}}}
is a dual to one of the Hamacher t-norms.

Properties of t-conorms

Many properties of t-conorms can be obtained by dualizing the properties of t-norms, for example:

  • For any t-conorm ⊥, the number 1 is an annihilating element: ⊥(a, 1) = 1, for any a in .
  • Dually to t-norms, all t-conorms are bounded by the maximum and the drastic t-conorm:
⊥ m a x ( a , b ) ≤ ⊥ ( a , b ) ≤ ⊥ D ( a , b ) {\displaystyle \mathrm {\bot _{max}} (a,b)\leq \bot (a,b)\leq \bot _{\mathrm {D} }(a,b)} , for any t-conorm ⊥ {\displaystyle \bot } and all a, b in .

Further properties result from the relationships between t-norms and t-conorms or their interplay with other operators, e.g.:

T(x, ⊥(y, z)) = ⊥(T(x, y), T(x, z)) for all x, y, z in ,
if and only if ⊥ is the maximum t-conorm. Dually, any t-conorm distributes over the minimum, but not over any other t-norm.

Non-standard negators

A negator n : [ 0 , 1 ] → [ 0 , 1 ] {\displaystyle n\colon \to } is a monotonically decreasing mapping such that n ( 0 ) = 1 {\displaystyle n(0)=1} and n ( 1 ) = 0 {\displaystyle n(1)=0} . A negator n is called

  • strict in case of strict monotonocity, and
  • strong if it is strict and involutive, that is, n ( n ( x ) ) = x {\displaystyle n(n(x))=x} for all x {\displaystyle x} in .

The standard (canonical) negator is n ( x ) = 1 − x ,   x ∈ [ 0 , 1 ] {\displaystyle n(x)=1-x,\ x\in } , which is both strict and strong. As the standard negator is used in the above definition of a t-norm/t-conorm pair, this can be generalized as follows:

A De Morgan triplet is a triple (T,⊥,n) such that

  1. T is a t-norm
  2. ⊥ is a t-conorm according to the axiomatic definition of t-conorms as mentioned above
  3. n is a strong negator
  4. ∀ a , b ∈ [ 0 , 1 ] :   n ( ⊥ ( a , b ) ) = ⊤ ( n ( a ) , n ( b ) ) {\displaystyle \forall a,b\in \colon \ n({\perp }(a,b))=\top (n(a),n(b))} .

See also

References

  1. Ismat Beg, Samina Ashraf: Similarity measures for fuzzy sets, at: Applied and Computational Mathematics, March 2009, available on Research Gate since November 23rd, 2016
Categories: