Determine whether each of the following relations are reflexive, symmetric and transitive: Relation R in the set \(N\) of natural numbers defined as \(R=\{(x,y) : y = x + 5\) and \(x<4\}\)
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a rule: pick a small number, add 5 to it, and pair them up. Only numbers 1, 2, and 3 are allowed as starting points. So our pairs are \( (1,6) \), \( (2,7) \), and \( (3,8) \). No number is paired with itself, so the relation is not reflexive. The pairs cannot be flipped around either, so it is not symmetric. Since no two pairs can be chained together, there is nothing to break transitivity, so it passes that test easily.
Answer: The relation \( R = \{(1,6),(2,7),(3,8)\} \) is neither reflexive nor symmetric, but it is transitive.
A relation R on a set is just a collection of ordered pairs. Here R is defined on the set of natural numbers \( N \) by the rule \( R = \{(x,y) : y = x + 5 \text{ and } x < 4\} \). To analyse R, the first thing we do is write down all pairs that actually satisfy both conditions. Then 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 N \). It is symmetric if \( (a,b) \in R \) forces \( (b,a) \in R \). It is transitive if \( (a,b) \in R \) and \( (b,c) \in R \) together force \( (a,c) \in R \).
Reflexive: \( (a,a) \in R \ \forall\, 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 \).
The relation \( R = \{(1,6),(2,7),(3,8)\} \) is neither reflexive nor symmetric, but it is transitive.
A common mistake is to declare R not transitive just because no pair 'connects'. When there are no pairs of the form \( (a,b) \) and \( (b,c) \) to check, the transitivity condition is vacuously true, so R must be called transitive, not non-transitive.
The relation \( R = \{(1,6),(2,7),(3,8)\} \) is neither reflexive nor symmetric, but it is transitive.
One common mistake: students assume that a very small or simple relation cannot be transitive and mark it as 'not transitive' without checking carefully. Remember that if no chain \( (a,b),(b,c) \) exists inside \( R \), transitivity holds vacuously — there is nothing to violate it.
Answer: The relation \( R = \{(1,6),(2,7),(3,8)\} \) is neither reflexive nor symmetric, but it is transitive.
Question: Determine whether the relation R in the set \( \mathbb{N} \) of natural numbers defined as \( R = \{(x, y) : y = x + 3 \text{ and } x < 5\} \) is reflexive, symmetric, and transitive.
Solution: Step 1: List all ordered pairs in R. Since \( x \in \mathbb{N} \) and \( x < 5 \), we have \( x \in \{1, 2, 3, 4\} \). For each, \( y = x + 3 \): \[ R = \{(1,4),\,(2,5),\,(3,6),\,(4,7)\} \] Step 2: Check Reflexivity. A relation is reflexive if \( (a, a) \in R \) for every \( a \in \mathbb{N} \). We need \( (1,1) \in R \). But for \( (a,a) \) to satisfy \( y = x + 3 \), we need \( a = a + 3 \), i.e., \( 0 = 3 \), which is impossible. So \( (1,1) \notin R \). Therefore, R is NOT reflexive. Step 3: Check Symmetry. A relation is symmetric if \( (a,b) \in R \Rightarrow (b,a) \in R \). We have \( (1,4) \in R \). For symmetry, we need \( (4,1) \in R \), i.e., \( 1 = 4 + 3 = 7 \), which is false. So \( (4,1) \notin R \). Therefore, R is NOT symmetric. Step 4: Check Transitivity. A relation is transitive if \( (a,b) \in R \) and \( (b,c) \in R \) together imply \( (a,c) \in R \). We check whether any pair \( (a,b) \in R \) and \( (b,c) \in R \) exist simultaneously. The second elements (values of \( y \)) in R are \( \{4,5,6,7\} \). The first elements (values of \( x \)) are \( \{1,2,3,4\} \). The only overlap is \( 4 \), so we check: \( (1,4) \in R \) and \( (4,7) \in R \). For transitivity, we would need \( (1,7) \in R \), i.e., \( 7 = 1 + 3 = 4 \), which is false. So \( (1,7) \notin R \). Therefore, R is NOT transitive.
Answer: R is neither reflexive, nor symmetric, nor transitive.
Question: Determine whether the relation R in the set \( \mathbb{N} \) of natural numbers defined as \( R = \{(x, y) : y = 2x - 1 \text{ and } x \le 4\} \) is reflexive, symmetric, and transitive.
Solution: Step 1: List all ordered pairs in R. Since \( x \in \mathbb{N} \) and \( x \le 4 \), we have \( x \in \{1,2,3,4\} \). For each, \( y = 2x - 1 \): When \( x = 1 \): \( y = 1 \). When \( x = 2 \): \( y = 3 \). When \( x = 3 \): \( y = 5 \). When \( x = 4 \): \( y = 7 \). \[ R = \{(1,1),\,(2,3),\,(3,5),\,(4,7)\} \] Step 2: Check Reflexivity. A relation is reflexive if \( (a,a) \in R \) for every \( a \in \mathbb{N} \). We check \( (2,2) \): for this to be in R, we need \( 2 = 2(2) - 1 = 3 \), which is false. So \( (2,2) \notin R \). Note: Although \( (1,1) \in R \), the element \( 2 \in \mathbb{N} \) does not satisfy \( (2,2) \in R \). Therefore, R is NOT reflexive. Step 3: Check Symmetry. A relation is symmetric if \( (a,b) \in R \Rightarrow (b,a) \in R \). We have \( (2,3) \in R \). For symmetry, we need \( (3,2) \in R \), i.e., \( 2 = 2(3) - 1 = 5 \), which is false. So \( (3,2) \notin R \). Therefore, R is NOT symmetric. Step 4: Check Transitivity. A relation is transitive if \( (a,b) \in R \) and \( (b,c) \in R \) imply \( (a,c) \in R \). The second elements in R are \( \{1,3,5,7\} \) and the first elements are \( \{1,2,3,4\} \). The overlaps are \( 1 \) and \( 3 \). Case 1: \( (1,1) \in R \) and \( (1,1) \in R \) require \( (1,1) \in R \). Indeed \( (1,1) \in R \). This case holds. Case 2: \( (2,3) \in R \) and \( (3,5) \in R \) require \( (2,5) \in R \), i.e., \( 5 = 2(2)-1 = 3 \), which is false. So \( (2,5) \notin R \). Therefore, R is NOT transitive.
Answer: R is neither reflexive, nor symmetric, nor transitive.
Question: Determine whether the following relation is reflexive, symmetric, and transitive: Relation R in the set \( \mathbb{N} \) of natural numbers defined as \( R = \{(x, y) : y = x + 7 \text{ and } x < 5\} \).
Answer: The relation \( R = \{(1,8),(2,9),(3,10),(4,11)\} \) is neither reflexive nor symmetric, but it is transitive.