Fuzzy Sets, Logic and Systems and Applications

Prof. Nishchal K. Verma

Department of Electrical Engineering
Indian Institute of Technology, Kanpur

Lecture – 40
Fuzzy Tolerance and Equivalence Relations –III

So, welcome to lecture number 40 of Fuzzy sets, Logic and Systems and Applications, and
this lecture is in continuation to our previous lectures and here we will discuss a Fuzzy
Tolerance and Equivalence Relations.

(Refer Slide Time: 00:34)

So, this way we have understood as to, when we can say that particular fuzzy relation set
is a fuzzy equivalence relation are not.

One thing we have understood that a fuzzy equivalence relation is always a fuzzy tolerance
relation that is an important outcome of this discussion. And there are fuzzy relation sets
which many a times they are not fuzzy equivalence relations, but we can make them fuzzy
equivalence relation.

So, here is a very important concept that I am going to mention is that a fuzzy relation set
which is a fuzzy tolerance relation let us say fuzzy tolerance relation 𝑅𝑅, if it is defined in
this space 𝑋𝑋 × 𝑋𝑋 so; that means, these 𝑅𝑅 is already a reflexive and symmetric, means this
fuzzy relation set 𝑅𝑅 is satisfying the reflectivity and symmetry property. So, if we have a
fuzzy tolerance relation and this fuzzy tolerance relation if it is not fuzzy equivalence
relation it can be converted into fuzzy equivalence relation by at most n minus 1
compositions.

So, this is very important concept that we need to know here. So, if we can make a
composition, at most 𝑛𝑛 − 1 composition with itself. So, within this any fuzzy tolerance
relation 𝑅𝑅 can be converted into a fuzzy is equivalence relation. So, as I mentioned a fuzzy
tolerance relation 𝑅𝑅 which is defined in the space 𝑋𝑋 × 𝑋𝑋 that has already satisfied the
properties of reflexivity and symmetry can be reformed into a fuzzy equivalence relation
by at most 𝑛𝑛 − 1 composition with itself. Where n is the cardinal number of the set defining
𝑅𝑅. So, this can be written as this expression.

So, 𝑅𝑅𝑛𝑛−1 this shows that we are making 𝑛𝑛 − 1 compositions. So, this is the maximum
number of composition that it can go through and within this the fuzzy relation set which
is not a fuzzy equivalence relation can be transformed into fuzzy equivalence relation.

So, I would like to just amend here that a fuzzy tolerance relation 𝑅𝑅 only can get
transformed into fuzzy equivalence relation in this process. And the process is at most n
minus 1 compositions with itself, where n is the cardinal number of the set defining 𝑅𝑅.

(Refer Slide Time: 04:30)

So, let us take an example here to understand this concept also. So, here we have taken
fuzzy relation set in form of matrix we can call this as the fuzzy relation matrix 𝑅𝑅. And if
we look at the fuzzy relation matrix we can quickly comment on the reflexivity property,
all the diagonal elements are 1. And not only this the symmetry property is also satisfied
because we have already done this in the previous example. Example number 5 where we
had a fuzzy relation 𝑅𝑅 which is here and we have already proved that 𝑅𝑅 is a fuzzy tolerance
relation.

So, this is a fuzzy tolerance relation. So, 𝑅𝑅 is a fuzzy tolerance relation, why because 𝑅𝑅
satisfies the reflexivity property and symmetry property, now if we are interested in
checking whether this fuzzy tolerance relation is qualified to be called as fuzzy equivalence
relation or not. So, the third property that is transitivity property it needs to be satisfied.

Now, in the example number 5 we have checked this that the transitivity property is not
satisfied. So, this fuzzy relation set 𝑅𝑅 is not a fuzzy equivalence relation. So, here I am just
mentioning that I am just writing that the what are the properties that are satisfied. So,
reflexivity, then symmetry, then transitivity.

So, transitivity criteria transitivity property is not satisfied for this 𝑅𝑅, however the
reflexivity and symmetry both the properties are satisfied. So, that is why the given fuzzy
tolerance relation are given fuzzy relation matrix 𝑅𝑅 is not qualified to be called as fuzzy
equivalence relation. So, now, the question is how to make this a fuzzy equivalence
relation by having the compositions as we have just discussed. So, let us proceed for that.

So we apply now the composition of 𝑅𝑅 on 𝑅𝑅; so that is 𝑅𝑅2 . So, 𝑅𝑅2 is nothing, but the 𝑅𝑅 ∘
𝑅𝑅. So, we have the fuzzy tolerance relation. Now, 𝑅𝑅 and we are now having the 𝑅𝑅 ∘ 𝑅𝑅 and
let us see what happens.
(Refer Slide Time: 08:20)

So, we have the 𝑅𝑅 that is given again and the same 𝑅𝑅 is here. And when we take the
composition of these two and here we have ∘ sign, ∘ is for the composition and here we
are taking the max-min composition. So, when we do that we see that this is the outcome.

So, after taking the max min composition of 𝑅𝑅 ∘ 𝑅𝑅, we get a new fuzzy relation which is
represented by 𝑅𝑅2 . So, this is the first composition, this is you know the first stage of the
composition. So, the fuzzy relation matrix if we see if we look at we see that we have
𝜇𝜇𝑅𝑅2 (𝑥𝑥1 , 𝑥𝑥2 ) which is equal to 0.8 and 𝜇𝜇𝑅𝑅2 (𝑥𝑥2 , 𝑥𝑥4 ) is 0.5.

And we see that here also the transitivity condition is not satisfied because the 𝜇𝜇𝑅𝑅2 (𝑥𝑥1 , 𝑥𝑥4 )
equal to 0.2 which is 𝜆𝜆. And this is not either equal to or greater than the mean of the 0.8
and 0.5. So, this way we can clearly say that the transitivity condition is still not satisfied.
(Refer Slide Time: 10:01)

Now, let us go one step further and let us have one more composition. So, we already have
𝑅𝑅2 and now let us have a composition of 𝑅𝑅2 ∘ 𝑅𝑅 which is 𝑅𝑅3 here. So, when we have the
max-min composition of 𝑅𝑅2 on 𝑅𝑅 we have this as the outcome, we have a new fuzzy
relation here that is 𝑅𝑅3 .

New fuzzy relation matrix and of course, this fuzzy relation matrix is a fuzzy tolerance
relation because we have already seen that this satisfies the reflexivity and symmetry. We
can again once again we can check this and here also the condition of reflexivity and
symmetry both are satisfied.

Now, when we check for transitivity we see that a 𝜇𝜇𝑅𝑅2 here that is 𝜇𝜇𝑅𝑅3 (𝑥𝑥1 , 𝑥𝑥2 ) and
𝜇𝜇𝑅𝑅3 (𝑥𝑥2 , 𝑥𝑥4 ) values are 0.8 and 0.5. So, 𝜇𝜇𝑅𝑅3 (𝑥𝑥1 , 𝑥𝑥2 ); 𝑥𝑥1 , 𝑥𝑥2 is this, and 𝜇𝜇𝑅𝑅3 (𝑥𝑥2 , 𝑥𝑥4 )value is
0.5 here.

Now, when we check for 𝜇𝜇𝑅𝑅3 (𝑥𝑥1 , 𝑥𝑥4 ), which is 0.5 again. And if we see that this 0.5 is
either greater than or equal to the mean of these two the 0.8 and 0.5. So, here for this case
the transitivity condition is satisfied, but we have to go further and we have to check this
condition for all its elements.

So, when we have checked for all its elements all the membership values of the fuzzy
tolerance relation 𝑅𝑅3 . Then we see that all the elements are satisfying the transitivity
condition and this way we can comment here that the 𝑅𝑅3 is satisfies the transitivity
condition.

So, now when the 𝑅𝑅3 is satisfying the transitivity condition and we have already seen that
𝑅𝑅3 is reflexive and symmetric. So, this means all the three conditions of fuzzy equivalence
relations satisfied. So, we can now say that the fuzzy relation matrix 𝑅𝑅 is converted into
𝑅𝑅3 . And 𝑅𝑅3 is a fuzzy equivalence relation.

So, what does this mean? This means that if we have any fuzzy tolerance relation which is
not a fuzzy equivalence relation. So, with this with the help of this fuzzy tolerance relation
we can use the fuzzy tolerance relation and we can convert this into fuzzy equivalence
relations by taking the suitable compositions.

(Refer Slide Time: 14:09)

Now, the anti-reflexivity and anti-symmetry these are two other properties, we can just
understand. So, at this stage the fuzzy relations for fuzzy relations we have anti-reflexivity
anti-symmetry and these are nothing but the antonyms of the properties that we have
already discussed. So, anti-reflexivity is the property where the reflexivity is not satisfied;
reflexivity condition is not satisfied.
(Refer Slide Time: 14:50)

And similarly anti-symmetry is the property where the symmetry condition is not satisfied.
So, let us now formally understand what is anti-reflexivity. So, if we have any fuzzy
relation 𝑅𝑅 which is defined in the universe of discourse 𝑋𝑋 × 𝑋𝑋 such that 𝑅𝑅 ⊂ 𝑋𝑋 × 𝑋𝑋. Then
𝑅𝑅 will satisfy the anti-reflexivity property.

If 𝜇𝜇𝑅𝑅 (𝑥𝑥𝑖𝑖 , 𝑥𝑥𝑖𝑖 ) is equal to 0 instead of 1 in the case of reflexivity. So, here 𝜇𝜇𝑅𝑅 (𝑥𝑥𝑖𝑖 , 𝑥𝑥𝑖𝑖 ) means,
the diagonal elements so all the diagonal elements of the fuzzy relation set need to be 0.
So, this condition if this is the case then we can say that the fuzzy relation has anti-
reflexivity condition.
(Refer Slide Time: 15:47)

And similarly, now have an example to understand this better. So, if we have a fuzzy
relation matrix 𝑅𝑅 as shown here. And we see that the all the diagonal elements of it are
zero. So, then in that case we can say that the anti-reflexivity criteria is satisfied. So, we
can say that the fuzzy relation 𝑅𝑅 is anti-reflexive.

(Refer Slide Time: 16:26)

Now, anti-symmetry; so, for any fuzzy relation set 𝑅𝑅 if we have this condition satisfied
which is 𝜇𝜇𝑅𝑅 (𝑥𝑥𝑖𝑖 , 𝑥𝑥𝑗𝑗 ) > 0, then 𝜇𝜇𝑅𝑅 �𝑥𝑥𝑗𝑗 , 𝑥𝑥𝑖𝑖 � = 0, ∀𝑥𝑥𝑖𝑖 , 𝑥𝑥𝑗𝑗 ∈ 𝑋𝑋, 𝑥𝑥𝑖𝑖 ≠ 𝑥𝑥𝑗𝑗 .
(Refer Slide Time: 16:55)

So, let us now understand this property the anti-symmetry property by taking an example.
So, we have any fuzzy relation set 𝑅𝑅 which is represented in the form of matrix here.

(Refer Slide Time: 17:12)

So, we see that the condition that is necessary for anti-symmetry is satisfied here. So, this
means that if we have 𝜇𝜇𝑅𝑅 (𝑥𝑥1 , 𝑥𝑥2 ). So, 𝜇𝜇𝑅𝑅 (𝑥𝑥1 , 𝑥𝑥2 ) is 0.9 here. And this is greater than 0 of
course, and then 𝜇𝜇𝑅𝑅 when we interchange the row and columns we see that 𝜇𝜇𝑅𝑅 (𝑥𝑥2 , 𝑥𝑥1 ) is
equal to here 0.
So, this way we can say that the anti-symmetry for this element is satisfied. Similarly,
when we check or for all the elements we see that the 𝑅𝑅 satisfies the anti-symmetry
property. And this way we can say that the fuzzy relation 𝑅𝑅 that has been given satisfies
the anti-symmetry property.

So, this way we have understood that a fuzzy relation can go through multiple tests and
based on that we can comment on its whether it is the fuzzy tolerance relation or a fuzzy
equivalence relation. And if a fuzzy tolerance relation is not a fuzzy equivalence relation
let’s say, then we can make a fuzzy equivalence relation by using a fuzzy tolerance relation
with proper composition of it.

(Refer Slide Time: 18:59)

So, this way we will finish the lecture here. And in the next lecture we will study the
Linguistic Hedges ahead.

Thank you.