SOLVER7 Study. Nothing Else.
Exercise 1.1 Q1(ii)

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Reflexive, Symmetric, Transitive Check for R on N

Detailed Explanation

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 \).

Formula Used

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 \).

Solution

  1. Step 1: List the allowed values of \( x \). Since \( x \in N \) and \( x < 4 \), the possible values are \( x = 1, 2, 3 \).
  2. Step 2: For each value of \( x \), compute \( y = x + 5 \). For \( x = 1 \) we get \( y = 6 \); for \( x = 2 \) we get \( y = 7 \); for \( x = 3 \) we get \( y = 8 \). So the relation is \( R = \{(1,6),(2,7),(3,8)\} \).
  3. Step 3: Check reflexive. We need \( (a,a) \in R \) for every \( a \in N \). For example \( (1,1) \) should be in R, but \( (1,1) \notin R \). So R is not reflexive.
  4. Step 4: Check symmetric. We have \( (1,6) \in R \). For symmetry we would need \( (6,1) \in R \), but \( 6 \) is not even an allowed value of \( x \) (since \( 6 < 4 \) is false), so \( (6,1) \notin R \). Hence R is not symmetric.
  5. Step 5: Check transitive. Transitivity requires that whenever \( (a,b) \in R \) and \( (b,c) \in R \), we also have \( (a,c) \in R \). Look at the first elements \( 1,2,3 \) and the second elements \( 6,7,8 \); no second element ever reappears as a first element, so there is no pair \( (a,b),(b,c) \) to chain together. Because the condition is never triggered, it is never violated, so R is trivially (vacuously) transitive.

Final Answer

The relation \( R = \{(1,6),(2,7),(3,8)\} \) is neither reflexive nor symmetric, but it is transitive.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the allowed values of \( x \). The rule states \( x \in N \) and \( x < 4 \), so \( x \) can only be \( 1, 2, \) or \( 3 \). — Reason: We must pin down every valid input before we can list the pairs, since both conditions (\( x \in N \) and \( x < 4 \)) must hold simultaneously.
  2. Step 2: Use the rule \( y = x + 5 \) to compute the partner of each \( x \): for \( x = 1 \), \( y = 6 \); for \( x = 2 \), \( y = 7 \); for \( x = 3 \), \( y = 8 \). Therefore the relation is \[ R = \{(1,6),(2,7),(3,8)\}. \] — Reason: Substituting each allowed \( x \) into the formula gives the complete, explicit list of ordered pairs in \( R \).
  3. Step 3: Check reflexivity. Reflexivity requires \( (a,a) \in R \) for every \( a \in N \). Take \( a = 1 \): we need \( (1,1) \in R \), but \( (1,1) \notin R \). Since even one element fails, \( R \) is not reflexive. — Reason: A single counter-example is enough to disprove a universal claim; we found it immediately with \( a = 1 \).
  4. Step 4: Check symmetry. Symmetry requires that whenever \( (a,b) \in R \), we also have \( (b,a) \in R \). Take the pair \( (1,6) \in R \); for symmetry we would need \( (6,1) \in R \). But \( 6 \ge 4 \), so \( 6 \) is not an allowed first element, meaning \( (6,1) \notin R \). Therefore \( R \) is not symmetric. — Reason: Again, one failing pair is sufficient to conclude that the property does not hold for the entire relation.
  5. Step 5: Check transitivity. Transitivity requires: if \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). Look at all pairs in \( R = \{(1,6),(2,7),(3,8)\} \). The second element of every pair is \( 6, 7, \) or \( 8 \), none of which appears as a first element in any pair. So there are no two pairs \( (a,b) \) and \( (b,c) \) in \( R \) at all. When the hypothesis of a conditional statement is never satisfied, the statement is vacuously true. Therefore \( R \) is transitive. — Reason: Transitivity is a conditional property; if the triggering condition (a chain of two pairs) never occurs, the property is automatically satisfied — no pair can violate it.

Final Answer

The relation \( R = \{(1,6),(2,7),(3,8)\} \) is neither reflexive nor symmetric, but it is transitive.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: List all pairs in R: Since \( x \in N \) and \( x < 4 \), take \( x = 1, 2, 3 \) and compute \( y = x + 5 \): \[ R = \{(1,6),(2,7),(3,8)\} \]
  2. Step 2: Check Reflexive: \( (1,1) \notin R \), so R is not reflexive.
  3. Step 3: Check Symmetric: \( (1,6) \in R \) but \( (6,1) \notin R \), so R is not symmetric.
  4. Step 4: Check Transitive: No two pairs \( (a,b) \in R \) and \( (b,c) \in R \) exist simultaneously (no element appears as both second and first coordinate), so the condition holds vacuously. R is transitive.

Answer: The relation \( R = \{(1,6),(2,7),(3,8)\} \) is neither reflexive nor symmetric, but it is transitive.

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

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\} \).

Solution

  1. Step 1 – List all elements of R: We need \( y = x + 7 \) with \( x \in \mathbb{N} \) and \( x < 5 \), so \( x \) can be \( 1, 2, 3, 4 \). Substituting each value: when \( x = 1 \), \( y = 8 \); when \( x = 2 \), \( y = 9 \); when \( x = 3 \), \( y = 10 \); when \( x = 4 \), \( y = 11 \). Therefore, \[ R = \{(1,8),(2,9),(3,10),(4,11)\}. \]
  2. Step 2 – Check Reflexivity: A relation is reflexive if \( (a, a) \in R \) for every \( a \in \mathbb{N} \). For \( (a, a) \) to satisfy the rule, we would need \( a = a + 7 \), which gives \( 7 = 0 \) — a contradiction. In particular, \( (1,1) \notin R \), \( (2,2) \notin R \), etc. Hence R is NOT reflexive.
  3. Step 3 – Check Symmetry: A relation is symmetric if whenever \( (a, b) \in R \), we also have \( (b, a) \in R \). Consider \( (1, 8) \in R \). For symmetry we would need \( (8, 1) \in R \), which would require \( 1 = 8 + 7 = 15 \) — false. So \( (8,1) \notin R \). Hence R is NOT symmetric.
  4. Step 4 – Check Transitivity: A relation is transitive if whenever \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). Look at the second components of R: they are \( 8, 9, 10, 11 \). None of these values \( (8, 9, 10, 11) \) appear as the first component of any ordered pair in R (the first components are only \( 1, 2, 3, 4 \)). Therefore, there is no pair \( (a,b) \in R \) and \( (b,c) \in R \) simultaneously. The transitive condition is vacuously true. Hence R IS transitive.
  5. Step 5 – Conclusion: The relation \( R = \{(1,8),(2,9),(3,10),(4,11)\} \) is neither reflexive nor symmetric, but it is (vacuously) transitive.

Answer: The relation \( R = \{(1,8),(2,9),(3,10),(4,11)\} \) is neither reflexive nor symmetric, but it is transitive.

Everything you get with Solver7

More questions in Relations and Functions