Exercise 1.1 · Q8: even on {1, …, 5}
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 .
Reflexive: Let . Then , which is even, so . Thus is reflexive.
Symmetric: Let . Then is even, so . Thus is symmetric.
Transitive: Let and . Then and are even: , for some .
So is even and . Thus is transitive.
Hence is an equivalence relation.
For : , all even. So all elements of are related to each other.
For : , all even. So all elements of are related to each other.
For , : , which is odd. So and .
Hence no element of is related to any element of .
Want the reason behind every step, the basics and the checks?
The absolute value only removes a sign, and a number is even exactly when its negative is even. So " is even" means the same as " is even", which means and have the same parity (both odd or both even). That turns the problem into Example 5 on a small set: the odd numbers form one class, the even numbers the other.
- Given
- and the rule: exactly when is even.
- To show
- (a) is an equivalence relation. (b) Any two elements of are related, and any two elements of are related. (c) No element of is related to any element of .
- Plan
- (1) Remove the absolute value: even . (2) Prove reflexive, symmetric, transitive for arbitrary elements. (3) Check parts (b) and (c) pair by pair, using the grid of all 25 pairs.
Basics you need
An integer is even when for some integer . 0 is even (). If then , so is even exactly when is even. Basics: integers, even and odd
if and if . So is always either or . Also , since .
Reflexive: for all . Symmetric: . Transitive: . All three together: an equivalence relation. Basics: reflexive, symmetric, transitive
If is odd and is even, then , which is odd. Two numbers of the same parity have an even difference; different parity gives an odd difference.
An equivalence relation splits its set into disjoint classes of mutually related elements. Basics: equivalence classes
Solution
Remove the absolute value
For any , is either or (Basic 2), and a number is even exactly when its negative is even (Basic 1). So
Absolute values are awkward in algebra because need not equal . The transitive step needs to add differences, so we first replace " is even" by the equivalent " is even". This is valid because removing the absolute value changes at most the sign, and the sign does not affect evenness.Example: is odd and is odd; is even and is even.Reflexive
Take any . Then , which is even. So for every , and is reflexive.
Every element differs from itself by 0, and 0 counts as even. The argument does not depend on which we take.0 is even, because with an integer (Basic 1).Symmetric
Suppose , so is even. Since , we have
which is even. So , and is symmetric.
The absolute value makes symmetry immediate: the distance from to is the same as from to . We started from and derived , as the definition requires.for every real (Basic 2).Transitive
Suppose and . By Step 1 there are integers and with
Adding makes cancel:
is an integer, so is even, and by Step 1 is even. So , and is transitive.
Being reflexive, symmetric and transitive, is an equivalence relation.
We add the two equations because that removes the middle element , and the conclusion does not mention . Using two letters and is important: the two differences need not be equal (for example and ). This is why Step 1 removed the absolute values: the signed differences add up exactly, .Even + even = even: . Integers are closed under addition.All of are related, and all of are related
Check every pair inside each set (9 ordered pairs from , 4 from ). The differences that occur:
Set Pairs Even? yes yes yes yes yes All 13 pairs have an even difference, so every element of is related to every element of , and likewise for .
In general: if and are both odd, is even; if , are both even, is even.
The sets are small, so a complete table is a full proof. The general line underneath explains why it works and would work for any odd or even numbers.Same parity even difference (Basic 4).No element of is related to any element of
There are pairs with and :
Every one is odd, so none of these pairs is in . By symmetry of , the 6 reversed pairs have the same odd values and are not in either. So no element of is related to any element of .
All 25 pairs of , each showing . The 13 coloured cells are : the blue ones form and the gold ones . The 12 empty cells mix an odd and an even number, and their differences 1 and 3 are odd. "No element of one set is related to any element of the other" is a statement about all 6 cross pairs (12 counting both orders), so we check them all. In general an odd number minus an even number is odd (Basic 4), which is why every cross difference came out as 1 or 3.So has exactly two equivalence classes: and . They are disjoint and their union is . Basics: equivalence classes
is an equivalence relation on : reflexive (), symmetric () and transitive ( is even + even). Its pairs are exactly those inside (differences 0, 2, 4) or inside (differences 0, 2), 13 pairs in all; every cross pair has difference 1 or 3, which is odd. So and are the two equivalence classes.
Class Catcher, in the chapter’s Games tab. Level 2 is this question: sort 1 to 5 by |a − b| even. Play Class Catcher ↗
Count: pairs in and cross pairs not in ; , so every pair of is accounted for. Transitivity on one chain: () and (), and indeed (), with for the signed differences. A computer check of all triples confirms transitivity.
- Adding absolute values in the transitive step. is not always (try : but ). Remove the absolute values first, as in Step 1.
- Forgetting that 0 is even. Reflexivity rests on being even.
- Checking only one order of the cross pairs. "Not related" should hold both ways; symmetry of covers the reversed pairs, but say so.
- Evenness ignores sign, so even even and have the same parity.
- This is Example 5 restricted to , and the textbook's Example 6 does the same on . The classes are always "the odd ones" and "the even ones".
- On a finite set, a grid of all pairs makes the classes visible as coloured blocks once the elements are grouped.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| even even; | Step 1 | Definition of even; absolute value |
| Reflexive, symmetric, transitive | Steps 2–4 | Definition 3, Section 1.2 (Lesson: types of relations) |
| Equivalence relation | Step 4 | Definition 4, Section 1.2 |
| Step 4 | Integers closed under addition | |
| Same parity even difference | Steps 5, 6 | etc. |
| Same relation on and on | Take-away 2 | Example 5, Example 6 (Lesson: equivalence relations) |
| All 25 differences and the counts 13, 12 | Steps 5, 6; Check | Brute-force check in the site's verification script |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →