Let rho_{1} and rho_{2} be two equivalence re | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) An equivalence relation must be reflexive, symmetric, and transitive. $1$. Intersection: If $\rho_{1}$ and $\rho_{2}$ are equivalence relations, t

Vedclass · Accepted Answer

$\rho_{1} \cap \rho_{2}$ is an equivalence relation but $\rho_{1} \cup \rho_{2}$ is not necessarily so.

Vedclass · Answer

(B) An equivalence relation must be reflexive, symmetric, and transitive. $1$. Intersection: If $\rho_{1}$ and $\rho_{2}$ are equivalence relations, then $\rho_{1} \cap \rho_{2}$ is always reflexive, symmetric, and transitive. Thus, $\rho_{1} \cap \rho_{2}$ is an equivalence relation. $2$. Union: The union $\rho_{1} \cup \rho_{2}$ is always reflexive and symmetric, but it is not necessarily transitive. For example, let $S = \{1, 2, 3\}$. Let $\rho_{1} = \{(1,1), (2,2), (3,3), (1,2), (2,1)\}$ and $\rho_{2} = \{(1,1), (2,2), (3,3), (2,3), (3,2)\}$. Then $\rho_{1} \cup \rho_{2}$ contains $(1,2)$ and $(2,3)$, but it does not contain $(1,3)$, so it is not transitive. Therefore, $\rho_{1} \cap \rho_{2}$ is an equivalence relation, but $\rho_{1} \cup \rho_{2}$ is not necessarily so.

Let $\rho_{1}$ and $\rho_{2}$ be two equivalence relations defined on a non-void set $S$. Then

Similar Questions

The number of relations on the set $A = \{1, 2, 3\}$ containing at most $6$ elements including $(1, 2)$,which are reflexive and transitive but not symmetric,is . . . . . . .

Let $P = \{ (x, y) | x^2 + y^2 = 1, x, y \in \mathbb{R} \}$. Then $P$ is:

Given the relation $R = \{(1, 2), (2, 3)\}$ on the set $A = \{1, 2, 3\}$,the minimum number of ordered pairs which when added to $R$ make it an equivalence relation is

Among the relations $S = \{(a, b) : a, b \in R - \{0\}, 2 + \frac{a}{b} > 0\}$ and $T = \{(a, b) : a, b \in R, a^2 - b^2 \in Z\}$,which of the following is true?

Vedclass Test Series

Exam Paper Generator

Online Exam Module