Fundamentals of Fuzzy Logic

L1

Dpto. Ing. de Sistemas y Automática

Universidad Carlos III
Madrid

August 2019
 Table of contents

1 Foundations of Fuzzy Logic

 Introduction

• The imprecision and the uncertainty can be considered as two aspects

unavoidably associated to most of the phenomena that surround us, and
that have their origin in the complexity of the same or/and in the
imperfection of our information about them.
• Each element of information or item can be defined by a set of elements
(object, attribute, value, confidence or certainty).
• The attribute is the function that assigns a value or set of values to
an object.
• The confidence is an indication of the reliability of the information
element.
• It is possible to differentiate between the concept of imprecision
and that of uncertainty:
• The imprecision is related to the content of an item or information
element (the component value of the quatern of elements that make
up the information item).
• The uncertainty is related to its truth, understood as its conformity
with reality (the trust component of the quatem of elements that
make up the information item).
 Information elements

• The uncertainty of an information element can be treated by means

of qualifiers such as probable, possible, necessary, plausible or
believable to which it is necessary to give a precise meaning. It is
evident that the concept of probability has been extensively studied.
• An information element is said to be precise when the component
value of that element can not be subdivided.
• The property of being precise depends on the definition of the
reference domain (of the granularity of the same, that is, of the
choice of the unit of measurement).
• There are different qualifiers to refer to the imprecision, so we have:
vague, fuzzy, general, diffuse or ambiguous.
• By fuzzy, in an information element, we understand the absence of a
clear limit in the set of values ??associated with the objects to which
it refers.
• Most of the qualifiers used in the conventional language are fuzzy.
 Difference between precision and
uncertainty

• Given a set of information items, the opposition between the

concepts of precision and uncertainty is expressed because:
• By making the content of a proposition more precise, it tends to
increase its uncertainty.
• On the other hand, the inaccurate character of a certain item of
information usually confers a certain certainty on the conclusions
that can be derived from it.
 Historical origins

• Fuzzy or fuzzy control uses the manipulation techniques of fuzzy

information started by Zadeh in the 1960s with the introduction of
the concept of blurred or fuzzy and subsequent set development of
the theory of fuzzy sets.
 Fuzzy sets

• In the theory of fuzzy sets, the normal sets are called crisp or precise
sets, to differentiate them from the textit fuzzy or blurry sets.
• If C is a precise set defined over a speech universe U, then for any
element u of U, either u ∈ C or u ∈ / C.
• In the theory of fuzzy sets this property is generalized, and the
membership of an element in the fuzzy set F is not the dichotomy ∈
or ∈,
/ but it is defined as a function, called membership function
that assigns to each element u of U a value in the interval [0,1] that
indicates the degree of belonging of said element u to the fuzzy
set F .
• To the set defined on the basis of this function of generalized
membership is called fuzzy set.
 Fuzzy sets

Crisp set Fuzzy set

/I
, l'c< x) ',,F( x)
1.0
I I

C
0 ..5

0 j \
I
 Fuzzy sets

• Def: The membership function µF of a fuzzy set F is a function

µF : U → [0, 1]. (1)

With this definition, every element u ∈ U has a degree of

belonging µF (u) ∈ [0, 1].
• The fuzzy set F est ’a completely determined by the set of n-tuples

F = {(u, µF (u)) |u ∈ U }. (2)

 Fuzzy sets
• Examples :
• Suppose we want to define the fuzzy set of the numbers textbf
textit natural "next to 8". This can be expressed as:

8̃ = (5, 0,1)+(6, 0,2)+(7, 0,5)+(8, 1,0)+(9, 0,5)+(10, 0,2)+(11, 0,1)

• If we assume that what we want to represent is the function of

belonging to the fuzzy set of textit comfortable temperatures, this
could be, for example,
1
µC (x) =
1 + (x − 20)2

grafically
 Fuzzy sets
• A more convenient notation for fuzzy sets is the proposed by Zadeh.
• Let’s suppose that C is a finite precise set (crisp) {u1 , u2 , ..., un }, an
alternative notation es C = u1 + u2 + ... + un where the + symbol
indicates enumeration.
• Similarly, the pair (u, µ(u)) it could be denoted as µ(u)/u, where /
denotes n-tuple.
• With this, the fuzzy set F ,

F = {(u, µF (u)) |u ∈ U } (3)

can be expressed by:

F = µF (u1 )/u1 + µF (u2 )/u2 + ... + µF (un )/un =

n
P (4)
= µF (ui )/ui
i=1

and in the case of continuous sets,

Z
F = µF (u)/u (5)
U
 Typical membership functions:
Gamma

• Def: The Gamma function Γ : u → [0, 1] is a two-parameter function

defined as

 0

if u<α
(u−α)
Γ(u; α, β) = if α≤u≤β (6)
 (β−α)
1 if u>β
 Typical membership functions:
S

• Def: The function S : u → [0, 1] , due to Zadeh, is a non-linear

function of three parameters defined as

0 if u ≤ α


  2
 2 (u−α)

if α < u ≤ β

(β−α)
S(u; α, β, γ) =  2 (7)
(u−β)



 1 − 2 (γ−β) if β < u ≤ γ

1 if u > β
 Typical membership functions:
L

• Def: The function L : u → [0, 1] is a two-parameter function defined

as
 1

if u < α
(α−u)
L(u; α, β) = 1 − (α−β) if α ≤ u ≤ β (8)

0 if u > β
 Typical membership functions:
Lambda

• Def: The function Λ : u → [0, 1] is a three-parameter function

defined as


 0 if u ≤ α
 (u−α)

if α ≤ u ≤ β
(β−α)
Λ(u; α, β, γ) = (β−u) (9)


 1 − (β−γ) if β ≤ u ≤ γ
0 if u > γ

 Typical membership functions:
Pi

• Def: The function Π : u → [0, 1] is a four-parameter function

defined as


 0 if u ≤ α
(u−α)
if α ≤ u < β


 (β−α)

Π(u; α, β, γ, δ) = 1 if β ≤ u ≤ γ (10)
 (γ−u)



 1 − (γ−δ) if γ < u ≤ δ
0 if u > δ

 Membership functions

• This function can be used to describe the previous ones since, if we

assume that the domain is [-6,6], we could do

Γ (x; α, β) = Π (x; α, β, 6, 6)
L (x; γ, δ) = Π (x; −6, −6, γ, δ) (11)
Λ (x; α, β, γ) = Π (x; α, β, β, δ)
 Membership functions
Gaussian

• Def: A Gaussian membership function, Gauss(x; c, ?), is defined

according to the expression,
(x−c)2
− 2β 2
µGauss (x; c, β) = e (12)

being c its center and beta > 0 the width of the membership
function.
 Basic Concepts

• Def: (Normalized fuzzy set). Let A be a fuzzy set defined in X , it is

said that A is a normalized fuzzy set if and only if 0 ≤ µA (x) ≤ 1.
Since a degree of belonging greater than one does not have much
logical sense, normally standardized fuzzy sets are always used.
• Def: (Null or empty fuzzy set). Let A be a fuzzy set defined in X ,
say that A is a set of fuzzy null or void, A = ∅, if and only if
µA (x) = 0, ∀x ∈ X . That is, A is a null fuzzy set if there is not an
element whose degree of membership to the set is nonzero.
• Def: (Normal fuzzy set). Let A be a fuzzy set defined in X , it is said
that A is a normal fuzzy set, if and only if there is at least one
x ∈ X such that µA (x) = 1. Otherwise, it is said that A is a
non-normal fuzzy set.
 Basic Concepts
Convexity

• Def: (Convex fuzzy set). Let A be a fuzzy set defined in X , say that
A is a convex fuzzy set if and only if for any two points x1 and x2 ,
and any λ ∈ [0, 1], this equation is verified:

µA (λx1 + (1 − λ)x2 ) ≥ min(µA (x1 ), µA (x2 )) (13)

 Basic Concepts
Support

• Def: (Support of a fuzzy set). Let A be a fuzzy set defined in X , the

support of A, denoted by Sop(A) or sup(A), is the subset of X
whose elements have a degree of Non-zero membership in A.

Sop(A) = {x ∈ X : µA (x) > 0}. (14)

 Basic Concepts
Support

• When using asymptotic membership functions, such as Gaussian,

this definition is not practical, since the support of these functions is
infinite. To limit the support of asymptotic functions to a finite set of
elements, the previous definition is usually modified by the following.

Sop(A) = {x ∈ X : µA (x) > γ, γ > 0}. (15)

If γ is chosen with a positive value close to zero, those elements

whose membership quality is very low are eliminated from the
support, obtaining at the same time a finite and representative
support of the whole.
 Basic Concepts
Nucleus, frontier y height

• Def: ( textit Nucleus of a fuzzy set). Let A be a fuzzy set defined in

X , the nucleus of A, denoted by nuc(A), is the subset of X whose
elements have degree of belonging one in A.

nuc(A) = {x ∈ X |µA (x) = 1} (16)

If A is a convex fuzzy set, its nucleus is also convex.

• Def: (Border of a fuzzy set). Let A be a fuzzy set defined in X , the
boundary of A is the subset of X whose elements have degrees of
membership in A between zero and one.
• Def: (Weight or height of a fuzzy set). Let A be a fuzzy set defined
in X , the weight or height of A is the maximum value of the
membership function µA . If A is a normal (and normalized) fuzzy
set, its weight will be 1.
 Basic Concepts
Fuzzy number

• Def: (Fuzzy number ). A fuzzy number A is a fuzzy set defined in

R, normal and convex, whose membership function is continuous
and its support limited. If the support is not limited, but the
condition of limit given by the equation is fulfilled

lim A(x) = 0 (17)

|x|→∞

It can also be said that A is a fuzzy number or, more precisely,

quasi-fuzzy.
• The fuzzy numbers are fuzzy sets with a clear quantitative meaning,
insofar as they classify a concept around a number or range of
numbers.
• These numbers have a great importance in the fuzzy control, since
they allow to represent numerical values by means of the imprecision
of the fuzzy logic.
 Operations on fuzzy sets

• The basic operations that are defined on the fuzzy sets are the same
as in the classical set theory: equality, inclusion, union, intersection
and complementation.
• Def: [equality ] Dos conjuntos borrosos son iguales , A=B, si y sólo si

∀x ∈ S : µA (x) = µB (x). (18)

• Def: [inclusion] A is a subset of B, A ⊆ B, if and only if

∀x ∈ X : µA (x) 6 µB (x). (19)

 Operations on fuzzy sets

• In the classical sets theory, the operations of union, intersection and

complementation are simple and unambiguously defined operations.
• The same is not true in the theory of fuzzy sets. Zadeh proposed
that these operations be defined in the following way (there are
other possible definitions for these operations):
• Def: The intersection of two fuzzy sets A and B, A ∩ B, is defined as

∀x ∈ X : µA∩B (x) = min (µA (x), µB (x)) . (20)

• Def: The union of two fuzzy sets A and B, A cupB, is defined as

∀x ∈ X : µA∪B (x) = max (µA (x), µB (x)) . (21)

• Def: The fuzzy set complementary of a fuzzy set A, A0 , is defined as

∀x ∈ X : µA0 (x) = 1 − µA (x). (22)

 Operations on fuzzy sets

• The above operations are shown graphically in the following figure:

 Properties

• Fuzzy sets and union, intersection, and complement operations

satisfy the basic properties of their classical equivalents:
• Idempotency:

A∩A = A
A∪A = A (23)

• Identity:

A∪∅ = A and, if A ⊂ X,A ∩ X = A

A∩∅ = ∅ and, if A ⊂ X,A ∪ X = X (24)

• Transitivity:
Si A ⊂ B ⊂ C, then A⊂C (25)
 Properties

• Cont.:
• Involution:
A00 = A (26)
• Commutative property:

A∪B = B ∪A
A∩B = B ∩A (27)
• Associative property:

A ∪ (B ∪ C ) = (A ∪ B) ∪ C
A ∩ (B ∩ C ) = (A ∩ B) ∩ C (28)
 Properties
• With the operations and basic properties studied it is possible to
extend to the fuzzy sets many of the identities valid for the classical
sets.
• It can be verified that in the theory of fuzzy sets the laws of De
Morgan given by

(A ∪ B)0 = A0 ∩ B 0
0
(A ∩ B) = A0 ∪ B 0 (29)

if the classical uni, intersection and negation operators initially

proposed by L. Zadeh are considered (maximum, minimum, and
complement to one respectively).
• Likewise, under the same assumptions, the distributive laws are also
fulfilled

C ∩ (A ∪ B) = (C ∩ A) ∪ (C ∩ B)
C ∪ (A ∩ B) = (C ∪ A) ∩ (C ∪ B) (30)
• The logical functions were proposed by Professor Zadeh in the initial
development of the theory of fuzzy sets. However, these functions
can be substituted by others as long as they meet certain conditions.
• These functions that generalize the intersection and union
operations, derived from the concepts presented by Menger and
Schwizer and Sklar, are known as triangular rules and co-norms
respectively.
• In addition to the minimum function, there are other operators that
implement this function, known as triangular norms or T-norms.
 T-norms

• Def: (Triangular norms or T-norms). A triangular norm, or T-norm,

is an application T : [0, 1] × [0, 1] → [0, 1] that fulfills the properties
commutative, associative, monotonicity and unit identity (or
boundary condition).
• The T-norms represent a generic model for the logical intersection
(logical operator Y or AND).
• The commutative and associative properties have already been seen.
• Given two pairs of values x 6 y , w 6 z, the property of
monotonicity requires that T (x, w ) 6 T (y , z) be satisfied .
• The boundary condition that must fulfill a function so that it can be
considered as a triangular norm (T-norm) is that it be a unit identity,
that is, T (x, 1) = x, for all x ∈ [0, 1].
• For a function to be considered T-norm it must comply with the
associative property (this requirement allows the T-norms to be
extended to more than two arguments).
• As the commutative property must comply, the order of application
of the T-norms does not affect the final result.
 T-norms
Main

• Main T-norms:
• Minimum (standard): T (x, y ) = min{x, y } .
• Product: T (x, y ) = xy .

• Drastic Product : T (x, y ) = min{x, y } if max {x, y } = 1
0 in other case
• Bounded Product (Lukasiewicz):
T (x, y ) = max{0, (1 + λ)(x + y − 1) − λxy }, λ > −1 .
• Hamacher: T (x, y ) = xy
,λ > 0 .
λ+(1−λ)(x+y −xy )
• Yager: T (x, y ) = 1 − min{1, λ (1 − x)λ + (1 − y )λ }, λ > 0.
p
• Dubois-Prade: T (x, y ) = xy
, α ∈ (0, 1) .
 max{x,y
x
,α}
y
• Frank: T (x, y ) = logλ 1 + (λ −1)(λ −1) , λ > 0, λ 6= 1

λ−1
• Einstein’s Product: T (x, y ) = xy
1+(1−x)+(1−y )
 T-norms

• Ejemplo:
• Product T-norms and bounded product.
... P•(•)
·· · P11(•)
0,9 -- Lulwriewkl<, � = o
•-, -, , Lulwriewkl<, � = 4
0,8
- - - Product
0,7

*
0,G

0,5

0,4

0,3
'
I

0,2 , I

0,1 , ,, I
''
I '·..
,·.
.· , I
0
0 0.1 0,2 0,3 0,4 0,5 0,G 0,7 0,8 0,9
•
 S-norms

As with intersection, fuzzy union can be defined by other functions than

the maximum (they are the T-conorms or S-norms).
• Def: (T-conorm or S-norm).A triangular conorm, also called
2
T-conorm or S-norm, is an application S : [0, 1] → [0, 1] that
fulfills the commutative, associative, monotonicity and zero identity
(or boundary condition) properties.
• The S-norms represent a generic model for the logical union (logical
operator OR).
• The boundary condition that must fulfill a function so that it can be
considered as a triangular conorm (S-norm) is that it be of zero
identity, that is, that S(x, 0) = x, ∀x ∈ [0, 1].
• As with the T-norms, the S-norms or T-conorms can be extended to
more than two arguments using their associativity, regardless of their
order of application (commutativity).
 S-norms
Main

• Main S-norms:
• Standard Maximum: T (x, y ) = max{x, y } .
• Sum-Product: T (x, y ) = x + y − xy .

• Drastic Sum: T (x, y ) = max{x, y } if min {x, y } = 0
1 in other case
• Bounded Sum (Lukasiewicz):
T (x, y ) = min{1, (x + y + λxy )}, λ > 0 .
• Hamacher: T (x, y ) = x+y −(2−λ)xy , λ > 0 .
1−(1−λ)(xy )
p
• Yager: T (x, y ) = 1 − min{1, λ x λ + y λ }, λ > 0.
• Dubois-Prade: T (x, y ) = 1 − (1−x)(1−y )
max{(1−x),(1−y ),α}
, α ∈ [0, 1] .
( (
• Frank: T (x, y ) = logλ 1 + (λ 1−x)−1)(λ 1−y )−1) , λ > 0, λ 6= 1

λ−1
 S-norms

• Exemple:
• Sum-product and bounded sum S-norms.
........ P•(•

, ": -
)
········ Pu(•
)
' ,
"'.'··
0,9 -- Lub.siewick, .\ =0 I
,
· -·-·· Lulwiiewick, .\ = 4
,,
0,8
- - - Sum-producc
0,7

0,6

:E:"' 0,5 ..J''

0,4

0,3

0,2

0,1

0
0 0,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9
 S-norms
• For each T-norm there is a dual or conjugated S-norm and vice
versa. Thus for a T-norm, T (x, y ), its conjugate S-norm is:
S(x, y ) = 1 − T ((1 − x), (1 − y )).
• Although the T-norms and S-norms can not be ordered, if the
largest and smallest of them can be clearly identified. Thus, the
largest of the T-norms is the minimum function and the smallest the
drastic product.
• In the case of S-norms, the largest is the drastic sum, and the
smallest the maximum function.
• The rest of the T-norms and S-norms are included among them.
• With respect to the properties that comply with the T-norms and
S-norms, in general it can be said that these operations do not
satisfy the properties of contradiction or exclusion of the medium,
except for Lukasiewicz’s family with λ = 0.
• The idempotency properties and the distributive property are only
met in the case of standard operators, that is, if the maximum and
minimum are used as union and intersection operators, respectively.
 Negation Operators
Alternative definitions

As with union and intersection operations, the negation operator can also
be defined differently from its original definition.
• Def: (Negation Operator ). A negation function is an application
N : [0, 1] → [0, 1] continuous, monotone not increasing, involutive,
that is, N(N(x)) = x, for all x ∈ X , and that meets the boundary
conditions N(0) = 1 and N(1) = 0.
• Main definitions:
• Standard: N(x) = 1 − x .

• Umbral: N(x) = 1 si x 6 0
02 λ < 1
0 si x > 0
• Sugeno: N(x) = 1−x , λ > −1 .
p1+λx
• Yager: N(x) = ω (1 − x ω ), ω > 0.
 Negation Operators

• Example:
• Negation Operators of Yager and Sugeno.
 Other fuzzy operations

• Def:(α-cut). Let A be a fuzzy set, whose membership function is

α
µA (x), the α-cut of A is a fuzzy set denoted by [A] and is defined
according to
α
[A] = x ∈ X |µA (x) > α, α > 0. (31)
 Other fuzzy operations
• Def: (Concentración y dilatación). Sea A un conjunto borroso cuya
función de pertenencia es µA (x), entonces Ak , con k ∈ R+, denota
la operación de concentración si k > 1 o de dilatación si k ∈ [0, 1).
La función de pertenencia del conjunto borroso concentrado o
dilatado se obtiene mediante:

µAk = µA (x)k . (32)

• Normalmente se utiliza k = 2 para la operación de concentración y

k = 0,5 para la dilatación.
• Def: (Producto algebraico). El producto algebraico de dos conjuntos
borrosos A y B, cuyas funciones de pertenencia son µA (x) y µB (x),
respectivamente, se denota por AB y se define mediante:

µ(AB) (x) = µA (x)µB (x). (33)

El conjunto borroso AB cumple AB ⊂ A ∩ B.

 Other fuzzy operations

• Def: (Algebraic Sum). The algebraic sum of two fuzzy sets A and
B, whose membership functions are µA (x) and µB (x), respectively,
is denoted by A + B and is defined by

µ(A+B) (x) = µA (x) + µB (x) (34)

• If A and B are standardized fuzzy sets, the fuzzy set obtained by the
algebraic sum of A and B will only be normalized if µA (x) + µB (x) 6
1 for all x ∈ X , that is, unlike the algebraic product, the algebraic
sum of two fuzzy sets will have a sense if µ(A+B) 6 1 para todo
x ∈ X.
 Other fuzzy operations
• Def: (Sum). The sum of two fuzzy sets A and B, whose
membership functions are µA (x) and µB (x), respectively, denote
A ⊕ B and is defined by the equation:

(A ⊕ B) = A + B − AB
µ(A⊕B) (x) = µA (x) + µB (x) − µA (x)µB (x), ∀x ∈ X (35)

• If A and B are standardized fuzzy sets, the fuzzy set A ⊕ B will be

normalized in any case, so the operation adds up if it makes sense
throughout the universe of speech of the sets A and B.
• Observation: the algebraic product is a T-norm, so it is equivalent to
the fuzzy intersection operation, however the algebraic sum is not a
T-conorm, so it does not would be the dual operation of the
algebraic product.
In fuzzy logic, the dual operation of the algebraic product is the sum,
since this is equivalent to the union operation (it is an S-norm).
 Other fuzzy operations
• Def: (Convex combination). The convex combination of two fuzzy
sets A and B, with membership functions are µA (x) and µB (x),
through a third fuzzy set C , with membership function µC (x), is
denoted by (A, B; C ), and is defined as:

(A, B; C ) = CA + CB
µ(A,B;C ) (x) = µC (x)µA (x) + (1 − µC (x))µB (x), ∀x ∈ X (36)
 Other fuzzy operations

• The convex combination of A and B through a fuzzy set C is a

fuzzy set intermediate between the union and intersection of the A
and B sets; that is, verify that:

A ∩ B ⊂ (A, B; C ) ⊂ A ∪ B, ∀C (37)
 Fuzzy Relations

• A crisp relationship represents:

• The presence or absence of association, interaction or
interconnection between the elements of two or more sets. item A
relationship can be considered as a set of n-tuples, where A tuple is
an ordered pair. A binary n-tuple is denoted as (x, y ), a ternary
n-tuple is (x, y , z), and one of order n would be (x1 , x2 , . . . , xn ).
• The Cartesian product is a binary relation, which for the case of two
precise sets or crisp, X e Y , is denoted by X x Y , and is defined
formally as
X × Y = { (x, y )|x ∈ X , y ∈ Y } (38)
 Fuzzy Relations

• The Cartesian product can be generalized for a family of crisp sets

{ Xi |i ∈ N, i 6 n} and defined as
n
× Xi = { (x1 , . . . , xn )|xi ∈ Xi , ∀i ∈ N, i 6 n} (39)
i=1

• A relation between precise sets or crisp X1 , . . . , Xn is a subset of the

Cartesian product ×ni=1 Xi . It is denoted as R(X1 , X2 , . . . , Xn ), y

R(X1 , X2 , . . . , Xn ) ⊂ X1 × X2 × . . . × Xn (40)

• As a relation is in itself a set, the basic concepts of sets such as

subset, union, intersection and complementation can be applied to a
relationship without any modification.
 Fuzzy Relations
Definición

• A textit fuzzy relationship is a blurry set defined on the Cartesian

product of precise sets or crisp X1 , . . . , Xn where the n-tuples
(x1 , . . . , xn ) may have degrees of membership that vary with the
relationship.
• Def: Let U and V be two continuous speech universes, and
µR : UxV → [0, 1], the characteristic function that defines the
degree of belonging of a n-tuple to the relation R, then
Z
R= µR (u, v )/(u, v ) (41)
UxV

is a binary fuzzy relation on UxV.

• In the case that U and V are discrete speech universes, so
X
R= µR (u, v )/(u, v ) (42)
UxV
 Operations with Fuzzy Relations

• Fuzzy relationships have great importance in control since allow

describing interactions between variables (using rules <if-then>).
• Def: (Intersection) Let R and S be two binary relations defined on
XxY. The intersection of R and S is defined as

∀(x, y ) ∈ X × Y : µR∩S (x, y ) = min (µR (x, y ), µS (x, y )) . (43)

• Def: (Union) Let R y S be two binary relations defined on XxY. The

union de R y S is defined as

∀(x, y ) ∈ X × Y : µR∪S (x, y ) = max (µR (x, y ), µS (x, y )) . (44)

 Operations with Fuzzy Relations

• Two very important operations on fuzzy sets and fuzzy relationships

are the so-called projection and cylindrical extension.
• The projection operation converts a ternary relation into a binary, or
a binary into a fuzzy set, or a fuzzy set into a precise value.
• The cylindrical extension is the opposite of projection, that is, it
extends fuzzy sets to fuzzy binary relations, fuzzy binary relations in
fuzzy ternary relations, etc.
 Operations with Fuzzy Relations
Proyection

• Sea R a relation on U = Xni=1 Ui . Be (i1 , . . . , ik ) a subsequence of

(1, . . . , n), and be (j1 , . . . , jl ) the complementary subsequence of
(1, . . . , n). Be in addition V = Xkm=1 Vim .
• Def: The projection of R over V is defined as
Z
projRonV= sup µR (x1 , . . . , xn )/(x1 , . . . , xik ). (45)
xj1 ,...,xjl
V

In the binary case this operation is very simple (suppose that R is

defined on X xY ):
Z
projRonY= supµR (x, y )/y (46)
x
Y
 Operations with Fuzzy Relations
Proyección

• Graphic Interpretation
 Operations with Fuzzy Relations
Cylindrical extension

• Def: The Cylindrical extension of S on U is defined as

Z
ce(S)= µS (xi1 , . . . , xik )/(x1 , . . . , xn ). (47)
U

In the binary case this operation is very simple (suppose that F is a

fuzzy set defined on Y ), the cylindrical extension of F on X x Y is
the set of n-tuples (x, y ) ∈ X x Y with degree of belonging equal to
µF , that is:
Z
ce(F )= µF (y )/(x, y ). (48)
X ×Y
 Operations with Fuzzy Relations
cylindrical extensions

• Graphic Interpretation
 Operations with Fuzzy Relations
Example

• µA (x), µB (y ), cey (A(x)) = ceA (x, y ), cex (B(y )) = ceB (x, y ) y

R = ceA (x, y ) ∩ ceB (x, y ).
 Operations with Fuzzy Relations
Composition
The combination of fuzzy sets with fuzzy relations with the help of the
cylindrical extension and the projection is denominates composition.
And it is denoted by ◦.
• Def: (Composition) A A is a fuzzy set defined on X and R a fuzzy
relation defined on X x Y . Then the composition of A and R that
results in a fuzzy set B defined above Y is obtained as:
B = A ◦ R = proj (ce(A) ∩ R) onY (49)

• If the intersection is done with the maximum operation and the

projection with the minimum,
µB (y ) = max min (µA (x), µR (x, y )) . (50)
x

This composition is called textit max-min. If the intersection

operation is carried out with maximum and the projection with
product, we have
µB (y ) = max (µA (x).µR (x, y )) (51)
x

which is called composition max-dot or max-product.

 Operations with Fuzzy Relations
Composition

• Graphic Interpretation
 Extension Principle

• One of the notions of more importance in the theory of fuzzy sets is

the so-called principle of extension.
• This extension principle gives us a general method to combine fuzzy
and non-fuzzy concepts of any kind,
• for example, to combine fuzzy sets and relationships,
• but also for the operations of a math function on fuzzy sets.
• Fuzzy sets can be interpreted as fuzzy numbers. In this case the
extension principle can be used to add or multiply these numbers.
 Extension Principle

• Let A1 , . . . , An fuzzy sets, defined on U1 , . . . , Un , and let f be a

non-fuzzy function f : U1 × . . . × Un → V . The purpose is to extend
f so that it operates on A1 , . . . , An and returns a fuzzy set F on V .
• This is done using the sup-min composition operation as follows:
• Def: The extension of f , operating on A1 , . . . , An results in the
following membership function for F

µF (v ) = sup min µA1 (u1 ), . . . , µAn (un ) (52)
u1 , . . . , un
f (u1 , . . . , un ) = v

when f −1 (v ) exists. In any other case µA (v ) = 0.

 Extension Principle

• In the binary case and on compact or discrete domains, the previous

expression could be formulated as

µf (A1 ,A2 ) (y ) = max min µA1 (x1 ), µA2 (x2 ) (53)
x1 , x2
y = f (x1 , x2 )

• With this we can extend the domain of the real numbers to the
domain of the fuzzy numbers.
• Since in fuzzy control the domains are discrete or compact, it is
almost always possible to use the max-min composition instead of
the sup-min.
• The End L1