Question

f : A = {1, 2, 3} , then how many equivalence relation can be defined on A containing (1, 2)-

  1. 2
  2. 3
  3. 8
  4. 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 R1,R2,R3 and so on.

Now, a relation is equivalence if that relation satisfy three relation first.

(1) reflexive relation aRa,aA
(2) symmetric relation IfaRbthenbRa,a,bA
(3) transitive relation IfaRbandbRcthenaRc,abcA

Now, Let’s talk about R1 if R1 is a equivalence relation on A then (1, 1), (2, 2), (3, 3) must be include in R1. Now if (1, 2) belongs to R1 the for being symmetric relation (2, 1) must belong to R1 .

Hence, R1={(1,1),(2,2),(3,3),(1,2),(2,1)} is a equivalence relation on A that contains (1, 2).

Now, Let’s talk about R2 if R2 is another equivalence relation on A then in R2 (1, 1), (2, 2), (3, 3) must include. Now if (1, 2) belong to R2 then (2, 1) must belong to R2 for being equivalence.

So, R2={(1,1),(2,2),(3,3),(1,2),(2,1)} and this relation is same as R1

Now, for being R2 different from R1 then another element must belong to R2 different from already belonging elements. So lets take another element which is not in R1. If we take (1 ,3) from A × A then for being R2 equivalence (3, 1) must belong in R2 and if (1, 3) and (3, 1) both belong in R2 then for being transitive and symmetric relation (2, 3) and (3, 2) must be include in R2 .

Hence, R2={(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1),(2,3),(3,2)} Also R2 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, 2