SOLVER7 Study. Nothing Else.
2026 Board Paper Q36(iii)a

A school wants the students of class XII to do a project on ‘Sustainability’ keeping the world environment in mind. They select the student participants on the basis of an essay writing competition. 7 students out of 80 are selected for the project and are categorized into two sets such that :
Girl students belong to Set \(A =\{G_1, G_2, G_3, G_4\},\)
Boy students belong to Set \(B=\{B1, B2, B3\}.\) Based on the above information, answer the following questions :Let the relation R from \(A\rightarrow A\) be such that
\(R=\{(x, y), x, y \in A, x\) and \(y\) are students from the same colony in the city\(\}.\)Verify if R is an equivalence relation.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine four friends — \( G_1, G_2, G_3, G_4 \) — and a rule: two friends are 'related' if they live in the same colony. Every person lives in their own colony, so every person matches with themselves. If one friend lives near another, that other friend lives near them too. Also, if two friends share a colony with a third friend, all three share the same colony. A relation that works this way — matching yourself, matching both ways, and passing along — is called an equivalence relation.

Answer: The relation R is reflexive, symmetric and transitive, so R is an equivalence relation on \( A = \{G_1, G_2, G_3, G_4\} \).

📖 Verifying if R is an Equivalence Relation

Detailed Explanation

A relation \( R \) on a set \( A \) is called an equivalence relation if it satisfies three properties at once. First, it must be reflexive, meaning every element is related to itself: \( (x, x) \in R \) for all \( x \in A \). Second, it must be symmetric, meaning if \( x \) is related to \( y \), then \( y \) is related to \( x \): \( (x, y) \in R \Rightarrow (y, x) \in R \). Third, it must be transitive, meaning if \( x \) is related to \( y \) and \( y \) is related to \( z \), then \( x \) is related to \( z \): \( (x, y) \in R \) and \( (y, z) \in R \Rightarrow (x, z) \in R \). Here the relation is defined on \( A = \{G_1, G_2, G_3, G_4\} \) by the rule 'x and y are students from the same colony'. We must check each of the three properties for this real-world condition.

Formula Used

R is an equivalence relation on A if and only if R is reflexive, symmetric and transitive: (i) \( (x,x) \in R \ \forall x \in A \); (ii) \( (x,y) \in R \Rightarrow (y,x) \in R \); (iii) \( (x,y) \in R \) and \( (y,z) \in R \Rightarrow (x,z) \in R \).

Solution

  1. Step 1: Understand the relation. We are given \( A = \{G_1, G_2, G_3, G_4\} \) and \( R = \{(x, y) : x, y \in A, \ x \text{ and } y \text{ live in the same colony}\} \). To prove it is an equivalence relation we test reflexivity, symmetry and transitivity one by one.
  2. Step 2: Check reflexivity. Take any student \( x \in A \). Every student certainly lives in the same colony as herself. So \( x \) and \( x \) are from the same colony, which means \( (x, x) \in R \) for all \( x \in A \). Hence R is reflexive.
  3. Step 3: Check symmetry. Suppose \( (x, y) \in R \). This means \( x \) and \( y \) live in the same colony. But if \( x \) lives in the same colony as \( y \), then \( y \) also lives in the same colony as \( x \). Therefore \( (y, x) \in R \). So \( (x, y) \in R \Rightarrow (y, x) \in R \), and R is symmetric.
  4. Step 4: Check transitivity. Suppose \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x \) and \( y \) are from the same colony, and \( y \) and \( z \) are from the same colony. So \( x \), \( y \), \( z \) all belong to one and the same colony, which gives that \( x \) and \( z \) are from the same colony. Hence \( (x, z) \in R \), and R is transitive.
  5. Step 5: Conclude. Since R is reflexive, symmetric and transitive, all three conditions for an equivalence relation are satisfied. Therefore R is an equivalence relation on \( A \).

Final Answer

The relation R is reflexive, symmetric and transitive, so R is an equivalence relation on \( A = \{G_1, G_2, G_3, G_4\} \).

Common Mistake

A common mistake is to only check symmetry and transitivity and forget reflexivity, or to assume transitivity fails just because not all pairs appear in R. You must verify all three properties independently using the meaning of the relation, not just the listed pairs.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and the relation. We have \( A = \\{G_1, G_2, G_3, G_4\\} \) where each \( G_i \) is a student. The relation is defined as \( R = \\{(x, y) : x, y \in A \text{ and } x \text{ and } y \text{ live in the same colony}\\} \). — Reason: Clearly stating the set and the rule of the relation helps us know exactly what condition we need to test in each of the three checks.
  2. Step 2: Check Reflexivity. Pick any arbitrary student \( x \in A \). A student always lives in the same colony as herself, so the pair \( (x, x) \in R \) holds for every \( x \in A \). Therefore R is reflexive. — Reason: Reflexivity demands that every element is related to itself; the real-world condition 'same colony' is trivially satisfied when both members of the pair are the same person.
  3. Step 3: Check Symmetry. Suppose \( (x, y) \in R \) for some \( x, y \in A \). This means x and y live in the same colony. But 'living in the same colony' is a mutual condition — if x lives in the same colony as y, then y also lives in the same colony as x. Hence \( (y, x) \in R \), so R is symmetric. — Reason: Symmetry requires the relation to work in both directions; shared residence is inherently a two-way fact.
  4. Step 4: Check Transitivity. Suppose \( (x, y) \in R \) and \( (y, z) \in R \) for some \( x, y, z \in A \). The first pair tells us x and y live in the same colony; the second tells us y and z live in the same colony. Since both x and z share a colony with y, they must belong to the same colony as each other. Therefore \( (x, z) \in R \), and R is transitive. — Reason: Transitivity ensures the relation chains through a common link; 'same colony' transfers through any shared intermediate student.
  5. Step 5: Combine all three results. We have verified: R is reflexive, R is symmetric, and R is transitive. Since all three conditions hold simultaneously, R qualifies as an equivalence relation on \( A = \\{G_1, G_2, G_3, G_4\\} \). — Reason: All three properties together are exactly the definition of an equivalence relation; missing even one would disqualify R.

Final Answer

The relation R is reflexive, symmetric and transitive, so R is an equivalence relation on \( A = \{G_1, G_2, G_3, G_4\} \).

Common Mistake

One common mistake: Students often forget to verify all three properties and conclude equivalence after checking only reflexivity and symmetry — transitivity must also be explicitly proved.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Reflexivity: Every student \( x \) lives in the same colony as herself, so \( (x,x) \in R \) for all \( x \in A \). R is reflexive.
  2. Step 2: Symmetry: If \( (x,y) \in R \), then x and y are in the same colony, so y and x are in the same colony, giving \( (y,x) \in R \). R is symmetric.
  3. Step 3: Transitivity: If \( (x,y) \in R \) and \( (y,z) \in R \), then x, y, z all share the same colony, so \( (x,z) \in R \). R is transitive.

Answer: The relation R is reflexive, symmetric and transitive, so R is an equivalence relation on \( A = \{G_1, G_2, G_3, G_4\} \).

➕ More Examples

More Examples

Example 1

Question: A sports club selects 6 members for an inter-school tournament. The members are divided into two teams: Team P (players) \ \( = \{P_1, P_2, P_3\} \) and Team Q (substitutes) \ \( = \{Q_1, Q_2, Q_3\} \). Let the relation R on set P be defined as \ \( R = \{(x, y) : x, y \in P, \text{ x and y play the same sport}\} \). Given that \ \( P_1 \) and \ \( P_2 \) play cricket, while \ \( P_3 \) plays football, verify whether R is an equivalence relation.

Solution: The relation on set \ \( P = \{P_1, P_2, P_3\} \) is defined by \ \( R = \{(x, y) : x \text{ and } y \text{ play the same sport}\} \). Since \ \( P_1, P_2 \) play cricket and \ \( P_3 \) plays football, the relation R in roster form is: \[ R = \{(P_1, P_1),\ (P_2, P_2),\ (P_3, P_3),\ (P_1, P_2),\ (P_2, P_1)\} \] Step 1: Check Reflexivity. Every player plays the same sport as themselves. So \ \( (P_1, P_1) \in R \), \ \( (P_2, P_2) \in R \), and \ \( (P_3, P_3) \in R \). Since \ \( (x, x) \in R \) for all \ \( x \in P \), R is reflexive. Step 2: Check Symmetry. Suppose \ \( (x, y) \in R \). Then x and y play the same sport, which means y and x also play the same sport. So \ \( (y, x) \in R \). We verify: \ \( (P_1, P_2) \in R \Rightarrow (P_2, P_1) \in R \). Hence R is symmetric. Step 3: Check Transitivity. Suppose \ \( (x, y) \in R \) and \ \( (y, z) \in R \). Then x and y play the same sport, and y and z play the same sport. Therefore x and z also play the same sport, so \ \( (x, z) \in R \). We verify the non-trivial case: \ \( (P_1, P_2) \in R \) and \ \( (P_2, P_1) \in R \Rightarrow (P_1, P_1) \in R \). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation.

Answer: R is an equivalence relation on set P.

Example 2

Question: A library committee shortlists 5 students for a reading programme. The students are categorized into two groups: Group A \ \( = \{A_1, A_2, A_3\} \) (senior students) and Group B \ \( = \{B_1, B_2\} \) (junior students). Define a relation R on Group A as \ \( R = \{(x, y) : x, y \in A, \text{ x and y have read the same number of books this year}\} \). Given that \ \( A_1 \) has read 5 books, \ \( A_2 \) has read 5 books, and \ \( A_3 \) has read 8 books, verify whether R is an equivalence relation.

Solution: The relation on set \ \( A = \{A_1, A_2, A_3\} \) is defined by \ \( R = \{(x, y) : x \text{ and } y \text{ have read the same number of books}\} \). Since \ \( A_1 \) and \ \( A_2 \) have each read 5 books, and \ \( A_3 \) has read 8 books, the relation R in roster form is: \[ R = \{(A_1, A_1),\ (A_2, A_2),\ (A_3, A_3),\ (A_1, A_2),\ (A_2, A_1)\} \] Step 1: Check Reflexivity. Every student has read the same number of books as themselves. So \ \( (A_1, A_1) \in R \), \ \( (A_2, A_2) \in R \), and \ \( (A_3, A_3) \in R \). Since \ \( (x, x) \in R \) for all \ \( x \in A \), R is reflexive. Step 2: Check Symmetry. Let \ \( (x, y) \in R \). Then x and y have read the same number of books. This immediately means y and x have also read the same number of books, so \ \( (y, x) \in R \). We verify: \ \( (A_1, A_2) \in R \Rightarrow (A_2, A_1) \in R \). Hence R is symmetric. Step 3: Check Transitivity. Let \ \( (x, y) \in R \) and \ \( (y, z) \in R \). Then x and y have read the same number of books, and y and z have read the same number of books. By equality, x and z have also read the same number of books. So \ \( (x, z) \in R \). We verify: \ \( (A_1, A_2) \in R \) and \ \( (A_2, A_1) \in R \Rightarrow (A_1, A_1) \in R \). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation.

Answer: R is an equivalence relation on set A.

🎯 Try a Similar Question

Try a Similar Question

Question: A cultural club in a college has 6 student members. The girl members form Set \( P = \{G_1, G_2, G_3\} \) and the boy members form Set \( Q = \{B_1, B_2, B_3\} \). A relation R is defined on Set \( P \) as: \[ R = \{(x, y) : x, y \in P \text{ and } x \text{ and } y \text{ speak the same mother tongue}\} \] It is known that \( G_1 \) and \( G_2 \) speak Hindi, while \( G_3 \) speaks Tamil. Verify whether R is an equivalence relation on \( P \). Also state whether R is an equivalence relation or not, giving a reason.

Solution

  1. Step 1: List all pairs in R: Given: \( G_1 \) and \( G_2 \) speak Hindi; \( G_3 \) speaks Tamil. Two students are related if they share the same mother tongue. So the relation R on \( P = \{G_1, G_2, G_3\} \) is: \[ R = \{(G_1, G_1),\, (G_2, G_2),\, (G_3, G_3),\, (G_1, G_2),\, (G_2, G_1)\} \]
  2. Step 2: Check Reflexivity: For R to be reflexive, \( (a, a) \in R \) for every \( a \in P \). We check: \( (G_1, G_1) \in R \) since \( G_1 \) speaks the same language as herself. \( (G_2, G_2) \in R \) since \( G_2 \) speaks the same language as herself. \( (G_3, G_3) \in R \) since \( G_3 \) speaks the same language as herself. All diagonal pairs are present, so R is reflexive.
  3. Step 3: Check Symmetry: For R to be symmetric, whenever \( (a, b) \in R \), we need \( (b, a) \in R \). The non-trivial pairs to check are \( (G_1, G_2) \) and \( (G_2, G_1) \). Since \( (G_1, G_2) \in R \) (both speak Hindi) and \( (G_2, G_1) \in R \) (both speak Hindi), symmetry holds for all pairs. So R is symmetric.
  4. Step 4: Check Transitivity: For R to be transitive, whenever \( (a, b) \in R \) and \( (b, c) \in R \), we need \( (a, c) \in R \). The relevant case: \( (G_1, G_2) \in R \) and \( (G_2, G_1) \in R \), so we need \( (G_1, G_1) \in R \) — yes, it is present. Also \( (G_2, G_1) \in R \) and \( (G_1, G_2) \in R \), so we need \( (G_2, G_2) \in R \) — yes. All other combinations involve only single elements or already-checked pairs. So R is transitive.
  5. Step 5: Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( P = \{G_1, G_2, G_3\} \). The equivalence classes are: \[ [G_1] = [G_2] = \{G_1, G_2\} \quad \text{(Hindi speakers)} \] and \[ [G_3] = \{G_3\} \quad \text{(Tamil speaker)} \] These classes partition \( P \) into two disjoint non-empty subsets.

Answer: R is reflexive, symmetric, and transitive, so R is an equivalence relation on \( P = \{G_1, G_2, G_3\} \). The equivalence classes are \( \{G_1, G_2\} \) (Hindi speakers) and \( \{G_3\} \) (Tamil speaker).

Everything you get with Solver7

More questions in Relations and Functions