If \(R_1\) and \(R_2\) are equivalence relations in a set A, show that \(R_1\cap R_2\) is also an equivalence relation.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Think of two clubs with very strict membership rules. Club \( R_1 \) and Club \( R_2 \) each treat their members fairly and equally. Now imagine a new, even stricter club made of only those members who belong to both clubs at the same time. This new club, called \( R_1 \cap R_2 \), still follows all the same fair rules. Because both original clubs were balanced and fair, the shared group stays balanced and fair too.
Answer: \( R_1 \cap R_2 \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( A \).
A relation \( R \) on a set \( A \) is called an equivalence relation if it is reflexive, symmetric, and transitive. Reflexive means \( (a,a) \in R \) for every \( a \in A \). Symmetric means whenever \( (a,b) \in R \), we also have \( (b,a) \in R \). Transitive means whenever \( (a,b) \in R \) and \( (b,c) \in R \), we get \( (a,c) \in R \). Here we are given two equivalence relations \( R_1 \) and \( R_2 \) on the same set \( A \). Their intersection \( R_1 \cap R_2 \) consists of all ordered pairs that belong to BOTH relations, that is \( (a,b) \in R_1 \cap R_2 \) if and only if \( (a,b) \in R_1 \) and \( (a,b) \in R_2 \). To prove \( R_1 \cap R_2 \) is an equivalence relation, we simply verify all three properties, using the fact that both \( R_1 \) and \( R_2 \) already satisfy them.
\( (a,b) \in R_1 \cap R_2 \iff (a,b) \in R_1 \text{ and } (a,b) \in R_2 \)
\( R_1 \cap R_2 \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( A \).
A common mistake is assuming the result holds for the union \( R_1 \cup R_2 \) as well. The union need not be transitive: a pair may come from \( R_1 \) and another from \( R_2 \), so their 'combined' pair need not lie in either relation. Only the intersection is guaranteed to be an equivalence relation.
\( R_1 \cap R_2 \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( A \).
One common mistake: students sometimes assume that if \( R_1 \) and \( R_2 \) are equivalence relations then their union \( R_1 \cup R_2 \) is also an equivalence relation — this is false because the union may fail transitivity. Only the intersection is guaranteed to inherit all three properties from both parent relations.
Answer: \( R_1 \cap R_2 \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( A \).
Question: Let \( S \) and \( T \) be two equivalence relations defined on a non-empty set \( B \). Prove that \( S \cap T \) is also an equivalence relation on \( B \).
Solution: We need to show that \( S \cap T \) is reflexive, symmetric, and transitive. Step 1 — Reflexivity: Since \( S \) is an equivalence relation on \( B \), it is reflexive. So for every \( a \in B \), we have \( (a, a) \in S \). Since \( T \) is an equivalence relation on \( B \), it is also reflexive. So for every \( a \in B \), we have \( (a, a) \in T \). Therefore, for every \( a \in B \), \( (a, a) \in S \) and \( (a, a) \in T \), which means \( (a, a) \in S \cap T \). Hence \( S \cap T \) is reflexive. Step 2 — Symmetry: Let \( (a, b) \in S \cap T \) for some \( a, b \in B \). This means \( (a, b) \in S \) and \( (a, b) \in T \). Since \( S \) is symmetric, \( (a, b) \in S \Rightarrow (b, a) \in S \). Since \( T \) is symmetric, \( (a, b) \in T \Rightarrow (b, a) \in T \). Therefore \( (b, a) \in S \) and \( (b, a) \in T \), so \( (b, a) \in S \cap T \). Hence \( S \cap T \) is symmetric. Step 3 — Transitivity: Let \( (a, b) \in S \cap T \) and \( (b, c) \in S \cap T \) for some \( a, b, c \in B \). This means \( (a, b) \in S \), \( (a, b) \in T \), \( (b, c) \in S \), and \( (b, c) \in T \). Since \( S \) is transitive, \( (a, b) \in S \) and \( (b, c) \in S \Rightarrow (a, c) \in S \). Since \( T \) is transitive, \( (a, b) \in T \) and \( (b, c) \in T \Rightarrow (a, c) \in T \). Therefore \( (a, c) \in S \) and \( (a, c) \in T \), so \( (a, c) \in S \cap T \). Hence \( S \cap T \) is transitive. Since \( S \cap T \) is reflexive, symmetric, and transitive, \( S \cap T \) is an equivalence relation on \( B \).
Answer: \( S \cap T \) is an equivalence relation on \( B \), as it satisfies reflexivity, symmetry, and transitivity.
Question: Let \( P \), \( Q \), and \( R \) be three equivalence relations on a non-empty set \( X \). Show that \( P \cap Q \cap R \) is also an equivalence relation on \( X \).
Solution: We use the fact that the intersection of any two equivalence relations is an equivalence relation (proved in Example 1), and then apply it twice. Alternatively, we verify the three properties directly for \( P \cap Q \cap R \). Step 1 — Reflexivity: Since \( P \), \( Q \), and \( R \) are each equivalence relations on \( X \), each is reflexive. So for every \( x \in X \), we have \( (x, x) \in P \), \( (x, x) \in Q \), and \( (x, x) \in R \). Therefore \( (x, x) \in P \cap Q \cap R \) for every \( x \in X \). Hence \( P \cap Q \cap R \) is reflexive. Step 2 — Symmetry: Let \( (a, b) \in P \cap Q \cap R \). This means \( (a, b) \in P \), \( (a, b) \in Q \), and \( (a, b) \in R \). Since \( P \) is symmetric, \( (b, a) \in P \). Since \( Q \) is symmetric, \( (b, a) \in Q \). Since \( R \) is symmetric, \( (b, a) \in R \). Therefore \( (b, a) \in P \cap Q \cap R \). Hence \( P \cap Q \cap R \) is symmetric. Step 3 — Transitivity: Let \( (a, b) \in P \cap Q \cap R \) and \( (b, c) \in P \cap Q \cap R \). This means \( (a, b) \in P \), \( (b, c) \in P \), \( (a, b) \in Q \), \( (b, c) \in Q \), \( (a, b) \in R \), and \( (b, c) \in R \). Since \( P \) is transitive, \( (a, c) \in P \). Since \( Q \) is transitive, \( (a, c) \in Q \). Since \( R \) is transitive, \( (a, c) \in R \). Therefore \( (a, c) \in P \cap Q \cap R \). Hence \( P \cap Q \cap R \) is transitive. Since all three properties are satisfied, \( P \cap Q \cap R \) is an equivalence relation on \( X \). Remark: By repeated application of this result, the intersection of any finite number of equivalence relations on a set is also an equivalence relation.
Answer: \( P \cap Q \cap R \) is an equivalence relation on \( X \), as it satisfies reflexivity, symmetry, and transitivity.
Question: Let \( R_1 \) and \( R_2 \) be two equivalence relations defined on a non-empty set \( A \). Show that \( R_1 \cup R_2 \) is NOT necessarily an equivalence relation on \( A \) by giving a specific counterexample to the transitivity of \( R_1 \cup R_2 \). Additionally, verify that \( R_1 \cup R_2 \) is always reflexive and symmetric.
Answer: \( R_1 \cup R_2\) is always reflexive and symmetric, but it is NOT necessarily transitive, and hence NOT necessarily an equivalence relation on \( A \). The counterexample with \( A = \\{1,2,3\\} \), \( R_1 = \\{(1,1),(2,2),(3,3),(1,2),(2,1)\\} \), \( R_2 = \\{(1,1),(2,2),(3,3),(2,3),(3,2)\\} \) shows that \( (1,2) \in R_1 \cup R_2 \) and \( (2,3) \in R_1 \cup R_2 \) but \( (1,3) \notin R_1 \cup R_2 \), violating transitivity.