Mathematical-Reasoning ยท Unit 28 ยท Video 3 ยท Interactive Practice
| Formula | Meaning |
|---|---|
| the equivalence class of , for an equivalence relation on | |
| the same class, naming the relation when more than one is in use | |
| , | a class is a subset; the element that names it is an element |
| the distinct congruence classes modulo , one per remainder |
Key Insight: Every element names a class, but many names give the same class: for congruence modulo .
Congruence modulo cuts the integers into congruence classes, one for each remainder.
Each integer lies in exactly one of , , , for congruence modulo .
Problem 1 ยท A Roster Modulo 4
For congruence modulo on , which roster is the class ?
exactly when , that is, for some integer . Taking gives
Check a negative entry: , remainder .
Problem 2 ยท Element or Subset?
For congruence modulo on , which statement is true?
, the odd integers. It is a subset of , and (reflexivity) puts in it. It is not an integer, not equal to , and shares no element with , the even integers.
Problem 3 ยท A Class on a Finite Set
On define when . This is an equivalence relation. Find .
The values of for are . Since ,
has three classes, , and ; six elements give six names but only three classes.
Problem 4 ยท Congruence Modulo 7
Consider congruence modulo on .
How many distinct congruence classes are there?
Which class contains ?
Each integer is congruent modulo to exactly one of , so the distinct classes are : seven of them. Infinitely many integers name classes, but whenever is the remainder of .
so and . (Negating would give , which is not a remainder.)
Solved: 0 / 4