Check whether the relation R defined in the set \(\{1, 2, 3, 4, 5, 6\}\) as \(R=\{(a, b) : b = a + 1\}\) is reflexive, symmetric or transitive.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a line of friends numbered 1 to 6, where each friend only talks to the very next friend. Friend 1 talks to Friend 2, Friend 2 talks to Friend 3, and so on. Nobody talks to themselves, so the relation is not reflexive. Friend 1 talks to Friend 2, but Friend 2 does not talk back to Friend 1, so it is not symmetric. Friend 1 talks to Friend 2 and Friend 2 talks to Friend 3, but Friend 1 never talks directly to Friend 3, so it is not transitive either.
Answer: The relation \( R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \) is neither reflexive, nor symmetric, nor transitive.
A relation \( R \) on a set \( A \) is just a collection of ordered pairs from \( A \times A \). To classify it we check three properties. A relation is reflexive if every element is related to itself, i.e. \( (a,a) \in R \) for all \( 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 \). The best approach for a finite set is to first write out all the pairs of \( R \), then test each property against these pairs.
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 \).
The relation \( R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \) is neither reflexive, nor symmetric, nor transitive.
A common mistake is to think transitivity holds because the pairs form a 'chain' like \( 1 \to 2 \to 3 \). Transitivity actually requires \( (1,3) \) to be in R, and it is not, so the relation is not transitive.
The relation \( R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \) is neither reflexive, nor symmetric, nor transitive.
One common mistake: students sometimes confuse the defining rule \( b = a+1 \) with a general 'consecutive' idea and incorrectly claim transitivity holds because the pairs form a chain — but a chain \( a \to b \to c \) requires \( (a,c) \) to also be in \( R \), and the pair \( (1,3) \) (for example) is not generated by the rule \( b = a+1 \).
Answer: The relation \( R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \) is neither reflexive, nor symmetric, nor transitive.
Question: Let A = {2, 3, 4, 5, 6, 7}. Define a relation R on A as R = {(a, b) : b = a + 2}. Check whether R is reflexive, symmetric, or transitive.
Solution: The set is A = {2, 3, 4, 5, 6, 7} and the relation is R = {(a, b) : b = a + 2}. First, list all ordered pairs in R by finding pairs where b = a + 2: When a = 2: b = 4, giving (2, 4). When a = 3: b = 5, giving (3, 5). When a = 4: b = 6, giving (4, 6). When a = 5: b = 7, giving (5, 7). When a = 6: b = 8, but 8 ∉ A, so no pair. When a = 7: b = 9, but 9 ∉ A, so no pair. Thus \[R = \{(2,4),\,(3,5),\,(4,6),\,(5,7)\}\] Checking Reflexivity: For R to be reflexive, we need (a, a) ∈ R for every a ∈ A, i.e., we need a = a + 2, which means 0 = 2 — a contradiction. For example, (2, 2) ∉ R. Therefore R is NOT reflexive. Checking Symmetry: For R to be symmetric, whenever (a, b) ∈ R, we need (b, a) ∈ R. Consider (2, 4) ∈ R. This requires (4, 2) ∈ R, which means 2 = 4 + 2 = 6 — false. So (4, 2) ∉ R. Therefore R is NOT symmetric. Checking Transitivity: For transitivity, whenever (a, b) ∈ R and (b, c) ∈ R, we need (a, c) ∈ R. Check if there exist pairs (a, b) and (b, c) both in R. Take (2, 4) ∈ R and (4, 6) ∈ R. For transitivity, we need (2, 6) ∈ R. But (2, 6) ∈ R requires 6 = 2 + 2 = 4, which is false. So (2, 6) ∉ R. Since (2, 4) ∈ R and (4, 6) ∈ R but (2, 6) ∉ R, the relation is NOT transitive. Similarly, (3, 5) ∈ R and (5, 7) ∈ R but (3, 7) ∉ R (since 7 ≠ 3 + 2), confirming the result.
Answer: R is neither reflexive, nor symmetric, nor transitive.
Question: Define a relation R on the set A = {1, 2, 3, 4, 5} as R = {(a, b) : a divides b and a ≠ b}. Check whether R is reflexive, symmetric, or transitive.
Solution: The set is A = {1, 2, 3, 4, 5} and the relation is \[R = \{(a, b) : a \mid b \text{ and } a \ne b\}\] List all pairs where a divides b and a ≠ b: 1 divides 2, 3, 4, 5: pairs (1,2), (1,3), (1,4), (1,5). 2 divides 4: pair (2,4). 3 divides nothing else in A (other than itself): no new pairs. 4 and 5 divide nothing else in A: no new pairs. Thus \[R = \{(1,2),\,(1,3),\,(1,4),\,(1,5),\,(2,4)\}\] Checking Reflexivity: For R to be reflexive, we need (a, a) ∈ R for every a ∈ A. But the condition requires a ≠ b, so (a, a) can never belong to R. For example, (1,1) ∉ R. Therefore R is NOT reflexive. Checking Symmetry: For R to be symmetric, whenever (a, b) ∈ R we need (b, a) ∈ R. Consider (1, 2) ∈ R. For symmetry, (2, 1) must be in R, meaning 2 divides 1. But 2 does not divide 1. So (2, 1) ∉ R. Therefore R is NOT symmetric. Checking Transitivity: For transitivity, whenever (a, b) ∈ R and (b, c) ∈ R, we need (a, c) ∈ R. Case 1: (1, 2) ∈ R and (2, 4) ∈ R. We need (1, 4) ∈ R. Since 1 divides 4 and 1 ≠ 4, yes (1, 4) ∈ R. ✓ Case 2: Check all such chains. The only chain of length 2 in R is (1,2) → (2,4) → need (1,4); already in R. ✓ There are no other pairs (a,b) and (b,c) both in R. For instance, (1,3) ∈ R but there is no pair starting with 3 in R. Similarly (1,4) ∈ R but no pair starts with 4 in R. (1,5) ∈ R but no pair starts with 5 in R. Since for every (a, b) ∈ R and (b, c) ∈ R the pair (a, c) ∈ R, the relation IS transitive.
Answer: R is not reflexive, not symmetric, but IS transitive.
Question: Let \( A = \{1, 2, 3, 4, 5\} \). Check whether the relation \( R \) defined on \( A \) as \( R = \{(a, b) : b = a + 2,\ a, b \in A\} \) is reflexive, symmetric, or transitive.
Answer: The relation \( R = \{(1,3),\ (2,4),\ (3,5)\} \) on \( A = \{1,2,3,4,5\} \) is neither reflexive, nor symmetric. It is also NOT transitive, since \( (1,3) \in R \) and \( (3,5) \in R \) but \( (1,5) \notin R \).