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.