In mathematics, t-norms are a special kind of binary operations on the real unit interval [0, 1]. Various constructions of t-norms, either by explicit definition or by transformation from previously known functions, provide a plenitude of examples and classes of t-norms. This is important, e.g., for finding counter-examples or supplying t-norms with particular properties for use in engineering applications of fuzzy logic. The main ways of construction of t-norms include using generators, defining parametric classes of t-norms, rotations, or ordinal sums of t-norms.
Relevant background can be found in the article on t-norms.
The method of constructing t-norms by generators consists in using a unary function (generator) to transform some known binary function (most often, addition or multiplication) into a t-norm.
In order to allow using non-bijective generators, which do not have the inverse function, the following notion of pseudo-inverse function is employed:
Let f: [''a'', ''b''] → [''c'', ''d''] be a monotone function between two closed subintervals of extended real line. The pseudo-inverse function to f is the function f (−1): [''c'', ''d''] → [''a'', ''b''] defined as
f(-1)(y)=\begin{cases} \sup\{x\in[a,b]\midf(x)<y\}&forfnon-decreasing\\ \sup\{x\in[a,b]\midf(x)>y\}&forfnon-increasing. \end{cases}
The construction of t-norms by additive generators is based on the following theorem:
Let f: [0, 1] → [0, +∞] be a strictly decreasing function such that f(1) = 0 and f(x) + f(y) is in the range of f or equal to f(0+) or +∞ for all x, y in [0, 1]. Then the function T: [0, 1]2 → [0, 1] defined as
T(x, y) = f (-1)(f(x) + f(y))
is a t-norm.
Alternatively, one may avoid using the notion of pseudo-inverse function by having
T(x,y)=f-1\left(min\left(f(0+),f(x)+f(y)\right)\right)
(x ⇒ y)=f-1\left(max\left(0,f(y)-f(x)\right)\right)
(x\Leftrightarrowy)=f-1\left(\left|f(x)-f(y)\right|\right)
If a t-norm T results from the latter construction by a function f which is right-continuous in 0, then f is called an additive generator of T.
Examples:
Basic properties of additive generators are summarized by the following theorem:
Let f: [0, 1] → [0, +∞] be an additive generator of a t-norm T. Then:
The isomorphism between addition on [0, +∞] and multiplication on [0, 1] by the logarithm and the exponential function allow two-way transformations between additive and multiplicative generators of a t-norm. If f is an additive generator of a t-norm T, then the function h: [0, 1] → [0, 1] defined as h(x) = e−f (x) is a multiplicative generator of T, that is, a function h such that
Vice versa, if h is a multiplicative generator of T, then f: [0, 1] → [0, +∞] defined by f(x) = −log(h(x)) is an additive generator of T.
Many families of related t-norms can be defined by an explicit formula depending on a parameter p. This section lists the best known parameterized families of t-norms. The following definitions will be used in the list:
\lim | |
p\top0 |
Tp=
T | |
p0 |
for all values p0 of the parameter.
The family of Schweizer–Sklar t-norms, introduced by Berthold Schweizer and Abe Sklar in the early 1960s, is given by the parametric definition
SS | |
T | |
p(x,y) |
=\begin{cases} Tmin(x,y)&ifp=-infty\\ (xp+yp-1)1/p&if-infty<p<0\\ Tprod(x,y)&ifp=0\\ (max(0,xp+yp-1))1/p&if0<p<+infty\\ TD(x,y)&ifp=+infty. \end{cases}
A Schweizer–Sklar t-norm
SS | |
T | |
p |
The family is strictly decreasing for p ≥ 0 and continuous with respect to p in [−∞, +∞]. An additive generator for
SS | |
T | |
p |
SS | |
f | |
p |
(x)=\begin{cases} -logx&ifp=0\\
1-xp | |
p |
&otherwise. \end{cases}
The family of Hamacher t-norms, introduced by Horst Hamacher in the late 1970s, is given by the following parametric definition for 0 ≤ p ≤ +∞:
H | |
T | |
p |
(x,y)=\begin{cases} TD(x,y)&ifp=+infty\\ 0&ifp=x=y=0\\
xy | |
p+(1-p)(x+y-xy) |
&otherwise. \end{cases}
H | |
T | |
0 |
Hamacher t-norms are the only t-norms which are rational functions.The Hamacher t-norm
H | |
T | |
p |
H | |
T | |
p |
H | |
f | |
p(x) |
=\begin{cases}
1-x | |
x |
&ifp=0\\ log
p+(1-p)x | |
x |
&otherwise. \end{cases}
The family of Frank t-norms, introduced by M.J. Frank in the late 1970s, is given by the parametric definition for 0 ≤ p ≤ +∞ as follows:
F | |
T | |
p(x,y) |
=\begin{cases} Tmin(x,y)&ifp=0\\ Tprod(x,y)&ifp=1\\ TLuk(x,y)&ifp=+infty\\ logp\left(1+
(px-1)(py-1) | |
p-1 |
\right)&otherwise. \end{cases}
The Frank t-norm
F | |
T | |
p |
F | |
T | |
p |
F | |
f | |
p(x) |
=\begin{cases} -logx&ifp=1\\ 1-x&ifp=+infty\\ log
p-1 | |
px-1 |
&otherwise. \end{cases}
The family of Yager t-norms, introduced in the early 1980s by Ronald R. Yager, is given for 0 ≤ p ≤ +∞ by
Y | |
T | |
p |
(x,y)=\begin{cases} TD(x,y)&ifp=0\\ max\left(0,1-((1-x)p+(1-y)p)1/p\right)&if0<p<+infty\\ Tmin(x,y)&ifp=+infty \end{cases}
The Yager t-norm
Y | |
T | |
p |
Y | |
T | |
p |
Y | |
T | |
p |
Y | |
f | |
p(x) |
=(1-x)p.
The family of Aczél–Alsina t-norms, introduced in the early 1980s by János Aczél and Claudi Alsina, is given for 0 ≤ p ≤ +∞ by
AA | |
T | |
p |
(x,y)=\begin{cases} TD(x,y)&ifp=0\\
-\left(|-logx|p+|-logy|p\right)1/p | |
e |
&if0<p<+infty\\ Tmin(x,y)&ifp=+infty \end{cases}
The Aczél–Alsina t-norm
AA | |
T | |
p |
AA | |
T | |
p |
AA | |
T | |
p |
AA | |
f | |
p(x) |
=(-logx)p.
The family of Dombi t-norms, introduced by József Dombi (1982), is given for 0 ≤ p ≤ +∞ by
D | |
T | |
p |
(x,y)=\begin{cases} 0&ifx=0ory=0\\ TD(x,y)&ifp=0\\ Tmin(x,y)&ifp=+infty\\
1 | ||||||||
|
&otherwise.\\ \end{cases}
The Dombi t-norm
D | |
T | |
p |
D | |
T | |
p |
D | |
T | |
p |
D | |
f | |
p(x) |
=\left(
1-x | |
x |
\right)p.
The family of Sugeno–Weber t-norms was introduced in the early 1980s by Siegfried Weber; the dual t-conorms were defined already in the early 1970s by Michio Sugeno. It is given for −1 ≤ p ≤ +∞ by
SW | |
T | |
p |
(x,y)=\begin{cases} TD(x,y)&ifp=-1\\ max\left(0,
x+y-1+pxy | |
1+p |
\right)&if-1<p<+infty\\ Tprod(x,y)&ifp=+infty\end{cases}
The Sugeno–Weber t-norm
SW | |
T | |
p |
SW | |
T | |
p |
SW | |
f | |
p(x) |
=\begin{cases} 1-x&ifp=0\\ 1-log1(1+px)&otherwise. \end{cases}
The ordinal sum constructs a t-norm from a family of t-norms, by shrinking them into disjoint subintervals of the interval [0, 1] and completing the t-norm by using the minimum on the rest of the unit square. It is based on the following theorem:
Let Ti for i in an index set I be a family of t-norms and (ai, bi) a family of pairwise disjoint (non-empty) open subintervals of [0, 1]. Then the function T: [0, 1]2 → [0, 1] defined as
T(x,y)=\begin{cases} ai+(bi-ai) ⋅
T | ||||
|
,
y-ai | |
bi-ai |
\right) &ifx,y\in[ai,
2 | |
b | |
i] |
\\ min(x,y)&otherwise \end{cases}
is a t-norm.
The resulting t-norm is called the ordinal sum of the summands (Ti, ai, bi) for i in I, denoted by
T=oplus\nolimitsi\in(Ti,ai,bi),
(T1,a1,b1) ⊕ ... ⊕ (Tn,an,bn)
Ordinal sums of t-norms enjoy the following properties:
If
T=oplus\nolimitsi\in(Ti,ai,bi)
R(x,y)=\begin{cases} 1&ifx\ley\\ ai+(bi-ai) ⋅
R | ||||
|
,
y-ai | |
bi-ai |
\right) &ifai<y<x\lebi\\ y&otherwise. \end{cases}
The ordinal sum of a family of continuous t-norms is a continuous t-norm. By the Mostert–Shields theorem, every continuous t-norm is expressible as the ordinal sum of Archimedean continuous t-norms. Since the latter are either nilpotent (and then isomorphic to the Łukasiewicz t-norm) or strict (then isomorphic to the product t-norm), each continuous t-norm is isomorphic to the ordinal sum of Łukasiewicz and product t-norms.
Important examples of ordinal sums of continuous t-norms are the following ones:
The construction of t-norms by rotation was introduced by Sándor Jenei (2000). It is based on the following theorem:
Let T be a left-continuous t-norm without zero divisors, N: [0, 1] → [0, 1] the function that assigns 1 − x to x and t = 0.5. Let T1 be the linear transformation of T into [''t'', 1] and
R | |
T1 |
(x,y)=\sup\{z\midT1(z,x)\ley\}.
Trot=\begin{cases} T1(x,y)&ifx,y\in(t,1]\\
N(R | |
T1 |
(x,N(y)))&ifx\in(t,1]andy\in[0,t]\\
N(R | |
T1 |
(y,N(x)))&ifx\in[0,t]andy\in(t,1]\\ 0&ifx,y\in[0,t] \end{cases}
is a left-continuous t-norm, called the rotation of the t-norm T.
Geometrically, the construction can be described as first shrinking the t-norm T to the interval [0.5, 1] and then rotating it by the angle 2π/3 in both directions around the line connecting the points (0, 0, 1) and (1, 1, 0).
The theorem can be generalized by taking for N any strong negation, that is, an involutive strictly decreasing continuous function on [0, 1], and for t taking the unique fixed point of N.
The resulting t-norm enjoys the following rotation invariance property with respect to N:
T(x, y) ≤ z if and only if T(y, N(z)) ≤ N(x) for all x, y, z in [0, 1].The negation induced by Trot is the function N, that is, N(x) = Rrot(x, 0) for all x, where Rrot is the residuum of Trot.