Give an example of a relation. Which is Reflexive and symmetric but not transitive.
Give an example of a relation. Which is Reflexive and symmetric but not transitive.
Let $A=\{4,6,8\}$
Define a relation $R$ on $A$ as
$A=\{(4,4),\,(6,6),\,(8,8),\,(4,6),\,(6,4),\,(6,8),\,(8,6)\}$
Relation $R$ is reflexive since for every $a \in A,\,(a, \,a) \in R$
i.e., $\{(4,4),(6,6),(8,8)\}\in R$
Relation $R$ is symmetric since $(a, \,b) \in R \Rightarrow(b, a) \in R$ for all $a, \,b \in R$
Relation $R$ is not transitive since $(4,6),(6,8) \in R,$ but $(4,8)\notin R$
Hence, relation $R$ is reflexive and symmetric but not transitive.
Similar Questions
The relation $R$ defined in $N$ as $aRb \Leftrightarrow b$ is divisible by $a$ is
The relation $R$ defined in $N$ as $aRb \Leftrightarrow b$ is divisible by $a$ is
Let $\mathrm{A}=\{1,2,3,4,5\}$. Let $\mathrm{R}$ be a relation on $\mathrm{A}$ defined by $x R y$ if and only if $4 x \leq 5 y$. Let $m$ be the number of elements in $\mathrm{R}$ and $\mathrm{n}$ be the minimum number of elements from $\mathrm{A} \times \mathrm{A}$ that are required to be added to $\mathrm{R}$ to make it a symmetric relation. Then $m+n$ is equal to:
Let $\mathrm{A}=\{1,2,3,4,5\}$. Let $\mathrm{R}$ be a relation on $\mathrm{A}$ defined by $x R y$ if and only if $4 x \leq 5 y$. Let $m$ be the number of elements in $\mathrm{R}$ and $\mathrm{n}$ be the minimum number of elements from $\mathrm{A} \times \mathrm{A}$ that are required to be added to $\mathrm{R}$ to make it a symmetric relation. Then $m+n$ is equal to:
- [JEE MAIN 2024]
Determine whether each of the following relations are reflexive, symmetric and transitive:
Relation $R$ in the set $A$ of human beings in a town at a particular time given by
$R =\{(x, y): x $ is father of $y\}$
Determine whether each of the following relations are reflexive, symmetric and transitive:
Relation $R$ in the set $A$ of human beings in a town at a particular time given by
$R =\{(x, y): x $ is father of $y\}$
Let $A = \{1, 2, 3\}, B = \{1, 3, 5\}$. If relation $R$ from $A$ to $B$ is given by $R =\{(1, 3), (2, 5), (3, 3)\}$. Then ${R^{ - 1}}$ is
Let $A = \{1, 2, 3\}, B = \{1, 3, 5\}$. If relation $R$ from $A$ to $B$ is given by $R =\{(1, 3), (2, 5), (3, 3)\}$. Then ${R^{ - 1}}$ is
If $R$ is an equivalence relation on a set $A$, then ${R^{ - 1}}$ is
If $R$ is an equivalence relation on a set $A$, then ${R^{ - 1}}$ is