Show that the relation $R$ in the set $R$ of real numbers, defined as $R =\left\{(a, b): a \leq b^{2}\right\}$ is neither reflexive nor symmetric nor transitive.
Show that the relation $R$ in the set $R$ of real numbers, defined as $R =\left\{(a, b): a \leq b^{2}\right\}$ is neither reflexive nor symmetric nor transitive.
$( i)$ $R = \left\{ {(a,b):a \leqslant {b^2}} \right\}$
It can be observed that $\left(\frac{1}{2}, \frac{1}{2}\right) \notin R,$
since, $\frac{1}{2}>\left(\frac{1}{2}\right)^{2}$
$R$ is not reflexive.
Now, $(1,4)\in R$ as $1<42$ But, $4$ is not less than $1^{2}$.
$\therefore $ $(4,1) \notin R$
$\therefore R$ is not symmetric.
Now,
$(3,2),\,(2,1.5) \in R$ $[$ as $3<2^{2}=4 $ and $2<(1.5)^{2}=2.25]$
But, $3 >(1.5)^{2}=2.25$
$\therefore $ $(3,1.5) \notin R$
$\therefore $ $R$ is not transitive.
Hence, $R$ is neither reflexive, nor symmetric, nor transitive.
Similar Questions
Let $R$ and $S$ be two non-void relations on a set $A$. Which of the following statements is false
Let $R$ and $S$ be two non-void relations on a set $A$. Which of the following statements is false
Check whether the relation $R$ in $R$ defined by $S =\left\{(a, b): a \leq b^{3}\right\}$ is reflexive, symmetric or transitive.
Check whether the relation $R$ in $R$ defined by $S =\left\{(a, b): a \leq b^{3}\right\}$ is reflexive, symmetric or transitive.
If $R = \{ (x,\,y)|x,\,y \in Z,\,{x^2} + {y^2} \le 4\} $ is a relation in $Z$, then domain of $R$ is
If $R = \{ (x,\,y)|x,\,y \in Z,\,{x^2} + {y^2} \le 4\} $ is a relation in $Z$, then domain of $R$ is
The number of symmetric relations defined on the set $\{1,2,3,4\}$ which are not reflexive is
The number of symmetric relations defined on the set $\{1,2,3,4\}$ which are not reflexive is
- [JEE MAIN 2024]
Let $A =\{2,3,4,5, \ldots ., 30\}$ and $^{\prime} \simeq ^{\prime}$ be an equivalence relation on $A \times A ,$ defined by $(a, b) \simeq (c, d),$ if and only if $a d=b c .$ Then the number of ordered pairs which satisfy this equivalence relation with ordered pair $(4,3)$ is equal to :
Let $A =\{2,3,4,5, \ldots ., 30\}$ and $^{\prime} \simeq ^{\prime}$ be an equivalence relation on $A \times A ,$ defined by $(a, b) \simeq (c, d),$ if and only if $a d=b c .$ Then the number of ordered pairs which satisfy this equivalence relation with ordered pair $(4,3)$ is equal to :
- [JEE MAIN 2021]