Fuzzy Systems

Jensen
Outline
Lecture 1:
Introduction
Lecture 2:
Lecture 3:
Lecture 4: Fuzzy
Control
Fuzzy Systems
Hans-Christian B. Jensen
Institute of Energy Technology
Aalborg University
hcj@et.aau.dk
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Lectures
First lecture: Introduction
An introduction to fuzzy sets
Operations on fuzzy sets
Fuzzy relations
Second lecture:
Fuzzy implications
The theory of approximate reasoning
Third lecture:
Fuzzy rule-based systems
Fuzzy reasoning schemes
Forth lecture: Fuzzy Control
Fuzzy logic controllers
Eect of fuzzy systems
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Can computers think?
Best known is Articial Intelligence.
But what is AI?
The eld of Articial Intelligence: The study and
design of intelligent agents
An intelligent agent is a system that perceives its environment
and takes actions that maximize its chances of success.
How do people perceive the statements?
Example: Is the sky blue?
Yes it is TRUE (T)
No it is FALSE (F)
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
What is Fuzzy Sets?
Fuzzy sets were introduced by Zadeh in 1965 to
represent/manipulate data and information possessing
nonstatistical uncertainties. It was specically
designed to mathematically represent uncertainty and
vagueness and to provide formalized tools for dealing
with the imprecision intrinsic to many problems.
However, the story of fuzzy logic started much more
earlier . . .
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
What is Fuzzy Sets? - BC
To devise a concise theory of logic, and later mathematics,
Aristotle (384-322 BC) posited the so-called Laws of
Thought. One of these, the Law of the Excluded
Middle, states that every proposition must either be True
(T) or False (F). Even when Parminedes proposed the rst
version of this law (around 400 Before Christ)
Heraclitus (535-475 BC) proposed that things could be
simultaneously True and not True.
It was Plato (427-347 BC) who laid the foundation for
what would become fuzzy logic, indicating that there was
a third region (beyond T and F) where these opposites
tumbled about.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
What is Fuzzy Sets? - The Mathematics
Around 1920 Lukasiewicz proposed a systematic
alternative to the bi-valued logic (T or F), when he
described a three-valued logic (T, F or possible), along
with the mathematics.
Later, Lukasiewicz explored four-valued logics, ve-valued
logics, and declared that in principle there was nothing to
prevent the derivation of an innite-valued logic. But he
settled on four-valued, due to historic reasons.
In 1965 Zadeh introduced the innite-valued logic in his
work Fuzzy Sets, where he described the mathematics
of fuzzy set theory, and thereby also fuzzy logic. This
theory proposed making the membership function (the T
and F values) operate over the range [0, 1] of real
numbers, which indicate partially true.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
What is Fuzzy Logic?
Fuzzy logic provides an inference morphology that
enables approximate human reasoning capabilities to
be applied to knowledge-based systems. The theory
of fuzzy logic provides a mathematical strength to
capture the uncertainties associated with human
cognitive processes, such as thinking and reasoning.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
What is Fuzzy Logic? - Characteristics
Some of the essential characteristics relate to the following
(Zadeh, 1992):
In fuzzy logic, exact reasoning is viewed as a limiting case
of approximate reasoning.
In fuzzy logic, everything is a matter of degree.
In fuzzy logic, knowledge is interpreted a collection of
elastic or, equivalently, fuzzy constraint on a collection of
variables.
Inference is viewed as a process of propagation of elastic
constraints.
Any logical system can be fuzzied.
Note: The opposite of a fuzzy is a crisp (T or F), which also is
an especially case of fuzzy.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Why Fuzzy Systems?
There are two reasons, why fuzzy systems are of interest:
Fuzzy systems are suitable for systems with mathematical
model uncertainties or even lack of models
Fuzzy logic (part of fuzzy systems) allows decision making
with estimated values under incomplete or uncertain
information
Summary. The characteristics of fuzzy systems are:
No mathematical model is necessary
A priori knowledge is essential
Simple interpretation and implementation
Not capable to learn
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
What are the classical sets?
The classical set presented is dened by means of the denite
or crisp boundaries. So no uncertainty in the location of the
boundaries. (T or F)
The fuzzy set is dened by its vague and ambiguous properties,
hence the boundaries are specied ambiguously.
Both classical and fuzzy sets are dened on a universe. The
individual elements in the universe X will be denoted as x. The
features of the elements in X can be discrete integers, or
continuous values on the real line.
Membership mapping for Crisp Set A.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
The mathematics of Fuzzy Sets
Denition 1. (fuzzy set) Let X be a nonempty set. A fuzzy set
A in X is characterized by its membership function (
A
)

A
: X [0, 1]
and
A
(x) is interpreted as the degree of membership of
element x in fuzzy set A for each x X.
A is completely determined by the set of tuples
A = {(u,
A
(u))|u X} = (
A
(u
1
), u
1
), . . . , (
A
(u
n
), u
n
)
Often written as:
A =
A
(x
1
)/x
1
+ +
A
(x
n
)/x
n
The value of
A
(x) at x represents the grade of membership
of x in A. Hence the value of 1 represents that it belongs to
and 0 represents does not belong to. The plus sign represents
the union.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy Sets - Example
Assume someone wants to buy a cheap car. Cheap can be
represented as a fuzzy set on a universe of prices.
Cheap is roughly interpreted as follows:
Below 3000$ cars are considered as cheap, and price make
no dierence
Between 3000 and 4500$, a variation in the price induces
a preference in favor of the cheapest car
Between 4500 and 6000$, a small variation in the price
induces a clear preference in favor of the cheapest car
Beyond 6000$ the costs are too high.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy Sets
Denition 2. (support of fuzzy set) Let A be a fuzzy subset of
X; the support of A, denoted supp(A), is the crisp (can be
open or closed interval) subset of X whose elements all have
nonzero
A
(membership grades).
supp(A) = {x X|
A
(x) > 0}
Denition 3. (normal fuzzy set) A fuzzy subset A of X is called
normal if there exists an x X such that

A
(x) = 1
Otherwise A is subnormal.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy Sets - -cut
Denition 4. (-cut) An -level set of a fuzzy set A of X is a
non-fuzzy set denoted by [A]

and is dened by
[A]

= {x X|
A
(x) }
for if 1 0.
An -cut of a triangular fuzzy number.
Note: at = 0, the -cut ([A]
0
is equal to the support
(supp(A)).
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy Sets - -cut - Example
Assume we have the nite set:
X = {2, 1, 0, 1, 2, 3, 4}
and the fuzzy set:
A =
0.0
2
+
0.3
1
+
0.6
0
+
1.0
1
+
0.6
2
+
0.3
3
+
0.0
4
, in this case the -cut is:
[A]

=
_
_
_
{1, 0, 1, 2, 3} if 0 0.3
{0, 1, 2} if 0.3 < 0.6
{1} if 0.6 < 1
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy Sets - Fuzzy number
Denition 5. (convex fuzzy set) A fuzzy set A of X is called
convex if [A]

is a convex subset of X (0, 1].

A more direct denition of convexity is denes as; A is convex
if and only if

A
(x
1
+ (1 )x
2
) min{
A
(x
1
),
A
(x
2
)}, 0 < < 1
Denition 6. (fuzzy number) A fuzzy number A is a special
case of a
convex,
normal fuzzy set of the real line and
it has a continuous membership function of bounded
support.
It fullls the normal fuzzy set for one element. The family of
fuzzy numbers will be denoted by F.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy Sets - Singleton
Denition 7. (Fuzzy point) Let A be a fuzzy number. If
supp(A) = {x
0
} then A is called a fuzzy point and we use the
notation A = x
0
= 1.
Fuzzy point.
If x
0
= 1, then the fuzzy set is called a singleton. A fuzzy point
is also a simpleton, but a simpleton is not always a fuzzy point.
Let A = x
0
be a singleton. Then the -cut is:
[A]

= [x0, x0] = {x0}, [0, x

0
[
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy number - Quasi Fuzzy Number
Denition 8. (quasi fuzzy number) A quasi fuzzy number A is a
fuzzy set of the real line with a normal, fuzzy convex and
continuous membership function satisfying the limit conditions
lim
t

A
(t) = 0, lim
t

A
(t) = 0
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy number - Triangular Fuzzy Number
Denition 9. (triangular fuzzy number) A fuzzy set A is called
triangular fuzzy number with peak (or center) a, left width
> 0 and right width > 0 if its membership function has the
following form

A
(t) =
_
_
_
1 (a t)/ if a t a
1 (t a)/ if a t a +
0 otherwise
and we use the notation A = (a, , ). It can easily be veried
that
[A]

= [a (1 ), a + (1 )], [0, 1]
The support of A (supp(A)) is the open interval ]a , b +[.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy number - Triangular Fuzzy Number
Triangular fuzzy number.
A triangular fuzzy number with center a may be seen as a
fuzzy quantity:
x is approximately equal to a
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy number - Trapezoidal Fuzzy Number
Denition 10. (trapezoidal fuzzy number) A fuzzy set A is
called trapezoidal fuzzy number with tolerance interval [a, b],
left width and right width if its membership function has
the following form

A
(t) =
_

_
1 (a t)/ if a t a
1 if a t b
1 (t b)/ if b t b +
0 otherwise
and we use the notation A = (a, b, , ). The cut is:
[A]

= [a (1 ), b + (1 )], [0, 1]
The support of A is the open interval ]a , b +[.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy number - Trapezoidal Fuzzy Number
Trapezoidal fuzzy number.
A trapezoidal fuzzy number may be seen as a fuzzy quantity
x is approximately in the interval [a, b].
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy number - Fuzzy interval
Denition 11. Any fuzzy number A F can be described as

A
(t) =
_

_
L
_
at

_
if t [a , a]
1 if t [a, b]
R
_
tb

_
if t [b, b +]
0 otherwise
where [a, b] is the peak or core of A,
L : [0, 1] [0, 1], R : [0, 1] [0, 1],
are continuous and non-increasing shape functions with
L(0) = R(0) = 1 and R(1) = L(1) = 0. We call this fuzzy
interval of LR-type and refer to it by
A = (a, b, , )
LR
The support of A is the open interval (a , b +).
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy number - Fuzzy interval
Let A = (a, b, , )
LR
be a fuzzy number of type LR. If a = b
then we use the notation
A = (a, , )
LR
and say that A is a quasi-triangular fuzzy number. Furthermore
if L(x) = R(x) = 1 x (Linear relation) then instead of
A = (a, b, , )
LR
we simply write
A = (a, b, , ).
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Subsethood/Containment/Inclusion
Denition 12. (Subsethood/Containment/Inclusion) Let A and
B are fuzzy subsets of a classical set X. We say that A is a
subset of B (A B) if

A
(x)
B
(x), x X
A is a subset of B.
Proper inclusion is:
A
(x) <
B
(x), x X
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Equality of/Special fuzzy sets
Denition 13. (Equality of fuzzy sets) Let A and B are fuzzy
subsets of a classical set X. A and B are said to be equal,
denoted A = B, if A B and B A. We note that A = B if
and only if

A
(x) =
B
(x), x X.
Denition 14. (Empty fuzzy set) The empty fuzzy subset of X
is dened as the fuzzy subset of X such that (x) = 0 for
each x X. It is easy to see that A holds for any fuzzy
subset A of X.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Special fuzzy sets
Denition 15. The largest fuzzy set in X, called universal fuzzy
set in X, denoted by 1
X
, is dened by
1
X
(t) = 1, t X.
Let A be a fuzzy subset of X, then A 1
X
.
The graph of the universal fuzzy subset in X = [0, 8].
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Operations on Fuzzy Sets - Intersection
Denition 16. (intersection) The intersection of A and B,
which are fuzzy subsets of a nonempty set X, is dened as
(A B)
AB
(t) =
A
(t)
B
(t)
= min{
A
(t),
B
(t)}, t X
Intersection of two triangular fuzzy numbers can be interpreted
as series combination of A and B.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Operations on Fuzzy Sets - Union
Denition 17. (union) The union of A and B is dened as
(A B)
AB
(t) =
A
(t)
B
(t)
= max{
A
(t),
B
(t)}, t X
Union of two triangular fuzzy numbers can be interpreted as
parallel combination of A and B.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Operations on Fuzzy Sets - Complement
Denition 18. (Complement) The complement of a fuzzy set A
(A) is dened as
(A) (
A
)(t) = 1
A
(t), t X
This gives the following relations: 1
X
= and = 1
X
.
A closely related pair of properties which hold in classical set
theory are the law of excluded middle

A
(t)
A
(t) = 1
X
and the law of noncontradiction principle

A
(t)
A
(t) =
, however, the laws of excluded middle and noncontradiction
are NOT satised in FUZZY LOGIC WITHOUT CRISP sets.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Operations on Fuzzy Sets - Complement
Lemma
The law of excluded middle is not valid. Let

A
(t) = 1/2, t R, then it is easy to see that
(
A

A
)(t) = max{
A
(t),
A
(t)}
= max{1 1/2, 1/2} = 1/2 = 1
Lemma
The law of noncontradiction is not valid. Let

A
(t) = 1/2, t R, then it is easy to see that
(
A

A
)(t) = min{
A
(t),
A
(t)}
= min{1 1/2, 1/2} = 1/2 = 0
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Complement/Union/Intersection rules
Fuzzy logic does satisfy De Morgans laws
(A B) = A B
(A B) = A B
Fuzzy logic does satisfy Commutativity
A B = B A
A B = B A
Fuzzy logic does satisfy Associativity
A (B C) = (A B) C
A (B C) = (A B) C
Fuzzy logic does satisfy Distributivity
C (A B) = (C A) (C B)
C (A B) = (C A) (C B)
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Complement/Union/Intersection rules (Continued)
Fuzzy logic does satisfy Dierence
A/B = A B
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Classical relations
A classical relation can be considered as a set of tuples, where
a tuple is an ordered pair. A binary tuple is denoted by (u, v),
an example of a ternary tuple is (u, v, w) and an example of
n-ary tuple is (x
1
, . . . , x
n
).
Denition 1. (classical n-ary relation) Let
1
, . . . ,
n
be
classical sets. The subsets of the Cartesian product

1

n
are called n-ary relations. Let x
1
, . . . , x
n
and
y
1
, . . . , y
n
be members of classical sets X and Y, then the
relation is dened as
X Y = {(x, y)|x X, y Y}
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Classical relations
If X
1
= = X
n
and R X
n
then R is called an n-ary relation
in X and is dened as
R
X
1
X
n
(x
1
, . . . , x
n
)
If the relation for two classical sets is binary, then
R
XY
(x, y) =
_
1 if (x, y) X Y
0 otherwise
If the classical sets X and Y are nite then a relation matrix is
a convenient representation of the relation. If X = {2, 4, 6}
and Y = {+, 0, }, then a relation matrix can look like:
R
XY
=
_
_
_
_
+ 0
2 0 0 1
4 1 0 1
5 1 0 0
_
_
_
_
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Classical relations - Binary Example
Let X be the domain of man John, Charles, James and Y the
domain of women Diana, Rita, Eva, then the relation married
to on X Y is, for example {(Charles, Diana), (John, Eva)}.
This gives the following relation matrix
R
XY
=
_
_
_
_
John Charles James
Diana 0 1 0
Rita 0 0 0
Eva 1 0 0
_
_
_
_
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Classical relations - Ternary example
Let R be a relation among the three sets X = {Hindi , English},
Y = {Dollar , Euro, Pound, Rupees} and
Z = {India, Nepal , USA, UK}
R
XYZ
(x, y, z) ={Hindi , Rupees, India}, {Hindi , Rupees, Nepal },
{English, Dollar , USA}, {English, Pound, UK}
Then the relation matrices are:
R
XYZ
(Hindi , y, z) =
_
_
_
_
_
_
India Nepal USA UK
Dollar 0 0 0 0
Euro 0 0 0 0
Pound 0 0 0 0
Rupees 1 1 0 0
_
_
_
_
_
_
R
XYZ
(English, y, z) =
_
_
_
_
_
_
India Nepal USA UK
Dollar 0 0 1 0
Euro 0 0 0 0
Pound 0 0 0 1
Rupees 0 0 0 0
_
_
_
_
_
_
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations
A fuzzy relation R is is a mapping from X Y to the strength
interval [0, 1]. In other words, R F(X Y). The strength is
expressed by the membership function
R
(x, y). The fuzzy
relation on X Y is then dened as:
R
XY
(x, y) = {(x, y),
R
(x, y)|(x, y) X Y}
If X = Y then we say that R is a binary fuzzy relation in X.
Consider the following binary relation (x, y) R x [a, b]
and y [0, c]

R
(x, y) =
_
1 if (x, y) [a, b] [0, c]
0 otherwise
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relation - Types
Let R be a binary relation in a classical set X.
Denition 2. (reexivity) R is reexive if every element of X is
related to itself
(x, x) R
R
(x, x) = 1, x X
Denition 3. (anti-reexivity) R is anti-reexive if
(x, x) / R
R
(x, x) = 1, x X
Denition 4. (transitivity) R is transitive if
(x, y) R (y, z) R (x, z) R, x, y, z X

R
(x, z) max{
R
(x, y),
R
(y, z)}, x, y, z X
Denition 5. (symmetricity) R is symmetric if
(x, y) R (y, x) R
R
(x, y) =
R
(y, x), x, y X
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relation - Types (Continued)
Denition 6. (anti-symmetricity) R is anti-symmetric if
(x, y) R (y, x) R x = y, x, y X

R
(x, y) > 0
R
(y, x) > 0 x = y, x, y X
Denition 7. (comparability) R is comparable if
(x, y) R (y, x) R, x, y X

R
(x, y) > 0
R
(y, x) > 0, x, y X
Other important properties of binary relations are:
Proximity: R is an approximately equivalence relation if, R
is reexive and symmetric
Equivalence: R is an equivalence relation if, R is reexive,
symmetric and transitive
Partial order: R is a partial order relation if it is reexive,
anti-symmetric and transitive
Total order: R is a total order relation if it is partial order
and comparable
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relation - Types - Example
A simple example of a binary fuzzy relation on U = {1, 2, 3} is
called approximately equal can be dened as:
R(1, 1) = R(2, 2) = R(3, 3) = 1
R(1, 2) = R(2, 1) = R(2, 3) = R(3, 2) = 0.8
R(1, 3) = R(3, 1) = 0.3
The membership function of R is given by

R
(u, v) =
_
_
_
1 if u = v
0.8 if |u v| = 1
0.3 if |u v| = 2
R =
_
_
_
_
1 2 3
1 1 0.8 0.3
2 0.8 1 0.8
3 0.3 0.8 1
_
_
_
_
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relation - Types (Continued)
Let R be a fuzzy relation in a set X.
Denition 8. (reexivity) R is reexive if every element of X is
related to itself

R
(x
i
, x
i
) = 1
Denition 9. (symmetricity) R is symmetric if

R
(x
i
, x
j
) =
R
(x
j
, x
i
)
Denition 10. (transitivity) R is transitive if

R
(x
i
, x
j
) =
1

R
(x
j
, x
k
) =
2

R
(x
i
, x
k
) =
, where min{
1
,
2
}
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - Operations
Operations on fuzzy relations Fuzzy relations are very important
because they can describe interactions between variables.
Let R and S be two fuzzy relations on X Y.
Denition 11. The complement of R is dened by

R
(x, y) = 1
R
(x, y)
Denition 12. The containment of R and S is dened by
R(x, y) S(x, y)
R
(x, y)
S
(x, y)
Denition 13. The intersection of R and S is dened by
(R S)(x, y)
RS
(x, y) = min{
R
(x, y),
S
(x, y)}
Denition 14. The union of R and S is dened by
(R S)(x, y)
RS
(x, y) = max{
R
(x, y),
S
(x, y)}
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - Operations - Properties
Let R, S and T be fuzzy relations on X Y.
Denition 15. The commutativity of R and S is dened by

RS
(x, y) =
SR
(x, y)
Denition 16. The associativity of R, S and T is dened by

(RS)T
(x, y) =
R(ST)
(x, y)
Denition 17. The distributivity of R, S and T is dened by

(RS)T
(x, y) =
R(ST)
(x, y)
Denition 18. The idempotency of R is dened by

RR
(x, y) =
R
(x, y)
Denition 19. The involution of R is dened by
(
R
(x, y)) =
R
(x, y)
As fuzzy relations also are a fuzzy set, the operations on fuzzy
sets also work fuzzy relations.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - Operations - Example
Let us dene two binary relations R(x, y) and S(x, y)
R(x, y) = x is considerable larger than y
=
_
_
_
_
y
1
y
2
y
3
y
4
x
1
0.8 0.1 0.1 0.7
x
2
0 0.8 0 0
x
3
0.9 1 0.7 0.8
_
_
_
_
S(x, y) = x is very close to y
=
_
_
_
_
y
1
y
2
y
3
y
4
x
1
0.4 0 0.9 0.6
x
2
0.9 0.4 0.5 0.7
x
3
0.3 0 0.8 0.5
_
_
_
_
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - Operations - Example (Continued)
The intersection of R and S means that x is considerable
larger than y and x is very close to y.
(R S)(x, y) =
_
_
_
_
y
1
y
2
y
3
y
4
x
1
0.4 0 0.1 0.6
x
2
0 0.4 0 0
x
3
0.3 0 0.7 0.5
_
_
_
_
The union of R and S means that x is considerable larger
than y or x is very close to y.
(R S)(x, y) =
_
_
_
_
y
1
y
2
y
3
y
4
x
1
0.8 0.1 0.9 0.7
x
2
0.9 0.8 0.5 0.7
x
3
0.9 1 0.8 0.8
_
_
_
_
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - Operations - Projection
Consider a classical relation R on R.

R
(x, y) =
_
1 if (x, y) [a, b] [0, c]
0 otherwise
It is clear that the projection (or shadow) of R on the X-axis is
the closed interval [a, b] and its projection on the Y-axis is
[0, c].
If R is a classical relation in X Y then

X
(R(x, y)) = {x X|y Y : (x, y) R}

Y
(R(x, y)) = {y Y|x X : (x, y) R}
where

X
denotes projection on X and

Y
denotes projection
on Y.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - Operations - Projection
Denition 20. Let R be a fuzzy relation on X Y. The
projection of R on X is dened as

X
(R(x, y)) = sup
yY
{
R
(x, y)}|x X
and the projection of R on Y is dened as

Y
(R(x, y)) = sup
xX
{
R
(x, y)}|y Y
Note sup is the supremum (maximum).
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - Operations - Example (Revisited)
Consider the relation R then the projection on X means that
R(x, y) = x is considerable larger than y
=
_
_
_
_
y
1
y
2
y
3
y
4
x
1
0.8 0.1 0.1 0.7
x
2
0 0.8 0 0
x
3
0.9 1 0.7 0.8
_
_
_
_
x
1
is assigned the highest membership degree from the
tuples (x
1
, y
1
), (x
1
, y
2
), (x
1
, y
3
), (x
1
, y
4
), i.e.

X
(x
1
) = 0.8, which is the maximum of the rst row.
x
2
is assigned the highest membership degree from the
tuples (x
2
, y
1
), (x
2
, y
2
), (x
2
, y
3
), (x
2
, y
4
), i.e.

X
(x
2
) = 0.8, which is the maximum of the second row.
x
3
is assigned the highest membership degree from the
tuples (x
3
, y
1
), (x
3
, y
2
), (x
3
, y
3
), (x
3
, y
4
), i.e.

X
(x
3
) = 1,
which is the maximum of the third row.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - Operations - Cartesian product
Denition 21. The Cartesian product of A F(X) and
B F(Y) is dened as
(A B)(x, y) = min{A(x), B(y)}, x X, y Y
It is clear that the Cartesian product of two fuzzy sets is a
fuzzy relation in X Y.
If A and B are normal then

Y
(A B) = B and

X
(A B) = A, as

X
(A B) = sup
yY
{(A B)(x, y)} = sup
yY
{A(x) B(y)}
= min{A(x), sup
yY
{B(y)}} = min{A(x), 1} = A(x)
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - sup-min / max-min
Denition 22. The sup-min composition of a fuzzy set
A F(X) and a fuzzy relation R F(X Y) is dened as

B
(y) = (
A

R
)(y) = sup
xX
min{
A
(x),
R
(x, y)}, y Y
The composition of a fuzzy set A and a fuzzy relation R can be
considered as the shadow of the relation R on the fuzzy set B.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - sup-min / max-min
Figure illustrating Denition 22.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - sup-min / max-min - Example
Let A be a fuzzy set in the universe of discourse {1, 2, 3} and
let R be a binary fuzzy relation in {1, 2, 3}. Assume that
A =
0.2
1
+
1
2
+
0.2
3
and
R =
_
_
_
_
1 2 3
1 1 0.8 0.3
2 0.8 1 0.8
3 0.3 0.8 1
_
_
_
_
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - sup-min / max-min - Example
(Continued)
Using the denition of sup-min composition we get
A R =
_
0.2
1
+
1
2
+
0.2
3
_

_
_
_
_
1 2 3
1 1 0.8 0.3
2 0.8 1 0.8
3 0.3 0.8 1
_
_
_
_
=
max{0.2, 0.8, 0.2}
1
+
max{0.2, 1, 0.2}
2
+
max{0.2, 0.8, 0.2}
3
=
0.8
1
+
1
2
+
0.8
3
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - sup-min / max-min - Example
Let A be a fuzzy set in the universe of discourse [0, 1] and let R
be a binary fuzzy relation in [0, 1]. Assume that C(x) = x and
R(x, y) = 1 |x y|
Using the denition of sup-min composition we get
(A R)(y) = sup
x[0,1]
min{x, 1 |x y|} =
1 + y
2
y [0, 1]
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - sup-min / max-min
Denition 23. (sup-min composition of fuzzy relations) Let
R F(X Y) and S F(Y Z). The sup-min composition
of R and S, denoted by R(x, y) S(y, z) is dened as
(R S)(x, z) = sup
yY
min{R(x, y), S(y, z)}
It is clear that (R S)(x, z) is a binary fuzzy relation in X Z.
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - sup-min / max-min - Example
(Revisited)
Consider two fuzzy relations R(x, y) and S(y, z)
R(x, y) = x is considerable larger than y
=
_
_
_
_
y
1
y
2
y
3
y
4
x
1
0.8 0.1 0.1 0.7
x
2
0 0.8 0 0
x
3
0.9 1 0.7 0.8
_
_
_
_
S(y, z) = y is very close to z
=
_
_
_
_
_
_
z
1
z
2
z
3
y
1
0.4 0.9 0.3
y
2
0 0.4 0
y
3
0.9 0.5 0.8
y
4
0.6 0.7 0.5
_
_
_
_
_
_
Fuzzy Systems
Jensen
Introduction
Fuzzy Sets
Fuzzy Logic
Fuzzy Systems
Fuzzy Sets
Fuzzy Number
Operations on
Fuzzy Sets
Inclusion
Equality
Intersection
Union
Complement
Rules
Fuzzy
relations
Types
Operations on
Fuzzy
relations
Fuzzy relations - sup-min / max-min - Example
(Continued)
Then their composition is the binary relation T(x, z) on X Z
T(x, z) = R(x, y) S(y, z) = sup
yY
min{R(x, y), S(y, z)}
=
_
_
_
_
y
1
y
2
y
3
y
4
x
1
0.8 0.1 0.1 0.7
x
2
0 0.8 0 0
x
3
0.9 1 0.7 0.8
_
_
_
_

_
_
_
_
_
_
z
1
z
2
z
3
y
1
0.4 0.9 0.3
y
2
0 0.4 0
y
3
0.9 0.5 0.8
y
4
0.6 0.7 0.5
_
_
_
_
_
_
=
_
_
_
_
z
1
z
2
z
3
x
1
0.6 0.8 0.5
x
2
0 0.4 0
x
3
0.7 0.9 0.7
_
_
_
_
The composition (R S)(x, z) is the classical product of the
matrices R and S with the dierence that instead of addition &
multiplication, maximum & minimum is used