What does it mean to describe the partition defined by the equivalence class

Question

Question:
Is this relation an equivalence relation? If yes, describe the partition defined by the equivalence classes. Justify your answer: The domain is the set of all integers. xEy if x + y is even. (An integer z is even if z = 2k for some integer k.)

So for a relationship to be an equivalence relation it must be reflexive, symmetric, and transitive. How would I apply it to this problem? Also, I'm don't quite understand what it means by describing the partition.

Answer 1

"Describing the partition" of a set A given equivalence relations R1...Rn means to define each of the equivalence classes in the partitioned set. Any members of A which do not belong to one of the equivalence classes form a final equivalence class: their equivalence relation is that they do not relate under any of the relations R1...Rn.

This example can be confusing because pairs of integers belong in an equivalence class (or not), rather than individual integers, so we must define A to be the set of all pairs of integers.

• Let A be the set of pairs of integers.
• xEy divides A into two equivalence classes:
  • Class 1: x and y have the same parity
  • Class 2: x and y do not have the same parity