SOLVER7 Study. Nothing Else.
Exercise 1.1 Q10(iii)

Give an example of a relation. Which is Reflexive and symmetric but not transitive.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine three friends: 1, 2, and 3. Every friend is friends with themselves (reflexive). Friend 1 and Friend 2 are mutual friends, and Friend 2 and Friend 3 are mutual friends (symmetric). But Friend 1 and Friend 3 have never met! Normally, we might expect friends-of-friends to know each other, but here they do not. That broken link is exactly what makes this relation fail the transitivity rule.

Answer: On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} \] is reflexive and symmetric but not transitive, because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).

📖 Relation that is Reflexive and Symmetric but not Transitive

Detailed Explanation

A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). We check 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 \), we also have \( (b,a) \in R \). Transitive means whenever \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). To get a relation that is reflexive and symmetric but NOT transitive, we deliberately connect two chains through a middle element without connecting the outer elements, which breaks transitivity while keeping the other two properties intact.

Formula Used

For a relation \( R \) on set \( A \): 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: Choose a small set to work with. Let \( A = \{1, 2, 3\} \). A small set makes checking all conditions easy.
  2. Step 2: Define the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\}. \] Here 1 is linked to 2, and 2 is linked to 3, but 1 and 3 are deliberately NOT linked.
  3. Step 3: Check reflexivity. We need \( (a,a) \in R \) for every \( a \in A \). Since \( (1,1), (2,2), (3,3) \) are all present, \( R \) is reflexive.
  4. Step 4: Check symmetry. For every pair \( (a,b) \in R \), the reverse pair \( (b,a) \) must also be in \( R \). We have \( (1,2) \) and \( (2,1) \), and \( (2,3) \) and \( (3,2) \). The diagonal pairs are their own reverses. So \( R \) is symmetric.
  5. Step 5: Check transitivity. Take \( (1,2) \in R \) and \( (2,3) \in R \). For transitivity we would need \( (1,3) \in R \). But \( (1,3) \notin R \). Therefore \( R \) is NOT transitive.
  6. Step 6: Conclusion. Since \( R \) satisfies reflexivity and symmetry but violates transitivity, it is the required example.

Final Answer

On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} \] is reflexive and symmetric but not transitive, because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).

Common Mistake

A common mistake is including the pair \( (1,3) \) (and its reverse) to keep things symmetric, but doing so accidentally makes the relation transitive too. To break transitivity, you must leave out the 'end-to-end' pair while keeping both middle links present.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Choose the Base Set: Take \ A = \{1, 2, 3\} \. — Reason: A three-element set is the smallest set where reflexivity, symmetry, and transitivity can be checked in a non-trivial way, making verification manageable.
  2. Step 2: Build the Relation: Define \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\}. \] — Reason: We include all diagonal pairs for reflexivity, add pairs in both directions for symmetry, but deliberately omit \( (1,3) \) and \( (3,1) \) to break transitivity at exactly the right spot.
  3. Step 3: Verify Reflexivity: Check that \( (a,a) \in R \) for every \( a \in A \). We have \( (1,1) \in R \), \( (2,2) \in R \), and \( (3,3) \in R \). — Reason: All three self-pairs are present, so the reflexivity condition is fully satisfied.
  4. Step 4: Verify Symmetry: For every pair \( (a,b) \in R \), confirm \( (b,a) \in R \) as well. We see \( (1,2) \in R \) and \( (2,1) \in R \); also \( (2,3) \in R \) and \( (3,2) \in R \). The diagonal pairs \( (1,1) \), \( (2,2) \), \( (3,3) \) are trivially symmetric. — Reason: Every non-diagonal pair appears with its reverse, confirming the symmetry property holds throughout.
  5. Step 5: Check Transitivity (and Find the Failure): Transitivity requires: whenever \( (a,b) \in R \) and \( (b,c) \in R \), we must have \( (a,c) \in R \). Observe \( (1,2) \in R \) and \( (2,3) \in R \), so transitivity would demand \( (1,3) \in R \). But \( (1,3) \notin R \). — Reason: This single missing pair is a concrete counterexample proving that transitivity fails, even though the other two properties hold.
  6. Step 6: State the Conclusion: Since \( (1,1) \), \( (2,2) \), \( (3,3) \) are in \( R \) it is reflexive; since every pair appears with its reverse it is symmetric; and since \( (1,2) \in R \) and \( (2,3) \in R \) yet \( (1,3) \notin R \) it is NOT transitive. — Reason: The design strategy of linking 1 to 2 and 2 to 3 without linking 1 to 3 is precisely what guarantees reflexivity and symmetry while breaking transitivity.

Final Answer

On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} \] is reflexive and symmetric but not transitive, because \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \).

Common Mistake

One common mistake: Students sometimes add \( (1,3) \) and \( (3,1) \) to try to 'complete' the relation, which would make it transitive (in fact, an equivalence relation) and defeat the purpose — the whole point is to leave exactly this pair out to break transitivity while keeping the other two properties intact.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Define the set and relation: Let \( A = \\{1, 2, 3\\} \) and \[ R = \\{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\\}. \]
  2. Step 2: Verify reflexivity and symmetry: Reflexive: \( (1,1), (2,2), (3,3) \in R \) ✓. Symmetric: \( (1,2) \in R \Rightarrow (2,1) \in R \) and \( (2,3) \in R \Rightarrow (3,2) \in R \) ✓.
  3. Step 3: Show transitivity fails: \( (1,2) \in R \) and \( (2,3) \in R \), but \( (1,3) \notin R \), so transitivity fails ✗.

Answer: On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\} \] is reflexive and symmetric but 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 = \{1, 2, 3\} \). Define a relation R on A as \[ R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)\} \] Show that R is reflexive and symmetric but not transitive.

Solution: We check each property in turn. Step 1 — Reflexive: A relation is reflexive if \( (a, a) \in R \) for every \( a \in A \). We observe that \( (1,1) \in R \), \( (2,2) \in R \), and \( (3,3) \in R \). Hence R is reflexive. Step 2 — Symmetric: A relation is symmetric if whenever \( (a, b) \in R \) then \( (b, a) \in R \). Checking the non-diagonal pairs: \( (1,2) \in R \) and \( (2,1) \in R \); also \( (2,3) \in R \) and \( (3,2) \in R \). There are no other non-diagonal pairs. Hence R is symmetric. Step 3 — Not Transitive: A relation is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Consider \( a = 1,\, b = 2,\, c = 3 \). We have \( (1, 2) \in R \) and \( (2, 3) \in R \). For transitivity we need \( (1, 3) \in R \). But \( (1, 3) \notin R \). Hence R is NOT transitive. Conclusion: R is reflexive and symmetric but not transitive.

Answer: R = {(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)} is reflexive and symmetric but not transitive.

Example 2

Question: Let \( A = \{p, q, r, s\} \). Define a relation R on A as \[ R = \{(p,p),(q,q),(r,r),(s,s),(p,q),(q,p),(q,r),(r,q)\} \] Examine whether R is reflexive, symmetric, and transitive.

Solution: We check each property in turn. Step 1 — Reflexive: For every element in A we need \( (a,a) \in R \). We have \( (p,p) \in R \), \( (q,q) \in R \), \( (r,r) \in R \), and \( (s,s) \in R \). All elements are related to themselves, so R is reflexive. Step 2 — Symmetric: Check every non-diagonal ordered pair. \( (p,q) \in R \) and \( (q,p) \in R \) — symmetric pair present. \( (q,r) \in R \) and \( (r,q) \in R \) — symmetric pair present. No other non-diagonal pairs exist. Hence R is symmetric. Step 3 — Not Transitive: Take \( a = p,\, b = q,\, c = r \). We have \( (p, q) \in R \) and \( (q, r) \in R \). Transitivity requires \( (p, r) \in R \). However \( (p, r) \notin R \). Therefore R is NOT transitive. Conclusion: R is reflexive and symmetric but not transitive.

Answer: R = {(p,p),(q,q),(r,r),(s,s),(p,q),(q,p),(q,r),(r,q)} is reflexive and symmetric but not transitive.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( A = \{a, b, c\} \). Define a relation \( R \) on \( A \) such that \( R \) is reflexive and symmetric but NOT transitive. Verify each property for your chosen relation.

Solution

  1. Step 1: Construct the Relation: Define \( A = \{a, b, c\} \) and choose the relation \[ R = \{(a,a),\,(b,b),\,(c,c),\,(a,b),\,(b,a),\,(b,c),\,(c,b)\}. \]
  2. Step 2: Check Reflexivity: A relation is reflexive if every element of \( A \) is related to itself. Check: \( (a,a) \in R \), \( (b,b) \in R \), and \( (c,c) \in R \). Since all three diagonal pairs are present, \( R \) is reflexive.
  3. Step 3: Check Symmetry: A relation is symmetric if whenever \( (x,y) \in R \), then \( (y,x) \in R \). Check the non-diagonal pairs: \( (a,b) \in R \) and \( (b,a) \in R \) — symmetric. Also \( (b,c) \in R \) and \( (c,b) \in R \) — symmetric. Hence \( R \) is symmetric.
  4. Step 4: Check Transitivity: A relation is transitive if whenever \( (x,y) \in R \) and \( (y,z) \in R \), then \( (x,z) \in R \). Observe: \( (a,b) \in R \) and \( (b,c) \in R \), so transitivity requires \( (a,c) \in R \). However, \( (a,c) \notin R \). Therefore \( R \) is NOT transitive.
  5. Step 5: Conclusion: The relation \[ R = \{(a,a),\,(b,b),\,(c,c),\,(a,b),\,(b,a),\,(b,c),\,(c,b)\} \] on \( A = \{a, b, c\} \) is reflexive and symmetric but not transitive, since \( (a,b) \in R \) and \( (b,c) \in R \) but \( (a,c) \notin R \).

Answer: On \( A = \{a, b, c\} \), the relation \[ R = \{(a,a),\,(b,b),\,(c,c),\,(a,b),\,(b,a),\,(b,c),\,(c,b)\} \] is reflexive and symmetric but not transitive, because \( (a,b) \in R \) and \( (b,c) \in R \) but \( (a,c) \notin R \).

Everything you get with Solver7

More questions in Relations and Functions