Answer
Verified
451.2k+ views
Hint: The congruence modulo $m$ is defined as the relation between $x$ and $y$ such that $x - y$ is divisible by m. Use the properties of set theory to prove that the congruence modulo $m$ is an equivalence relation.
Complete step-by-step answer:
The congruence modulo $m$ is defined as the relation between $x$ and $y$ such that $x - y$ is divisible by $m$. $xRy = x - y$is divisible by $m$. Or $x - y = km$ where $k$ is an integer.
For an relation to be reflexive , it should satisfy $xRx$.
For the given relation, $xRx = x - x = 0$, which is divisible by $m$. Therefore the relation is true for all values $\left( {x,x} \right)$. Therefore the given relation is reflexive.
For in relation to be symmetric, if $\left( {x,y} \right)$satisfies the relation then $\left( {y,x} \right)$ must also satisfy the relation.
For pair $\left( {x,y} \right)$ satisfying the given relation,
$xRy = x - y$ is divisible by $m$ or $x - y = km$
For the pair $\left( {y,x} \right)$, $yRx$ gives $y - x$ which is also divisible by $m$ as
$x - y = km$,
On taking $ - 1$ common from both sides, we get,
$y - x = - km$
$ - k$ is also an integer.
Therefore $yRx$ is true.
Thus the given relation is symmetric.
For a relation to be transitive, if $x,y$ satisfy the relation and $y,z$ satisfy the relation then $x,z$ must also satisfy the relation.
For $x,y$ and $y,z$ satisfy relation we can say
$x - y$ is divisible by $m$ and \[y - z\] is also divisible by $m$.
\[x - y = {k_1}m\] and \[y - z = {k_2}m\].
Adding both equations, we get
\[x - y + y - z = \left( {{k_1} + {k_2}} \right)m\]
\[x - z = {k_3}m\], where \[{k_3}\] is an integer.
Thus \[x,z\] also satisfies the relation.
The given relation is also transitive.
And since the given relation is reflexive, symmetric and transitive in nature, it is an equivalence relation.
Note: The relation congruence modulo $m$ for the ordered pair \[x,y\] means that the value \[x - y\] is divisible by $m$. For in relation to be equivalence, the relation must be reflexive that is it should satisfy $xRx$, symmetric that is if $\left( {x,y} \right)$ satisfy the relation then $\left( {y,x} \right)$ must also satisfy the relation and transitive , which implies, for in relation to be transitive, if $x,y$ and $y,z$ satisfy the relation then $x,z$ must also satisfy the relation.
Complete step-by-step answer:
The congruence modulo $m$ is defined as the relation between $x$ and $y$ such that $x - y$ is divisible by $m$. $xRy = x - y$is divisible by $m$. Or $x - y = km$ where $k$ is an integer.
For an relation to be reflexive , it should satisfy $xRx$.
For the given relation, $xRx = x - x = 0$, which is divisible by $m$. Therefore the relation is true for all values $\left( {x,x} \right)$. Therefore the given relation is reflexive.
For in relation to be symmetric, if $\left( {x,y} \right)$satisfies the relation then $\left( {y,x} \right)$ must also satisfy the relation.
For pair $\left( {x,y} \right)$ satisfying the given relation,
$xRy = x - y$ is divisible by $m$ or $x - y = km$
For the pair $\left( {y,x} \right)$, $yRx$ gives $y - x$ which is also divisible by $m$ as
$x - y = km$,
On taking $ - 1$ common from both sides, we get,
$y - x = - km$
$ - k$ is also an integer.
Therefore $yRx$ is true.
Thus the given relation is symmetric.
For a relation to be transitive, if $x,y$ satisfy the relation and $y,z$ satisfy the relation then $x,z$ must also satisfy the relation.
For $x,y$ and $y,z$ satisfy relation we can say
$x - y$ is divisible by $m$ and \[y - z\] is also divisible by $m$.
\[x - y = {k_1}m\] and \[y - z = {k_2}m\].
Adding both equations, we get
\[x - y + y - z = \left( {{k_1} + {k_2}} \right)m\]
\[x - z = {k_3}m\], where \[{k_3}\] is an integer.
Thus \[x,z\] also satisfies the relation.
The given relation is also transitive.
And since the given relation is reflexive, symmetric and transitive in nature, it is an equivalence relation.
Note: The relation congruence modulo $m$ for the ordered pair \[x,y\] means that the value \[x - y\] is divisible by $m$. For in relation to be equivalence, the relation must be reflexive that is it should satisfy $xRx$, symmetric that is if $\left( {x,y} \right)$ satisfy the relation then $\left( {y,x} \right)$ must also satisfy the relation and transitive , which implies, for in relation to be transitive, if $x,y$ and $y,z$ satisfy the relation then $x,z$ must also satisfy the relation.
Recently Updated Pages
How many sigma and pi bonds are present in HCequiv class 11 chemistry CBSE
Mark and label the given geoinformation on the outline class 11 social science CBSE
When people say No pun intended what does that mea class 8 english CBSE
Name the states which share their boundary with Indias class 9 social science CBSE
Give an account of the Northern Plains of India class 9 social science CBSE
Change the following sentences into negative and interrogative class 10 english CBSE
Trending doubts
Difference Between Plant Cell and Animal Cell
Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE
Fill the blanks with the suitable prepositions 1 The class 9 english CBSE
Differentiate between homogeneous and heterogeneous class 12 chemistry CBSE
Which are the Top 10 Largest Countries of the World?
One cusec is equal to how many liters class 8 maths CBSE
Give 10 examples for herbs , shrubs , climbers , creepers
The mountain range which stretches from Gujarat in class 10 social science CBSE
The Equation xxx + 2 is Satisfied when x is Equal to Class 10 Maths