Show that the relation \(R\) in the set \(\{1, 2, 3\}\) given by \(R =\{(1, 2), (2, 1)\}\) is symmetric but neither reflexive nor transitive.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a group of three friends: 1, 2, and 3. The relation \( R = \\{(1,2),(2,1)\\} \) is like a list of "who waves at whom." For reflexive, everyone must wave at themselves — but nobody does here, so it fails. For symmetric, if 1 waves at 2, then 2 must wave back at 1 — and that happens perfectly. For transitive, if 1 waves at 2 and 2 waves at 1, then 1 should wave at 1 — but that pair is missing. So only symmetry holds.
Answer: The relation \( R = \{(1,2),(2,1)\} \) on \( \{1,2,3\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)).
A relation \( R \) on a set \( A \) is just a collection of ordered pairs from \( A \times A \). To classify it, we test three properties. Reflexive means every element is related to itself, so \( (a,a) \in R \) for all \( a \in A \). Symmetric means whenever \( (a,b) \in R \), the reversed pair \( (b,a) \in R \) too. Transitive means whenever \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). Here the set is \( A = \{1,2,3\} \) and \( R = \{(1,2),(2,1)\} \). We simply match this small relation against each definition.
Reflexive: \( (a,a) \in R \ \forall a \in A \). Symmetric: \( (a,b) \in R \Rightarrow (b,a) \in R \). Transitive: \( (a,b) \in R \ \text{and}\ (b,c) \in R \Rightarrow (a,c) \in R \).
The relation \( R = \{(1,2),(2,1)\} \) on \( \{1,2,3\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)).
A common error is to think the relation is transitive just because it looks 'complete'. Students forget that \( (1,2) \) and \( (2,1) \) force the pair \( (1,1) \) to be present; since it is absent, transitivity fails. Always test the specific chain of pairs rather than judging by appearance.
The relation \( R = \{(1,2),(2,1)\} \) on \( \{1,2,3\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)).
One common mistake: students often assume that because a relation is symmetric it must also be transitive, but this example shows clearly that symmetry and transitivity are independent — \( R \) is symmetric yet fails transitivity because \( (1,2),(2,1) \in R \) does not lead to \( (1,1) \in R \).
Answer: The relation \( R = \{(1,2),(2,1)\} \) on \( \{1,2,3\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)).
Question: Let A = {1, 2, 3, 4}. Show that the relation R = {(1, 3), (3, 1), (2, 4), (4, 2)} defined on A is symmetric but neither reflexive nor transitive.
Solution: We check each property of the relation R = {(1, 3), (3, 1), (2, 4), (4, 2)} on the set A = {1, 2, 3, 4}. Step 1 — Check Reflexivity: For R to be reflexive, we need \( (a, a) \in R \) for every \( a \in A \). We observe that \( (1,1) \notin R \), \( (2,2) \notin R \), \( (3,3) \notin R \), and \( (4,4) \notin R \). Since none of the diagonal pairs belong to R, the relation is NOT reflexive. Step 2 — Check Symmetry: For R to be symmetric, whenever \( (a, b) \in R \), we need \( (b, a) \in R \). We verify each ordered pair: - \( (1, 3) \in R \) and \( (3, 1) \in R \). ✓ - \( (3, 1) \in R \) and \( (1, 3) \in R \). ✓ - \( (2, 4) \in R \) and \( (4, 2) \in R \). ✓ - \( (4, 2) \in R \) and \( (2, 4) \in R \). ✓ Since all conditions are satisfied, R is SYMMETRIC. Step 3 — Check Transitivity: For R to be transitive, whenever \( (a, b) \in R \) and \( (b, c) \in R \), we need \( (a, c) \in R \). Consider the pairs \( (1, 3) \in R \) and \( (3, 1) \in R \). By transitivity, we would require \( (1, 1) \in R \). However, \( (1, 1) \notin R \). Therefore, R is NOT transitive. Conclusion: R is symmetric but neither reflexive nor transitive.
Answer: R is symmetric but neither reflexive nor transitive.
Question: Let A = {a, b, c}. Consider the relation R = {(a, b), (b, a), (b, c), (c, b)} on A. Check whether R is symmetric, reflexive, or transitive.
Solution: We check each property of the relation R = {(a, b), (b, a), (b, c), (c, b)} on A = {a, b, c}. Step 1 — Check Reflexivity: For R to be reflexive, we need \( (x, x) \in R \) for every \( x \in A \). We observe that \( (a, a) \notin R \). Since at least one element is not related to itself, R is NOT reflexive. Step 2 — Check Symmetry: For R to be symmetric, whenever \( (x, y) \in R \), we need \( (y, x) \in R \). We verify: - \( (a, b) \in R \) and \( (b, a) \in R \). ✓ - \( (b, a) \in R \) and \( (a, b) \in R \). ✓ - \( (b, c) \in R \) and \( (c, b) \in R \). ✓ - \( (c, b) \in R \) and \( (b, c) \in R \). ✓ All conditions are satisfied, so R is SYMMETRIC. Step 3 — Check Transitivity: For R to be transitive, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). Consider \( (a, b) \in R \) and \( (b, c) \in R \). By transitivity, we would need \( (a, c) \in R \). However, \( (a, c) \notin R \). Therefore, R is NOT transitive. Conclusion: R is symmetric but neither reflexive nor transitive.
Answer: R is symmetric but neither reflexive nor transitive.
Question: Let \( A = \{1, 2, 3, 4\} \) and let \( R = \{(1, 3), (3, 1), (2, 4), (4, 2)\} \) be a relation on \( A \). Show that \( R \) is symmetric but neither reflexive nor transitive.
Answer: The relation \( R = \{(1, 3), (3, 1), (2, 4), (4, 2)\} \) on \( A = \{1, 2, 3, 4\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,3),(3,1) \in R \) but \( (1,1) \notin R \)).