Show that the relation R in the set \(\{1, 2, 3\}\) given by \(R=\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3) \}\) is reflexive but neither symmetric 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. A relation is just a list of pairs showing who is 'connected' to whom. Every person is connected to themselves — that is called reflexive. If person 1 is connected to person 2, symmetry means person 2 must also connect back to person 1. Here, 1 connects to 2 but 2 does not connect back, so symmetry fails. Transitivity means if 1 connects to 2 and 2 connects to 3, then 1 must connect to 3 — but that pair is missing here.
Answer: The relation \( R \) is reflexive because \( (1,1), (2,2), (3,3) \in R \). It is not symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). It is 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 \). To classify a relation we test three properties. A relation is reflexive if every element is related to itself, that is \( (a, a) \in R \) for all \( a \in A \). It is symmetric if whenever \( (a, b) \in R \) then \( (b, a) \in R \) too. It is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). To prove a property fails, we only need one counterexample. To prove a property holds, we must verify it for all required cases. Here the set is \( A = \{1, 2, 3\} \) and \( R = \{(1,1), (2,2), (3,3), (1,2), (2,3)\} \).
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 \).
The relation \( R \) is reflexive because \( (1,1), (2,2), (3,3) \in R \). It is not symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). It is not transitive because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).
A common mistake is thinking that finding just one symmetric or transitive pair proves the whole relation has that property. To conclude a property holds you must check all required cases, but to conclude it fails, a single counterexample is enough.
The relation \( R \) is reflexive because \( (1,1), (2,2), (3,3) \in R \). It is not symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). It is not transitive because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).
One common mistake: students check only a few pairs for reflexivity and assume the rest hold, or they forget to check whether the reverse of every pair exists when testing symmetry — always verify all required pairs systematically.
Answer: The relation \( R \) is reflexive because \( (1,1), (2,2), (3,3) \in R \). It is not symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). It is not transitive because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).
Question: Let \( A = \{4, 5, 6\} \). Define a relation \( R \) on \( A \) by \( R = \{(4,4),\,(5,5),\,(6,6),\,(4,5),\,(5,6)\} \). Show that \( R \) is reflexive but neither symmetric nor transitive.
Solution: We check each property one by one. Step 1 — Check Reflexivity: For \( R \) to be reflexive, we need \( (a, a) \in R \) for every \( a \in A = \{4, 5, 6\} \). We observe that \( (4,4) \in R \), \( (5,5) \in R \), and \( (6,6) \in R \). Since all diagonal pairs are present, \( R \) is reflexive. Step 2 — Check Symmetry: For symmetry, whenever \( (a, b) \in R \), we need \( (b, a) \in R \). Notice that \( (4, 5) \in R \), but \( (5, 4) \notin R \). This violates the symmetric condition. Hence \( R \) is NOT symmetric. Step 3 — Check Transitivity: For transitivity, whenever \( (a, b) \in R \) and \( (b, c) \in R \), we need \( (a, c) \in R \). We have \( (4, 5) \in R \) and \( (5, 6) \in R \). Transitivity requires \( (4, 6) \in R \). However, \( (4, 6) \notin R \). This violates the transitive condition. Hence \( R \) is NOT transitive.
Answer: R is reflexive (all diagonal pairs present), but not symmetric (since (4,5) ∈ R yet (5,4) ∉ R), and not transitive (since (4,5) ∈ R and (5,6) ∈ R but (4,6) ∉ R).
Question: Let \( A = \{a, b, c\} \). Define a relation \( R \) on \( A \) by \( R = \{(a,a),\,(b,b),\,(c,c),\,(b,a),\,(c,b)\} \). Show that \( R \) is reflexive but neither symmetric nor transitive.
Solution: We check each property one by one. Step 1 — Check Reflexivity: For \( R \) to be reflexive, we need \( (x, x) \in R \) for every \( x \in A = \{a, b, c\} \). We observe that \( (a,a) \in R \), \( (b,b) \in R \), and \( (c,c) \in R \). All required diagonal pairs are present, so \( R \) is reflexive. Step 2 — Check Symmetry: For symmetry, whenever \( (x, y) \in R \), we need \( (y, x) \in R \). We note that \( (b, a) \in R \), but \( (a, b) \notin R \). This violates symmetry. Hence \( R \) is NOT symmetric. Step 3 — Check Transitivity: For transitivity, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). We have \( (c, b) \in R \) and \( (b, a) \in R \). Transitivity requires \( (c, a) \in R \). However, \( (c, a) \notin R \). This violates the transitive condition. Hence \( R \) is NOT transitive.
Answer: R is reflexive (all diagonal pairs present), but not symmetric (since (b,a) ∈ R yet (a,b) ∉ R), and not transitive (since (c,b) ∈ R and (b,a) ∈ R but (c,a) ∉ R).
Question: Let A = {1, 2, 3, 4}. Consider the relation R on A defined by R = {(1,1), (2,2), (3,3), (4,4), (2,3), (3,4)}. Show that R is reflexive but neither symmetric nor transitive.
Answer: The relation R on A = {1, 2, 3, 4} given by R = {(1,1), (2,2), (3,3), (4,4), (2,3), (3,4)} is reflexive because \((1,1), (2,2), (3,3), (4,4) \in R\). It is not symmetric because \((2,3) \in R\) but \((3,2) \notin R\). It is not transitive because \((2,3) \in R\) and \((3,4) \in R\) but \((2,4) \notin R\).