Give an example of a relation. Which is Symmetric but neither reflexive nor transitive.
Give an example of a relation. Which is Symmetric but neither reflexive nor transitive.
Let $A=\{5,6,7\}$
Define a relation $R$ on $A$ as $R =\{(5,6),(6,5)\}$
Relation $R$ is not reflexive as $(5,5),\,(6,6),\,(7,7) \notin R$
Now, as $(5,6)\in R$ and also $(6,5) \in R , R$ is symmetric.
$\Rightarrow(5,6),\,(6,5) \in R,$ but $(5,5)\notin R$
$\therefore R$ is not transitive.
Hence, relation $R$ is symmetric but not reflexive or transitive.
Similar Questions
Let $N$ denote the set of all natural numbers. Define two binary relations on $N$ as $R_1 = \{(x,y) \in N \times N : 2x + y= 10\}$ and $R_2 = \{(x,y) \in N\times N : x+ 2y= 10\} $. Then
Let $N$ denote the set of all natural numbers. Define two binary relations on $N$ as $R_1 = \{(x,y) \in N \times N : 2x + y= 10\}$ and $R_2 = \{(x,y) \in N\times N : x+ 2y= 10\} $. Then
- [JEE MAIN 2018]
Let the relations $R_1$ and $R_2$ on the set $\mathrm{X}=\{1,2,3, \ldots, 20\}$ be given by $\mathrm{R}_1=\{(\mathrm{x}, \mathrm{y}): 2 \mathrm{x}-3 \mathrm{y}=2\}$ and $\mathrm{R}_2=\{(\mathrm{x}, \mathrm{y}):-5 \mathrm{x}+4 \mathrm{y}=0\}$. If $\mathrm{M}$ and $\mathrm{N}$ be the minimum number of elements required to be added in $R_1$ and $R_2$, respectively, in order to make the relations symmetric, then $\mathrm{M}+\mathrm{N}$ equals
Let the relations $R_1$ and $R_2$ on the set $\mathrm{X}=\{1,2,3, \ldots, 20\}$ be given by $\mathrm{R}_1=\{(\mathrm{x}, \mathrm{y}): 2 \mathrm{x}-3 \mathrm{y}=2\}$ and $\mathrm{R}_2=\{(\mathrm{x}, \mathrm{y}):-5 \mathrm{x}+4 \mathrm{y}=0\}$. If $\mathrm{M}$ and $\mathrm{N}$ be the minimum number of elements required to be added in $R_1$ and $R_2$, respectively, in order to make the relations symmetric, then $\mathrm{M}+\mathrm{N}$ equals
- [JEE MAIN 2024]
Show that the relation $R$ in the set $A$ of all the books in a library of a college, given by $R =\{(x, y): x $ and $y$ have same number of pages $\}$ is an equivalence relation.
Show that the relation $R$ in the set $A$ of all the books in a library of a college, given by $R =\{(x, y): x $ and $y$ have same number of pages $\}$ is an equivalence relation.
Define a relation $R$ over a class of $n \times n$ real matrices $A$ and $B$ as $"ARB$ iff there exists a non-singular matrix $P$ such that $PAP ^{-1}= B "$ Then which of the following is true?
Define a relation $R$ over a class of $n \times n$ real matrices $A$ and $B$ as $"ARB$ iff there exists a non-singular matrix $P$ such that $PAP ^{-1}= B "$ Then which of the following is true?
- [JEE MAIN 2021]
Let $A=\{1,2,3\} .$ Then show that the number of relations containing $(1,2) $ and $(2,3)$ which are reflexive and transitive but not symmetric is four.
Let $A=\{1,2,3\} .$ Then show that the number of relations containing $(1,2) $ and $(2,3)$ which are reflexive and transitive but not symmetric is four.