Skip to content
Question of 104

Q.Consider the relation R = {(x, y) : x, y ∈ A, x = y} defined on the set A = {1, 2, 3, 4}.

(i) Show that R is an equivalence relation.
(2)
(ii) Hence write the equivalence classes. (1)
Kerala DhseKerala DHSE Plus Two Board 2026Subjective· 3mImportance★★★★★
0% · 0/104 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

R = {(x,y): x = y} is just the equality relation on A, which is always reflexive, symmetric and transitive — so it is an equivalence relation, and each element forms its own singleton equivalence class.

(i) R is an equivalence relation. Here A={1,2,3,4}A=\{1,2,3,4\} and R={(x,y):x,y∈A, x=y}={(1,1),(2,2),(3,3),(4,4)}R=\{(x,y): x,y\in A,\ x=y\} = \{(1,1),(2,2),(3,3),(4,4)\}.

Reflexive: For every x∈Ax\in A, x=xx=x is true, so (x,x)∈R(x,x)\in R for all x∈Ax\in A. Hence R is reflexive.

Symmetric: If (x,y)∈R(x,y)\in R then x=yx=y. Since equality is symmetric, y=xy=x, so (y,x)∈R(y,x)\in R. Hence R is symmetric.

Transitive: If (x,y)∈R(x,y)\in R and (y,z)∈R(y,z)\in R, then x=yx=y and y=zy=z, so x=zx=z, i.e. (x,z)∈R(x,z)\in R. Hence R is transitive.

Since R is reflexive, symmetric and transitive, R is an equivalence relation on A.

…

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.