Question
f : A = {1, 2, 3} , then how many equivalence relation can be defined on A containing (1, 2)-
- 2
- 3
- 8
- 6
Answer: 2
Solution :-
A relation on set A is a subset of A × A.
A × A = {(1, 1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 1), (2, 3), (3, 1), (3, 2)}
Let first denote the equivalence relation and so on.
Now, a relation is equivalence if that relation satisfy three relation first.
(1) reflexive relation
(2) symmetric relation
(3) transitive relation
Now, Let’s talk about if is a equivalence relation on A then (1, 1), (2, 2), (3, 3) must be include in Now if (1, 2) belongs to the for being symmetric relation (2, 1) must belong to .
Hence, is a equivalence relation on A that contains (1, 2).
Now, Let’s talk about if is another equivalence relation on A then in (1, 1), (2, 2), (3, 3) must include. Now if (1, 2) belong to then (2, 1) must belong to for being equivalence.
So, and this relation is same as
Now, for being different from then another element must belong to different from already belonging elements. So lets take another element which is not in If we take (1 ,3) from A × A then for being equivalence (3, 1) must belong in and if (1, 3) and (3, 1) both belong in then for being transitive and symmetric relation (2, 3) and (3, 2) must be include in .
Hence, Also is whole set A × A.
Now, we no more equivalence relation define with including (1, 2).
Hence, we get only two equivalence relation on A including (1, 2).
So, the correct answer is option-1,