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

Give an example of a relation. Which is Transitive but neither reflexive nor symmetric.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a group of three friends numbered 1, 2, and 3. A relation is just a list of who is 'connected' to whom. We pick only one connection: 1 is connected to 2. Nobody is connected to themselves, so the relation is not reflexive. Since 2 is not connected back to 1, it is not symmetric either. But transitivity only breaks when a chain like 1 to 2 and 2 to 3 exists without 1 to 3 — no such chain exists here, so transitivity holds perfectly.

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

📖 Relation That Is Transitive but Not Reflexive or Symmetric

Detailed Explanation

A relation \( R \) on a set \( A \) is a subset of \( A \times A \). We test three properties. A relation is reflexive if \( (a, a) \in R \) for every element \( 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 \). To answer this question, we need a relation that satisfies transitivity but fails both reflexivity and symmetry. A very simple approach is to work on a small finite set and pick just a few ordered pairs, then check each property carefully.

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. Let \( A = \{1, 2, 3\} \). We will define a relation \( R \) on \( A \) and then test its properties.
  2. Step 2: Define the relation. Let \( R = \{(1, 2)\} \). This relation contains only a single ordered pair, which makes checking each property quick.
  3. Step 3: Check reflexivity. For reflexivity we need \( (1, 1), (2, 2), (3, 3) \) all to be in \( R \). None of these pairs is present, so \( R \) is not reflexive.
  4. Step 4: Check symmetry. Here \( (1, 2) \in R \), but its reverse \( (2, 1) \) is not in \( R \). Since the symmetric partner is missing, \( R \) is not symmetric.
  5. Step 5: Check transitivity. Transitivity requires that if \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). The only pair is \( (1, 2) \). To use the transitive condition we would need a pair starting with \( 2 \), like \( (2, c) \), but no such pair exists. So the condition is never triggered, and it is vacuously satisfied. Hence \( R \) is transitive.

Final Answer

On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2)\} \) is transitive but neither reflexive nor symmetric.

Common Mistake

A common mistake is thinking a relation with only one pair cannot be transitive. In fact, transitivity is vacuously true whenever there is no pair of the form \( (a, b) \) and \( (b, c) \) to chain together, so such a relation still counts as transitive.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Choose a small working set. Let \( A = \{1, 2, 3\} \). — Reason: A three-element set is the simplest non-trivial domain on which we can meaningfully test all three relational properties without unnecessary complexity.
  2. Step 2: Define the relation \( R = \{(1, 2)\} \) on \( A \). — Reason: Picking a single ordered pair keeps verification fast and makes it easy to spot which properties hold or fail, since there are very few cases to check.
  3. Step 3: Test reflexivity. For \( R \) to be reflexive, every element of \( A \) must be related to itself, meaning \( (1,1),\, (2,2),\, (3,3) \) must all belong to \( R \). None of these pairs appears in \( R = \{(1,2)\} \), so \( R \) is NOT reflexive. — Reason: Reflexivity is checked by scanning for all diagonal pairs; even one missing pair disqualifies it.
  4. Step 4: Test symmetry. Since \( (1, 2) \in R \), symmetry demands that \( (2, 1) \in R \) as well. But \( (2, 1) \notin R \), so \( R \) is NOT symmetric. — Reason: Symmetry requires the reverse of every pair to also be present; finding any single counterexample is enough to disprove it.
  5. Step 5: Test transitivity. Transitivity would be violated only if there exist \( a, b, c \in A \) such that \( (a, b) \in R \) and \( (b, c) \in R \) but \( (a, c) \notin R \). The only pair in \( R \) is \( (1, 2) \), and there is no pair of the form \( (2, c) \) in \( R \). So the condition 'both \( (a,b) \) and \( (b,c) \) are in \( R \)' is never simultaneously satisfied, meaning there is no scenario that could violate transitivity. Hence \( R \) IS transitive. — Reason: When a relation is too small to form any chain of two consecutive pairs, the transitivity condition holds vacuously — there is simply nothing to contradict it.
  6. Step 6: Summarise the findings: \( R = \{(1,2)\} \) on \( A = \{1,2,3\} \) fails reflexivity (no diagonal pairs present), fails symmetry (the pair \( (2,1) \) is absent), but satisfies transitivity (no violating triple exists). — Reason: Collecting all three results confirms that this relation is exactly the type requested: transitive but neither reflexive nor symmetric.

Final Answer

On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2)\} \) is transitive but neither reflexive nor symmetric.

Common Mistake

One common mistake: Students often assume that a very small or 'sparse' relation cannot be transitive, forgetting that transitivity holds vacuously when no two consecutive pairs \( (a,b) \) and \( (b,c) \) both appear in \( R \) — there is no counterexample to transitivity if the required chain never forms.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Let \( A = \{1, 2, 3\} \) and define \( R = \{(1, 2)\} \).
  2. Step 2: Not reflexive: \( (1,1), (2,2), (3,3) \notin R \).
  3. Step 3: Not symmetric: \( (1,2) \in R \) but \( (2,1) \notin R \).
  4. Step 4: Transitive: No pair \( (a,b) \in R \) and \( (b,c) \in R \) exists simultaneously, so the condition holds vacuously. Hence \( R \) is transitive.

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

➕ More Examples

More Examples

Example 1

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

Solution: We check each property in turn. Step 1 — Check Reflexivity: For R to be reflexive, we need \( (a, a) \in R \) for every \( a \in A \). However, \( (1,1) \notin R \), \( (2,2) \notin R \), \( (3,3) \notin R \), and \( (4,4) \notin R \). Since no element is related to itself, R is NOT reflexive. Step 2 — Check Symmetry: For R to be symmetric, whenever \( (a, b) \in R \) we need \( (b, a) \in R \). We observe that \( (1, 2) \in R \) but \( (2, 1) \notin R \). Hence R is NOT symmetric. Step 3 — Check Transitivity: We must verify: if \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). The only chain to check is \( (1, 2) \in R \) and \( (2, 3) \in R \). We need \( (1, 3) \in R \), and indeed \( (1, 3) \in R \). No other pair of elements in R forms a composable chain, so the condition holds vacuously for all other cases. Therefore R is transitive. Conclusion: \( R = \{(1, 2), (2, 3), (1, 3)\} \) is transitive but neither reflexive nor symmetric.

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

Example 2

Question: Let \( A = \{p, q, r\} \). Define a relation R on A as \( R = \{(p, q), (p, r), (q, r)\} \). Verify that R is transitive but neither reflexive nor symmetric.

Solution: We check each property in turn. Step 1 — Check Reflexivity: For R to be reflexive, we need \( (x, x) \in R \) for all \( x \in A \). But \( (p, p) \notin R \), \( (q, q) \notin R \), and \( (r, r) \notin R \). Hence R is NOT reflexive. Step 2 — Check Symmetry: For symmetry, whenever \( (x, y) \in R \) we need \( (y, x) \in R \). We see that \( (p, q) \in R \) but \( (q, p) \notin R \). Hence R is NOT symmetric. Step 3 — Check Transitivity: We list all composable pairs: Case (i): \( (p, q) \in R \) and \( (q, r) \in R \). We require \( (p, r) \in R \), and indeed \( (p, r) \in R \). This condition is satisfied. Case (ii): \( (p, r) \in R \). There is no element \( s \in A \) with \( (r, s) \in R \), so no further requirement arises from this pair. Case (iii): \( (q, r) \in R \). Similarly, there is no \( s \in A \) with \( (r, s) \in R \), so no further requirement arises. All transitivity conditions are satisfied, so R is transitive. Conclusion: \( R = \{(p, q), (p, r), (q, r)\} \) is transitive but neither reflexive nor symmetric.

Answer: R = {(p, q), (p, r), (q, r)} is transitive but neither reflexive nor symmetric.

🎯 Try a Similar Question

Try a Similar Question

Question: On the set \( A = \{4, 5, 6\} \), define a relation R. Give an example of a relation on A that is transitive but neither reflexive nor symmetric. Verify all three properties for your relation.

Solution

  1. Step 1: Define a suitable relation: Consider the set \( A = \{4, 5, 6\} \) and define the relation \( R = \{(4, 5), (5, 6), (4, 6)\} \).
  2. Step 2: Check for Reflexivity: A relation is reflexive if \( (a, a) \in R \) for every \( a \in A \). Here, \( (4, 4) \notin R \), \( (5, 5) \notin R \), and \( (6, 6) \notin R \). Since none of the diagonal pairs belong to R, the relation is NOT reflexive.
  3. Step 3: Check for Symmetry: A relation is symmetric if \( (a, b) \in R \) implies \( (b, a) \in R \). We have \( (4, 5) \in R \), but \( (5, 4) \notin R \). Therefore, the relation is NOT symmetric.
  4. Step 4: Check for Transitivity: A relation is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Check all applicable pairs: Since \( (4, 5) \in R \) and \( (5, 6) \in R \), we need \( (4, 6) \in R \) — and indeed \( (4, 6) \in R \). No other pair of the form \( (a, b) \in R \) and \( (b, c) \in R \) exists in R. Hence the condition holds vacuously for all remaining cases. Therefore, R is transitive.
  5. Step 5: Conclusion: The relation \( R = \{(4, 5), (5, 6), (4, 6)\} \) on the set \( A = \{4, 5, 6\} \) is transitive but neither reflexive nor symmetric.

Answer: On the set \( A = \{4, 5, 6\} \), the relation \( R = \{(4, 5), (5, 6), (4, 6)\} \) is transitive but neither reflexive nor symmetric.

Everything you get with Solver7

More questions in Relations and Functions