wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

37. Let A = {1, 2, 3}. Then find the number of equivalence relations containing (1, 2

Open in App
Solution

It is given that A = {1, 2, 3}.

The smallest equivalence relation containing (1, 2) is given by,

R1 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}

Now, we are left with only four pairs i.e., (2, 3), (3, 2), (1, 3), and (3, 1).

If we odd any one pair [say (2, 3)] to R1, then for symmetry we must add (3, 2). Also, for transitivity we are required to add (1, 3) and (3, 1).

Hence, the only equivalence relation (bigger than R1) is the universal relation.

This shows that the total number of equivalence relations containing (1, 2) is two.


flag
Suggest Corrections
thumbs-up
105
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Types of Relations
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon