Let A = {p, q, r}. Which of the following is | vedclass

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

Question

(D) An equivalence relation must be reflexive,symmetric,and transitive.For a relation on $A = \{p, q, r\}$ to be reflexive,it must contain $(p, p), (q

Vedclass · Accepted Answer

None of these

Vedclass · Answer

(D) An equivalence relation must be reflexive,symmetric,and transitive.For a relation on $A = \{p, q, r\}$ to be reflexive,it must contain $(p, p), (q, q),$ and $(r, r)$.$R_1$ does not contain $(q, q)$ and $(r, r)$,so it is not reflexive.$R_2$ does not contain $(p, p)$,so it is not reflexive.$R_3$ contains $(p, p), (q, q),$ and $(r, r)$,so it is reflexive. However,it is not symmetric because $(p, q) \in R_3$ but $(q, p) 
otin R_3$.Therefore,none of the given relations are equivalence relations.

Let $A = \{p, q, r\}$. Which of the following is an equivalence relation on $A$?

Similar Questions

Let the relation $R$ on the set $M = \{1, 2, 3, \dots, 16\}$ be given by $R = \{(x, y) : 4y = 5x - 3, x, y \in M\}$. Then the minimum number of elements required to be added in $R$, in order to make the relation symmetric, is equal to

Give an example of a relation on a set $A = \{5, 6, 7\}$ which is symmetric but neither reflexive nor transitive.

Show that the number of equivalence relations on the set $A = \{1, 2, 3\}$ containing $(1, 2)$ and $(2, 1)$ is $2$.

Let $R$ and $S$ be two equivalence relations on a set $A$. Then

Let $R$ be an equivalence relation on a finite set $A$ having $n$ elements. Then the number of ordered pairs in $R$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module