Algebra 8 | Integers Modulo m ⤳ Abelian Group [dark version]

Integers modulo m form a finite, commutative group under addition, with exactly m elements—each element being an equivalence class of integers that differ by a multiple of m. The key move is to treat numbers like they “wrap around” the way hours on a clock do: for modulus 12, 13 behaves like 1 and 24 behaves like 0 because both differences are integer multiples of 12. Formally, two integers X and Y are equivalent (mod m) precisely when X − Y = Q·m for some integer Q. This equivalence relation partitions all integers into m distinct classes, typically written as Z/mZ or Z_ided_by_m, with representatives like [0], [1], …, [m−1].

Once those equivalence classes are set up, addition can be defined on the classes themselves: the sum of [K] and [L] is defined as [K + L]. The crucial technical requirement is that this operation is well defined—choosing different representatives from the same equivalence classes must not change the resulting class. That property holds because if K and K′ differ by a multiple of m, and L and L′ differ by a multiple of m, then (K + L) and (K′ + L′) also differ by a multiple of m, so they land in the same equivalence class. With addition in place, [0] acts as the identity element since [K] + [0] = [K]. Every class has an inverse: the inverse of [K] is [−K], because [K] + [−K] = [0].

These facts together guarantee a group structure: closure comes from the definition, the identity is [0], inverses exist for every element, and associativity follows from associativity of integer addition. Commutativity also carries over directly, making the group abelian. The group’s order is exactly m, matching the number of equivalence classes.

Concrete examples make the structure tangible. For m = 2, there are two classes: [0] (even integers) and [1] (odd integers). Adding them follows the parity rules: [1] + [1] = [2] = [0], so [1] is its own inverse and the addition table closes with only four outcomes. For m = 6, there are six classes [0] through [5]. The addition table reflects wrap-around modulo 6: for instance, 3 + 3 = 6 lands back at [0], and 4 + 4 = 8 lands at [2] because 8 ≡ 2 (mod 6). The inverse of [5] is [1] since 5 + 1 = 6 ≡ 0 (mod 6).

Although multiplication can also be defined on Z/mZ, it is not automatically guaranteed to produce a group under multiplication—whether it forms a group depends on additional conditions. That uncertainty is flagged as a topic for a later installment, but the additive story is complete: Z/mZ is always a finite abelian group of order m under addition modulo m.