Skip to content
Official PYQ · 1998

GATE CS 1998 Q1.7 — Sets, Relations and Functions

Explain with AI

Let R1R_1 and R2R_2 be two equivalence relations on a set. Consider the following assertions:

  1. R1∪R2R_1 \cup R_2 is an equivalence relation
  2. R1∩R2R_1 \cap R_2 is an equivalence relation

Which of the following is correct?

Choose one option
View worked solution

Answer: C

To determine the validity of the assertions, let us analyze the properties of the intersection and union of two equivalence relations R1R_1 and R2R_2 defined on a set AA.

Assertion (ii): R1∩R2R_1 \cap R_2 is an equivalence relation

An equivalence relation must be reflexive, symmetric, and transitive. Let us check these properties for R1∩R2R_1 \cap R_2:

  • Reflexivity: Since R1R_1 and R2R_2 are equivalence relations, they are both reflexive. For any a∈Aa \in A, (a,a)∈R1(a, a) \in R_1 and (a,a)∈R2(a, a) \in R_2. Therefore, (a,a)∈R1∩R2(a, a) \in R_1 \cap R_2. Thus, R1∩R2R_1 \cap R_2 is reflexive.
  • Symmetry: Let (a,b)∈R1∩R2(a, b) \in R_1 \cap R_2. This means (a,b)∈R1(a, b) \in R_1 and (a,b)∈R2(a, b) \in R_2. Since both R1R_1 and R2R_2 are symmetric, we have (b,a)∈R1(b, a) \in R_1 and (b,a)∈R2(b, a) \in R_2. Thus, (b,a)∈R1∩R2(b, a) \in R_1 \cap R_2. Thus, R1∩R2R_1 \cap R_2 is symmetric.
  • Transitivity: Let (a,b)∈R1∩R2(a, b) \in R_1 \cap R_2 and (b,c)∈R1∩R2(b, c) \in R_1 \cap R_2.
    • From (a,b),(b,c)∈R1(a, b), (b, c) \in R_1, we get (a,c)∈R1(a, c) \in R_1 (since R1R_1 is transitive).
    • From (a,b),(b,c)∈R2(a, b), (b, c) \in R_2, we get (a,c)∈R2(a, c) \in R_2 (since R2R_2 is transitive).
    Therefore, (a,c)∈R1∩R2(a, c) \in R_1 \cap R_2. Thus, R1∩R2R_1 \cap R_2 is transitive.

Since R1∩R2R_1 \cap R_2 satisfies all three properties, Assertion (ii) is always true.

Assertion (i): R1∪R2R_1 \cup R_2 is an equivalence relation

The union of two equivalence relations is not necessarily transitive. We can show this with a counterexample:

Let A={1,2,3}A = \{1, 2, 3\}.

  • Let R1={(1,1),(2,2),(3,3),(1,2),(2,1)}R_1 = \{(1,1), (2,2), (3,3), (1,2), (2,1)\} (equivalence relation with partition {{1,2},{3}}\{\{1, 2\}, \{3\}\})
  • Let R2={(1,1),(2,2),(3,3),(2,3),(3,2)}R_2 = \{(1,1), (2,2), (3,3), (2,3), (3,2)\} (equivalence relation with partition {{1},{2,3}}\{\{1\}, \{2, 3\}\})

Now, their union is: R1∪R2={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}R_1 \cup R_2 = \{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)\}

In R1∪R2R_1 \cup R_2, we have (1,2)∈R1∪R2(1, 2) \in R_1 \cup R_2 and (2,3)∈R1∪R2(2, 3) \in R_1 \cup R_2, but (1,3)∉R1∪R2(1, 3) \notin R_1 \cup R_2. Hence, transitivity fails, and R1∪R2R_1 \cup R_2 is not an equivalence relation. Thus, Assertion (i) is not true.

Therefore, Assertion (ii) is true but Assertion (i) is not true.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Sets, Relations and Functions questions