SOLVER7 Study. Nothing Else.
2026 Board Paper Q19

Assertion (A) : A relation R on the set \(\{1,2,3\}\) defined as \(R =\{(1, 1), (1, 2), (2, 1), (2, 2), (3, 3)\}\) is an equivalence relation. Reason (R) : A relation that is reflexive, symmetric and transitive is an equivalence relation.
(A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
(B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A).
(C) Assertion (A) is true, but Reason (R) is false.
(D) Assertion (A) is false, but Reason (R) is true.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Think of an equivalence relation like a friendship club with three rules. Every person must be friends with themselves. If you are friends with someone, they must be friends with you back. If you are friends with someone who is friends with a third person, you must also be friends with that third person. The relation given follows all three rules, so it is an equivalence relation. The reason stated is exactly the definition of this rule, so it perfectly explains why the assertion is true.

Answer: Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). The correct option is (A).

📖 Checking 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. It must be reflexive, meaning \( (a, a) \in R \) for every element \( a \in A \). It must be symmetric, meaning if \( (a, b) \in R \) then \( (b, a) \in R \). It must be transitive, meaning if \( (a, b) \in R \) and \( (b, c) \in R \) then \( (a, c) \in R \). To answer this Assertion-Reason question, we check all three conditions on the given relation, and we also note that the Reason simply states this exact definition, which is a true statement.

Formula Used

R is an equivalence relation \( \iff \) R is reflexive, symmetric and transitive. Reflexive: \( (a,a) \in R \ \forall a \in A \). Symmetric: \( (a,b) \in R \Rightarrow (b,a) \in R \). Transitive: \( (a,b), (b,c) \in R \Rightarrow (a,c) \in R \).

Solution

  1. Step 1: Write down the set and the relation. The set is \( A = \{1, 2, 3\} \) and the relation is \( R = \{(1,1), (1,2), (2,1), (2,2), (3,3)\} \).
  2. Step 2: Check reflexivity. We need \( (a,a) \in R \) for every element of \( A \). Here \( (1,1) \in R \), \( (2,2) \in R \) and \( (3,3) \in R \). All three are present, so \( R \) is reflexive.
  3. Step 3: Check symmetry. For every pair \( (a,b) \in R \), the pair \( (b,a) \) must also be in \( R \). The only off-diagonal pairs are \( (1,2) \) and \( (2,1) \), and both are present. The diagonal pairs are symmetric by themselves. So \( R \) is symmetric.
  4. Step 4: Check transitivity. Whenever \( (a,b) \in R \) and \( (b,c) \in R \), we need \( (a,c) \in R \). Take \( (1,2) \) and \( (2,1) \): this needs \( (1,1) \), which is present. Take \( (2,1) \) and \( (1,2) \): this needs \( (2,2) \), which is present. All other combinations lead to pairs already in \( R \). So \( R \) is transitive.
  5. Step 5: Conclude about the Assertion. Since \( R \) is reflexive, symmetric and transitive, it is an equivalence relation. Hence Assertion (A) is true.
  6. Step 6: Evaluate the Reason. Reason (R) states that a relation which is reflexive, symmetric and transitive is an equivalence relation. This is exactly the definition, so Reason (R) is true, and it correctly explains why the Assertion holds.

Final Answer

Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). The correct option is (A).

Common Mistake

A common mistake is to declare the relation not transitive because \( 3 \) is not related to \( 1 \) or \( 2 \). Transitivity is only violated when \( (a,b) \) and \( (b,c) \) are both present but \( (a,c) \) is missing. Since \( 3 \) only appears in \( (3,3) \), no such broken chain exists, so transitivity still holds.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and relation. The set is \( A = \{1, 2, 3\} \) and the relation is \( R = \{(1,1),\ (1,2),\ (2,1),\ (2,2),\ (3,3)\} \). — Reason: Writing these out clearly helps us check each property systematically without missing any element or pair.
  2. Step 2: Check Reflexivity. Every element of \( A \) must appear as \( (a, a) \) in \( R \). We verify: \( (1,1) \in R \), \( (2,2) \in R \), and \( (3,3) \in R \). All three diagonal pairs are present, so \( R \) is reflexive. — Reason: Reflexivity is the first mandatory condition; if even one \( (a, a) \) were missing, \( R \) would fail immediately.
  3. Step 3: Check Symmetry. For every off-diagonal pair in \( R \), its reverse must also be in \( R \). The only off-diagonal pairs are \( (1, 2) \) and \( (2, 1) \), and both are present. Diagonal pairs like \( (1,1) \) are trivially symmetric. Hence \( R \) is symmetric. — Reason: Symmetry ensures the relation works equally in both directions between any two related elements.
  4. Step 4: Check Transitivity. We must verify: whenever \( (a, b) \in R \) and \( (b, c) \in R \), we also have \( (a, c) \in R \). The non-trivial cases to check are: \( (1,2) \in R \) and \( (2,1) \in R \Rightarrow (1,1) \in R \) ✓; and \( (2,1) \in R \) and \( (1,2) \in R \Rightarrow (2,2) \in R \) ✓. All other combinations involve only diagonal pairs, which trivially satisfy transitivity. Hence \( R \) is transitive. — Reason: Transitivity is the most detailed check; missing even one case would mean \( R \) is not an equivalence relation.
  5. Step 5: Conclude about the Assertion. Since \( R \) is reflexive, symmetric, and transitive, it satisfies all three conditions. Therefore Assertion (A) — that \( R \) is an equivalence relation — is TRUE. — Reason: All three pillars of equivalence are confirmed, so the assertion stands.
  6. Step 6: Evaluate the Reason. The Reason (R) states that a relation is an equivalence relation if and only if it is reflexive, symmetric, and transitive. This is precisely the standard definition taught in the CBSE syllabus, so Reason (R) is also TRUE. — Reason: The definition itself is a universally accepted mathematical fact, not just a claim.
  7. Step 7: Check whether Reason (R) explains Assertion (A). We verified the assertion by directly applying the definition stated in the Reason — checking reflexivity, symmetry, and transitivity one by one. So the Reason is not merely true in isolation; it is the precise logical basis used to confirm the Assertion. Hence Reason (R) is the correct explanation of Assertion (A). — Reason: An explanation must be the direct logical justification, not just a related true statement.

Final Answer

Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). The correct option is (A).

Common Mistake

One common mistake: Students often verify only reflexivity and symmetry but forget to check ALL transitive combinations, especially cases like \( (1,2) \in R \) and \( (2,1) \in R \) requiring \( (1,1) \in R \), leading to an incorrect conclusion about transitivity.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: Set \( A = \{1, 2, 3\} \), Relation \( R = \{(1,1),(1,2),(2,1),(2,2),(3,3)\} \)
  2. Step 2: Verify all three properties: Reflexive: \( (1,1),(2,2),(3,3) \in R \) ✓ Symmetric: \( (1,2) \in R \Rightarrow (2,1) \in R \) ✓ Transitive: \( (1,2),(2,1) \in R \Rightarrow (1,1) \in R \); \( (1,2),(2,2) \in R \Rightarrow (1,2) \in R \); all such cases hold ✓
  3. Step 3: Conclusion on A and R: Assertion (A): R is an equivalence relation — TRUE. Reason (R): states the definition of equivalence relation — TRUE, and directly explains (A).

Answer: Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). The correct option is (A).

➕ More Examples

More Examples

Example 1

Question: Assertion (A): The relation \( R \) on the set \( A = \{1, 2, 3, 4\} \) defined as \( R = \{(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(3,4),(4,3)\} \) is an equivalence relation. Reason (R): A relation is an equivalence relation if and only if it is reflexive, symmetric, and transitive. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution: Step 1: Analyse Reason (R). The definition of an equivalence relation is that it must be reflexive, symmetric, and transitive simultaneously. This is a standard, correct mathematical definition. Hence Reason (R) is TRUE. Step 2: Check Assertion (A) — verify whether R is an equivalence relation on \( A = \{1,2,3,4\} \). The given relation is \( R = \{(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(3,4),(4,3)\} \). Reflexivity: Check whether \( (a,a) \in R \) for all \( a \in A \). \[(1,1),(2,2),(3,3),(4,4) \in R.\] All diagonal pairs are present, so R is reflexive. Symmetry: Check whether \( (a,b) \in R \Rightarrow (b,a) \in R \). The non-diagonal pairs are \( (1,2),(2,1),(3,4),(4,3) \). Each pair appears with its reverse, so R is symmetric. Transitivity: Check whether \( (a,b) \in R \) and \( (b,c) \in R \Rightarrow (a,c) \in R \). Consider pairs sharing a middle element: - \( (1,2) \in R \) and \( (2,1) \in R \): we need \( (1,1) \in R \). Yes, it is present. - \( (2,1) \in R \) and \( (1,2) \in R \): we need \( (2,2) \in R \). Yes, it is present. - \( (3,4) \in R \) and \( (4,3) \in R \): we need \( (3,3) \in R \). Yes, it is present. - \( (4,3) \in R \) and \( (3,4) \in R \): we need \( (4,4) \in R \). Yes, it is present. Crucially, check: \( (1,2) \in R \) and \( (2,2) \in R \Rightarrow (1,2) \in R \). Present. Similarly all other combinations via diagonal pairs work trivially. Now check cross-group: Is \( (1,3) \) ever forced? For that we would need \( (1,x) \in R \) and \( (x,3) \in R \). The elements related to 1 are 1 and 2. Neither \( (1,3) \) nor \( (2,3) \) is in R, so no cross-group transitivity is required. R is transitive. Since R is reflexive, symmetric, and transitive, Assertion (A) is TRUE. Step 3: Determine the relationship between A and R. Reason (R) states the definition of an equivalence relation, which is exactly the criterion used to verify Assertion (A). Hence Reason (R) is the correct explanation of Assertion (A). Conclusion: Both Assertion (A) and Reason (R) are true, and Reason (R) is the correct explanation of Assertion (A).

Answer: (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).

Example 2

Question: Assertion (A): The relation \( R \) on the set \( A = \{1, 2, 3\} \) defined as \( R = \{(1,1),(2,2),(3,3),(1,2),(2,3)\} \) is an equivalence relation. Reason (R): A relation that is reflexive, symmetric, and transitive is called an equivalence relation. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution: Step 1: Analyse Reason (R). The statement that a relation which is reflexive, symmetric, and transitive is an equivalence relation is the standard correct definition taught in CBSE Class 12. Hence Reason (R) is TRUE. Step 2: Check Assertion (A) — verify whether R is an equivalence relation on \( A = \{1,2,3\} \). The given relation is \( R = \{(1,1),(2,2),(3,3),(1,2),(2,3)\} \). Reflexivity: We need \( (1,1),(2,2),(3,3) \in R \). All three are present, so R is reflexive. Symmetry: We need to check every non-diagonal pair. - \( (1,2) \in R \) but is \( (2,1) \in R \)? No, \( (2,1) \notin R \). Since \( (1,2) \in R \) but \( (2,1) \notin R \), the relation R is NOT symmetric. Because R fails to be symmetric, R is NOT an equivalence relation. We do not need to check transitivity further (though transitivity also fails: \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \)). Hence Assertion (A) is FALSE. Step 3: Determine the relationship between A and R. Assertion (A) is false. Reason (R) is true. Conclusion: Assertion (A) is false, but Reason (R) is true.

Answer: (D) Assertion (A) is false, but Reason (R) is true.

🎯 Try a Similar Question

Try a Similar Question

Question: Assertion (A): A relation R on the set \( \{1, 2, 3\} \) defined as \( R = \{(1,1),(2,2),(1,2),(2,3),(1,3)\} \) is an equivalence relation. Reason (R): A relation that is reflexive, symmetric and transitive is called an equivalence relation. (A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Solution

  1. Step 1: Check the Reason (R): Reason (R) states: A relation that is reflexive, symmetric, and transitive is called an equivalence relation. This is the standard definition of an equivalence relation and is completely TRUE.
  2. Step 2: Check Reflexivity of R in Assertion (A): The set is \( \{1, 2, 3\} \). For reflexivity, we need \( (1,1), (2,2), (3,3) \in R \). Looking at \( R = \{(1,1),(2,2),(1,2),(2,3),(1,3)\} \), we see that \( (3,3) \notin R \). Hence R is NOT reflexive.
  3. Step 3: Check Symmetry of R: For symmetry, if \( (a,b) \in R \) then \( (b,a) \in R \). We have \( (1,2) \in R \), but \( (2,1) \notin R \). Hence R is NOT symmetric either.
  4. Step 4: Check Transitivity of R: For transitivity, if \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). We have \( (1,2) \in R \) and \( (2,3) \in R \), and indeed \( (1,3) \in R \). Also \( (1,1) \in R \) and \( (1,2) \in R \) gives \( (1,2) \in R \). So transitivity holds. However, since reflexivity and symmetry both fail, R is still NOT an equivalence relation.
  5. Step 5: Evaluate the Assertion (A): Since R is neither reflexive (missing \( (3,3) \)) nor symmetric (missing \( (2,1) \)), R is NOT an equivalence relation. Therefore, Assertion (A) is FALSE.
  6. Step 6: Choose the Correct Option: Assertion (A) is false, and Reason (R) is true. This corresponds to option (D).

Answer: Assertion (A) is false, but Reason (R) is true. The correct option is (D).

Everything you get with Solver7

More questions in Relations and Functions