Let and be two equivalence relations on a set. Consider the following assertions:
- is an equivalence relation
- is an equivalence relation
Which of the following is correct?
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 and defined on a set .
Assertion (ii): is an equivalence relation
An equivalence relation must be reflexive, symmetric, and transitive. Let us check these properties for :
- Reflexivity: Since and are equivalence relations, they are both reflexive. For any , and . Therefore, . Thus, is reflexive.
- Symmetry: Let . This means and . Since both and are symmetric, we have and . Thus, . Thus, is symmetric.
- Transitivity: Let and .
- From , we get (since is transitive).
- From , we get (since is transitive).
Since satisfies all three properties, Assertion (ii) is always true.
Assertion (i): is an equivalence relation
The union of two equivalence relations is not necessarily transitive. We can show this with a counterexample:
Let .
- Let (equivalence relation with partition )
- Let (equivalence relation with partition )
Now, their union is:
In , we have and , but . Hence, transitivity fails, and 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.
