Answer :

__An equivalence relation is one which is reflexive, symmetric and transitive.__

Given that, A = {1, 2, 3}

We can define equivalence relation on A as follows.

R_{1} = A × A = {(1,1),(1,2),(1,3),(2,1),(2,2),(2,3),

(3,1),(3,2),(3,3)}

R_{1} is reflexive ∵ (1,1),(2,2),(3,3) ∈ R

R_{1} is symmetric ∵ (1,2),(1,3),(2,3) ∈ R ⇒ (2,1),(3,1),(3,2) ∈ R

R_{1} is Transitive ∵ (1,2) ∈ R and (2,3) ∈ R ⇒ (1,3) ∈ R

Similarly,

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

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

R_{4} = {(1,1),(2,2),(3,3),(2,3),(3,2)}

R_{5} = {(1,1),(2,2),(3,3)}

∴ maximum number of equivalence relation on A is ‘5’.

Rate this question :

Fill in theMathematics - Exemplar

State True Mathematics - Exemplar

State True Mathematics - Exemplar

State True Mathematics - Exemplar

Let A = {1, 2, 3}Mathematics - Exemplar

Show that the relMathematics - Board Papers

Let N denote the Mathematics - Board Papers