Compute equivalence classes of equivalence relation

Question

I have already proven that the relation $R=\{(x,y) \in \mathbb Z \times \mathbb Z \mid x+y\text{ is even}\}$ is an equivalence relation by showing reflexive, symmetric, and transitive properties of the relation. But when I try to find the equivalence classes of it I'm stuck.

Since $x$ and $y$ are either both even or both odd, does this simply come down to the equivalence classes of "congruence modulo $2$"?

Answer 1

Suppose $x+y$ is even. What does that tell you about $x$ and $y$? HINT: Write down some examples . . .

Answer 2

Your intuition is correct. To describe the equivalence classes explicitly, it often helps to find the equivalence classes of numbers that are easy to work with.

Let's find, for example, the equivalence classes $[0]$ and $[1]$.

$0+a$ is even for which integers $a$? All these will form $[0]$.

$1+b$ is even for which integers $b$? All these will form $[1]$.

Are there any other equivalence classes? (You can be sure you've found them all when your equivalence classes form a partition of $\Bbb Z$.)

Answer 3

$x+y$ is even if and only if $x-y$ is even because $x-y=(x+y)-2y$. So the even integers form one equivalence class, and the odd integers form the other.