Let \(A =\{1, 2, 3\}.\) Then number of equivalence relations containing (1, 2) 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. An equivalence relation is like putting them into friend groups where everyone in a group is friends with everyone else in that group. We already know 1 and 2 must be in the same group. Now, 3 can either join their group or stay alone. Those are the only two ways to arrange the groups. So there are exactly two valid friend-grouping arrangements that include the pair \( (1, 2) \).
Answer: There are exactly \(2\) equivalence relations containing \((1, 2)\). The correct option is (B) 2.
A relation \(R\) on a set \(A\) is called an equivalence relation if it is reflexive, symmetric and transitive. Reflexive means every element is related to itself, so all pairs \((a, a)\) must be in \(R\). Symmetric means if \((a, b) \in R\) then \((b, a) \in R\). Transitive means if \((a, b) \in R\) and \((b, c) \in R\) then \((a, c) \in R\). Here \(A = \{1, 2, 3\}\), and we must count every equivalence relation that includes the pair \((1, 2)\). A useful way to think about equivalence relations is through partitions: each equivalence relation corresponds to a way of splitting \(A\) into disjoint groups (equivalence classes), where two elements are related exactly when they lie in the same group.
An equivalence relation must satisfy: Reflexive: \((a, a) \in R\) for all \(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\).
There are exactly \(2\) equivalence relations containing \((1, 2)\). The correct option is (B) 2.
A common mistake is forgetting that transitivity forces extra pairs: once you relate 3 to 1 (or to 2), you MUST also relate 3 to the other one, giving the full relation. Students who ignore this incorrectly count relations that are not transitive and end up with a wrong total.
There are exactly \(2\) equivalence relations containing \((1, 2)\). The correct option is (B) 2.
One common mistake: students forget that adding any extra pair (such as \( (1,3) \)) triggers a cascade of new required pairs through symmetry and transitivity, so they incorrectly count partial additions as separate valid relations when they actually collapse into \( R_2 \).
Answer: There are exactly \(2\) equivalence relations containing \((1, 2)\). The correct option is (B) 2.
Question: Let \( A = \{1, 2, 3\} \). Find the number of equivalence relations on \( A \) that contain the pair \( (2, 3) \).
Solution: We need to count all equivalence relations on \( A = \{1, 2, 3\} \) that contain the ordered pair \( (2, 3) \). Step 1: Recall that any equivalence relation must be reflexive, symmetric, and transitive. Step 2: If \( (2, 3) \) is in the relation, then by symmetry \( (3, 2) \) must also be in it. By reflexivity, \( (1,1), (2,2), (3,3) \) must all be in it. So, the relation must at minimum contain: \[ R_0 = \{(1,1),\ (2,2),\ (3,3),\ (2,3),\ (3,2)\} \] Step 3: Check that \( R_0 \) is a valid equivalence relation. The equivalence classes are \( \{1\} \) and \( \{2, 3\} \). It is reflexive, symmetric, and transitive. So \( R_0 \) is one valid equivalence relation. Step 4: Now, can we extend \( R_0 \) by adding more pairs? The only pairs not yet in \( R_0 \) are \( (1,2),\ (2,1),\ (1,3),\ (3,1) \). If we add \( (1,2) \), then by symmetry we need \( (2,1) \), and by transitivity (since \( (1,2) \) and \( (2,3) \) are in the relation) we also need \( (1,3) \), and by symmetry \( (3,1) \). This gives the universal relation: \[ R_1 = A \times A = \{(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1),(2,3),(3,2)\} \] This has a single equivalence class \( \{1, 2, 3\} \), and it is indeed a valid equivalence relation. Step 5: No other combinations are possible. Adding only \( (1,3) \) without \( (1,2) \) leads to: by symmetry \( (3,1) \) is required; by transitivity \( (3,1) \) and \( (1,3) \) give \( (3,3) \) (already present), but \( (3,2) \) and \( (2,3) \) are present, so \( (3,1) \) and transitivity with \( (1,3) \) give \( (3,3) \). However, \( (2,3) \) and \( (3,1) \) forces \( (2,1) \) and then \( (1,2) \) — so we end up at \( R_1 \) again. Therefore, there are exactly 2 equivalence relations on \( A \) containing \( (2, 3) \).
Answer: 2
Question: Let \( B = \{a, b, c, d\} \). How many equivalence relations on \( B \) contain the pair \( (a, b) \)?
Solution: We need all equivalence relations on \( B = \{a, b, c, d\} \) that include \( (a, b) \). Step 1: Since \( (a, b) \) is required, by symmetry \( (b, a) \) is also required. By reflexivity, \( (a,a),(b,b),(c,c),(d,d) \) are all required. So \( a \) and \( b \) must be in the same equivalence class. Step 2: An equivalence relation on \( B \) corresponds to a partition of \( B \). We need all partitions where \( a \) and \( b \) are in the same block. Step 3: Treat \( \{a, b\} \) as a single combined unit. We must now partition the set \( \{\{a,b\}, c, d\} \) — a 3-element collection — into non-empty blocks. The number of such partitions equals the Bell number \( B(3) = 5 \). Step 4: List all partitions of \( B \) where \( a \) and \( b \) are together: Partition 1: \( \{a,b\},\ \{c\},\ \{d\} \) — three separate blocks. Partition 2: \( \{a,b,c\},\ \{d\} \) — merge \( c \) into the \( \{a,b\} \) block. Partition 3: \( \{a,b,d\},\ \{c\} \) — merge \( d \) into the \( \{a,b\} \) block. Partition 4: \( \{a,b\},\ \{c,d\} \) — \( c \) and \( d \) form their own block. Partition 5: \( \{a,b,c,d\} \) — all elements in one block (universal relation). Step 5: Each partition corresponds to exactly one equivalence relation. All 5 are valid. Therefore, there are exactly 5 equivalence relations on \( B \) that contain the pair \( (a, b) \).
Answer: 5
Question: Let \( A = \{1, 2, 3\} \). Find the number of equivalence relations on \( A \) that contain the pair \( (1, 3) \). (A) 1 (B) 2 (C) 3 (D) 4
Answer: There are exactly \( 5 \) equivalence relations on \( A = \{1, 2, 3, 4\} \) that contain the pair \( (1, 2) \). The correct option is (C) 5.