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
CBSE Class 12 Maths · Relations and Functions
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)\}. \]
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.
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 \).
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)\}. \]
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 \)).
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)\}. \]
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.
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)\}. \]
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
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
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.
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.