If $R$ be a relation $<$ from $A = \{1,2, 3, 4\}$ to $B = \{1, 3, 5\}$ i.e., $(a,\,b) \in R \Leftrightarrow a < b,$ then $Ro{R^{ - 1}}$ is
$\{(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)\}$
$\{(3, 1) (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)\}$
$\{(3, 3), (3, 5), (5, 3), (5, 5)\}$
$\{(3, 3) (3, 4), (4, 5)\}$
Let $A = \{1, 2, 3\}, B = \{1, 3, 5\}$. $A$ relation $R:A \to B$ is defined by $R = \{(1, 3), (1, 5), (2, 1)\}$. Then ${R^{ - 1}}$ is defined by
Let $M$ denotes set of all $3 \times 3$ non singular matrices. Define the relation $R$ by
$R = \{ (A,B) \in M \times M$ : $AB = BA\} ,$ then $R$ is-
Show that the relation $R$ in the set $A=\{1,2,3,4,5\}$ given by $R =\{(a, b):|a-b|$ is even $\},$ is an equivalence relation. Show that all the elements of $\{1,3,5\}$ are related to each other and all the elements of $ \{2,4\}$ are
How many reflexive relation are there on a set ' with $3$ elements
Let $R$ and $S$ be two equivalence relations on a set $A$. Then