Algebra 8 | Integers Modulo m ⤳ Abelian Group

Integers modulo m form a finite, commutative group under addition, with exactly m elements—each element is an equivalence class of integers that differ by a multiple of m. The construction starts with the clock-style rule: two integers X and Y are treated as the same whenever X − Y is divisible by m. That relation partitions all integers into m distinct “boxes,” typically written as Z/mZ (or equivalently Z_M), whose elements are denoted by brackets like [0], [1], …, [m−1]. Even though each equivalence class contains infinitely many integers (including negative ones), the quotient set has only m different classes, matching the idea of m positions on a clock.

Once those boxes are defined, addition is performed by adding representatives and then taking the resulting equivalence class. Concretely, if K and L represent two classes, their sum in Z/mZ is defined as the class of K + L. A key technical point is that this operation is well defined: choosing a different representative from the same equivalence class does not change the resulting class. With that in place, the group structure follows. The class [0] acts as the identity element because adding any class to [0] leaves it unchanged. Every class has an inverse: the inverse of [K] is [−K], since adding K and −K lands in a multiple of m, i.e., the zero class. Because addition of integers is commutative, the induced addition on Z/mZ is also commutative, so the structure is an abelian group.

The transcript then grounds the abstract definition with small moduli. For m = 2, there are two equivalence classes: [0] (all even integers) and [1] (all odd integers). The addition table reflects “parity arithmetic”: 1 + 1 becomes 2, which is equivalent to 0 modulo 2, so [1] added to itself returns the identity. For m = 6, there are six classes [0] through [5]. The addition table is built by reducing sums back into the correct class modulo 6. Along the diagonal, adding an element to itself repeatedly increases by 2, and whenever a sum hits 6 it wraps around to 0; similarly, 8 wraps to 2, and so on. The inverse behavior is visible directly: the inverse of [5] is [1] because 5 + 1 = 6, a multiple of 6, which corresponds to [0].

Finally, the discussion notes a natural next step: multiplication can also be defined on Z/mZ, but whether it produces a group under multiplication is not automatic and requires additional conditions—left for a later lesson. In short, modular addition reliably yields a finite abelian group of order m, while modular multiplication raises subtler questions.