Give an example of a relation. Which is Reflexive and transitive but not symmetric.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a queue where taller people stand behind shorter ones. Every person is at least as tall as themselves, so the 'at least as tall' rule always includes yourself. If person A is taller than B, B is NOT taller than A, so the rule is not two-way. Yet if A is taller than B and B is taller than C, then A is definitely taller than C too. This 'bigger or equal' idea is the heart of our example relation on the set \( \{1, 2, 3\} \).
Answer: On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\} \] is reflexive and transitive but not symmetric. Equivalently, the relation \( R = \{(a,b) : a \le b\} \) on \( \mathbb{R} \) works too.
A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). We check three main 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 also \( (b, a) \in R \). It is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). A very natural example that is reflexive and transitive but NOT symmetric is the 'less than or equal to' relation \( \le \) on real numbers, or we can build a simple finite example on a small set. We want a relation where being related in one direction does not force the reverse direction.
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 \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\} \] is reflexive and transitive but not symmetric. Equivalently, the relation \( R = \{(a,b) : a \le b\} \) on \( \mathbb{R} \) works too.
A common mistake is to declare a relation not symmetric without producing a specific witness pair. You must clearly show one pair \( (a,b) \in R \) whose reverse \( (b,a) \notin R \), such as \( (1,2) \in R \) but \( (2,1) \notin R \).
On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\} \] is reflexive and transitive but not symmetric. Equivalently, the relation \( R = \{(a,b) : a \le b\} \) on \( \mathbb{R} \) works too.
One common mistake: students sometimes confuse transitivity with symmetry and add the reverse pairs \( (2,1) \), \( (3,2) \), \( (3,1) \) to 'complete' the relation, which would make it symmetric and destroy the intended example — transitivity only demands that chains \( a \to b \to c \) imply \( a \to c \), not that every one-step link has a reverse.
Answer: On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\} \] is reflexive and transitive but not symmetric. Equivalently, the relation \( R = \{(a,b) : a \le b\} \) on \( \mathbb{R} \) works too.
Question: Let A = {1, 2, 3}. Define a relation R on A by R = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)}. Check whether R is (i) Reflexive, (ii) Symmetric, and (iii) Transitive.
Solution: We check each property one by one. Step 1 — Check Reflexivity: For every element in A, we need (a, a) ∈ R. We have \( (1,1) \in R \), \( (2,2) \in R \), and \( (3,3) \in R \). Since all diagonal pairs are present, R is reflexive. Step 2 — Check Symmetry: We need to check: if \( (a, b) \in R \) then \( (b, a) \in R \). Observe that \( (1, 2) \in R \). For symmetry we need \( (2, 1) \in R \), but \( (2, 1) \notin R \). Hence R is NOT symmetric. Step 3 — Check Transitivity: We check all pairs \( (a,b) \in R \) and \( (b,c) \in R \) to see if \( (a,c) \in R \). Case 1: \( (1,2) \in R \) and \( (2,3) \in R \). We need \( (1,3) \in R \). Indeed \( (1,3) \in R \). ✓ Case 2: \( (1,2) \in R \) and \( (2,2) \in R \). We need \( (1,2) \in R \). Indeed \( (1,2) \in R \). ✓ Case 3: \( (2,3) \in R \) and \( (3,3) \in R \). We need \( (2,3) \in R \). Indeed \( (2,3) \in R \). ✓ All other combinations involve diagonal pairs which trivially satisfy the condition. Hence R is transitive. Conclusion: R is reflexive and transitive, but NOT symmetric.
Answer: R = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)} is reflexive and transitive but not symmetric.
Question: On the set of natural numbers \( \mathbb{N} \), define a relation R by: \( R = \{(a, b) : a \le b,\; a, b \in \mathbb{N}\} \). Show that R is reflexive and transitive but not symmetric.
Solution: Step 1 — Check Reflexivity: For any \( a \in \mathbb{N} \), we have \( a \le a \), so \( (a, a) \in R \) for all natural numbers a. Hence R is reflexive. Step 2 — Check Symmetry: Take a specific example: let \( a = 2 \) and \( b = 5 \). Since \( 2 \le 5 \), we have \( (2, 5) \in R \). But \( 5 \le 2 \) is false, so \( (5, 2) \notin R \). Since \( (2, 5) \in R \) but \( (5, 2) \notin R \), R is NOT symmetric. Step 3 — Check Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). This means \( a \le b \) and \( b \le c \). By the transitive property of inequalities on \( \mathbb{N} \), we get \( a \le c \), i.e., \( (a, c) \in R \). Hence R is transitive. Conclusion: The relation \( R = \{(a, b) : a \le b\} \) on \( \mathbb{N} \) is reflexive and transitive, but NOT symmetric.
Answer: The relation R defined by \( a \le b \) on \( \mathbb{N} \) is reflexive and transitive but not symmetric.
Question: Let \( B = \{p, q, r\} \). Define a relation \( S \) on \( B \) as \( S = \{(p,p),\,(q,q),\,(r,r),\,(p,q),\,(p,r),\,(q,r)\} \). Verify whether \( S \) is (i) reflexive, (ii) symmetric, and (iii) transitive. Hence state the properties that \( S \) satisfies.
Answer: On \( B = \{p, q, r\} \), the relation \( S = \{(p,p),(q,q),(r,r),(p,q),(p,r),(q,r)\} \) is reflexive and transitive but not symmetric, since \( (p,q) \in S \) but \( (q,p) \notin S \).