Let R_1 be a relation defined by R_1 ={(a, b) | vedclass

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

Question

For any $a \in R$ , we have $a \geq a$, Therefore the relation $R$ is reflexive but it is not symmetric as $(2, 1) \in R$ but $(1, 2) 
otin

Vedclass · Accepted Answer

Reflexive, transitive but not symmetric

Vedclass · Answer

For any $a \in R$ , we have $a \geq a$, Therefore the relation $R$ is reflexive but it is not symmetric as $(2, 1) \in R$ but $(1, 2) 
otin R$ . The relation $R$ is transitive also, because $(a,b) \in R,(b,c) \in R$ imply that $a \geq b$ and $b \geq c$ which is turn imply that $a \geq c$ .

Let $R_1$ be a relation defined by $R_1 =\{(a, b) | a \geq b, a, b \in R\}$ . Then $R_1$ is

Similar Questions

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

Let $A=\{1,2,3,4\}$ and $R$ be a relation on the set $A \times A$ defined by $R=\{((a, b),(c, d)): 2 a+3 b=4 c+5 d\}$. Then the number of elements in $R$ is:

Show that the number of equivalence relation in the set $\{1,2,3\} $ containing $(1,2)$ and $(2,1)$ is two.

The number of relations $R$ from an $m$-element set $A$ to an $n$-element set $B$ satisfying the condition$\left(a, b_1\right) \in R,\left(a, b_2\right) \in R \Rightarrow b_1=b_2$ for $a \in A, b_1, b_2 \in B$ is

The void relation on a set $A$ is