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
$A =\{1,2,3,4,5\}$ and $R =\{( a , b ):| a - b |$ is even $\}$
It is clear that for any element $a \in A$, we have $|a-a|=0$ (which is even).
$\therefore R$ is reflexive.
Let $(a, b) \in R$
$\Rightarrow|a-b|$ is even
$\Rightarrow|-(a-b)|=|b-a|$ is also even
$\Rightarrow(b, a) \in R$
$\therefore R$ is symmetric.
Now, let $(a, b) \in R$ and $(b, c) \in R$
$\Rightarrow|a-b|$ is even and $|b-c|$ is even
$\Rightarrow(a-b)$ is even and $(b-c)$ is even
$\Rightarrow(a-c)=(a-b)+(b-c)$ is even [Sum of two even integers is even]
$\Rightarrow|a-b|$ is even.
$\Rightarrow(a, c) \in R$
$\therefore R$ is transitive.
Hence, $R$ is an equivalence relation.
Now, all elements of the set $\{1,2,3\}$ are related to each other as all the elements of this subset are odd. Thus, the modulus of the difference between any two elements will be even.
Similarly, all elements of the set $\{2,4\}$ are related to each other as all the elements of this subset are even.
Also, no element of the subset $\{1,3,5\}$ can be related to any element of $\{2,4\}$ as all elements of $\{1,3,5\}$ are odd and all elements of $\{2,4\}$ are even. Thus, the modulus of the difference between the two elements (from each of these two subsets) will not be even $[$ as $1-2,\,1-4$, $3-2,\,3-4$, $5-2$ and $5-4$ all are odd $]$
Let $A=\{1,2,3, \ldots 20\}$. Let $R_1$ and $R_2$ two relation on $\mathrm{A}$ such that $\mathrm{R}_1=\{(\mathrm{a}, \mathrm{b}): \mathrm{b}$ is divisible by $\mathrm{a}\}$ $\mathrm{R}_2=\{(\mathrm{a}, \mathrm{b}): \mathrm{a}$ is an integral multiple of $\mathrm{b}\}$. Then, number of elements in $R_1-R_2$ is equal to_____.
Let $n(A) = n$. Then the number of all relations on $A$ is
Let $R$ and $S$ be two relations on a set $A$. 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
If $R$ is an equivalence relation on a Set $A$, then $R^{-1}$ is not :-