Show that the relation in the set given by , is an equivalence relation. Show that all the elements of are related to each other and all the elements of are related to each other. But no element of is related to any element of .
Exercise 1.1 · Question 8 of 16
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.
Let and .
First, a remark that makes everything easy. For integers and , is even exactly when and have the same parity (both odd, or both even). Indeed, odd odd even and even even even, while odd even is odd. So relates two elements of precisely when they are both odd or both even.
Part 1: is an equivalence relation.
Reflexive. Let . Then
and is even. So for every , giving all five pairs .
Hence is reflexive.
Symmetric. Let , so is even. Since
the two quantities are the same number, so is even as well and .
Hence is symmetric.
Transitive. Let and , so and are both even. Then and for some integers and , so
which is even; therefore is even and .
Hence is transitive.
Being reflexive, symmetric and transitive, is an equivalence relation on .
The complete relation. By the parity remark, consists of every pair taken from the odd elements together with every pair taken from the even elements :
That is pairs from plus pairs from , so pairs in all. Notice that the reflexive pairs and both directions of every pair are present — that is what reflexivity and symmetry mean here.
Part 2: all elements of are related to each other.
Check every pair of distinct elements:
all even, and by symmetry the reversed pairs are in too. Together with from reflexivity, all nine pairs from lie in .
So every element of is related to every element of .
Part 3: all elements of are related to each other.
which is even, so and, by symmetry, . With and from reflexivity, all four pairs from lie in .
Part 4: no element of is related to any element of .
This needs a proof, not a check of a few cases — so argue it in general.
Let and . Then is odd and is even, so we may write
for some integers and . Subtracting,
which is an odd integer. Hence is odd, so it is not even, and therefore . The same argument with the roles swapped gives .
So no element of is related to any element of . (As a spot check: , , — all odd, as the proof predicts.)
Conclusion. is an equivalence relation, and its two equivalence classes are exactly and . They are disjoint and together they make up all of — the partition of that every equivalence relation produces.

