SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q18

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

Solution

👶 Simple Explanation

Simple Explanation

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 \).

📖 Intersection of Two Equivalence Relations

Detailed Explanation

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.

Formula Used

\( (a,b) \in R_1 \cap R_2 \iff (a,b) \in R_1 \text{ and } (a,b) \in R_2 \)

Solution

  1. Step 1: Recall what must be proved. To show \( R_1 \cap R_2 \) is an equivalence relation on \( A \), we must show it is reflexive, symmetric, and transitive. We will use that \( R_1 \) and \( R_2 \) are both already equivalence relations.
  2. Step 2 (Reflexive): Let \( a \in A \) be arbitrary. Since \( R_1 \) is reflexive, \( (a,a) \in R_1 \). Since \( R_2 \) is reflexive, \( (a,a) \in R_2 \). As \( (a,a) \) lies in both, \( (a,a) \in R_1 \cap R_2 \). This holds for every \( a \in A \), so \( R_1 \cap R_2 \) is reflexive.
  3. Step 3 (Symmetric): Let \( (a,b) \in R_1 \cap R_2 \). Then \( (a,b) \in R_1 \) and \( (a,b) \in R_2 \). Since \( R_1 \) is symmetric, \( (b,a) \in R_1 \). Since \( R_2 \) is symmetric, \( (b,a) \in R_2 \). Hence \( (b,a) \in R_1 \cap R_2 \), so \( R_1 \cap R_2 \) is symmetric.
  4. Step 4 (Transitive): Let \( (a,b) \in R_1 \cap R_2 \) and \( (b,c) \in R_1 \cap R_2 \). Then \( (a,b), (b,c) \in R_1 \), and since \( R_1 \) is transitive, \( (a,c) \in R_1 \). Similarly \( (a,b), (b,c) \in R_2 \), and since \( R_2 \) is transitive, \( (a,c) \in R_2 \). Therefore \( (a,c) \in R_1 \cap R_2 \), so \( R_1 \cap R_2 \) is transitive.
  5. Step 5 (Conclusion): Since \( R_1 \cap R_2 \) is reflexive, symmetric, and transitive, it satisfies all three defining conditions. Hence \( R_1 \cap R_2 \) is an equivalence relation on \( A \).

Final Answer

\( R_1 \cap R_2 \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( A \).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Set up the goal: We are given that \( R_1 \) and \( R_2 \) are both equivalence relations on a set \( A \). Our task is to show that \( R_1 \cap R_2 \) is also an equivalence relation on \( A \). — Reason: An equivalence relation must satisfy exactly three properties — reflexivity, symmetry, and transitivity — so we will check each one in turn, using the membership condition \( (a,b) \in R_1 \cap R_2 \iff (a,b) \in R_1 \text{ and } (a,b) \in R_2 \).
  2. Step 2: Prove Reflexivity: Pick any arbitrary element \( a \in A \). Since \( R_1 \) is an equivalence relation, it is reflexive, so \( (a,a) \in R_1 \). Since \( R_2 \) is an equivalence relation, it is also reflexive, so \( (a,a) \in R_2 \). Because \( (a,a) \) belongs to both relations, we conclude \( (a,a) \in R_1 \cap R_2 \). — Reason: Since this argument works for every \( a \in A \), the relation \( R_1 \cap R_2 \) is reflexive.
  3. Step 3: Prove Symmetry: Suppose \( (a,b) \in R_1 \cap R_2 \) for some \( a, b \in A \). By the intersection definition, \( (a,b) \in R_1 \) and \( (a,b) \in R_2 \). Since \( R_1 \) is symmetric, \( (a,b) \in R_1 \) implies \( (b,a) \in R_1 \). Since \( R_2 \) is symmetric, \( (a,b) \in R_2 \) implies \( (b,a) \in R_2 \). Therefore \( (b,a) \) lies in both \( R_1 \) and \( R_2 \), giving \( (b,a) \in R_1 \cap R_2 \). — Reason: We transferred the symmetry of each individual relation to their intersection, confirming \( R_1 \cap R_2 \) is symmetric.
  4. Step 4: Prove Transitivity: Suppose \( (a,b) \in R_1 \cap R_2 \) and \( (b,c) \in R_1 \cap R_2 \) for some \( a, b, c \in A \). By the intersection definition, \( (a,b) \in R_1 \), \( (b,c) \in R_1 \), \( (a,b) \in R_2 \), and \( (b,c) \in R_2 \). Since \( R_1 \) is transitive, \( (a,b) \in R_1 \) and \( (b,c) \in R_1 \) together imply \( (a,c) \in R_1 \). Since \( R_2 \) is transitive, \( (a,b) \in R_2 \) and \( (b,c) \in R_2 \) together imply \( (a,c) \in R_2 \). Hence \( (a,c) \in R_1 \cap R_2 \). — Reason: We applied the transitivity of each relation separately and then combined the results using the intersection condition, so \( R_1 \cap R_2 \) is transitive.
  5. Step 5: State the Conclusion: We have verified all three required properties: \( R_1 \cap R_2 \) is reflexive (Step 2), symmetric (Step 3), and transitive (Step 4). — Reason: A relation that satisfies all three properties simultaneously qualifies as an equivalence relation, so we can now state the final conclusion.

Final Answer

\( R_1 \cap R_2 \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( A \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexive: For any \( a \in A \): \( R_1 \) reflexive \( \Rightarrow (a,a) \in R_1 \); \( R_2 \) reflexive \( \Rightarrow (a,a) \in R_2 \); so \( (a,a) \in R_1 \cap R_2 \). Hence \( R_1 \cap R_2 \) is reflexive.
  2. Symmetric: Let \( (a,b) \in R_1 \cap R_2 \Rightarrow (a,b) \in R_1 \) and \( (a,b) \in R_2 \). Symmetry of \( R_1, R_2 \) gives \( (b,a) \in R_1 \) and \( (b,a) \in R_2 \), so \( (b,a) \in R_1 \cap R_2 \). Hence \( R_1 \cap R_2 \) is symmetric.
  3. Transitive: Let \( (a,b) \in R_1 \cap R_2 \) and \( (b,c) \in R_1 \cap R_2 \). Then \( (a,b),(b,c) \in R_1 \Rightarrow (a,c) \in R_1 \); and \( (a,b),(b,c) \in R_2 \Rightarrow (a,c) \in R_2 \); so \( (a,c) \in R_1 \cap R_2 \). Hence \( R_1 \cap R_2 \) is transitive.

Answer: \( R_1 \cap R_2 \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( A \).

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: Set up a specific counterexample: Let \( A = \\{1, 2, 3\\} \). Define two relations on \( A \): \nLet \( R_1 = \\{(1,1),\\,(2,2),\\,(3,3),\\,(1,2),\\,(2,1)\\} \) and \( R_2 = \\{(1,1),\\,(2,2),\\,(3,3),\\,(2,3),\\,(3,2)\\} \). \nWe first verify that both \( R_1 \) and \( R_2 \) are equivalence relations on \( A \).
  2. Step 2: Verify R₁ is an equivalence relation: Reflexive: \( (1,1),(2,2),(3,3) \in R_1 \). Symmetric: \( (1,2) \in R_1 \Rightarrow (2,1) \in R_1 \). Transitive: \( (1,2),(2,1) \in R_1 \Rightarrow (1,1) \in R_1 \); all other cases are trivial. So \( R_1 \) is an equivalence relation.
  3. Step 3: Verify R₂ is an equivalence relation: Reflexive: \( (1,1),(2,2),(3,3) \in R_2 \). Symmetric: \( (2,3) \in R_2 \Rightarrow (3,2) \in R_2 \). Transitive: \( (2,3),(3,2) \in R_2 \Rightarrow (2,2) \in R_2 \); all other cases are trivial. So \( R_2 \) is an equivalence relation.
  4. Step 4: Compute R₁ ∪ R₂: Taking the union: \[ R_1 \cup R_2 = \\{(1,1),\\,(2,2),\\,(3,3),\\,(1,2),\\,(2,1),\\,(2,3),\\,(3,2)\\} \]
  5. Step 5: Show R₁ ∪ R₂ is Reflexive: For any \( a \in A \), since \( R_1 \) is reflexive, \( (a, a) \in R_1 \). Therefore \( (a, a) \in R_1 \cup R_2 \). Hence \( R_1 \cup R_2 \) is reflexive.
  6. Step 6: Show R₁ ∪ R₂ is Symmetric: Let \( (a, b) \in R_1 \cup R_2 \). Then \( (a, b) \in R_1 \) or \( (a, b) \in R_2 \). If \( (a, b) \in R_1 \), since \( R_1 \) is symmetric, \( (b, a) \in R_1 \subseteq R_1 \cup R_2 \). Similarly if \( (a, b) \in R_2 \), then \( (b, a) \in R_2 \subseteq R_1 \cup R_2 \). Hence \( R_1 \cup R_2 \) is symmetric.
  7. Step 7: Show R₁ ∪ R₂ is NOT necessarily Transitive (counterexample): From our example, observe that \( (1, 2) \in R_1 \subseteq R_1 \cup R_2 \) and \( (2, 3) \in R_2 \subseteq R_1 \cup R_2 \). For transitivity we would need \( (1, 3) \in R_1 \cup R_2 \). But \( (1, 3) \notin R_1 \) and \( (1, 3) \notin R_2 \), so \( (1, 3) \notin R_1 \cup R_2 \). This violates transitivity.
  8. Step 8: Conclusion: We have shown that \( R_1 \cup R_2 \) is always reflexive and symmetric (since each of \( R_1 \) and \( R_2 \) is reflexive and symmetric). However, \( R_1 \cup R_2 \) need not be transitive, as demonstrated by the counterexample above. Therefore, \( R_1 \cup R_2 \) is NOT necessarily an equivalence relation on \( A \).

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.

Everything you get with Solver7

More questions in Relations and Functions