Check whether the relation in the set of integers defined as is reflexive, symmetric, or transitive. Write the equivalence class containing 0, i.e. .
Previous Year Questions · Question 16 of 37
Check whether the relation R in the set Z of integers defined as R = (a, b) : a + b is divisible by 2 is reflexive…
Throughout, means is divisible by , i.e. for some .
Reflexive. Let . Then
and is divisible by because is an integer. So for every , and is reflexive.
Symmetric. Let , so for some . Addition of integers is commutative, so
which is divisible by . So , and is symmetric.
Transitive. Let and . Then there are integers and with
Adding these two equations gives , so
Here is an integer, so is divisible by , i.e. . So is transitive.
Being reflexive, symmetric and transitive, is an equivalence relation on .
The equivalence class of 0. By definition . Let be the set of even integers. We prove by showing each set is contained in the other.
: let . Then is divisible by , so for some , and therefore .
: let , say with . Then is divisible by , so , and therefore .
Both inclusions hold, so
the set of all even integers.
