Give an example of a relation. Which is Symmetric and transitive but not reflexive.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine three friends: 1, 2, and 3. A relation is like a list of who-knows-who pairs. We want a list where friends know each other back (symmetric) and knowing through a friend counts too (transitive). But we sneak out the pair for friend 3 knowing himself. Friends 1 and 2 each know themselves and each other, so those rules still work fine. Friend 3 just never appears, so the rule about everyone knowing themselves breaks. That one missing pair makes the whole relation not reflexive.
Answer: On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 1), (2, 2), (1, 2), (2, 1)\} \) is symmetric and transitive but not reflexive (because \( (3, 3) \notin R \)).
A relation \( R \) on a set \( A \) is a subset of \( A \times A \). Recall the three properties: (i) Reflexive means \( (a, a) \in R \) for every element \( a \in A \). (ii) Symmetric means whenever \( (a, b) \in R \), we also have \( (b, a) \in R \). (iii) Transitive means whenever \( (a, b) \in R \) and \( (b, c) \in R \), we have \( (a, c) \in R \). To get a relation that is symmetric and transitive but not reflexive, we simply leave out at least one pair of the form \( (a, a) \), so that some element of the set is not related to itself.
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 \).
On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 1), (2, 2), (1, 2), (2, 1)\} \) is symmetric and transitive but not reflexive (because \( (3, 3) \notin R \)).
A common error is to think that if a relation is symmetric and transitive it must automatically be reflexive. This is false: reflexivity requires \( (a,a) \in R \) for EVERY element, and if some element (like 3 above) never appears in any pair, that condition can never be triggered by symmetry or transitivity.
On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 1), (2, 2), (1, 2), (2, 1)\} \) is symmetric and transitive but not reflexive (because \( (3, 3) \notin R \)).
One common mistake: students assume that if a relation is both symmetric and transitive then it must automatically be reflexive (reasoning that \( (a,b) \in R \) and \( (b,a) \in R \) give \( (a,a) \in R \) by transitivity). This reasoning fails because an element like 3 that does not appear in any pair at all creates no such obligation — reflexivity still requires \( (3,3) \in R \) explicitly.
Answer: On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 1), (2, 2), (1, 2), (2, 1)\} \) is symmetric and transitive but not reflexive (because \( (3, 3) \notin R \)).
Question: Let \( A = \{1, 2, 3, 4\} \). Define a relation \( R \) on \( A \) by \[ R = \{(2, 4),\, (4, 2),\, (2, 2),\, (4, 4)\} \] Verify that \( R \) is symmetric and transitive but NOT reflexive.
Solution: We check each property in turn. Checking Reflexivity: For R to be reflexive, every element of A must be related to itself, i.e., (a, a) ∈ R for all a ∈ A. The element \( 1 \in A \), but \( (1, 1) \notin R \). Similarly \( (3, 3) \notin R \). Hence R is NOT reflexive. Checking Symmetry: We verify that whenever \( (a, b) \in R \), we also have \( (b, a) \in R \). For \( (2, 4) \in R \): we check \( (4, 2) \in R \). Yes. For \( (4, 2) \in R \): we check \( (2, 4) \in R \). Yes. For \( (2, 2) \in R \): we need \( (2, 2) \in R \). Yes (it is its own reverse). For \( (4, 4) \in R \): we need \( (4, 4) \in R \). Yes. So R is symmetric. Checking Transitivity: We verify that whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Case 1: \( (2, 4) \in R \) and \( (4, 2) \in R \) — we need \( (2, 2) \in R \). Yes. Case 2: \( (4, 2) \in R \) and \( (2, 4) \in R \) — we need \( (4, 4) \in R \). Yes. Case 3: \( (2, 4) \in R \) and \( (4, 4) \in R \) — we need \( (2, 4) \in R \). Yes. Case 4: \( (4, 2) \in R \) and \( (2, 2) \in R \) — we need \( (4, 2) \in R \). Yes. Case 5: \( (2, 2) \in R \) and \( (2, 4) \in R \) — we need \( (2, 4) \in R \). Yes. Case 6: \( (4, 4) \in R \) and \( (4, 2) \in R \) — we need \( (4, 2) \in R \). Yes. All other combinations involving elements not in R vacuously hold. So R is transitive. Conclusion: R is symmetric and transitive but not reflexive (since \( (1,1) \notin R \) and \( (3,3) \notin R \)).
Answer: R is symmetric and transitive but NOT reflexive, because elements 1 and 3 in A are never related to themselves.
Question: On the set \( A = \{a, b, c\} \), define a relation \[ R = \{(a, b),\, (b, a),\, (a, a),\, (b, b)\} \] Show that R is symmetric and transitive but not reflexive.
Solution: We examine all three properties. Checking Reflexivity: For R to be reflexive, we need \( (x, x) \in R \) for every \( x \in A \). Since \( c \in A \) but \( (c, c) \notin R \), the relation R is NOT reflexive. Checking Symmetry: We go through each ordered pair in R: For \( (a, b) \in R \): is \( (b, a) \in R \)? Yes. For \( (b, a) \in R \): is \( (a, b) \in R \)? Yes. For \( (a, a) \in R \): is \( (a, a) \in R \)? Yes (self-symmetric). For \( (b, b) \in R \): is \( (b, b) \in R \)? Yes (self-symmetric). Hence R is symmetric. Checking Transitivity: We check all combinations \( (x, y) \in R \) and \( (y, z) \in R \): Case 1: \( (a, b) \in R \) and \( (b, a) \in R \) — need \( (a, a) \in R \). Yes. Case 2: \( (a, b) \in R \) and \( (b, b) \in R \) — need \( (a, b) \in R \). Yes. Case 3: \( (b, a) \in R \) and \( (a, b) \in R \) — need \( (b, b) \in R \). Yes. Case 4: \( (b, a) \in R \) and \( (a, a) \in R \) — need \( (b, a) \in R \). Yes. Case 5: \( (a, a) \in R \) and \( (a, b) \in R \) — need \( (a, b) \in R \). Yes. Case 6: \( (a, a) \in R \) and \( (a, a) \in R \) — need \( (a, a) \in R \). Yes. Case 7: \( (b, b) \in R \) and \( (b, a) \in R \) — need \( (b, a) \in R \). Yes. Case 8: \( (b, b) \in R \) and \( (b, b) \in R \) — need \( (b, b) \in R \). Yes. All required pairs are present. Hence R is transitive. Conclusion: R is symmetric and transitive but not reflexive, since \( c \in A \) but \( (c, c) \notin R \).
Answer: R is symmetric and transitive but NOT reflexive, because the element c in A has no self-pair (c, c) in R.
Question: On the set \( B = \{4, 5, 6\} \), define a relation and verify that it is symmetric and transitive but NOT reflexive.
Answer: On the set \( B = \{4, 5, 6\} \), the relation \( R = \{(4, 5),\ (5, 4),\ (4, 4),\ (5, 5)\} \) is symmetric and transitive but NOT reflexive, because \( (6, 6) \notin R \).