Give an example of a relation. Which is Reflexive and symmetric but not transitive.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine three friends: 1, 2, and 3. Every friend is friends with themselves (reflexive). Friend 1 and Friend 2 are mutual friends, and Friend 2 and Friend 3 are mutual friends (symmetric). But Friend 1 and Friend 3 have never met! Normally, we might expect friends-of-friends to know each other, but here they do not. That broken link is exactly what makes this relation fail the transitivity rule.
Answer: On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} \] is reflexive and symmetric but not transitive, because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).
A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). We check 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 \), we also have \( (b,a) \in R \). Transitive means whenever \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). To get a relation that is reflexive and symmetric but NOT transitive, we deliberately connect two chains through a middle element without connecting the outer elements, which breaks transitivity while keeping the other two properties intact.
For a relation \( R \) on set \( A \): Reflexive: \( (a,a) \in R \ \forall 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 \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} \] is reflexive and symmetric but not transitive, because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).
A common mistake is including the pair \( (1,3) \) (and its reverse) to keep things symmetric, but doing so accidentally makes the relation transitive too. To break transitivity, you must leave out the 'end-to-end' pair while keeping both middle links present.
On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} \] is reflexive and symmetric but not transitive, because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).
One common mistake: Students sometimes add \( (1,3) \) and \( (3,1) \) to try to 'complete' the relation, which would make it transitive (in fact, an equivalence relation) and defeat the purpose — the whole point is to leave exactly this pair out to break transitivity while keeping the other two properties intact.
Answer: On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} \] is reflexive and symmetric but not transitive, because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).
Question: Let \( A = \{1, 2, 3\} \). Define a relation R on A as \[ R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)\} \] Show that R is reflexive and symmetric but not transitive.
Solution: We check each property in turn. Step 1 — Reflexive: A relation is reflexive if \( (a, a) \in R \) for every \( a \in A \). We observe that \( (1,1) \in R \), \( (2,2) \in R \), and \( (3,3) \in R \). Hence R is reflexive. Step 2 — Symmetric: A relation is symmetric if whenever \( (a, b) \in R \) then \( (b, a) \in R \). Checking the non-diagonal pairs: \( (1,2) \in R \) and \( (2,1) \in R \); also \( (2,3) \in R \) and \( (3,2) \in R \). There are no other non-diagonal pairs. Hence R is symmetric. Step 3 — Not Transitive: A relation is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Consider \( a = 1,\, b = 2,\, c = 3 \). We have \( (1, 2) \in R \) and \( (2, 3) \in R \). For transitivity we need \( (1, 3) \in R \). But \( (1, 3) \notin R \). Hence R is NOT transitive. Conclusion: R is reflexive and symmetric but not transitive.
Answer: R = {(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)} is reflexive and symmetric but not transitive.
Question: Let \( A = \{p, q, r, s\} \). Define a relation R on A as \[ R = \{(p,p),(q,q),(r,r),(s,s),(p,q),(q,p),(q,r),(r,q)\} \] Examine whether R is reflexive, symmetric, and transitive.
Solution: We check each property in turn. Step 1 — Reflexive: For every element in A we need \( (a,a) \in R \). We have \( (p,p) \in R \), \( (q,q) \in R \), \( (r,r) \in R \), and \( (s,s) \in R \). All elements are related to themselves, so R is reflexive. Step 2 — Symmetric: Check every non-diagonal ordered pair. \( (p,q) \in R \) and \( (q,p) \in R \) — symmetric pair present. \( (q,r) \in R \) and \( (r,q) \in R \) — symmetric pair present. No other non-diagonal pairs exist. Hence R is symmetric. Step 3 — Not Transitive: Take \( a = p,\, b = q,\, c = r \). We have \( (p, q) \in R \) and \( (q, r) \in R \). Transitivity requires \( (p, r) \in R \). However \( (p, r) \notin R \). Therefore R is NOT transitive. Conclusion: R is reflexive and symmetric but not transitive.
Answer: R = {(p,p),(q,q),(r,r),(s,s),(p,q),(q,p),(q,r),(r,q)} is reflexive and symmetric but not transitive.
Question: Let \( A = \{a, b, c\} \). Define a relation \( R \) on \( A \) such that \( R \) is reflexive and symmetric but NOT transitive. Verify each property for your chosen relation.
Answer: On \( A = \{a, b, c\} \), the relation \[ R = \{(a,a),\,(b,b),\,(c,c),\,(a,b),\,(b,a),\,(b,c),\,(c,b)\} \] is reflexive and symmetric but not transitive, because \( (a,b) \in R \) and \( (b,c) \in R \) but \( (a,c) \notin R \).