What is Fuzzy Logic?

Fuzzy Logic resembles the human decision-making methodology.

It deals with vague and imprecise information. This is gross
oversimplification of the real-world problems and based on
degrees of truth rather than usual true/false or 1/0 like Boolean
logic.

Take a look at the following diagram. It shows that in fuzzy

systems, the values are indicated by a number in the range from
0 to 1. Here 1.0 represents absolute truth and 0.0
represents absolute falseness. The number which indicates the
value in fuzzy systems is called the truth value.

In other words, we can say that fuzzy logic is not logic that is
fuzzy, but logic that is used to describe fuzziness. There can be
numerous other examples like this with the help of which we can
understand the concept of fuzzy logic.

Fuzzy Logic was introduced in 1965 by Lofti A. Zadeh in his

research paper “Fuzzy Sets”. He is considered as the father of
Fuzzy Logic.

A set is an unordered collection of different elements. It can be

written explicitly by listing its elements using the set bracket. If
the order of the elements is changed or any element of a set is
repeated, it does not make any changes in the set.
Example
●​ A set of all positive integers.
●​ A set of all the planets in the solar system.
●​ A set of all the states in India.
●​ A set of all the lowercase letters of the alphabet.
Mathematical Representation of a Set
Sets can be represented in two ways −
Roster or Tabular Form
In this form, a set is represented by listing all the elements
comprising it. The elements are enclosed within braces and
separated by commas.
Following are the examples of set in Roster or Tabular Form −
●​ Set of vowels in English alphabet, A = {a,e,i,o,u}
●​ Set of odd numbers less than 10, B = {1,3,5,7,9}
Set Builder Notation
In this form, the set is defined by specifying a property that
elements of the set have in common. The set is described as A =
{x:p(x)}

Example 1 − The set {a,e,i,o,u} is written as

A = {x:x is a vowel in English alphabet}

Example 2 − The set {1,3,5,7,9} is written as

B = {x:1 ≤ x < 10 and (x%2) ≠ 0}

If an element x is a member of any set S, it is denoted by x∈S
and if an element y is not a member of set S, it is denoted by
y∉S.

Example − If S = {1,1.2,1.7,2},1 ∈ S but 1.5 ∉ S

Cardinality of a Set
Cardinality of a set S, denoted by |S||S|, is the number of
elements of the set. The number is also referred as the cardinal
number. If a set has an infinite number of elements, its
cardinality is ∞∞.

Example − |{1,4,3,5}| = 4,|{1,2,3,4,5,…}| = ∞

If there are two sets X and Y, |X| = |Y| denotes two sets X and Y
having same cardinality. It occurs when the number of elements
in X is exactly equal to the number of elements in Y. In this case,
there exists a bijective function ‘f’ from X to Y.

|X| ≤ |Y| denotes that set X’s cardinality is less than or equal to
set Y’s cardinality. It occurs when the number of elements in X is
less than or equal to that of Y. Here, there exists an injective
function ‘f’ from X to Y.

|X| < |Y| denotes that set X’s cardinality is less than set Y’s
cardinality. It occurs when the number of elements in X is less
than that of Y. Here, the function ‘f’ from X to Y is injective
function but not bijective.

If |X| ≤ |Y| and |X| ≤ |Y| then |X| = |Y|. The sets X and Y are
commonly referred as equivalent sets.

Types of Sets
Sets can be classified into many types; some of which are finite,
infinite, subset, universal, proper, singleton set, etc.
Finite Set
A set which contains a definite number of elements is called a
finite set.

Example − S = {x|x ∈ N and 70 > x > 50}

Infinite Set
A set which contains infinite number of elements is called an
infinite set.

Example − S = {x|x ∈ N and x > 10}

Subset
A set X is a subset of set Y (Written as X ⊆ Y) if every element of
X is an element of set Y.

Example 1 − Let, X = {1,2,3,4,5,6} and Y = {1,2}. Here set Y is

a subset of set X as all the elements of set Y is in set X. Hence,
we can write Y⊆X.

Example 2 − Let, X = {1,2,3} and Y = {1,2,3}. Here set Y is a

subset (not a proper subset) of set X as all the elements of set Y
is in set X. Hence, we can write Y⊆X.
Proper Subset
The term “proper subset” can be defined as “subset of but not
equal to”. A Set X is a proper subset of set Y (Written as X ⊂ Y) if
every element of X is an element of set Y and |X| < |Y|.

Example − Let, X = {1,2,3,4,5,6} and Y = {1,2}. Here set Y ⊂ X,

since all elements in Y are contained in X too and X has at least
one element which is more than set Y.

Universal Set
It is a collection of all elements in a particular context or
application. All the sets in that context or application are
essentially subsets of this universal set. Universal sets are
represented as U.

Example − We may define U as the set of all animals on earth. In

this case, a set of all mammals is a subset of U, a set of all fishes
is a subset of U, a set of all insects is a subset of U, and so on.

Empty Set or Null Set

An empty set contains no elements. It is denoted by Φ. As the
number of elements in an empty set is finite, empty set is a finite
set. The cardinality of empty set or null set is zero.

Example – S = {x|x ∈ N and 7 < x < 8} = Φ

Singleton Set or Unit Set

A Singleton set or Unit set contains only one element. A singleton
set is denoted by {s}.

Example − S = {x|x ∈ N, 7 < x < 9} = {8}

Equal Set
If two sets contain the same elements, they are said to be equal.

Example − If A = {1,2,6} and B = {6,1,2}, they are equal as

every element of set A is an element of set B and every element
of set B is an element of set A.

Equivalent Set
If the cardinalities of two sets are same, they are called
equivalent sets.
Example − If A = {1,2,6} and B = {16,17,22}, they are
equivalent as cardinality of A is equal to the cardinality of B. i.e.
|A| = |B| = 3

Overlapping Set
Two sets that have at least one common element are called
overlapping sets. In case of overlapping sets −

Example − Let, A = {1,2,6} and B = {6,12,42}. There is a

common element ‘6’, hence these sets are overlapping sets.

Disjoint Set
Two sets A and B are called disjoint sets if they do not have even
one element in common. Therefore, disjoint sets have the
following properties −

Example − Let, A = {1,2,6} and B = {7,9,14}, there is not a

single common element, hence these sets are overlapping sets.

Operations on Classical Sets

Set Operations include Set Union, Set Intersection, Set
Difference, Complement of Set, and Cartesian Product.
Union
The union of sets A and B (denoted by A ∪ BA ∪ B) is the set of
elements which are in A, in B, or in both A and B. Hence, A ∪ B =
{x|x ∈ A OR x ∈ B}.
Example − If A = {10,11,12,13} and B = {13,14,15}, then A ∪ B
= {10,11,12,13,14,15} – The common element occurs only once.

Intersection
The intersection of sets A and B (denoted by A ∩ B) is the set of
elements which are in both A and B. Hence, A ∩ B = {x|x ∈ A
AND x ∈ B}.

Difference/ Relative Complement

The set difference of sets A and B (denoted by A–B) is the set of
elements which are only in A but not in B. Hence, A − B = {x|x ∈
A AND x ∉ B}.

Example − If A = {10,11,12,13} and B = {13,14,15}, then (A −

B) = {10,11,12} and (B − A) = {14,15}. Here, we can see (A −
B) ≠ (B − A)
Complement of a Set
The complement of a set A (denoted by A′) is the set of elements
which are not in set A. Hence, A′ = {x|x ∉ A}.
More specifically, A′ = (U−A) where U is a universal set which
contains all objects.

Example − If A = {x|x belongs to set of add integers} then A′ =

{y|y does not belong to set of odd integers}

Cartesian Product / Cross Product

The Cartesian product of n number of sets A1,A2,…An denoted as
A1 × A2...× An can be defined as all possible ordered pairs
(x1,x2,…xn) where x1 ∈ A1,x2 ∈ A2,…xn ∈ An

Example − If we take two sets A = {a,b} and B = {1,2},

The Cartesian product of A and B is written as − A × B =

{(a,1),(a,2),(b,1),(b,2)}
And, the Cartesian product of B and A is written as − B × A =
{(1,a),(1,b),(2,a),(2,b)}
Properties of Classical Sets
Properties on sets play an important role for obtaining the
solution. The following are the different properties of classical
sets −
Idempotency Property
Involution Property

For any set A, this property states −

De Morgan’s Law
It is a very important law and supports in proving tautologies and
contradiction. This law states −
Fuzzy sets can be considered as an extension and gross
oversimplification of classical sets. It can be best understood in
the context of set membership. Basically it allows partial
membership which means that it contain elements that have
varying degrees of membership in the set. From this, we can
understand the difference between classical set and fuzzy set.
Classical set contains elements that satisfy precise properties of
membership while fuzzy set contains elements that satisfy
imprecise properties of membership.

Mathematical Concept

Representation of fuzzy set

Let us now consider two cases of universe of information and
understand how a fuzzy set can be represented.
Case 1

Case 2

When universe of information U� is continuous and infinite −

In the above representation, the summation symbol represents

the collection of each element.
Operations on Fuzzy Sets
Having two fuzzy sets A˜�~ and B˜�~, the universe of
information U� and an element 𝑦 of the universe, the following
relations express the union, intersection and complement
operation on fuzzy sets.

Union/Fuzzy ‘OR’

Let us consider the following representation to understand how

the Union/Fuzzy ‘OR’ relation works −

Here ∨ represents the ‘max’ operation.

Intersection/Fuzzy ‘AND’

Let us consider the following representation to understand how

the Intersection/Fuzzy ‘AND’ relation works −

μA˜∩B˜(y)=μA˜∧μB˜∀y∈U��~∩�~(�)=��~∧��~∀�∈�
Here ∧ represents the ‘min’ operation.

Complement/Fuzzy ‘NOT’

Let us consider the following representation to understand how

the Complement/Fuzzy ‘NOT’ relation works −
Properties of Fuzzy Sets
Let us discuss the different properties of fuzzy sets.
Commutative Property

Distributive Property

Idempotency Property

For any fuzzy set A˜�~, this property states −

A˜∪A˜=A˜
A˜∩A˜=A˜
Identity Property

For fuzzy set A˜�~ and universal set U�, this property states −

A˜∪φ=A˜
A˜∩U=A˜
A˜∩φ=φ
A˜∪U=U
Transitive Property

Having three fuzzy sets A˜, B˜ and C˜, this property states −

IfA˜⊆B˜⊆C˜,thenA˜⊆C
Involution Property

For any fuzzy set A˜�~, this property states −

𝐴˜_=A˜
De Morgan’s Law
This law plays a crucial role in proving tautologies and
contradiction. This law states −
A˜∩B˜=A˜∪B˜
A˜∪B˜=A˜∩B˜

Fuzzy Logic - Membership Function

We already know that fuzzy logic is not logic that is fuzzy but
logic that is used to describe fuzziness. This fuzziness is best
characterized by its membership function. In other words, we can
say that the membership function represents the degree of truth
in fuzzy logic.

Following are a few important points relating to the membership

function −
●​ Membership functions were first introduced in 1965 by Lofti
A. Zadeh in his first research paper “fuzzy sets”.
 ●​ Membership functions characterize fuzziness (i.e., all the
information in fuzzy set), whether the elements in fuzzy sets
are discrete or continuous.
●​ Membership functions can be defined as a technique to solve
practical problems by experience rather than knowledge.
●​ Membership functions are represented by graphical forms.
●​ Rules for defining fuzziness are fuzzy too.
Mathematical Notation
We have already studied that a fuzzy set à in the universe of
information U can be defined as a set of ordered pairs and it can
be represented mathematically as −

A˜={(y,μA˜(y))|y∈U}�~={(�,��~(�))|�∈�}

Here μA˜(∙)��~(∙) = membership function of A˜�~; this assumes

values in the range from 0 to 1, i.e., μA˜(∙)∈[0,1]��~(∙)∈[0,1]. The
membership function μA˜(∙)��~(∙) maps U� to the membership
spaceM�.

The dot (∙)(∙) in the membership function described above,

represents the element in a fuzzy set; whether it is discrete or
continuous.

Features of Membership Functions

We will now discuss the different features of Membership
Functions.
Core

For any fuzzy set A˜�~, the core of a membership function is that
region of universe that is characterize by full membership in the
set. Hence, core consists of all those elements y� of the universe
of information such that,

μA˜(y)=1
Support

For any fuzzy set A˜�~, the support of a membership function is

the region of universe that is characterize by a nonzero
membership in the set. Hence core consists of all those
elements y� of the universe of information such that,
μA˜(y)>0
Boundary

For any fuzzy set A˜, the boundary of a membership function is

the region of universe that is characterized by a nonzero but
incomplete membership in the set. Hence, core consists of all
those elements y� of the universe of information such that,

1>μA˜(y)>0

Fuzzification
It may be defined as the process of transforming a crisp set to a
fuzzy set or a fuzzy set to fuzzier set. Basically, this operation
translates accurate crisp input values into linguistic variables.
Following are the two important methods of fuzzification −
Support Fuzzification(s-fuzzification) Method
In this method, the fuzzified set can be expressed with the help
of the following relation −
A˜=μ1Q(x1)+μ2Q(x2)+...+μnQ(xn)

Here the fuzzy set Q(xi)�(��) is called as kernel of fuzzification.

This method is implemented by keeping μi�� constant
and xi�� being transformed to a fuzzy set Q(xi)�(��).
Grade Fuzzification (g-fuzzification) Method

It is quite similar to the above method but the main difference is

that it kept xi�� constant and μi�� is expressed as a fuzzy set.

Defuzzification
It may be defined as the process of reducing a fuzzy set into a
crisp set or converting a fuzzy member into a crisp member.
We have already studied that the fuzzification process involves
conversion from crisp quantities to fuzzy quantities. In a number
of engineering applications, it is necessary to defuzzify the result
or rather “fuzzy result” so that it must be converted to a crisp
result. Mathematically, the process of Defuzzification is also called
“rounding it off”.