SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q4

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

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a group of three friends: 1, 2, and 3. A relation is just a list of pairs showing who is 'connected' to whom. Every person is connected to themselves — that is called reflexive. If person 1 is connected to person 2, symmetry means person 2 must also connect back to person 1. Here, 1 connects to 2 but 2 does not connect back, so symmetry fails. Transitivity means if 1 connects to 2 and 2 connects to 3, then 1 must connect to 3 — but that pair is missing here.

Answer: The relation \( R \) is reflexive because \( (1,1), (2,2), (3,3) \in R \). It is not symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). It is not transitive because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).

📖 Checking Reflexive, Symmetric and Transitive for a Relation

Detailed Explanation

A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). To classify a relation 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 A \). It is symmetric if whenever \( (a, b) \in R \) then \( (b, a) \in R \) too. It is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). To prove a property fails, we only need one counterexample. To prove a property holds, we must verify it for all required cases. Here the set is \( A = \{1, 2, 3\} \) and \( R = \{(1,1), (2,2), (3,3), (1,2), (2,3)\} \).

Formula Used

Reflexive: \( (a,a) \in R \) for all \( 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: Write down the set and the relation clearly. Here \( A = \{1, 2, 3\} \) and \( R = \{(1,1), (2,2), (3,3), (1,2), (2,3)\} \). We will test each property one by one.
  2. Step 2: Check reflexivity. For \( R \) to be reflexive, we need \( (a, a) \in R \) for every element \( a \in A \). The required pairs are \( (1,1) \), \( (2,2) \) and \( (3,3) \). All three of these pairs are present in \( R \). Therefore \( R \) is reflexive.
  3. Step 3: Check symmetry. We look for a pair \( (a, b) \in R \) whose reverse \( (b, a) \) is missing. Consider \( (1, 2) \in R \). For symmetry we would need \( (2, 1) \in R \), but \( (2, 1) \notin R \). Since one counterexample is enough, \( R \) is not symmetric.
  4. Step 4: Check transitivity. We look for pairs \( (a, b) \in R \) and \( (b, c) \in R \) whose combination \( (a, c) \) is missing. We have \( (1, 2) \in R \) and \( (2, 3) \in R \). For transitivity we would need \( (1, 3) \in R \), but \( (1, 3) \notin R \). Since this fails, \( R \) is not transitive.
  5. Step 5: Combine the results. Reflexivity holds because all self-pairs are present. Symmetry fails because \( (1,2) \in R \) but \( (2,1) \notin R \). Transitivity fails because \( (1,2), (2,3) \in R \) but \( (1,3) \notin R \).

Final Answer

The relation \( R \) is reflexive because \( (1,1), (2,2), (3,3) \in R \). It is not symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). It is not transitive because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).

Common Mistake

A common mistake is thinking that finding just one symmetric or transitive pair proves the whole relation has that property. To conclude a property holds you must check all required cases, but to conclude it fails, a single counterexample is enough.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and relation clearly. We are given \( A = \\{1, 2, 3\\} \) and \( R = \\{(1,1), (2,2), (3,3), (1,2), (2,3)\\} \). — Reason: Writing out all elements of \( R \) explicitly makes it easy to check each property without missing any pair.
  2. Step 2: Check reflexivity by listing all required diagonal pairs. For \( R \) to be reflexive, every element \( a \in A \) must satisfy \( (a, a) \in R \). The three required pairs are \( (1,1) \), \( (2,2) \), and \( (3,3) \). Checking: all three are present in \( R \). — Reason: Reflexivity demands self-pairing for every element, so we verify each one individually.
  3. Step 3: Conclude on reflexivity. Since \( (1,1) \in R \), \( (2,2) \in R \), and \( (3,3) \in R \), the condition \( (a,a) \in R \) holds for all \( a \in A \). Therefore \( R \) is reflexive. — Reason: All required cases pass, so no counterexample exists and the property holds.
  4. Step 4: Check symmetry by hunting for a one-sided pair. Look at \( (1, 2) \in R \). For symmetry, we would also need \( (2, 1) \in R \). Scanning \( R \): \( (2,1) \notin R \). This is a counterexample. — Reason: One missing reverse pair is enough to prove symmetry fails; we do not need to check every pair.
  5. Step 5: Conclude on symmetry. Because \( (1, 2) \in R \) yet \( (2, 1) \notin R \), the symmetry condition is violated. Therefore \( R \) is not symmetric. — Reason: A single counterexample is sufficient to disprove a property for the entire relation.
  6. Step 6: Check transitivity by finding a chain of two consecutive pairs. Notice \( (1, 2) \in R \) and \( (2, 3) \in R \). Transitivity requires \( (1, 3) \in R \). Scanning \( R \): \( (1, 3) \notin R \). This is a counterexample. — Reason: We look for pairs \( (a,b) \) and \( (b,c) \) in \( R \) and then verify whether \( (a,c) \) is also in \( R \).
  7. Step 7: Conclude on transitivity. Since \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \), the transitivity condition fails. Therefore \( R \) is not transitive. — Reason: Again, one counterexample is all that is needed to disprove the property.

Final Answer

The relation \( R \) is reflexive because \( (1,1), (2,2), (3,3) \in R \). It is not symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). It is not transitive because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).

Common Mistake

One common mistake: students check only a few pairs for reflexivity and assume the rest hold, or they forget to check whether the reverse of every pair exists when testing symmetry — always verify all required pairs systematically.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \ \( A = \{1, 2, 3\} \), \ \( R = \{(1,1),(2,2),(3,3),(1,2),(2,3)\} \)
  2. Step 2: Reflexivity: \ \( (1,1),(2,2),(3,3) \in R \) — all diagonal pairs present, so \( R \) is reflexive.
  3. Step 3: Symmetry: \ \( (1,2) \in R \) but \( (2,1) \notin R \) — counterexample found, so \( R \) is not symmetric.
  4. Step 4: Transitivity: \ \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \) — counterexample found, so \( R \) is not transitive.

Answer: The relation \( R \) is reflexive because \( (1,1), (2,2), (3,3) \in R \). It is not symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). It is not transitive because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).

➕ More Examples

More Examples

Example 1

Question: Let \( A = \{4, 5, 6\} \). Define a relation \( R \) on \( A \) by \( R = \{(4,4),\,(5,5),\,(6,6),\,(4,5),\,(5,6)\} \). Show that \( R \) is reflexive but neither symmetric nor transitive.

Solution: We check each property one by one. Step 1 — Check Reflexivity: For \( R \) to be reflexive, we need \( (a, a) \in R \) for every \( a \in A = \{4, 5, 6\} \). We observe that \( (4,4) \in R \), \( (5,5) \in R \), and \( (6,6) \in R \). Since all diagonal pairs are present, \( R \) is reflexive. Step 2 — Check Symmetry: For symmetry, whenever \( (a, b) \in R \), we need \( (b, a) \in R \). Notice that \( (4, 5) \in R \), but \( (5, 4) \notin R \). This violates the symmetric condition. Hence \( R \) is NOT symmetric. Step 3 — Check Transitivity: For transitivity, whenever \( (a, b) \in R \) and \( (b, c) \in R \), we need \( (a, c) \in R \). We have \( (4, 5) \in R \) and \( (5, 6) \in R \). Transitivity requires \( (4, 6) \in R \). However, \( (4, 6) \notin R \). This violates the transitive condition. Hence \( R \) is NOT transitive.

Answer: R is reflexive (all diagonal pairs present), but not symmetric (since (4,5) ∈ R yet (5,4) ∉ R), and not transitive (since (4,5) ∈ R and (5,6) ∈ R but (4,6) ∉ R).

Example 2

Question: Let \( A = \{a, b, c\} \). Define a relation \( R \) on \( A \) by \( R = \{(a,a),\,(b,b),\,(c,c),\,(b,a),\,(c,b)\} \). Show that \( R \) is reflexive but neither symmetric nor transitive.

Solution: We check each property one by one. Step 1 — Check Reflexivity: For \( R \) to be reflexive, we need \( (x, x) \in R \) for every \( x \in A = \{a, b, c\} \). We observe that \( (a,a) \in R \), \( (b,b) \in R \), and \( (c,c) \in R \). All required diagonal pairs are present, so \( R \) is reflexive. Step 2 — Check Symmetry: For symmetry, whenever \( (x, y) \in R \), we need \( (y, x) \in R \). We note that \( (b, a) \in R \), but \( (a, b) \notin R \). This violates symmetry. Hence \( R \) is NOT symmetric. Step 3 — Check Transitivity: For transitivity, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). We have \( (c, b) \in R \) and \( (b, a) \in R \). Transitivity requires \( (c, a) \in R \). However, \( (c, a) \notin R \). This violates the transitive condition. Hence \( R \) is NOT transitive.

Answer: R is reflexive (all diagonal pairs present), but not symmetric (since (b,a) ∈ R yet (a,b) ∉ R), and not transitive (since (c,b) ∈ R and (b,a) ∈ R but (c,a) ∉ R).

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Step 1: Check Reflexivity: A relation R on a set A is reflexive if for every element a in A, the pair (a, a) belongs to R. Here A = {1, 2, 3, 4}. We check: \[(1,1) \in R, \quad (2,2) \in R, \quad (3,3) \in R, \quad (4,4) \in R\] Since every element of A is related to itself, R is reflexive.
  2. Step 2: Check Symmetry: A relation R is symmetric if for every (a, b) in R, the pair (b, a) is also in R. Observe that \((2, 3) \in R\). For R to be symmetric, we would need \((3, 2) \in R\). However, \((3, 2) \notin R\). Therefore, R is NOT symmetric.
  3. Step 3: Check Transitivity: A relation R is transitive if whenever (a, b) in R and (b, c) in R, then (a, c) must also be in R. Observe that \((2, 3) \in R\) and \((3, 4) \in R\). For transitivity, we would require \((2, 4) \in R\). However, \((2, 4) \notin R\). Therefore, R is NOT transitive.
  4. Step 4: Conclusion: We have shown: - R is reflexive because \((1,1), (2,2), (3,3), (4,4) \in R\). - R is not symmetric because \((2,3) \in R\) but \((3,2) \notin R\). - R is not transitive because \((2,3) \in R\) and \((3,4) \in R\) but \((2,4) \notin R\). Hence, the relation R is reflexive but neither symmetric nor transitive.

Answer: The relation R on A = {1, 2, 3, 4} given by R = {(1,1), (2,2), (3,3), (4,4), (2,3), (3,4)} is reflexive because \((1,1), (2,2), (3,3), (4,4) \in R\). It is not symmetric because \((2,3) \in R\) but \((3,2) \notin R\). It is not transitive because \((2,3) \in R\) and \((3,4) \in R\) but \((2,4) \notin R\).

Everything you get with Solver7

More questions in Relations and Functions