CHAPTER 7

INTRODUCTION TO
FUZZY LOGIC, CLASSICAL
SETS AND FUZZY SETS

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 What is Fuzzy Logic
Fuzzy logic is a convenient way to map an input space to an output space.

* With information about how good your service was at a

restaurant, a fuzzy logic system can tell you what the tip should
be.

* With your specification of how hot you want the water, a

fuzzy logic system can adjust the faucet valve to the right setting.

* With information about how far away the subject of your

photograph is, a fuzzy logic system can focus the lens for you.

* With information about how fast the car is going and how
hard the motor is working, a fuzzy logic system can shift gears for
you. Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
 INTRODUCTION
• Fuzzy logic is an approach to computing based on
"degrees of truth" rather than the usual "true or false"
(1 or 0) Boolean logic on which the modern computer is
based.
• Why Fuzzy Logic?
– Fuzzy logic is useful for commercial and practical
purposes.
– It can control machines and consumer products.
– It may not give accurate reasoning, but acceptable
reasoning.
– Fuzzy logic helps to deal with the uncertainty in
engineering.
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
 Why use Fuzzy Logic

"In almost every case you can build the same

product without fuzzy logic, but fuzzy is
faster and cheaper.“

-Lotfi Zadeh

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Why use Fuzzy Logic

Here is a list of general observations about fuzzy logic:

•Fuzzy logic is conceptually easy to understand.

•Fuzzy logic is flexible
•Fuzzy logic is tolerant of imprecise data.
•Fuzzy logic can model nonlinear functions of arbitrary
complexity.
•Fuzzy logic can be blended with conventional control
techniques.
•Fuzzy logic is based on natural language.

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Sets and Fuzzy Sets

X (Universe of discourse)

A classical set is defined by crisp boundaries

A fuzzy set is prescribed by vague or ambiguous properties; hence its boundaries

are ambiguously specified
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
 Classical Sets

the universe of discourse is the universe of all available information on a given problem
a universe of discourse, X, as a collection of objects all having the same characteristics

The clock speeds of computer CPUs

The operating currents of an electronic motor
The operating temperature of a heat pump (in degrees Celsius)
The Richter magnitudes of an earthquake
The integers 1 to 10

The individual elements in the universe X will be denoted as x. The features of the
elements in X can be discrete, countable integers or continuous valued quantities on the
real line.
Arsha J K,AP, Computer Science
and Engineering, VJCET,
The total number of elements in a universe X is called its cardinal
Vazhakulam
number, denoted nx
 Classical Set/Crisp set
• Collection of objects which share same characteristics
• A classical set is the collection of distinct objects
• Consider an object in the crisp set A. This object is either the
member or nonmember of the given set A
• In crisp set no partial membership exist
• Let Universe of discourse be U.
• The collection of elements in the universe is called whole set
• The total number of elements in the universe U is called cardinal
number denoted by nU
• Collection of elements within the universe is called set
• Collection of elements within the set is called subset

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Sets

Collections of elements within a universe are called sets

universe of discourse : The Richter magnitudes of an earthquake

Set in the universe of discourse?

Collections of elements within sets are called subsets

The collection of all possible sets in the universe is called the whole set (power set).

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Sets

We have a universe comprised of three elements, X = {a, b, c}

The cardinal number, nx?

The power set ,P(X)?

The cardinality of the power set?

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 CRISP SETS
• There are several ways for defining a set. A set may be defined
using one of the following
1. The list of all members of the set may be given. Example A={2,3,4,5}
2. The properties of the set element may be specified
Example A={x|x is prime number <20}

3. The formula for the definition of the set may be specified

4. The set may be specified on the basis of the result of the logical operation
5. There exist a membership function, which may also be used to define a set.
The membership is denoted by the symbol µ and the membership function
for the set A is given by

µA(x) = 1 If x belongs to A
0 If x not belongs to A

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Operation on Classical Sets

Union A ∪ B = {x | x ∈ A or x ∈ B}

The union between the two sets, denoted A ∪ B,

represents all those elements in the universe that reside in (or belong to) the set
A, the set B, or both sets A and B.

This operation is also called the logical or

Union of sets A and B (logical or) in terms of Venn diagrams

Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
 Operation on Classical Sets

Intersection A ∩ B = {x | x ∈ A and x ∈ B}

The intersection of the t o sets, de oted A ∩ B, represe ts all those ele e ts i

the universe X that simultaneously reside in (or belong to) both sets A and B.

This operation is also called the logical and

Intersection of sets A and B.

Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
 Operation on Classical Sets

The complement of a set A,is defined as the collection of all elements in the
universe that do not reside in the set A.

Complement of set A

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Operation on Classical Sets

The difference of a set A with respect to B, denoted A | B, is defined

as the collection of all elements in the universe that reside in A and that do not
reside in B simultaneously

Difference operation A | B

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Properties of Classical (Crisp) Sets

Commutativity A∪B=B∪A
A∩B=B∩A
Associativity A ∪ (B ∪ C) = (A ∪ B) ∪ C
A∩ B∩C = A∩B ∩C
Distributivity A ∪ B ∩ C = A ∪ B ∩ A ∪ C)
A ∩ (B ∪ C = A ∩ B ∪ A ∩ C 2.7
Idempotency A∪A=A
A∩A=A
Identity A∪∅=A
A∩X=A
A∩∅=∅
A∪X=X
Transitivity If A ⊆ B and B ⊆ C, then A ⊆ C

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Properties of Classical (Crisp) Sets

Two special properties of set operations,

The excluded middle axioms

De Morgan’s principles

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Properties of Classical (Crisp) Sets

The excluded middle axioms

not valid for both classical sets and fuzzy sets.

There are two excluded middle axioms

The first, called the axiom of the excluded middle, deals with the union of a set A
and its complement,
the second, called the axiom of contradiction, represents the intersection of a set
A and its complement.

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Properties of Classical (Crisp) Sets

De Morgan’s principles

information about the complement of a set (or event), or the complement of

combinations of sets (or events), rather than information about the sets themselves

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Properties of Classical (Crisp) Sets

De Morgan’s principles

Example: A shallow arch consists of two slender members as shown in Fig.

If either member fails, then the arch will collapse.
E1 = survival of member 1 and
E2 = survival of member 2,

Survival of the arch = ?

Collapse of the arch = ?

Logically, collapse of the arch will occur if either of the members fails

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Properties of Classical (Crisp) Sets

De Morgan’s principles

Example 1: A shallow arch consists of two slender members as shown in Fig.

If either member fails, then the arch will collapse.
E1 = survival of member 1 and
E2 = survival of member 2,

Sur i al of the arch = E ∩ E

Collapse of the arch =
Collapse of the arch will occur if either of the members fails:

Illustratio of De Morga s pri ciple:

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Mapping of Classical Sets to Functions

Mapping is an important concept in relating set-theoretic forms to function-

theoretic representations of information.

In its most general form it can be used to map elements or subsets on one
universe of discourse to elements or sets in another universe.

If an element x is contained in X and corresponds to an element y contained in Y, it

is generally termed a mapping from X to Y,
f : X →Y

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Mapping of Classical Sets to Functions

The characteristic (indicator) function χA is defined by

Membership function is a mapping for crisp set A.

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Mapping of Classical Sets to Functions

Example : a universe with three elements, X = {a, b, c}, we desire to map the
elements of the power set of X, i.e., P(X), to a universe, Y, consisting of only two
elements (the characteristic function), Y = {0, 1}

the elements of the power set?

the elements in the value set V(P(X))?

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Mapping of Classical Sets to Functions

Example : a universe with three elements, X = {a, b, c}, we desire to map the
elements of the power set of X, i.e., P(X), to a universe, Y, consisting of only two
elements (the characteristic function), Y = {0, 1}

the elements of the power set

P(X) = {∅, {a}, {b}, {c}, {a, b}, {b, c}, {a, c}, {a, b, c}}

the elements in the value set V(P(X))

V{P(X)} = {{0, 0, 0}, {1, 0, 0}, {0, 1, 0}, {0, 0, 1}, {1, 1, 0}, {0, 1, 1}, {1, 0, 1}, {1, 1, 1}}

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Mapping of Classical Sets to Functions

The union of these two sets in terms of function-theoretic terms is given as

follows (the symbol is the maximum):

Union A ∪ B −→ χA∪B(x) = χA(x) χB(x) = max(χA(x), χ B(x))

The intersection of these two sets in function-theoretic terms is given by (the

symbol is the minimum operator):

Intersection A ∩ B −→ χA∩B x = χA(x) χB(x) = min(χA(x), χB(x))

The complement of a single set on universe X, say A, is given by

Example
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
 Fuzzy Sets

The boundaries of the fuzzy sets are vague and ambiguous. Hence, membership of
an element from the universe in this set is measured by a function that attempts to
describe vagueness and ambiguity

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Sets

the set of tall people

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Sets

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Sets
Elements of a fuzzy set are mapped to a universe of membership values using a
function-theoretic form.

fuzzy sets are denoted by a set symbol with a tilde understrike;

A∼ would be the fuzzy set A.

This function maps elements of a fuzzy set A∼ to a real numbered value on the
interval 0 to 1.
If an element in the universe, say x, is a member of fuzzy set A∼, then this mapping
is given by

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Notation Convention for Fuzzy Sets
When the universe of discourse, X, is discrete and finite, is as follows for a fuzzy
setA∼ :

When the universe, X, is continuous and infinite, the fuzzy setA∼

Membership function for fuzzy set A∼

Arsha J K,AP, Computer Science

and Engineering, VJCET, Example
Vazhakulam
 Fuzzy Set Operations
Three fuzzy sets A , B, and C on the universe X
For a given element x of the universe, the following function-theoretic
operations for the set-theoretic operations of union, intersection, and
complement are defined for aA, B, and C on X

Standard fuzzy operations

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Set Operations

Union of fuzzy sets A∼ and B∼

Intersection of fuzzy sets A∼ and B∼ Complement of fuzzy sets A∼ and B∼

Arsha J K,AP, Computer Science

and Engineering, VJCET, Example
Vazhakulam
 Fuzzy Set Operations
All other operations on classical sets also hold for fuzzy sets, except for the
excluded middle axioms

Proof, classical and fuzzy sets?

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Examples of Fuzzy Set Operations
Example: chemical engineering case
Suppose the selectio of a appropriate a al zer to o itor the sales gas
sour gas concentration is important. This selection process can be
complicated by the fact that one type of analyzer, say A, does not provide an
average suitable pressure range but it does give a borderline value of
instrument dead time; in contrast another analyzer, say B, may give a good
value of process dead time but a poor pressure range.
Suppose for this problem we consider three analyzers: A, B and C.

1. the pressure range suitability of analyzers A, B, and C (a membership of 0

is not suitable, a value of 1 is excellent) ?

2. the instrument dead time suitability of analyzers A, B, and C (again, 0 is

not suitable and 1 is excellent) ?

3. the analyzers that are not suitable for pressure range and instrument
dead time, respectively ?

4. which analyzer is most suitable in either category ?

Arsha J K,AP, Computer Science
and Engineering, VJCET,
5. which analyzer is suitable in both categories ?
Vazhakulam
 Examples of Fuzzy Set Operations
Example:
We are asked to select an implementation technology for a numerical processor.
Computation throughput is directly related to clock speed. We are considering whether
the design should be implemented using medium-scale integration (MSI) with discrete
parts, field-programmable array parts (FPGA), or multichip modules (MCM).

Define the universe of potential clock speeds as MHz; and define MSI, FPGA, and MCM
as fuzzy sets of clock frequencies that should be implemented in each of these
technologies. The following table defines the membership values for each of the three
fuzzy sets.

Representing the three sets as MSI = M∼ , FPGA = F∼ , and MCM= C∼ , find the following:

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 Examples of Fuzzy Set Operations
Example:
Samples of a new microprocessor IC chip are to be sent to several customers for beta
testing. The chips are sorted to meet certain maximum electrical characteristics, say
frequency and temperature rating, so that the ‘‘best’’ chips are distributed to preferred
customer 1. Suppose that each sample chip is screened and all chips are found to have a
maximum operating frequency in the range 7–15 MHz at 20◦C. Also, the maximum
operating temperature range (20◦C ± T ) at 8 MHz is determined. Suppose there are
eight sample chips with the following electrical characteristics:

The following fuzzy sets are defined:

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
• The set with no element is defined as an
empty set or null set. It is denoted by Φ
• The occurrence of an impossible event is
denoted by null set, and the occurrence of the
certain event indicate a whole set
• The set which consist of all possible subset of
a given set A is called power set and is
denoeted by
P A = { | ≤ A}

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
OPERATIONS ON CRISP SETS

 UNION:

 INTERSECTION:

 COMPLEMENT:

 DIFFERENCE:

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
PROPERTIES OF CRISP SETS
The various properties of crisp sets are as follows:

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
OPERATIONS ON FUZZY SETS

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP, Computer Science
and Engineering, VJCET,
Vazhakulam
SUMMARY
 This chapter discussed the basic concepts of fuzzy logic.

 An introduction to crisp sets and fuzzy sets has been included.

 The operations and properties of crisp sets and fuzzy sets are also
dealt with.

Arsha J K,AP, Computer Science

and Engineering, VJCET,
Vazhakulam
 CHAPTER 8

CLASSICAL RELATIONS
AND FUZZY RELATIONS

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
Classical Relations and Fuzzy Relations

A relation is of fundamental importance in all-engineering, science, and

mathematically based fields. Relations are involved in logic, approximate
reasoning, classification, rule-based systems, pattern recognition, and control.

Relations represent the mapping of the sets.

In the case of crisp relation there are only two degrees of relationship between
the elements of sets in a crisp relation, i.e., “completely related” and “not
related”. A crisp relation represents the presence or absence of association,
interaction, or interconnectedness between the elements of two or more sets.

But fuzzy relations have infinite number of relationship between the extremes
of completely related and not related between the elements of two or more sets
considered.
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
RELATIONS
 Relations represent mappings between sets and connectives in
logic.

 A classical binary relation represents the presence or absence of a

connection or interaction or association between the elements of
two sets.

 Fuzzy binary relations are a generalization of crisp binary relations,

and they allow various degrees of relationship (association)
between elements.

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Cartesian Product

For the crisp sets A1, A2, . . . , An, the set of n-tuples a1, a2, . . ., an,
where a1 ∈ A1, a2 ∈ A2, . . . , an ∈ An, is called the Cartesian product of
A1, A2, . . . , An.

The Cartesian product is denoted by

A1 × A2 ×· · ·×An.

In Cartesian product the first element in each pair is a member of x

and the second element is a member of y formally, X x Y

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
CRISP CARTESIAN PRODUCT

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Cartesian Product
The elements in two sets A and B are given as

A = {0, 1} and
B = {e, f, g}

The Cartesian product A × B, B × A, A × A, B × B ?.

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
CRISP RELATIONS

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
 Classical Relations

A relation among classical sets x1, x2, . . . , xn and y1, y2, . . . , yn is a

subset of the Cartesian product.
It is denoted by R

X × Y = {(x, y)/x ∈ X, y ∈ Y.

The strength of the relationship between ordered pairs of elements in

each
universe is measured by the characteristic function denoted by χ,
where a value of unity (1) is associated with complete relationship and
a value of zero is associated with no relationship, i.e.,

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Relations
When the universe or the set are finite, a matrix can conveniently
represent the relation.
The matrix is called as relation matrix

A two-dimensional matrix represents the binary relation.

If X = {2, 4, 6} and Y = {p, q, r}, if they both are related to each other
entirely, then the relation between them can be given by:

Arsha J K,AP,Computer Science

andSagittal diagram
Engineering, VJCET,
Vazhakulam
 Classical Relations

Example: Let R be a relation among the three sets

X= {Hindi, English},
Y = {Dollar, Euro, Pound, Rupees}, and
Z ={India, Nepal, United States, Canada}

R (x, y, z) = {Hindi, Rupees, India}

{Hindi, Rupees, Nepal}
{English, Dollar, Canada}
{English, Dollar, United States}.

Relation Matrix ?

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Relations

Example: Let R be a relation among the three sets

X= {Hindi, English}, Y = {Dollar, Euro, Pound, Rupees}, and Z ={India, Nepal, United
States, Canada}
R (x, y, z) = {Hindi, Rupees, India}
{Hindi, Rupees, Nepal}
{English, Dollar, Canada}
{English, Dollar, United States}.
Solution.
India Nepal US Canada
Dollar 0 0 0 0
Euro 0 0 0 0
Pound 0 0 0 0
Rupees 1 1 0 0
Hindi

India Nepal US Canada

Dollar 0 0 1 1
Euro 0 0 0 0
Pound 0 0 0 0
Arsha J K,AP,Computer Science
Rupees 0 0 0 0
and Engineering, VJCET,
English Vazhakulam
CRISP BINARY RELATIONS

Examples of binary relations

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
OPERATIONS ON CRISP RELATIONS

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
PROPERTIES OF CRISP RELATIONS

The properties of crisp sets (given below) hold good for crisp relations
as well.

 Commutativity,
 Associativity,
 Distributivity,
 Involution,
 Idempotency,
 DeMorgan’s Law,
 Excluded Middle Laws.

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Composition

Let R be a relation that relates, or maps, elements from universe X to

universe Y, and
let S be a relation that relates, or maps, elements from universe Y to
universe Z.

A useful question we seek to answer is whether we can find a relation,

T, that relates the same elements in universe X that R contains to the same
elements in universe Z that S contains.

we can find such a relation using an operation known as composition

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Composition

The two methods of the composition operations are:

– Max–min composition,
– Max–product composition.

The max–min composition is defined by the set-theoretic and membership

function-theoretic expressions:

The max–product composition is defined by the set-theoretic and membership

function-theoretic expressions:

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Composition

We wish to find a relation T that relates the ordered pair (x1, z2), i.e., (x1, z2) ∈ T.
In this example,

R = {(x1, y1), (x1, y3), (x2, y4)}

S = {(y1, z2), (y3, z2)}

Sagittal diagram?
Relation matrix?
Max-min composition operations?

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Composition

We wish to find a relation T that relates the ordered pair (x1, z2), i.e., (x1, z2) ∈ T.
In this example,

R = {(x1, y1), (x1, y3), (x2, y4)}

S = {(y1, z2), (y3, z2)}

Sagittal diagram

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Composition

We wish to find a relation T that relates the ordered pair (x1, z2), i.e., (x1, z2) ∈ T.
In this example,

R = {(x1, y1), (x1, y3), (x2, y4)}

S = {(y1, z2), (y3, z2)}

Relation matrix

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Classical Composition

We wish to find a relation T that relates the ordered pair (x1, z2), i.e., (x1, z2) ∈ T.
In this example,

R = {(x1, y1), (x1, y3), (x2, y4)}

S = {(y1, z2), (y3, z2)}

Max-Min composition operations

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
COMPOSITION ON CRISP RELATIONS

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
FUZZY CARTESIAN PRODUCT
Let R be a fuzzy subset of M and S be a fuzzy subset of N. Then the
Cartesian product R  S is a fuzzy subset of N  M such that

Example:

Let R be a fuzzy subset of {a, b, c} such that R = a/1 + b/0.8 + c/0.2

and S be a fuzzy subset of {1, 2, 3} such that S = 1/1 + 3/0.8 +
2/0.5. Then R x S is given by

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
FUZZY RELATION

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
OPERATIONS ON FUZZY RELATION
The basic operation on fuzzy sets also apply on fuzzy relations.

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
PROPERTIES OF FUZZY RELATIONS
The properties of fuzzy sets (given below) hold good for fuzzy relations
as well.

 Commutativity,
 Associativity,
 Distributivity,
 Involution,
 Idempotency,
 DeMorgan’s Law,
 Excluded Middle Laws.

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
COMPOSITION OF FUZZY RELATIONS

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
CLASSICAL EQUIVALENCE RELATION

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
CLASSICAL TOLERANCE RELATION

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
• Suppose we have a tolerance relation

• R1=

• This relation become an equivalence relation

by one composition
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
• R=R1 R1 =

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
FUZZY EQUIVALENCE RELATION

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
FUZZY TOLERANCE RELATION
A binary fuzzy relation that possesses the properties of reflexivity and
symmetry is called fuzzy tolerance relation or resemblance relation.

The equivalence relations are a special case of the tolerance relation.

The fuzzy tolerance relation can be reformed into fuzzy equivalence
relation in the same way as a crisp tolerance relation is reformed into
crisp equivalence relation, i.e.,

where ‘n’ is the cardinality of the set that defines R1.

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
SUMMARY

The chapter provides the definition, properties, and operations of the

following:

 Classical sets,

 Fuzzy sets,

 Classical relations,

 Fuzzy relations.

The chapter also discusses crisp and fuzzy equivalence and tolerance
relations.

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Relation

Fuzzy relations are fuzzy subsets of X×Y , i.e., mapping from X → Y .

Fuzzy relations maps elements of one universe, X to those of another universe, say
Y , through the Cartesian product of the two universes.
A fuzzy relation R∼ is mapping from the Cartesian space X × Y to the interval [0, 1]
where the strength of the mapping is expressed by the membership function of the
relation for ordered pairs. This can be expressed as

is called a fuzzy relation on X × Y .

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Relation
Cartesian Product
Let A∼ be a fuzzy set on universe X and B∼ be a fuzzy set on universe Y ,
then the Cartesian product between fuzzy sets A∼ and B∼ will result in a fuzzy
relation R∼ which is contained with the full Cartesian product space or

where the fuzzy relation R∼ has membership function.

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Relation
Cartesian Product
Example: Suppose we have two fuzzy sets, A∼ defined on a universe of three
discrete temperatures, X = {x1, x2, x3}, and B∼ defined on a universe of two discrete
pressures, Y = {y1, y2}, and we want to find the fuzzy Cartesian product between
them. Fuzzy set A∼ could represent the ‘‘ambient’’ temperature and fuzzy set B∼ the
‘‘near optimum’’ pressure for a certain heat exchanger, and the Cartesian product
might represent the conditions (temperature–pressure pairs) of the exchanger that
are associated with ‘‘efficient’’ operations. For example, let

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Relation
Cartesian Product
Example: Suppose we have two fuzzy sets, A∼ defined on a universe of three
discrete temperatures, X = {x1, x2, x3}, and B∼ defined on a universe of two discrete
pressures, Y = {y1, y2}, and we want to find the fuzzy Cartesian product between
them. Fuzzy set A∼ could represent the ‘‘ambient’’ temperature and fuzzy set B∼ the
‘‘near optimum’’ pressure for a certain heat exchanger, and the Cartesian product
might represent the conditions (temperature–pressure pairs) of the exchanger that
are associated with ‘‘efficient’’ operations. For example, let

The fuzzy Cartesian product results in a fuzzy relation R∼ representing ‘‘efficient’’

conditions,

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Relation
Composition
Fuzzy composition can be defined just as it is for crisp (binary) relations. Suppose
R∼ is a fuzzy relation on the Cartesian space X × Y,
S∼ is a fuzzy relation on Y × Z, and
T∼ is a fuzzy relation on X × Z;

then fuzzy max–min composition is defined in terms of the set-theoretic notation

and membership function-theoretic notation in the following manner:

fuzzy max–product composition is defined in terms of the membership function

theoretic notation as

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Relation
Composition
Example: Fuzzy relationships
for X × Y (denoted by the fuzzy relation R∼)
and Y× Z (denoted by the fuzzy relation S∼).

X = {x1, x2}, Y = {y1, y2}, and Z = {z1, z2, z3}

Consider the following fuzzy relations:

Find the resulting relation,T∼, which relates elements of universe X to elements of

universe Z, i.e., defined on Cartesian space X × Z
using max–min composition and
using max-product composition

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam
 Fuzzy Relation
Composition
Solution:Max–Min Composition

T
Arsha J K,AP,Computer Science
and Engineering, VJCET,
Vazhakulam
 Fuzzy Relation
Composition
Solution:Max–Product Composition

Arsha J K,AP,Computer Science

and Engineering, VJCET,
Vazhakulam