Question 15 Marks
Suppose $N$ is set of natural numbers and $R$, is defined in $N \times N$ such that :
$(a, b) R (c, d) \Leftrightarrow a d(b+c)=b c(a+d)$. Prove that $R$ in equivalence in $N \times N$.
$(a, b) R (c, d) \Leftrightarrow a d(b+c)=b c(a+d)$. Prove that $R$ in equivalence in $N \times N$.
Answer
View full question & answer→Reflexive : Suppose $(a, b)$ is a arbitrary element in $N \times N$.
then $(a, b) \in N \times N$
$\Rightarrow a, b \in N$
$\Rightarrow a b(b+a)=b a(a+b)$
$[$from commutativity$]$
$\Rightarrow (a, b) R(a, b) \forall(a, b) \in N \times N$
$\therefore R$ is reflexive in $N \times N$.
Symmetric : Suppose $(a, b),(c, d) \in N \times N$ such that $(a, b) R (c, d)$ then
$\Rightarrow a d(b+c)=b c(a+d)$
$\Rightarrow b c(a+d)=a d(b+c)$
$\Rightarrow c b(d+a)=d a(c+b) \ [$from commutativity$]$
$\Rightarrow(c, d) R(a, b)$
thus $(a, b) R (c, d) $
$\Rightarrow(c, d) R (a, b) \forall(a, b),(c, d)$
$\in N \times N$.
So, $R$ is symmetric in $N \times N$.
Transitive : Suppose $(a, b),(c, d),(e, f) \in N \times N$ such that :
$(a, b) R (c, d)$ and $(c, d) R (e, f)$ then $(a, b) R (c, d)$
$\Rightarrow a d(b+c)=b(a+d)$
$\Rightarrow \frac{b+c}{b c}=\frac{a+d}{a d} $
$\Rightarrow \frac{1}{b}+\frac{1}{c}$
$=\frac{1}{a}+\frac{1}{d}\ (c, d) R (e, f)$
$\Rightarrow c f(d+e)=d e(c+f)$
$\Rightarrow \frac{d+e}{d e}=\frac{c+f}{c f}$
$ \Rightarrow \frac{1}{d}+\frac{1}{e}=\frac{1}{c}+\frac{1}{f} .$
On adding $(i)$ and $(ii) \left(\frac{1}{b}+\frac{1}{c}\right)+\left(\frac{1}{d}+\frac{1}{e}\right)=\left(\frac{1}{a}+\frac{1}{d}\right)+\left(\frac{1}{c}+\frac{1}{f}\right)$
$\Rightarrow \frac{1}{b}+\frac{1}{e}=\frac{1}{a}+\frac{1}{f} $
$\Rightarrow \frac{b+e}{b e}=\frac{a+f}{a f}$
$\Rightarrow a f(b+e)=b e(a+f)$
$\Rightarrow (a, b) R(e, f)$
Thus $(a, b) R(c, d) $ and $(c, d) R(e, f)$
$\Rightarrow (a, b) R(e, f) \forall(a, b),(c, d),(e, f) \in N \times N$so, $R$ is transitive.
Hence $R$ is equivalence relation in $N \times N$.
then $(a, b) \in N \times N$
$\Rightarrow a, b \in N$
$\Rightarrow a b(b+a)=b a(a+b)$
$[$from commutativity$]$
$\Rightarrow (a, b) R(a, b) \forall(a, b) \in N \times N$
$\therefore R$ is reflexive in $N \times N$.
Symmetric : Suppose $(a, b),(c, d) \in N \times N$ such that $(a, b) R (c, d)$ then
$\Rightarrow a d(b+c)=b c(a+d)$
$\Rightarrow b c(a+d)=a d(b+c)$
$\Rightarrow c b(d+a)=d a(c+b) \ [$from commutativity$]$
$\Rightarrow(c, d) R(a, b)$
thus $(a, b) R (c, d) $
$\Rightarrow(c, d) R (a, b) \forall(a, b),(c, d)$
$\in N \times N$.
So, $R$ is symmetric in $N \times N$.
Transitive : Suppose $(a, b),(c, d),(e, f) \in N \times N$ such that :
$(a, b) R (c, d)$ and $(c, d) R (e, f)$ then $(a, b) R (c, d)$
$\Rightarrow a d(b+c)=b(a+d)$
$\Rightarrow \frac{b+c}{b c}=\frac{a+d}{a d} $
$\Rightarrow \frac{1}{b}+\frac{1}{c}$
$=\frac{1}{a}+\frac{1}{d}\ (c, d) R (e, f)$
$\Rightarrow c f(d+e)=d e(c+f)$
$\Rightarrow \frac{d+e}{d e}=\frac{c+f}{c f}$
$ \Rightarrow \frac{1}{d}+\frac{1}{e}=\frac{1}{c}+\frac{1}{f} .$
On adding $(i)$ and $(ii) \left(\frac{1}{b}+\frac{1}{c}\right)+\left(\frac{1}{d}+\frac{1}{e}\right)=\left(\frac{1}{a}+\frac{1}{d}\right)+\left(\frac{1}{c}+\frac{1}{f}\right)$
$\Rightarrow \frac{1}{b}+\frac{1}{e}=\frac{1}{a}+\frac{1}{f} $
$\Rightarrow \frac{b+e}{b e}=\frac{a+f}{a f}$
$\Rightarrow a f(b+e)=b e(a+f)$
$\Rightarrow (a, b) R(e, f)$
Thus $(a, b) R(c, d) $ and $(c, d) R(e, f)$
$\Rightarrow (a, b) R(e, f) \forall(a, b),(c, d),(e, f) \in N \times N$so, $R$ is transitive.
Hence $R$ is equivalence relation in $N \times N$.