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.
Standard fuzzy set operations
Let A and B be fuzzy sets that A,B â U, u is any element (e.g. value) in the U universe: u â U.
Standard complement
The complement is sometimes denoted by âÂÂA or A<sup>âÂÂ</sup> instead of ìA.
Standard intersection
Standard union
In general, the triple (i,u,n) is called De Morgan Triplet iff
so that for all x,y â [0, 1] the following holds true:
u(x,y) = n( i( n(x), n(y) ) )
(generalized De Morgan relation). This implies the axioms provided below in detail.
Fuzzy complements
ü<sub>A</sub>(x) is defined as the degree to which x belongs to A. Let âÂÂA denote a fuzzy complement of A of type c. Then ü<sub>âÂÂA</sub>(x) is the degree to which x belongs to âÂÂA, and the degree to which x does not belong to A. (ü<sub>A</sub>(x) is therefore the degree to which x does not belong to âÂÂA.) Let a complement âÂÂA be defined by a function
c : [0,1] â [0,1]
For all x â U: ü<sub>âÂÂA</sub>(x) = c(ü<sub>A</sub>(x))
Axioms for fuzzy complements
Axiom c1. Boundary condition
c(0) = 1 and c(1) = 0
Axiom c2. Monotonicity
For all a, b â [0, 1], if a < b, then c(a) > c(b)
Axiom c3. Continuity
c is continuous function.
Axiom c4. Involutions
c is an involution, which means that c(c(a)) = a for each a â [0,1]
c is a strong negator (aka fuzzy complement).
A function c satisfying axioms c1 and c3 has at least one fixpoint a<sup>*</sup> with c(a<sup>*</sup>) = a<sup>*</sup>, and if axiom c2 is fulfilled as well there is exactly one such fixpoint. For the standard negator c(x) = 1-x the unique fixpoint is a<sup>*</sup> = 0.5 .
Fuzzy intersections
The intersection of two fuzzy sets A and B is specified in general by a binary operation on the unit interval, a function of the form
i:[0,1]ÃÂ[0,1] â [0,1].
For all x â U: ü<sub>A â© B</sub>(x) = i[ü<sub>A</sub>(x), ü<sub>B</sub>(x)].
Axioms for fuzzy intersection
Axiom i1. Boundary condition
i(a, 1) = a
Axiom i2. Monotonicity
b ⤠d implies i(a, b) ⤠i(a, d)
Axiom i3. Commutativity
i(a, b) = i(b, a)
Axiom i4. Associativity
i(a, i(b, d)) = i(i(a, b), d)
Axiom i5. Continuity
i is a continuous function
Axiom i6. Subidempotency
i(a, a) < a for all 0 < a < 1
Axiom i7. Strict monotonicity
i (a<sub>1</sub>, b<sub>1</sub>) < i (a<sub>2</sub>, b<sub>2</sub>) if a<sub>1</sub> < a<sub>2</sub> and b<sub>1</sub> < b<sub>2</sub>
Axioms i1 up to i4 define a t-norm (aka fuzzy intersection). The standard t-norm min is the only idempotent t-norm (that is, i (a<sub>1</sub>, a<sub>1</sub>) = a for all a â [0,1]).
Fuzzy unions
The union of two fuzzy sets A and B is specified in general by a binary operation on the unit interval function of the form
u:[0,1]ÃÂ[0,1] â [0,1].
For all x â U: ü<sub>A ⪠B</sub>(x) = u[ü<sub>A</sub>(x), ü<sub>B</sub>(x)].
Axioms for fuzzy union
Axiom u1. Boundary condition
u(a, 0) =u(0 ,a) = a
Axiom u2. Monotonicity
b ⤠d implies u(a, b) ⤠u(a, d)
Axiom u3. Commutativity
u(a, b) = u(b, a)
Axiom u4. Associativity
u(a, u(b, d)) = u(u(a, b), d)
Axiom u5. Continuity
u is a continuous function
Axiom u6. Superidempotency
u(a, a) > a for all 0 < a < 1
Axiom u7. Strict monotonicity
a<sub>1</sub> < a<sub>2</sub> and b<sub>1</sub> < b<sub>2</sub> implies u(a<sub>1</sub>, b<sub>1</sub>) < u(a<sub>2</sub>, b<sub>2</sub>)
Axioms u1 up to u4 define a t-conorm (aka s-norm or fuzzy union). The standard t-conorm max is the only idempotent t-conorm (i. e. u (a1, a1) = a for all a â [0,1]).
Aggregation operations
Aggregation operations on fuzzy sets are operations by which several fuzzy sets are combined in a desirable way to produce a single fuzzy set.
Aggregation operation on n fuzzy set (2 ⤠n) is defined by a function
h:[0,1]<sup>n</sup> â [0,1]
Axioms for aggregation operations fuzzy sets
Axiom h1. Boundary condition
h(0, 0, ..., 0) = 0 and h(1, 1, ..., 1) = one
Axiom h2. Monotonicity
For any pair <a<sub>1</sub>, a<sub>2</sub>, ..., a<sub>n</sub>> and <b<sub>1</sub>, b<sub>2</sub>, ..., b<sub>n</sub>> of n-tuples such that a<sub>i</sub>, b<sub>i</sub> â [0,1] for all i â N<sub>n</sub>, if a<sub>i</sub> ⤠b<sub>i</sub> for all i â N<sub>n</sub>, then h(a<sub>1</sub>, a<sub>2</sub>, ...,a<sub>n</sub>) ⤠h(b<sub>1</sub>, b<sub>2</sub>, ..., b<sub>n</sub>); that is, h is monotonic increasing in all its arguments.
Axiom h3. Continuity
h is a continuous function.
See also
Further reading
References
* L.A. Zadeh. Fuzzy sets. Information and Control, 8:338âÂÂ353, 1965