Question 13 Marks
Let I be the set of all integers. A relation R on I, such that $x R y$ holds iff $(x-y)$ is divisible by $5, x \in$ $I, y \in I$, i.e., $R =\{(x, y): x \in I, y \in I, x-y$ is divisible by 5$\}$. Prove that it is an equivalence relation.
Answer
View full question & answer→Here we observe that,
(i) For each $x \in I, x-x=0$ and 0 is divisible by 5 . Thus, $\forall x \in I$, we have $x R x$. Therefore, $R$ is reflexive.
(ii) Suppose $x R y$; then $x-y$ is divisible by 5 and hence $(y-x)=-(x-y)$ is also divisible by 5 . Thus, $x R y$ $\Rightarrow y R x$. Therefore, $R$ is symmetric.
(iii) Suppose $x R y$ and $y R z$; then $(x-y)$ and $(y-z)$ are both divisible by 5 . Hence 5 is also a divisor of $(x-y)$ $+(y-z)$, i.e., 5 is also a divisor of $(x-z)$. Thus, $x R y$ and $y R z \Rightarrow x R z$.
Therefore, $R$ is transitive.
Since, $R$ is reflexive, symmetric and transitive, therefore $R$ is an equivalence
(i) For each $x \in I, x-x=0$ and 0 is divisible by 5 . Thus, $\forall x \in I$, we have $x R x$. Therefore, $R$ is reflexive.
(ii) Suppose $x R y$; then $x-y$ is divisible by 5 and hence $(y-x)=-(x-y)$ is also divisible by 5 . Thus, $x R y$ $\Rightarrow y R x$. Therefore, $R$ is symmetric.
(iii) Suppose $x R y$ and $y R z$; then $(x-y)$ and $(y-z)$ are both divisible by 5 . Hence 5 is also a divisor of $(x-y)$ $+(y-z)$, i.e., 5 is also a divisor of $(x-z)$. Thus, $x R y$ and $y R z \Rightarrow x R z$.
Therefore, $R$ is transitive.
Since, $R$ is reflexive, symmetric and transitive, therefore $R$ is an equivalence