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

Give an example of a relation. Which is Symmetric and transitive but not reflexive.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine three friends: 1, 2, and 3. A relation is like a list of who-knows-who pairs. We want a list where friends know each other back (symmetric) and knowing through a friend counts too (transitive). But we sneak out the pair for friend 3 knowing himself. Friends 1 and 2 each know themselves and each other, so those rules still work fine. Friend 3 just never appears, so the rule about everyone knowing themselves breaks. That one missing pair makes the whole relation not reflexive.

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

📖 Relation that is Symmetric and Transitive but Not Reflexive

Detailed Explanation

A relation \( R \) on a set \( A \) is a subset of \( A \times A \). Recall the three properties: (i) Reflexive means \( (a, a) \in R \) for every element \( a \in A \). (ii) Symmetric means whenever \( (a, b) \in R \), we also have \( (b, a) \in R \). (iii) Transitive means whenever \( (a, b) \in R \) and \( (b, c) \in R \), we have \( (a, c) \in R \). To get a relation that is symmetric and transitive but not reflexive, we simply leave out at least one pair of the form \( (a, a) \), so that some element of the set is not related to itself.

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: Choose a small set to work with. Let \( A = \{1, 2, 3\} \).
  2. Step 2: Define the relation \( R = \{(1, 1), (2, 2), (1, 2), (2, 1)\} \). Notice that we deliberately did NOT include \( (3, 3) \).
  3. Step 3: Check reflexivity. For \( R \) to be reflexive we would need \( (1,1), (2,2), (3,3) \) all in \( R \). Since \( (3, 3) \notin R \), the relation is NOT reflexive.
  4. Step 4: Check symmetry. The only 'mixed' pairs are \( (1, 2) \) and \( (2, 1) \), and both are present. The pairs \( (1,1) \) and \( (2,2) \) are their own reverses. Hence for every \( (a,b) \in R \), \( (b,a) \in R \), so \( R \) is symmetric.
  5. Step 5: Check transitivity. We test all combinations: \( (1,2) \) and \( (2,1) \) give \( (1,1) \in R \); \( (2,1) \) and \( (1,2) \) give \( (2,2) \in R \); \( (1,2) \) and \( (2,2) \) give \( (1,2) \in R \); \( (2,1) \) and \( (1,1) \) give \( (2,1) \in R \). Every required pair is present, so \( R \) is transitive.
  6. Step 6: Conclusion: \( R \) is symmetric and transitive but not reflexive, exactly as required.

Final Answer

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

Common Mistake

A common error is to think that if a relation is symmetric and transitive it must automatically be reflexive. This is false: reflexivity requires \( (a,a) \in R \) for EVERY element, and if some element (like 3 above) never appears in any pair, that condition can never be triggered by symmetry or transitivity.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Choose a simple working set. Let \( A = \\{1, 2, 3\\} \). — Reason: A three-element set is the smallest set that lets us deliberately exclude a diagonal pair and still have other elements to pair up, making the example non-trivial.
  2. Step 2: Define the relation \( R = \\{(1, 1),\\ (2, 2),\\ (1, 2),\\ (2, 1)\\} \). Notice that the pair \( (3, 3) \) is intentionally left out. — Reason: We want reflexivity to fail for element 3, so we must omit \( (3, 3) \) while keeping pairs only involving 1 and 2.
  3. Step 3: Check reflexivity. Reflexivity requires \( (a, a) \in R \) for every \( a \in A \), meaning all three pairs \( (1,1) \), \( (2,2) \), and \( (3,3) \) must belong to \( R \). Since \( (3, 3) \notin R \), reflexivity fails. — Reason: Even one missing diagonal pair is enough to break reflexivity, which is exactly what we designed.
  4. Step 4: Check symmetry. Go through every pair in \( R \): the pair \( (1, 2) \in R \) and its reverse \( (2, 1) \in R \); the pair \( (2, 1) \in R \) and its reverse \( (1, 2) \in R \); the pairs \( (1, 1) \) and \( (2, 2) \) are each their own reverse. All cases are satisfied, so \( R \) is symmetric. — Reason: Symmetry only checks pairs already in \( R \); since 3 is not involved in any pair, it places no obligation on \( R \) at all.
  5. Step 5: Check transitivity by testing every applicable combination. From \( (1, 2) \in R \) and \( (2, 1) \in R \), we need \( (1, 1) \in R \) — it is. From \( (2, 1) \in R \) and \( (1, 2) \in R \), we need \( (2, 2) \in R \) — it is. From \( (1, 2) \in R \) and \( (2, 2) \in R \), we need \( (1, 2) \in R \) — it is. From \( (2, 2) \in R \) and \( (2, 1) \in R \), we need \( (2, 1) \in R \) — it is. All other combinations involve element 3, which is not in any pair, so no obligation arises. Hence \( R \) is transitive. — Reason: Transitivity only creates obligations when both \( (a,b) \) and \( (b,c) \) are already in \( R \); element 3 appears in no pair, so it never triggers any transitive requirement.
  6. Step 6: Summarise the findings: \( R \) is symmetric and transitive but not reflexive, confirming that these three properties are logically independent — a relation can satisfy two of them without satisfying the third. — Reason: This example directly answers the question by construction, showing that 'symmetric + transitive' does not force reflexivity.

Final Answer

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

Common Mistake

One common mistake: students assume that if a relation is both symmetric and transitive then it must automatically be reflexive (reasoning that \( (a,b) \in R \) and \( (b,a) \in R \) give \( (a,a) \in R \) by transitivity). This reasoning fails because an element like 3 that does not appear in any pair at all creates no such obligation — reflexivity still requires \( (3,3) \in R \) explicitly.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Let \( A = \{1, 2, 3\} \) and define \( R = \{(1,1),(2,2),(1,2),(2,1)\} \).
  2. Step 2: Not reflexive: \( (3,3) \notin R \), so the condition \( (a,a) \in R \ \forall\, a \in A \) fails.
  3. Step 3: Symmetric: \( (1,2) \in R \Rightarrow (2,1) \in R \); all pairs satisfy \( (a,b) \in R \Rightarrow (b,a) \in R \).
  4. Step 4: Transitive: \( (1,2),(2,1) \in R \Rightarrow (1,1) \in R \); \( (2,1),(1,2) \in R \Rightarrow (2,2) \in R \); all cases hold.

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

➕ More Examples

More Examples

Example 1

Question: Let \( A = \{1, 2, 3, 4\} \). Define a relation \( R \) on \( A \) by \[ R = \{(2, 4),\, (4, 2),\, (2, 2),\, (4, 4)\} \] Verify that \( R \) is symmetric and transitive but NOT reflexive.

Solution: We check each property in turn. Checking Reflexivity: For R to be reflexive, every element of A must be related to itself, i.e., (a, a) ∈ R for all a ∈ A. The element \( 1 \in A \), but \( (1, 1) \notin R \). Similarly \( (3, 3) \notin R \). Hence R is NOT reflexive. Checking Symmetry: We verify that whenever \( (a, b) \in R \), we also have \( (b, a) \in R \). For \( (2, 4) \in R \): we check \( (4, 2) \in R \). Yes. For \( (4, 2) \in R \): we check \( (2, 4) \in R \). Yes. For \( (2, 2) \in R \): we need \( (2, 2) \in R \). Yes (it is its own reverse). For \( (4, 4) \in R \): we need \( (4, 4) \in R \). Yes. So R is symmetric. Checking Transitivity: We verify that whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Case 1: \( (2, 4) \in R \) and \( (4, 2) \in R \) — we need \( (2, 2) \in R \). Yes. Case 2: \( (4, 2) \in R \) and \( (2, 4) \in R \) — we need \( (4, 4) \in R \). Yes. Case 3: \( (2, 4) \in R \) and \( (4, 4) \in R \) — we need \( (2, 4) \in R \). Yes. Case 4: \( (4, 2) \in R \) and \( (2, 2) \in R \) — we need \( (4, 2) \in R \). Yes. Case 5: \( (2, 2) \in R \) and \( (2, 4) \in R \) — we need \( (2, 4) \in R \). Yes. Case 6: \( (4, 4) \in R \) and \( (4, 2) \in R \) — we need \( (4, 2) \in R \). Yes. All other combinations involving elements not in R vacuously hold. So R is transitive. Conclusion: R is symmetric and transitive but not reflexive (since \( (1,1) \notin R \) and \( (3,3) \notin R \)).

Answer: R is symmetric and transitive but NOT reflexive, because elements 1 and 3 in A are never related to themselves.

Example 2

Question: On the set \( A = \{a, b, c\} \), define a relation \[ R = \{(a, b),\, (b, a),\, (a, a),\, (b, b)\} \] Show that R is symmetric and transitive but not reflexive.

Solution: We examine all three properties. Checking Reflexivity: For R to be reflexive, we need \( (x, x) \in R \) for every \( x \in A \). Since \( c \in A \) but \( (c, c) \notin R \), the relation R is NOT reflexive. Checking Symmetry: We go through each ordered pair in R: For \( (a, b) \in R \): is \( (b, a) \in R \)? Yes. For \( (b, a) \in R \): is \( (a, b) \in R \)? Yes. For \( (a, a) \in R \): is \( (a, a) \in R \)? Yes (self-symmetric). For \( (b, b) \in R \): is \( (b, b) \in R \)? Yes (self-symmetric). Hence R is symmetric. Checking Transitivity: We check all combinations \( (x, y) \in R \) and \( (y, z) \in R \): Case 1: \( (a, b) \in R \) and \( (b, a) \in R \) — need \( (a, a) \in R \). Yes. Case 2: \( (a, b) \in R \) and \( (b, b) \in R \) — need \( (a, b) \in R \). Yes. Case 3: \( (b, a) \in R \) and \( (a, b) \in R \) — need \( (b, b) \in R \). Yes. Case 4: \( (b, a) \in R \) and \( (a, a) \in R \) — need \( (b, a) \in R \). Yes. Case 5: \( (a, a) \in R \) and \( (a, b) \in R \) — need \( (a, b) \in R \). Yes. Case 6: \( (a, a) \in R \) and \( (a, a) \in R \) — need \( (a, a) \in R \). Yes. Case 7: \( (b, b) \in R \) and \( (b, a) \in R \) — need \( (b, a) \in R \). Yes. Case 8: \( (b, b) \in R \) and \( (b, b) \in R \) — need \( (b, b) \in R \). Yes. All required pairs are present. Hence R is transitive. Conclusion: R is symmetric and transitive but not reflexive, since \( c \in A \) but \( (c, c) \notin R \).

Answer: R is symmetric and transitive but NOT reflexive, because the element c in A has no self-pair (c, c) in R.

🎯 Try a Similar Question

Try a Similar Question

Question: On the set \( B = \{4, 5, 6\} \), define a relation and verify that it is symmetric and transitive but NOT reflexive.

Solution

  1. Step 1: Define a suitable relation: Consider the set \( B = \{4, 5, 6\} \) and define the relation \( R = \{(4, 5),\ (5, 4),\ (4, 4),\ (5, 5)\} \).
  2. Step 2: Check Reflexivity: For R to be reflexive, we need \( (a, a) \in R \) for every \( a \in B \). We have \( (4, 4) \in R \) and \( (5, 5) \in R \), but \( (6, 6) \notin R \). Therefore R is NOT reflexive.
  3. Step 3: Check Symmetry: For R to be symmetric, whenever \( (a, b) \in R \) we need \( (b, a) \in R \). Check each pair: \( (4, 5) \in R \) and \( (5, 4) \in R \) ✓; \( (5, 4) \in R \) and \( (4, 5) \in R \) ✓; \( (4, 4) \in R \) and \( (4, 4) \in R \) ✓; \( (5, 5) \in R \) and \( (5, 5) \in R \) ✓. Hence R is symmetric.
  4. Step 4: Check Transitivity: For R to be transitive, whenever \( (a, b) \in R \) and \( (b, c) \in R \), we need \( (a, c) \in R \). Check all combinations: \( (4, 5) \in R \) and \( (5, 4) \in R \) implies we need \( (4, 4) \in R \) ✓; \( (5, 4) \in R \) and \( (4, 5) \in R \) implies we need \( (5, 5) \in R \) ✓; \( (4, 5) \in R \) and \( (5, 5) \in R \) implies we need \( (4, 5) \in R \) ✓; \( (5, 4) \in R \) and \( (4, 4) \in R \) implies we need \( (5, 4) \in R \) ✓. All other cases are trivially satisfied. Hence R is transitive.
  5. Step 5: Conclusion: The relation \( R = \{(4, 5),\ (5, 4),\ (4, 4),\ (5, 5)\} \) on \( B = \{4, 5, 6\} \) is symmetric and transitive but not reflexive, since \( (6, 6) \notin R \).

Answer: On the set \( B = \{4, 5, 6\} \), the relation \( R = \{(4, 5),\ (5, 4),\ (4, 4),\ (5, 5)\} \) is symmetric and transitive but NOT reflexive, because \( (6, 6) \notin R \).

Everything you get with Solver7

More questions in Relations and Functions