Give an example of a relation. Which is Transitive but neither reflexive nor symmetric.
Consider a relation $R$ in $R$ defined as:
$R =\{( a , b ): a < b \}$
For any $a \in R$, we have $(a, a) \notin R$ since a cannot be strictly less than a itself.
In fact, $a=a$
$\therefore R$ is not reflexive.
Now, $(1,2)\in R$ $($ as $1<2)$
But, $2$ is not less than $1.$
$\therefore (2,1) \notin R$
$\therefore R$ is not symmetric.
Now, let $(a, b),\,(b, c) \in R$
$\Rightarrow a < b$ and $b < c$
$\Rightarrow a < c$
$\Rightarrow(a, c) \in R$
$\therefore R$ is transitive.
Hence, relation $R$ is transitive but not reflexive and symmetric.
Let $R= \{(3, 3) (5, 5), (9, 9), (12, 12), (5, 12), (3, 9), (3, 12), (3, 5)\}$ be a relation on the set $A= \{3, 5, 9, 12\}.$ Then, $R$ is
If $A = \{1, 2, 3\}$ , $B = \{1, 4, 6, 9\}$ and $R$ is a relation from $A$ to $B$ defined by ‘$x$ is greater than $y$’. The range of $R$ is
Let $R$ be the relation defined in the set $A=\{1,2,3,4,5,6,7\}$ by $R =\{(a, b):$ both $a$ and $b$ are either odd or even $\} .$ Show that $R$ is an equivalence relation. Further, show that all the elements of the subset $ \{1,3,5,7\}$ are related to each other and all the elements of the subset $\{2,4,6\}$ are related to each other, but no element of the subset $\{1,3,5,7\}$ is related to any element of the subset $\{2,4,6\} .$
Let $R_1$ and $R_2$ be two relations on a set $A$ , then choose incorrect statement
Let $R$ and $S$ be two equivalence relations on a set $A$. Then