T-norm

Last updated

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.

Contents

Definition

A t-norm is a function T: [0, 1] × [0, 1] → [0, 1] that satisfies the following properties:

Since a t-norm is a binary algebraic operation on the interval [0, 1], infix algebraic notation is also common, with the t-norm usually denoted by .

The defining conditions of the t-norm are exactly those of a partially ordered abelian monoid on the real unit interval [0, 1]. (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 [0, 1]2. (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 ... x (n times) equals 0.

A t-norm 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 ... 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 [0, 1].

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) MinimumTnorm-graph-contour.png
Graph of the minimum t-norm (3D and contours)
Graph of the product t-norm ProductTnorm-graph-contour.png
Graph of the product t-norm
Graph of the Lukasiewicz t-norm LukasiewiczTnorm-graph-contour.png
Graph of the Łukasiewicz t-norm
Graph of the drastic t-norm. The function is discontinuous at the lines 0 < x = 1 and 0 < y = 1. DrasticTnorm-graph-contour.png
Graph of the drastic t-norm. The function is discontinuous at the lines 0 <x = 1 and 0 <y = 1.
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. NilpotentMinimum-graph-contour.png
Graph of the nilpotent minimum. The function is discontinuous at the line 0 <x = 1 − y< 1.
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 HamacherProduct-graph-contour.png
Graph of the Hamacher product
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:

for any t-norm and all a, b in [0, 1].

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

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 [0, a] or [0, a), for some a in [0, 1].

Properties of continuous t-norms

Although real functions of two variables can be continuous in each variable without being continuous on [0, 1]2, 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 [0, 1]. 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 eachx < 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

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 [0.25, 1]2.

For each continuous t-norm, the set of its idempotents is a closed subset of [0, 1]. 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 , there is a unique binary operation on [0,1] such that

if and only if

for all x, y, z in [0,1]. This operation is called the residuum of the t-norm. In prefix notation, the residuum of a t-norm is often denoted by or by the letter R.

The interval [0,1] 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 [0,1] 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 is the residuum of a left-continuous t-norm , then

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

if and only if

and

If is a left-continuous t-norm and its residuum, then

If is continuous, then equality holds in the former.

Residua of prominent left-continuous t-norms

If xy, 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 theNameValue for x>yGraph
Minimum t-normStandard Gödel implicationy
Standard Godel implication. The function is discontinuous at the line y = x < 1. ResiduumMinimumTnorm-graph-contour.png
Standard Gödel implication. The function is discontinuous at the line y = x < 1.
Product t-norm Goguen implicationy / x
Goguen implication. The function is discontinuous at the point x = y = 0. ResiduumProductTnorm-graph-contour.png
Goguen implication. The function is discontinuous at the point x = y = 0.
Łukasiewicz t-normStandard Łukasiewicz implication1 – x + y
Standard Lukasiewicz implication. ResiduumLukasiewiczTnorm-graph-contour.png
Standard Łukasiewicz implication.
Nilpotent minimumFodor implicationmax(1 – x, y)
Residuum of the nilpotent minimum. The function is discontinuous at the line 0 < y = x < 1. ResiduumNilpotentMinimum-graph-contour.png
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 [0, 1]. Given a t-norm , the complementary conorm is defined by

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:

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) MaximumTconorm-graph-contour.png
Graph of the maximum t-conorm (3D and contours)
Graph of the probabilistic sum ProbabilisticSum-graph-contour.png
Graph of the probabilistic sum
Graph of the bounded sum t-conorm BoundedSum-graph-contour.png
Graph of the bounded sum t-conorm
Graph of the drastic t-conorm. The function is discontinuous at the lines 1 > x = 0 and 1 > y = 0. DrasticTconorm-graph-contour.png
Graph of the drastic t-conorm. The function is discontinuous at the lines 1 >x = 0 and 1 >y = 0.
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. NilpotentMaximum-graph-contour.png
Graph of the nilpotent maximum. The function is discontinuous at the line 0 <x = 1 – y< 1.
Graph of the Einstein sum EinsteinSum-graph-contour.png
Graph of the Einstein sum
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 and all a, b in [0, 1].

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 [0, 1],
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 is a monotonically decreasing mapping such that and . A negator n is called

The standard (canonical) negator is , 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]

  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. .

See also

Related Research Articles

In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions, each taking a single argument.

<span class="mw-page-title-main">Logical connective</span> Symbol connecting sentential formulas in logic

In logic, a logical connective is a logical constant. Connectives can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary connective can be used to join the two atomic formulas and , rendering the complex formula .

Many-valued logic is a propositional calculus in which there are more than two truth values. Traditionally, in Aristotle's logical calculus, there were only two possible values for any proposition. Classical two-valued logic may be extended to n-valued logic for n greater than 2. Those most popular in the literature are three-valued, four-valued, nine-valued, the finite-valued with more than three values, and the infinite-valued (infinitely-many-valued), such as fuzzy logic and probability logic.

In mathematics, and in particular measure theory, a measurable function is a function between the underlying sets of two measurable spaces that preserves the structure of the spaces: the preimage of any measurable set is measurable. This is in direct analogy to the definition that a continuous function between topological spaces preserves the topological structure: the preimage of any open set is open. In real analysis, measurable functions are used in the definition of the Lebesgue integral. In probability theory, a measurable function on a probability space is known as a random variable.

Fuzzy logic is a form of many-valued logic in which the truth value of variables may be any real number between 0 and 1. It is employed to handle the concept of partial truth, where the truth value may range between completely true and completely false. By contrast, in Boolean logic, the truth values of variables may only be the integer values 0 or 1.

In mathematics, fuzzy sets are sets whose elements have degrees of membership. Fuzzy sets were introduced independently by Lotfi A. Zadeh in 1965 as an extension of the classical notion of set. At the same time, Salii (1965) defined a more general kind of structure called an L-relation, which he studied in an abstract algebraic context. Fuzzy relations, which are now used throughout fuzzy mathematics and have applications in areas such as linguistics, decision-making, and clustering, are special cases of L-relations when L is the unit interval [0, 1].

In mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0 and greatest element 1) equipped with a binary operation ab of implication such that (ca) ≤ b is equivalent to c ≤ (ab). From a logical standpoint, AB is by this definition the weakest proposition for which modus ponens, the inference rule AB, AB, is sound. Like Boolean algebras, Heyting algebras form a variety axiomatizable with finitely many equations. Heyting algebras were introduced by Arend Heyting (1930) to formalize intuitionistic logic.

In mathematical analysis, a function of bounded variation, also known as BV function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense. For a continuous function of a single variable, being of bounded variation means that the distance along the direction of the y-axis, neglecting the contribution of motion along x-axis, traveled by a point moving along the graph has a finite value. For a continuous function of several variables, the meaning of the definition is the same, except for the fact that the continuous path to be considered cannot be the whole graph of the given function, but can be every intersection of the graph itself with a hyperplane parallel to a fixed x-axis and to the y-axis.

Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realized. It is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers, which determine if a given artifact possesses safety or liveness properties. For example, CTL can specify that when some initial condition is satisfied, then all possible executions of a program avoid some undesirable condition. In this example, the safety property could be verified by a model checker that explores all possible transitions out of program states satisfying the initial condition and ensures that all such executions satisfy the property. Computation tree logic belongs to a class of temporal logics that includes linear temporal logic (LTL). Although there are properties expressible only in CTL and properties expressible only in LTL, all properties expressible in either logic can also be expressed in CTL*.

Fuzzy set operations are a generalization of crisp set operations for fuzzy sets. There is in fact more than one possible generalization. The most widely used operations are called standard fuzzy set operations; they comprise: fuzzy complements, fuzzy intersections, and fuzzy unions.

In abstract algebra, a branch of pure mathematics, an MV-algebra is an algebraic structure with a binary operation , a unary operation , and the constant , satisfying certain axioms. MV-algebras are the algebraic semantics of Łukasiewicz logic; the letters MV refer to the many-valued logic of Łukasiewicz. MV-algebras coincide with the class of bounded commutative BCK algebras.

In statistics, M-estimators are a broad class of extremum estimators for which the objective function is a sample average. Both non-linear least squares and maximum likelihood estimation are special cases of M-estimators. The definition of M-estimators was motivated by robust statistics, which contributed new types of M-estimators. However, M-estimators are not inherently robust, as is clear from the fact that they include maximum likelihood estimators, which are in general not robust. The statistical procedure of evaluating an M-estimator on a data set is called M-estimation.

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.

In mathematical logic, monoidal t-norm based logic, the logic of left-continuous t-norms, is one of the t-norm fuzzy logics. It belongs to the broader class of substructural logics, or logics of residuated lattices; it extends the logic of commutative bounded integral residuated lattices by the axiom of prelinearity.

In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects.

In mathematics and philosophy, Łukasiewicz logic is a non-classical, many-valued logic. It was originally defined in the early 20th century by Jan Łukasiewicz as a three-valued modal logic; it was later generalized to n-valued as well as infinitely-many-valued (0-valued) variants, both propositional and first order. The ℵ0-valued version was published in 1930 by Łukasiewicz and Alfred Tarski; consequently it is sometimes called the Łukasiewicz–Tarski logic. It belongs to the classes of t-norm fuzzy logics and substructural logics.

T-norm fuzzy logics are a family of non-classical logics, informally delimited by having a semantics that takes the real unit interval [0, 1] for the system of truth values and functions called t-norms for permissible interpretations of conjunction. They are mainly used in applied fuzzy logic and fuzzy set theory as a theoretical basis for approximate reasoning.

Fuzzy mathematics is the branch of mathematics including fuzzy set theory and fuzzy logic that deals with partial inclusion of elements in a set on a spectrum, as opposed to simple binary "yes" or "no" inclusion. It started in 1965 after the publication of Lotfi Asker Zadeh's seminal work Fuzzy sets. Linguistics is an example of a field that utilizes fuzzy set theory.

In mathematical logic, basic fuzzy logic, the logic of the continuous t-norms, is one of the t-norm fuzzy logics. It belongs to the broader class of substructural logics, or logics of residuated lattices; it extends the logic MTL of all left-continuous t-norms.

Łukasiewicz–Moisil algebras were introduced in the 1940s by Grigore Moisil in the hope of giving algebraic semantics for the n-valued Łukasiewicz logic. However, in 1956 Alan Rose discovered that for n ≥ 5, the Łukasiewicz–Moisil algebra does not model the Łukasiewicz logic. A faithful model for the ℵ0-valued (infinitely-many-valued) Łukasiewicz–Tarski logic was provided by C. C. Chang's MV-algebra, introduced in 1958. For the axiomatically more complicated (finite) n-valued Łukasiewicz logics, suitable algebras were published in 1977 by Revaz Grigolia and called MVn-algebras. MVn-algebras are a subclass of LMn-algebras, and the inclusion is strict for n ≥ 5. In 1982 Roberto Cignoli published some additional constraints that added to LMn-algebras produce proper models for n-valued Łukasiewicz logic; Cignoli called his discovery proper Łukasiewicz algebras.

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