Group
A set G with an associative binary operation, an identity e, and an inverse for every element.
REFERENCE SHEET
A group isolates the algebra of reversible operations.
Before this Proof techniques
A set G with an associative binary operation, an identity e, and an inverse for every element.
A subset H⊆G that is itself a group under the same operation.
The order of a finite group is its size. The order of g is the least positive n with gⁿ=e, if such n exists.
A nonempty subset H of a group is a subgroup if ab⁻¹∈H for every a,b∈H.
For a finite group and subgroup H, the left cosets partition G into equal-sized sets, giving |G|=[G:H]|H|. In particular, element orders divide |G|.
Every group of prime order is cyclic.
Rotations and reflections of a geometric object compose into a group.
Invertible residue classes form a multiplicative group used in arithmetic algorithms.
01 / Compute
Find the smallest n>0 with 4n≡0 mod 12.
The order is 3: the generated subgroup is {0,4,8}.
02 / Prove
Take g≠e and use Lagrange.
The order of g divides p and is not 1, so it is p. Hence its powers exhaust G.
These sheets use this topic as a prerequisite.
Further reading and full-length treatments: