SOLVER7 Study. Nothing Else.
Exercise 1.1 Q3

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Checking Reflexive, Symmetric and Transitive for R = {(a,b): b = a+1}

Detailed Explanation

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.

Formula Used

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

Solution

  1. Step 1: List all ordered pairs of R. The set is \( A = \{1,2,3,4,5,6\} \) and \( R = \{(a,b) : b = a+1\} \). Taking each \( a \) and finding \( b = a+1 \) that lies in \( A \): \[ R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \] Note that \( a = 6 \) gives \( b = 7 \notin A \), so it is excluded.
  2. Step 2: Check reflexivity. Reflexive means \( (a,a) \in R \) for every \( a \in A \). But for any \( a \), the pair \( (a,a) \) would need \( a = a+1 \), which is impossible. For example \( (1,1) \notin R \). Hence R is NOT reflexive.
  3. Step 3: Check symmetry. Symmetric means \( (a,b) \in R \Rightarrow (b,a) \in R \). Take \( (1,2) \in R \). For symmetry we would need \( (2,1) \in R \), but \( (2,1) \) requires \( 1 = 2+1 = 3 \), which is false, so \( (2,1) \notin R \). Hence R is NOT symmetric.
  4. Step 4: Check transitivity. Transitive means \( (a,b) \in R \) and \( (b,c) \in R \Rightarrow (a,c) \in R \). Take \( (1,2) \in R \) and \( (2,3) \in R \). For transitivity we would need \( (1,3) \in R \), but \( (1,3) \) requires \( 3 = 1+1 = 2 \), which is false, so \( (1,3) \notin R \). Hence R is NOT transitive.
  5. Step 5: Combine the conclusions. Since a single counterexample is enough to fail each property, and we found one for each, the relation satisfies none of the three properties.

Final Answer

The relation \( R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \) is neither reflexive, nor symmetric, nor transitive.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and build the relation explicitly. The set is \( A = \{1,2,3,4,5,6\} \) and the rule is \( R = \{(a,b) : b = a+1,\; a,b \in A\} \). For each element of \( A \), compute \( b = a+1 \) and include the pair only if \( b \in A \). When \( a = 6 \), \( b = 7 \notin A \), so that pair is excluded. The complete relation is \[ R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \] — Reason: Writing out every pair explicitly makes it straightforward to test each property without missing any case.
  2. Step 2: Test reflexivity. Reflexivity requires \( (a,a) \in R \) for every \( a \in A \). For \( (a,a) \) to belong to \( R \), the rule demands \( a = a + 1 \), which simplifies to \( 0 = 1 \) — a contradiction. For instance, \( (1,1) \notin R \). Therefore R is NOT reflexive. — Reason: We check whether every element is paired with itself; since no such pair exists in \( R \), reflexivity fails at the very first element.
  3. Step 3: Test symmetry. Symmetry requires that if \( (a,b) \in R \) then \( (b,a) \in R \). Take the pair \( (1,2) \in R \). For symmetry we would also need \( (2,1) \in R \), but the rule gives \( b = a+1 \), so \( (2,1) \) would require \( 1 = 2+1 = 3 \), which is false. Hence \( (2,1) \notin R \) and R is NOT symmetric. — Reason: A single counterexample is enough to disprove symmetry; the pair \( (1,2) \) without its reverse \( (2,1) \) serves as that counterexample.
  4. Step 4: Test transitivity. Transitivity requires that if \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). Consider \( (1,2) \in R \) and \( (2,3) \in R \). Transitivity would force \( (1,3) \in R \), but \( (1,3) \) needs \( 3 = 1+1 = 2 \), which is false. So \( (1,3) \notin R \) and R is NOT transitive. — Reason: We find a chain of two consecutive pairs and check whether the shortcut pair is present; it is not, so transitivity fails.
  5. Step 5: Summarise all three results. Reflexivity: FAILS (no element is paired with itself). Symmetry: FAILS (\( (1,2) \in R \) but \( (2,1) \notin R \)). Transitivity: FAILS (\( (1,2),(2,3) \in R \) but \( (1,3) \notin R \)). — Reason: Collecting all three conclusions together confirms the final classification of the relation.

Final Answer

The relation \( R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \) is neither reflexive, nor symmetric, nor transitive.

Common Mistake

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

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Write R explicitly: Given \( A = \{1,2,3,4,5,6\} \) and \( R = \{(a,b) : b = a+1\} \): \[ R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \]
  2. Step 2: Check Reflexivity: \( (1,1) \notin R \) since \( a = a+1 \) is impossible. So R is NOT reflexive.
  3. Step 3: Check Symmetry: \( (1,2) \in R \) but \( (2,1) \notin R \). So R is NOT symmetric.
  4. Step 4: Check Transitivity: \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \). So R is NOT transitive.

Answer: The relation \( R = \{(1,2),(2,3),(3,4),(4,5),(5,6)\} \) is neither reflexive, nor symmetric, nor transitive.

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: List all ordered pairs in R: We need pairs \( (a, b) \) such that \( b = a + 2 \) and both \( a, b \in \{1, 2, 3, 4, 5\} \). For \( a = 1 \): \( b = 3 \) ✓ For \( a = 2 \): \( b = 4 \) ✓ For \( a = 3 \): \( b = 5 \) ✓ For \( a = 4 \): \( b = 6 \notin A \) ✗ For \( a = 5 \): \( b = 7 \notin A \) ✗ So \( R = \{(1,3),\ (2,4),\ (3,5)\} \).
  2. Step 2: Check Reflexivity: R is reflexive if \( (a, a) \in R \) for every \( a \in A \). This requires \( a = a + 2 \), i.e., \( 0 = 2 \), which is impossible. Indeed, none of \( (1,1),\ (2,2),\ (3,3),\ (4,4),\ (5,5) \) belong to \( R \). Therefore R is NOT reflexive.
  3. Step 3: Check Symmetry: R is symmetric if \( (a, b) \in R \Rightarrow (b, a) \in R \). Consider \( (1, 3) \in R \). For symmetry we need \( (3, 1) \in R \), which would require \( 1 = 3 + 2 = 5 \). This is false, so \( (3,1) \notin R \). Therefore R is NOT symmetric.
  4. Step 4: Check Transitivity: R is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Check: \( (1, 3) \in R \) and \( (3, 5) \in R \). By transitivity we would need \( (1, 5) \in R \), which requires \( 5 = 1 + 2 = 3 \). This is false, so \( (1, 5) \notin R \). Therefore R is NOT transitive.
  5. Step 5: Conclusion: The relation \( R = \{(1,3),\ (2,4),\ (3,5)\} \) defined on \( A = \{1,2,3,4,5\} \) is neither reflexive, nor symmetric, nor transitive. However, note that no pair \( (a,b) \in R \) together with another pair \( (b,c) \in R \) produces a required \( (a,c) \) already in \( R \); specifically \( (1,3) \) and \( (3,5) \) demand \( (1,5) \in R \) but \( (1,5) \notin R \), confirming non-transitivity.

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

Everything you get with Solver7

More questions in Relations and Functions