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.
The smallest relation $R_{1}$ containing $(1,2)$ and $(2,3)$ which is reflexive and transitive but not symmetric is $\{(1,1),\,(2,2),\,(3,3),$ $(1,2),\,(2,3),\,(1,3)\} .$ Now, if we add the pair $(2,1)$ to $R_{1}$ to get $R_{2}$, then the relation $R_{2}$ will be reflexive, transitive but not symmetric. Similarly, we can obtain $R _{3}$ and $R _{4}$ by adding $(3,2)$ and $(3,1)$ respectively, to $R_{1}$ to get the desired relations. However, we can not add any two pairs out of $(2,1),$ $(3,2)$ and $(3,1)$ to $R_{1}$ at a time, as by doing so, we will be forced to add the remaining third pair in order to maintain transitivity and in the process, the relation will become symmetric also which is not required. Thus, the total number of desired relations is four.
Let $R$ be a relation on $Z \times Z$ defined by$ (a, b)$$R(c, d)$ if and only if $ad - bc$ is divisible by $5$ . Then $\mathrm{R}$ is
Show that the relation $R$ defined in the set A of all triangles as $R =\left\{\left( T _{1},\, T _{2}\right):\, T _{1}\right.$ is similar to $\left. T _{2}\right\}$, is equivalence relation. Consider three right angle triangles $T _{1}$ with sides $3,\,4,\,5, \,T _{2}$ with sides $5,\,12\,,13 $ and $T _{3}$ with sides $6,\,8,\,10 .$ Which triangles among $T _{1},\, T _{2}$ and $T _{3}$ are related?
Let $S$ be the set of all real numbers. Then the relation $R = \{(a, b) : 1 + ab > 0\}$ on $S$ is
Let a relation $R$ on $\mathbb{N} \times \mathbb{N}$ be defined as : $\left(\mathrm{x}_1, \mathrm{y}_1\right) \mathrm{R}\left(\mathrm{x}_2, \mathrm{y}_2\right)$ if and only if $\mathrm{x}_1 \leq \mathrm{x}_2$ or $\mathrm{y}_1 \leq \mathrm{y}_2$
Consider the two statements :
($I$) $\mathrm{R}$ is reflexive but not symmetric.
($II$) $\mathrm{R}$ is transitive
Then which one of the following is true?
If $R = \{ (x,\,y)|x,\,y \in Z,\,{x^2} + {y^2} \le 4\} $ is a relation in $Z$, then domain of $R$ is