Give an example of a relation. Which is Symmetric but neither reflexive nor transitive.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine you have three friends numbered 1, 2, and 3. A relation is like a list of "who likes who." Our list says: 1 likes 2, and 2 likes 1. That is symmetric, like a mutual friendship. But 1 does not like itself, so it is not reflexive. Also, since 1 likes 2 and 2 likes 1, we would need 1 to like 1 for transitivity, but that is missing. So the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric only.
Answer: On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric (since both a pair and its reverse are present), not reflexive (since \( (1, 1) \notin R \)), and not transitive (since \( (1, 2) \in R \) and \( (2, 1) \in R \) but \( (1, 1) \notin R \)).
A relation \( R \) on a set \( A \) is a subset of \( A \times A \). We check three properties. Reflexive means every element is related to itself, i.e. \( (a, a) \in R \) for all \( a \in A \). Symmetric means whenever \( (a, b) \in R \), we also have \( (b, a) \in R \). Transitive means whenever \( (a, b) \in R \) and \( (b, c) \in R \), we must have \( (a, c) \in R \). To build the required example, we deliberately make sure symmetry holds, but break reflexivity (by leaving out at least one pair \( (a, a) \)) and break transitivity (by having \( (a, b) \) and \( (b, a) \) present but \( (a, a) \) absent).
Reflexive: \( (a,a) \in R \) for all \( a \in A \). Symmetric: \( (a,b) \in R \Rightarrow (b,a) \in R \). Transitive: \( (a,b) \in R \) and \( (b,c) \in R \Rightarrow (a,c) \in R \).
On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric (since both a pair and its reverse are present), not reflexive (since \( (1, 1) \notin R \)), and not transitive (since \( (1, 2) \in R \) and \( (2, 1) \in R \) but \( (1, 1) \notin R \)).
A common mistake is to include the pairs \( (1, 2), (2, 1) \) and then think the relation is transitive because it 'looks fine'. Students forget that \( (1, 2) \) and \( (2, 1) \) together demand \( (1, 1) \); if \( (1, 1) \) is missing, transitivity actually fails, which is precisely what we want here.
On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric (since both a pair and its reverse are present), not reflexive (since \( (1, 1) \notin R \)), and not transitive (since \( (1, 2) \in R \) and \( (2, 1) \in R \) but \( (1, 1) \notin R \)).
One common mistake: students often assume that a symmetric relation must also be reflexive, forgetting that symmetry only governs pairs of distinct elements and says nothing about self-pairs like \( (1, 1) \).
Answer: On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric (since both a pair and its reverse are present), not reflexive (since \( (1, 1) \notin R \)), and not transitive (since \( (1, 2) \in R \) and \( (2, 1) \in R \) but \( (1, 1) \notin R \)).
Question: Let A = {1, 2, 3, 4}. Define a relation R on A as R = {(1, 2), (2, 1), (3, 4), (4, 3)}. Show that R is Symmetric but neither Reflexive nor Transitive.
Solution: We check each property for the relation R = {(1, 2), (2, 1), (3, 4), (4, 3)} defined on A = {1, 2, 3, 4}. Step 1 — Reflexivity Check: For R to be reflexive, every element must be related to itself, i.e., (a, a) must be in R for all a in A. Checking: (1, 1), (2, 2), (3, 3), and (4, 4) are all absent from R. Since none of the pairs (a, a) belong to R, the relation R is NOT Reflexive. Step 2 — Symmetry Check: For each pair (a, b) in R, we must verify (b, a) is also in R. We check: (1, 2) is in R and (2, 1) is in R. ✓ (2, 1) is in R and (1, 2) is in R. ✓ (3, 4) is in R and (4, 3) is in R. ✓ (4, 3) is in R and (3, 4) is in R. ✓ Since for every (a, b) in R we have (b, a) also in R, the relation R is Symmetric. Step 3 — Transitivity Check: For R to be transitive, whenever (a, b) and (b, c) are in R, then (a, c) must also be in R. Consider (1, 2) and (2, 1) which are both in R. This requires (1, 1) to be in R. But (1, 1) is NOT in R. So R is NOT Transitive.
Answer: R = {(1, 2), (2, 1), (3, 4), (4, 3)} is Symmetric but neither Reflexive nor Transitive.
Question: Let A be the set of all students in a class. Define a relation R on A as: (a, b) belongs to R if and only if a and b are best friends with each other (and being a best friend is mutual but a person is not considered their own best friend, and having a common best friend does not make two people best friends directly). Give a concrete finite example to illustrate that such a relation can be Symmetric but neither Reflexive nor Transitive.
Solution: Let A = {P, Q, R} represent three students, and define the relation R on A as: R = {(P, Q), (Q, P)} This captures the idea that P and Q are best friends with each other, but Q and R are not, and no one is their own best friend. Step 1 — Reflexivity Check: For reflexivity, (P, P), (Q, Q), and (R, R) must all be in R. None of them are present in R = {(P, Q), (Q, P)}. So R is NOT Reflexive. Step 2 — Symmetry Check: For every pair in R, the reverse must also be in R. (P, Q) is in R and (Q, P) is in R. ✓ (Q, P) is in R and (P, Q) is in R. ✓ There are no other pairs to check. So R is Symmetric. Step 3 — Transitivity Check: For transitivity, (a, b) in R and (b, c) in R must imply (a, c) is in R. Consider (P, Q) and (Q, P) which are both in R. This would require (P, P) to be in R. But (P, P) is NOT in R. So R is NOT Transitive. Thus the relation R = {(P, Q), (Q, P)} on A = {P, Q, R} is Symmetric but neither Reflexive nor Transitive.
Answer: R = {(P, Q), (Q, P)} on A = {P, Q, R} is Symmetric but neither Reflexive nor Transitive.
Question: Let A = {4, 5, 6}. Define a relation R on A by R = {(4, 5), (5, 4), (5, 6), (6, 5)}. Check whether R is (i) reflexive, (ii) symmetric, and (iii) transitive. Hence classify R.
Answer: On the set \( A = \{4, 5, 6\} \), the relation \( R = \{(4, 5), (5, 4), (5, 6), (6, 5)\} \) is symmetric (since the reverse of every pair is also in R), not reflexive (since \( (4, 4) \notin R \)), and not transitive (since \( (4, 5) \in R \) and \( (5, 6) \in R \) but \( (4, 6) \notin R \)).