SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 1 Q6

Let \( A =\{1, 2, 3\}.\) Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is (A)1 (B)2 (C) 3 (D) 4

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 friendships. Some rules say every person must be their own friend, and if A is friends with B, then B must also be friends with A. Now, the relation must include the pairs (1,2) and (1,3). Adding their reverses gives us the only valid list. Surprisingly, just one such list exists that follows all the rules but still breaks the chain rule — where friend-of-a-friend must also be friends.

Answer: The correct option is (A) 1. The only relation is \[ R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)\}. \]

📖 Counting Reflexive & Symmetric but Not Transitive Relations

Detailed Explanation

A relation \( R \) on a set \( A \) is a subset of \( A \times A \). For our set \( A = \{1, 2, 3\} \): A relation is reflexive if it contains \( (1,1), (2,2), (3,3) \). A relation is symmetric if whenever \( (a,b) \in R \), then \( (b,a) \in R \) too. A relation is transitive if whenever \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). We must build relations that MUST contain \( (1,2) \) and \( (1,3) \), are reflexive and symmetric, but NOT transitive. So we start with the forced pairs and see which extra pairs keep it symmetric but break transitivity.

Formula Used

Reflexive: \( (a,a) \in R \text{ for all } 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: List the pairs that MUST be in \( R \). For reflexivity we need \( (1,1), (2,2), (3,3) \). The question forces \( (1,2) \) and \( (1,3) \). Since \( R \) must be symmetric, adding \( (1,2) \) forces \( (2,1) \), and adding \( (1,3) \) forces \( (3,1) \).
  2. Step 2: Collect the minimum forced set: \[ R_0 = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)\}. \] This is the smallest relation satisfying reflexivity, symmetry, and containing the required pairs.
  3. Step 3: Check whether \( R_0 \) is transitive. We have \( (2,1) \in R_0 \) and \( (1,3) \in R_0 \), so transitivity would require \( (2,3) \). But \( (2,3) \notin R_0 \). Hence \( R_0 \) is NOT transitive. So \( R_0 \) itself is one valid relation.
  4. Step 4: Now consider adding the only remaining pairs \( (2,3) \) and \( (3,2) \). To stay symmetric, they must be added together (as a pair). If we add BOTH \( (2,3) \) and \( (3,2) \), the relation becomes the full set \( A \times A \), which is transitive. So adding both is NOT allowed.
  5. Step 5: Consider adding just \( (2,3) \) to \( R_0 \), keeping it symmetric means we must also add \( (3,2) \), which returns us to the full relation (already ruled out). So the only allowed choices give exactly these valid relations: \[ R_1 = R_0 \text{ (no extra pair added)}. \] Because any single symmetric addition of the \( \{(2,3),(3,2)\} \) pair forces transitivity, only limited combinations work.
  6. Step 6: Careful count: the extra pairs available are the symmetric pair \( \{(2,3),(3,2)\} \). We may leave it out (giving \( R_0 \)), or include only \( (2,3) \), or include only \( (3,2) \). Including only one of them keeps the relation non-transitive but breaks symmetry, so those are invalid. Including both breaks non-transitivity. Thus the valid relations are: \( R_0 \); \( R_0 \cup \{(2,3)\} \); and \( R_0 \cup \{(3,2)\} \) — but symmetry rejects the last two. So only the ones that keep symmetry AND fail transitivity count, giving a total of 1 base relation. Extending the standard NCERT analysis, the valid relations number 1.
  7. Step 7: Final verification (standard NCERT result): The smallest relation \( R_0 \) is reflexive, symmetric, contains \( (1,2) \) and \( (1,3) \), and is not transitive. Any attempt to enlarge it while preserving symmetry forces \( (2,3) \) and \( (3,2) \) together, making it transitive. Hence exactly ONE such relation exists.

Final Answer

The correct option is (A) 1. The only relation is \[ R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)\}. \]

Common Mistake

A common mistake is adding only \( (2,3) \) without its symmetric partner \( (3,2) \); this breaks symmetry. Students also wrongly count relations that include both \( (2,3) \) and \( (3,2) \), forgetting this makes the relation transitive (in fact the full relation \( A \times A \)).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and the mandatory pairs. We are working with \( A = \\{1, 2, 3\\} \). The problem requires that \( (1,2) \in R \) and \( (1,3) \in R \). — Reason: These are the 'forced' non-diagonal pairs that every valid relation must include.
  2. Step 2: Add the reflexive pairs. For \( R \) to be reflexive, we must include \( (1,1),\\, (2,2),\\, (3,3) \). — Reason: Reflexivity demands that every element be related to itself, so these three diagonal pairs are non-negotiable.
  3. Step 3: Apply symmetry to the forced non-diagonal pairs. Because \( (1,2) \in R \), symmetry forces \( (2,1) \in R \). Similarly, because \( (1,3) \in R \), symmetry forces \( (3,1) \in R \). — Reason: A symmetric relation must contain the reverse of every pair it already contains.
  4. Step 4: Assemble the minimum relation built so far: \[ R_0 = \\{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)\\}. \] — Reason: This is the smallest reflexive, symmetric relation that contains the two required pairs.
  5. Step 5: Check whether \( R_0 \) is transitive. Notice \( (2,1) \in R_0 \) and \( (1,3) \in R_0 \). Transitivity would then require \( (2,3) \in R_0 \). But \( (2,3) \notin R_0 \), so transitivity fails. — Reason: We need the relation to be NOT transitive, and this gap confirms \( R_0 \) qualifies.
  6. Step 6: Examine whether any additional pair can be added while keeping the relation non-transitive. The remaining candidate pairs are \( (2,3) \) and \( (3,2) \). Adding \( (2,3) \) (and hence \( (3,2) \) by symmetry) fills the transitivity gap: with \( (2,1),(1,3),(2,3) \) all present, every chain \( (a,b),(b,c) \Rightarrow (a,c) \) holds, making the relation transitive. — Reason: Any superset of \( R_0 \) that includes \( (2,3) \) and \( (3,2) \) becomes transitive, so it cannot be a valid answer.
  7. Step 7: Conclude the count. The only reflexive, symmetric, non-transitive relation on \( A \) that contains both \( (1,2) \) and \( (1,3) \) is \( R_0 \) itself. No other relation satisfies all four conditions simultaneously. — Reason: Every larger symmetric superset of \( R_0 \) turns out to be transitive, leaving exactly one valid relation.

Final Answer

The correct option is (A) 1. The only relation is \[ R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)\}. \]

Common Mistake

One common mistake: Students add the pair \( (2,3) \) and its symmetric counterpart \( (3,2) \) to make the relation 'look more complete', not realising that doing so actually repairs the transitivity gap and makes the relation transitive, which disqualifies it.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Forced pairs: reflexivity requires \ (1,1),(2,2),(3,3) \ ; question forces \ (1,2),(1,3) \ ; symmetry forces \ (2,1),(3,1) \.
  2. Step 2: Minimum relation: \ R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)\} \ .
  3. Step 3: Transitivity check: \ (2,1) \in R \ and \ (1,3) \in R \ but \ (2,3) \notin R \ , so \ R \ is NOT transitive. Adding any pair to restore transitivity also forces \ (2,3),(3,2) \ and makes \ R \ transitive, so no valid extension exists. Count = 1.

Answer: The correct option is (A) 1. The only relation is \[ R = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)\}. \]

➕ More Examples

More Examples

Example 1

Question: Let \( A = \{1, 2, 3\} \). Find the number of relations on \( A \) that contain the pairs \( (2, 3) \) and \( (2, 1) \), and are reflexive and symmetric but NOT transitive.

Solution: We need a relation \( R \) on \( A = \{1, 2, 3\} \) that is reflexive, symmetric, contains \( (2, 3) \) and \( (2, 1) \), but is NOT transitive. Step 1: Reflexivity requires \( (1,1), (2,2), (3,3) \in R \). Step 2: Since \( (2,3) \in R \), symmetry forces \( (3,2) \in R \). Since \( (2,1) \in R \), symmetry forces \( (1,2) \in R \). So the mandatory pairs so far are: \[ R_0 = \{(1,1),(2,2),(3,3),(2,3),(3,2),(2,1),(1,2)\} \] Step 3: Check transitivity of \( R_0 \). We have \( (1,2) \in R_0 \) and \( (2,3) \in R_0 \), but \( (1,3) \notin R_0 \). So \( R_0 \) is NOT transitive. Good. Also \( (3,2) \in R_0 \) and \( (2,1) \in R_0 \), but \( (3,1) \notin R_0 \). Not transitive. Step 4: Can we add any optional pairs and still remain non-transitive? The only remaining symmetric pairs we could add are \( \{(1,3),(3,1)\} \). If we add both \( (1,3) \) and \( (3,1) \), let \( R_1 = R_0 \cup \{(1,3),(3,1)\} \). Check transitivity of \( R_1 \): For all pairs \( (a,b) \in R_1 \) and \( (b,c) \in R_1 \), verify \( (a,c) \in R_1 \). Since \( R_1 \) contains all possible pairs among \( \{1,2,3\} \) (9 pairs total), it is the universal relation, which IS transitive. So \( R_1 \) is transitive — we cannot add both \( (1,3) \) and \( (3,1) \). If we add only \( (1,3) \), the relation is not symmetric (since \( (3,1) \) would be missing). So this is invalid. Similarly adding only \( (3,1) \) breaks symmetry. Therefore, the ONLY relation that is reflexive, symmetric, contains \( (2,3) \) and \( (2,1) \), and is NOT transitive is \( R_0 \) itself. The number of such relations is \( \mathbf{1} \).

Answer: 1

Example 2

Question: Let \( B = \{a, b, c\} \). How many relations on \( B \) contain the pairs \( (a, b) \) and \( (b, c) \), are reflexive and symmetric, but are NOT transitive?

Solution: We need a relation \( R \) on \( B = \{a, b, c\} \) that is reflexive, symmetric, contains \( (a, b) \) and \( (b, c) \), but is NOT transitive. Step 1: Reflexivity requires \( (a,a),(b,b),(c,c) \in R \). Step 2: Symmetry with \( (a,b) \in R \) forces \( (b,a) \in R \), and \( (b,c) \in R \) forces \( (c,b) \in R \). The mandatory set of pairs is: \[ R_0 = \{(a,a),(b,b),(c,c),(a,b),(b,a),(b,c),(c,b)\} \] Step 3: Check transitivity of \( R_0 \). We have \( (a,b) \in R_0 \) and \( (b,c) \in R_0 \), but \( (a,c) \notin R_0 \). So \( R_0 \) is NOT transitive. This is a valid relation. Also \( (c,b) \in R_0 \) and \( (b,a) \in R_0 \), but \( (c,a) \notin R_0 \). Not transitive either. Step 4: The only optional symmetric pair we could still add is \( \{(a,c),(c,a)\} \). If we add both \( (a,c) \) and \( (c,a) \) to get \( R_1 = R_0 \cup \{(a,c),(c,a)\} \), this is the complete relation on \( B \) (all 9 ordered pairs). Check transitivity: for every \( (x,y) \) and \( (y,z) \) in \( R_1 \), \( (x,z) \) is also in \( R_1 \) since all pairs are present. So \( R_1 \) IS transitive — this does not qualify. Adding only \( (a,c) \) without \( (c,a) \) violates symmetry, and vice versa. So neither can be added alone. Step 5: Conclusion. The only relation satisfying all conditions (reflexive, symmetric, contains \( (a,b) \) and \( (b,c) \), but NOT transitive) is \( R_0 \). The number of such relations is \( \mathbf{1} \).

Answer: 1

🎯 Try a Similar Question

Try a Similar Question

Question: Let \(A = \{1, 2, 3\}\). Find the number of relations on \(A\) that contain the pairs \((2, 3)\) and \((3, 1)\), and are reflexive and symmetric but NOT transitive.

Solution

  1. Step 1: Build the mandatory pairs from reflexivity: A reflexive relation on \(A = \{1,2,3\}\) must contain \((1,1)\), \((2,2)\), and \((3,3)\).
  2. Step 2: Include the required pairs and their symmetric counterparts: The relation must contain \((2,3)\) and \((3,1)\). For symmetry, it must also contain \((3,2)\) (symmetric to \((2,3)\)) and \((1,3)\) (symmetric to \((3,1)\)). So far the relation must include: \[R \supseteq \{(1,1),(2,2),(3,3),(2,3),(3,2),(3,1),(1,3)\}.\]
  3. Step 3: Check transitivity of the mandatory part: Check whether this core set is already transitive. We have \((2,3)\) and \((3,1)\), so transitivity requires \((2,1)\). We also have \((1,3)\) and \((3,2)\), so transitivity requires \((1,2)\). These pairs \((2,1)\) and \((1,2)\) are NOT yet in the core set, so the core set alone is NOT transitive. The relation \[R_0 = \{(1,1),(2,2),(3,3),(2,3),(3,2),(3,1),(1,3)\}\] is reflexive and symmetric but not transitive.
  4. Step 4: Check if adding optional pairs can preserve non-transitivity: The remaining candidate pairs are \((1,2)\), \((2,1)\). Can we add exactly one of them and still remain symmetric and non-transitive? Symmetry forces us to add both \((1,2)\) and \((2,1)\) together. So either we add none, or we add both.
  5. Step 5: Test adding both \((1,2)\) and \((2,1)\): Consider \[R_1 = \{(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2),(3,1),(1,3)\}.\] Check transitivity: \((1,2)\) and \((2,3)\) gives \((1,3)\) — present. \((2,3)\) and \((3,1)\) gives \((2,1)\) — present. \((3,1)\) and \((1,2)\) gives \((3,2)\) — present. \((1,3)\) and \((3,2)\) gives \((1,2)\) — present. All required pairs are present, so \(R_1\) IS transitive. Therefore \(R_1\) does not qualify.
  6. Step 6: Count qualifying relations: The only reflexive, symmetric, and NOT transitive relation containing both \((2,3)\) and \((3,1)\) is \[R_0 = \{(1,1),(2,2),(3,3),(2,3),(3,2),(3,1),(1,3)\}.\] Adding both remaining optional pairs makes the relation transitive. Hence there is exactly 1 such relation.

Answer: There is exactly 1 such relation, namely \[R = \{(1,1),(2,2),(3,3),(2,3),(3,2),(3,1),(1,3)\},\] which is reflexive and symmetric but not transitive.

Everything you get with Solver7

More questions in Relations and Functions