Consider the relations R_1 and R_2 defined as | vedclass

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

Question

(B) For relation $R_1$: $a R_1 b \Leftrightarrow a^2+b^2=1$ for $a, b \in R$. $1$. Reflexivity: For $a=0.5$,$a^2+a^2 = 0.25+0.25 = 0.5 
eq 1$. So,$R_

Vedclass · Accepted Answer

Only $R_2$ is an equivalence relation

Vedclass · Answer

(B) For relation $R_1$: $a R_1 b \Leftrightarrow a^2+b^2=1$ for $a, b \in R$. $1$. Reflexivity: For $a=0.5$,$a^2+a^2 = 0.25+0.25 = 0.5 
eq 1$. So,$R_1$ is not reflexive. $2$. Symmetry: If $a^2+b^2=1$,then $b^2+a^2=1$,so $b R_1 a$. $R_1$ is symmetric. $3$. Transitivity: If $a R_1 b$ and $b R_1 c$,then $a^2+b^2=1$ and $b^2+c^2=1$. This does not imply $a^2+c^2=1$. For example,$a=1, b=0, c=1$. $1^2+0^2=1$ and $0^2+1^2=1$,but $1^2+1^2=2 
eq 1$. Thus,$R_1$ is not transitive. For relation $R_2$: $(a, b) R_2 (c, d) \Leftrightarrow a+d=b+c$ for $(a, b), (c, d) \in N 	imes N$. $1$. Reflexivity: $a+b=b+a$ is true,so $(a, b) R_2 (a, b)$. $2$. Symmetry: If $a+d=b+c$,then $c+b=d+a$,so $(c, d) R_2 (a, b)$. $3$. Transitivity: If $(a, b) R_2 (c, d)$ and $(c, d) R_2 (e, f)$,then $a+d=b+c$ and $c+f=d+e$. Adding these,$a+d+c+f = b+c+d+e \Rightarrow a+f=b+e$. Thus,$(a, b) R_2 (e, f)$. Since $R_2$ is reflexive,symmetric,and transitive,it is an equivalence relation. Therefore,only $R_2$ is an equivalence relation.

Consider the relations $R_1$ and $R_2$ defined as $a R_1 b \Leftrightarrow a^2+b^2=1$ for all $a, b \in R$ and $(a, b) R_2 (c, d) \Leftrightarrow a+d=b+c$ for all $(a, b), (c, d) \in N \times N$. Then:

Similar Questions

Let $R$ be a relation from the set $\{1, 2, 3, \ldots, 60\}$ to itself such that $R = \{(a, b) : b = pq\}$,where $p, q \geq 3$ are prime numbers and $b \leq 60$. Then,the number of elements in $R$ is.

Let $R = \{(1,2), (2,3), (3,3)\}$ be a relation defined on the set $A = \{1, 2, 3, 4\}$. Then the minimum number of elements needed to be added to $R$ so that $R$ becomes an equivalence relation is:

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

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

Vedclass Test Series

Exam Paper Generator

Online Exam Module