Give an example of a relation. Which is Transitive but neither reflexive nor symmetric.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a group of three friends numbered 1, 2, and 3. A relation is just a list of who is 'connected' to whom. We pick only one connection: 1 is connected to 2. Nobody is connected to themselves, so the relation is not reflexive. Since 2 is not connected back to 1, it is not symmetric either. But transitivity only breaks when a chain like 1 to 2 and 2 to 3 exists without 1 to 3 — no such chain exists here, so transitivity holds perfectly.
Answer: On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2)\} \) is transitive but neither reflexive nor symmetric.
A relation \( R \) on a set \( A \) is a subset of \( A \times A \). We test three properties. A relation is reflexive if \( (a, a) \in R \) for every element \( a \in A \). It is symmetric if whenever \( (a, b) \in R \), then \( (b, a) \in R \) as well. It is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). To answer this question, we need a relation that satisfies transitivity but fails both reflexivity and symmetry. A very simple approach is to work on a small finite set and pick just a few ordered pairs, then check each property carefully.
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, 2)\} \) is transitive but neither reflexive nor symmetric.
A common mistake is thinking a relation with only one pair cannot be transitive. In fact, transitivity is vacuously true whenever there is no pair of the form \( (a, b) \) and \( (b, c) \) to chain together, so such a relation still counts as transitive.
On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2)\} \) is transitive but neither reflexive nor symmetric.
One common mistake: Students often assume that a very small or 'sparse' relation cannot be transitive, forgetting that transitivity holds vacuously when no two consecutive pairs \( (a,b) \) and \( (b,c) \) both appear in \( R \) — there is no counterexample to transitivity if the required chain never forms.
Answer: On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2)\} \) is transitive but neither reflexive nor symmetric.
Question: Let \( A = \{1, 2, 3, 4\} \). Define a relation R on A as \( R = \{(1, 2), (2, 3), (1, 3)\} \). Verify that R is transitive but neither reflexive nor symmetric.
Solution: We check each property in turn. Step 1 — Check Reflexivity: For R to be reflexive, we need \( (a, a) \in R \) for every \( a \in A \). However, \( (1,1) \notin R \), \( (2,2) \notin R \), \( (3,3) \notin R \), and \( (4,4) \notin R \). Since no element is related to itself, R is NOT reflexive. Step 2 — Check Symmetry: For R to be symmetric, whenever \( (a, b) \in R \) we need \( (b, a) \in R \). We observe that \( (1, 2) \in R \) but \( (2, 1) \notin R \). Hence R is NOT symmetric. Step 3 — Check Transitivity: We must verify: if \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). The only chain to check is \( (1, 2) \in R \) and \( (2, 3) \in R \). We need \( (1, 3) \in R \), and indeed \( (1, 3) \in R \). No other pair of elements in R forms a composable chain, so the condition holds vacuously for all other cases. Therefore R is transitive. Conclusion: \( R = \{(1, 2), (2, 3), (1, 3)\} \) is transitive but neither reflexive nor symmetric.
Answer: R = {(1, 2), (2, 3), (1, 3)} is transitive but neither reflexive nor symmetric.
Question: Let \( A = \{p, q, r\} \). Define a relation R on A as \( R = \{(p, q), (p, r), (q, r)\} \). Verify that R is transitive but neither reflexive nor symmetric.
Solution: We check each property in turn. Step 1 — Check Reflexivity: For R to be reflexive, we need \( (x, x) \in R \) for all \( x \in A \). But \( (p, p) \notin R \), \( (q, q) \notin R \), and \( (r, r) \notin R \). Hence R is NOT reflexive. Step 2 — Check Symmetry: For symmetry, whenever \( (x, y) \in R \) we need \( (y, x) \in R \). We see that \( (p, q) \in R \) but \( (q, p) \notin R \). Hence R is NOT symmetric. Step 3 — Check Transitivity: We list all composable pairs: Case (i): \( (p, q) \in R \) and \( (q, r) \in R \). We require \( (p, r) \in R \), and indeed \( (p, r) \in R \). This condition is satisfied. Case (ii): \( (p, r) \in R \). There is no element \( s \in A \) with \( (r, s) \in R \), so no further requirement arises from this pair. Case (iii): \( (q, r) \in R \). Similarly, there is no \( s \in A \) with \( (r, s) \in R \), so no further requirement arises. All transitivity conditions are satisfied, so R is transitive. Conclusion: \( R = \{(p, q), (p, r), (q, r)\} \) is transitive but neither reflexive nor symmetric.
Answer: R = {(p, q), (p, r), (q, r)} is transitive but neither reflexive nor symmetric.
Question: On the set \( A = \{4, 5, 6\} \), define a relation R. Give an example of a relation on A that is transitive but neither reflexive nor symmetric. Verify all three properties for your relation.
Answer: On the set \( A = \{4, 5, 6\} \), the relation \( R = \{(4, 5), (5, 6), (4, 6)\} \) is transitive but neither reflexive nor symmetric.