SOLVER7 Study. Nothing Else.
Exercise 1.1 Q6

Show that the relation \(R\) in the set \(\{1, 2, 3\}\) given by \(R =\{(1, 2), (2, 1)\}\) is symmetric but neither reflexive nor transitive.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a group of three friends: 1, 2, and 3. The relation \( R = \\{(1,2),(2,1)\\} \) is like a list of "who waves at whom." For reflexive, everyone must wave at themselves — but nobody does here, so it fails. For symmetric, if 1 waves at 2, then 2 must wave back at 1 — and that happens perfectly. For transitive, if 1 waves at 2 and 2 waves at 1, then 1 should wave at 1 — but that pair is missing. So only symmetry holds.

Answer: The relation \( R = \{(1,2),(2,1)\} \) on \( \{1,2,3\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)).

📖 Checking Reflexive, Symmetric and Transitive Properties

Detailed Explanation

A relation \( R \) on a set \( A \) is just a collection of ordered pairs from \( A \times A \). To classify it, we test three properties. Reflexive means every element is related to itself, so \( (a,a) \in R \) for all \( a \in A \). Symmetric means whenever \( (a,b) \in R \), the reversed pair \( (b,a) \in R \) too. Transitive means whenever \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). Here the set is \( A = \{1,2,3\} \) and \( R = \{(1,2),(2,1)\} \). We simply match this small relation against each definition.

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 \ \text{and}\ (b,c) \in R \Rightarrow (a,c) \in R \).

Solution

  1. Step 1: Write down the set and the relation clearly. We have \( A = \{1,2,3\} \) and \( R = \{(1,2),(2,1)\} \). The relation contains only two ordered pairs, which makes each check quick.
  2. Step 2: Check reflexivity. For \( R \) to be reflexive, all of \( (1,1) \), \( (2,2) \) and \( (3,3) \) must belong to \( R \). But none of these pairs appear in \( R \). Since \( (1,1) \notin R \), the relation fails the reflexive condition. Therefore \( R \) is not reflexive.
  3. Step 3: Check symmetry. We must confirm that reversing every pair also gives a pair in \( R \). Take \( (1,2) \in R \); its reverse is \( (2,1) \), which is in \( R \). Take \( (2,1) \in R \); its reverse is \( (1,2) \), which is also in \( R \). Both pairs pass, so \( R \) is symmetric.
  4. Step 4: Check transitivity. We look for pairs \( (a,b) \) and \( (b,c) \) in \( R \). Here \( (1,2) \in R \) and \( (2,1) \in R \). For transitivity we would then need \( (1,1) \in R \). But \( (1,1) \notin R \). Since this required pair is missing, \( R \) is not transitive.
  5. Step 5: Combine the results. The relation satisfies only the symmetric condition, and fails both reflexivity and transitivity. Hence \( R \) is symmetric but neither reflexive nor transitive, which is exactly what we had to show.

Final Answer

The relation \( R = \{(1,2),(2,1)\} \) on \( \{1,2,3\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)).

Common Mistake

A common error is to think the relation is transitive just because it looks 'complete'. Students forget that \( (1,2) \) and \( (2,1) \) force the pair \( (1,1) \) to be present; since it is absent, transitivity fails. Always test the specific chain of pairs rather than judging by appearance.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and the relation clearly. The set is \( A = \\{1,2,3\\} \) and the given relation is \( R = \\{(1,2),(2,1)\\} \). — Reason: Writing everything down explicitly ensures we do not miss any pairs when running each property check.
  2. Step 2: List the diagonal pairs needed for reflexivity. For \( R \) to be reflexive, the pairs \( (1,1) \), \( (2,2) \), and \( (3,3) \) must all belong to \( R \). — Reason: The reflexive condition requires every element to be paired with itself.
  3. Step 3: Check reflexivity by comparing. Looking at \( R = \\{(1,2),(2,1)\\} \), none of \( (1,1) \), \( (2,2) \), or \( (3,3) \) appear in \( R \). Since \( (1,1) \notin R \), the condition fails immediately. Therefore \( R \) is NOT reflexive. — Reason: A single missing diagonal pair is enough to conclude the relation is not reflexive.
  4. Step 4: Check symmetry for the pair \( (1,2) \). Since \( (1,2) \in R \), we need its reverse \( (2,1) \) to also be in \( R \). Indeed \( (2,1) \in R \). — Reason: Symmetry is verified pair by pair; each pair must have its mirror image in the relation.
  5. Step 5: Check symmetry for the pair \( (2,1) \). Since \( (2,1) \in R \), we need \( (1,2) \in R \). Indeed \( (1,2) \in R \). Both pairs pass the check, so \( R \) IS symmetric. — Reason: Every pair in \( R \) has its reverse also in \( R \), fulfilling the definition completely.
  6. Step 6: Check transitivity. We look for two pairs of the form \( (a,b) \) and \( (b,c) \) in \( R \) and verify whether \( (a,c) \) is also in \( R \). Take \( (1,2) \in R \) and \( (2,1) \in R \). Here \( a = 1 \), \( b = 2 \), \( c = 1 \), so transitivity requires \( (1,1) \in R \). But \( (1,1) \notin R \). Therefore \( R \) is NOT transitive. — Reason: Finding even one triple \( (a,b),(b,c) \in R \) whose conclusion \( (a,c) \) is missing is sufficient to disprove transitivity.
  7. Step 7: Summarise the three results. Reflexive: No (fails because \( (1,1) \notin R \)). Symmetric: Yes (every pair has its reverse in \( R \)). Transitive: No (fails because \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)). — Reason: Collecting all three verdicts gives the complete classification of the relation.

Final Answer

The relation \( R = \{(1,2),(2,1)\} \) on \( \{1,2,3\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)).

Common Mistake

One common mistake: students often assume that because a relation is symmetric it must also be transitive, but this example shows clearly that symmetry and transitivity are independent — \( R \) is symmetric yet fails transitivity because \( (1,2),(2,1) \in R \) does not lead to \( (1,1) \in R \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Identify the relation: Given: \ A = \{1,2,3\}, \quad R = \{(1,2),(2,1)\}
  2. Step 2: Check reflexivity: \( (1,1) \notin R \) — reflexive condition fails. R is not reflexive.
  3. Step 3: Check symmetry: \( (1,2) \in R \Rightarrow (2,1) \in R \) and \( (2,1) \in R \Rightarrow (1,2) \in R \). R is symmetric.
  4. Step 4: Check transitivity: \( (1,2) \in R \) and \( (2,1) \in R \), but \( (1,1) \notin R \). Transitive condition fails. R is not transitive.

Answer: The relation \( R = \{(1,2),(2,1)\} \) on \( \{1,2,3\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,2),(2,1) \in R \) but \( (1,1) \notin R \)).

➕ More Examples

More Examples

Example 1

Question: Let A = {1, 2, 3, 4}. Show that the relation R = {(1, 3), (3, 1), (2, 4), (4, 2)} defined on A is symmetric but neither reflexive nor transitive.

Solution: We check each property of the relation R = {(1, 3), (3, 1), (2, 4), (4, 2)} on the set A = {1, 2, 3, 4}. Step 1 — Check Reflexivity: For R to be reflexive, we need \( (a, a) \in R \) for every \( a \in A \). We observe that \( (1,1) \notin R \), \( (2,2) \notin R \), \( (3,3) \notin R \), and \( (4,4) \notin R \). Since none of the diagonal pairs belong to R, the relation is NOT reflexive. Step 2 — Check Symmetry: For R to be symmetric, whenever \( (a, b) \in R \), we need \( (b, a) \in R \). We verify each ordered pair: - \( (1, 3) \in R \) and \( (3, 1) \in R \). ✓ - \( (3, 1) \in R \) and \( (1, 3) \in R \). ✓ - \( (2, 4) \in R \) and \( (4, 2) \in R \). ✓ - \( (4, 2) \in R \) and \( (2, 4) \in R \). ✓ Since all conditions are satisfied, R is SYMMETRIC. Step 3 — Check Transitivity: For R to be transitive, whenever \( (a, b) \in R \) and \( (b, c) \in R \), we need \( (a, c) \in R \). Consider the pairs \( (1, 3) \in R \) and \( (3, 1) \in R \). By transitivity, we would require \( (1, 1) \in R \). However, \( (1, 1) \notin R \). Therefore, R is NOT transitive. Conclusion: R is symmetric but neither reflexive nor transitive.

Answer: R is symmetric but neither reflexive nor transitive.

Example 2

Question: Let A = {a, b, c}. Consider the relation R = {(a, b), (b, a), (b, c), (c, b)} on A. Check whether R is symmetric, reflexive, or transitive.

Solution: We check each property of the relation R = {(a, b), (b, a), (b, c), (c, b)} on A = {a, b, c}. Step 1 — Check Reflexivity: For R to be reflexive, we need \( (x, x) \in R \) for every \( x \in A \). We observe that \( (a, a) \notin R \). Since at least one element is not related to itself, R is NOT reflexive. Step 2 — Check Symmetry: For R to be symmetric, whenever \( (x, y) \in R \), we need \( (y, x) \in R \). We verify: - \( (a, b) \in R \) and \( (b, a) \in R \). ✓ - \( (b, a) \in R \) and \( (a, b) \in R \). ✓ - \( (b, c) \in R \) and \( (c, b) \in R \). ✓ - \( (c, b) \in R \) and \( (b, c) \in R \). ✓ All conditions are satisfied, so R is SYMMETRIC. Step 3 — Check Transitivity: For R to be transitive, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). Consider \( (a, b) \in R \) and \( (b, c) \in R \). By transitivity, we would need \( (a, c) \in R \). However, \( (a, c) \notin R \). Therefore, R is NOT transitive. Conclusion: R is symmetric but neither reflexive nor transitive.

Answer: R is symmetric but neither reflexive nor transitive.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( A = \{1, 2, 3, 4\} \) and let \( R = \{(1, 3), (3, 1), (2, 4), (4, 2)\} \) be a relation on \( A \). Show that \( R \) is symmetric but neither reflexive nor transitive.

Solution

  1. Step 1: Check Reflexivity: A relation \( R \) on \( A \) is reflexive if \( (a, a) \in R \) for every \( a \in A \). Here \( A = \{1, 2, 3, 4\} \), so we need \( (1,1), (2,2), (3,3), (4,4) \) all to belong to \( R \). Since none of these pairs appear in \( R = \{(1, 3), (3, 1), (2, 4), (4, 2)\} \), the relation is NOT reflexive.
  2. Step 2: Check Symmetry: A relation \( R \) is symmetric if whenever \( (a, b) \in R \) we also have \( (b, a) \in R \). Check every pair: \( (1, 3) \in R \) and \( (3, 1) \in R \) ✓. \( (3, 1) \in R \) and \( (1, 3) \in R \) ✓. \( (2, 4) \in R \) and \( (4, 2) \in R \) ✓. \( (4, 2) \in R \) and \( (2, 4) \in R \) ✓. Since for every \( (a, b) \in R \) the pair \( (b, a) \) also belongs to \( R \), the relation IS symmetric.
  3. Step 3: Check Transitivity: A relation \( R \) is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), we have \( (a, c) \in R \). Consider \( (1, 3) \in R \) and \( (3, 1) \in R \). Transitivity would require \( (1, 1) \in R \). But \( (1, 1) \notin R \). Similarly, \( (2, 4) \in R \) and \( (4, 2) \in R \) would require \( (2, 2) \in R \), but \( (2, 2) \notin R \). Therefore the relation is NOT transitive.
  4. Step 4: Conclusion: The relation \( R = \{(1, 3), (3, 1), (2, 4), (4, 2)\} \) on \( A = \{1, 2, 3, 4\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,3) \in R \) and \( (3,1) \in R \) but \( (1,1) \notin R \)).

Answer: The relation \( R = \{(1, 3), (3, 1), (2, 4), (4, 2)\} \) on \( A = \{1, 2, 3, 4\} \) is symmetric, but it is neither reflexive (since \( (1,1) \notin R \)) nor transitive (since \( (1,3),(3,1) \in R \) but \( (1,1) \notin R \)).

Everything you get with Solver7

More questions in Relations and Functions