The course has so far studied systems with two operations. A ring has an addition and a multiplication, and most of its theory, from units and zero divisors to ideals and quotient rings, concerns how the two interact. Many important systems have only one operation worth considering. Turning a regular polygon, shuffling a list, twisting a face of a Rubik's cube: each is a transformation that can be followed by another and can always be undone. What can be proved about every such system at once?
A group is a set with one operation that is associative, has an identity and lets every element be undone. The rings already supply examples. Every ring is a group under addition, and the units of a ring with identity are a group under multiplication. But the examples that gave the subject its start are groups of transformations, and they are usually nonabelian.
The unit answers three questions in turn.
- What is a group, and where do groups come from? The first article gives the definition and finds groups inside rings and among the bijections of a set. It also introduces Cayley tables, direct products and the order of an element.
- What do the important examples look like? Three families follow. The dihedral groups $D_n$ are the symmetries of the regular polygons, computed by arithmetic modulo $n$ on the vertex labels. The Rubik's cube group is generated by six quarter turns acting on 48 stickers; only one reassembly of the cube in twelve can be solved. The symmetric groups $S_n$ contain all permutations of $n$ objects, each a product of disjoint cycles and either even or odd.
- What is true of every group? The second half of the unit develops the general theory: the first consequences of the axioms, subgroups and cyclic groups, and homomorphisms and isomorphisms. It ends with Cayley's theorem that every group is a group of permutations.
The unit covers Chapter 7 of the course text (Hungerford, 2014), §§7.1 to 7.5, with Judson (2026, Chapters 3 to 6 and 9) as a free companion. The class sessions introduced groups through the units of rings already studied, used the Rubik's cube and the dihedral groups as nonabelian examples, and computed in $S_n$ with cycle notation. The Rubik's cube is not in the course text; its article follows Joyner's notes on the mathematics of the cube.
Articles
The articles are in reading order; each ends with a link to the next.
- Groups: Definition and First Examples: what a group is, and how to tell whether a set with an operation is one. The axioms and their notations, every ring as an additive group, and groups of units ($\mathbb{Z}^\times$, $\mathbb{Z}[i]^\times$, $U(n)$, $GL_2(\mathbb{R})$) with the Cayley table of $U(9)$. The bijections of a set as a group, symmetries and roots of unity. The relativistic addition of velocities $x * y = (x + y)/(1 + xy)$, and systems that are not groups. Cayley tables and a first look at isomorphism, direct products, and the order of an element.
- Dihedral Groups: how many symmetries a regular polygon has, and how to multiply them. The proof that there are exactly $2n$, by labeling vertices with $\mathbb{Z}_n$. The generators $r$ and $s$ with $r^n = s^2 = 1$ and $sr = r^{-1}s$, what conjugating does to rotations and mirror lines, and the Cayley table of $D_8$ (the octagon of a stop sign). Orders of rotations and reflections, which mirror lines pass through vertices, two reflections making a rotation, matrices, and the cycle types of $D_n$ as permutations of the vertices.
- The Rubik's Cube Group: why a twisted corner can never be fixed, and how long a move takes to repeat. Moves as permutations of 48 stickers, why cube notation is read left to right, and which face turns commute. Orders read from cycles and twists: $RU$ has order 105, $R U R' U'$ order 6, and 1260 is the largest. The three invariants and the count of 43,252,003,274,489,856,000 positions, confirmed by the Schreier-Sims algorithm. Subgroups, commutators and conjugates, the superflip and God's number 20.
- Symmetric Groups and Permutations: why a permutation can never be both even and odd, and how to compute in $S_n$. Its $n!$ elements, two-line and cycle notation, and the proof by orbits that every permutation is a product of disjoint cycles. Orders as least common multiples, cycle types in $S_6$, and conjugation as relabeling. Parity proved by counting cycles, the alternating group $A_n$, and why the 15 puzzle and the cube have unreachable positions.
- Basic Properties of Groups: which familiar rules hold in every group, using only the four axioms. Unique inverses, cancellation and unique solutions of $ax = b$, so every Cayley table is a Latin square. The reversal $(ab)^{-1} = b^{-1}a^{-1}$, products without parentheses and the laws of exponents. When $a^k = e$, why elements of finite groups have finite order, $\lvert a^k \rvert = n/\gcd(n, k)$ checked on powers of the cube move $RU$, and orders in direct products.
- Subgroups and Cyclic Groups: which subsets of a group are groups in their own right, and how to find them all. The subgroup tests, the center (scalar matrices in $GL_2(\mathbb{R})$), cyclic subgroups, and cyclic groups, with when $\mathbb{Z}_m \times \mathbb{Z}_n$ is one. One subgroup for each divisor and $\varphi(n)$ generators, shown by the nine subgroups of $\mathbb{Z}_{36}$. Subgroups generated by several elements, and the 19 subgroups of $D_8$.
- Group Homomorphisms and Isomorphisms: when two groups are one group under different names, and what a map that merges elements reveals. Examples from the sign of a permutation to the powers of an element, and maps that fail. First properties, kernels, and the homomorphisms out of a cyclic group. What isomorphisms preserve, five groups of order 16 and $U(32) \cong \mathbb{Z}_2 \times \mathbb{Z}_8$, every cyclic group as $\mathbb{Z}$ or $\mathbb{Z}_n$, and conjugation as an automorphism.
- Cayley's Theorem: whether every group is a group of permutations in disguise. The proof through left multiplication, $U(9)$ in $S_6$ as the powers of one 6-cycle, and why left multiplication by $g$ splits the group into cycles of length $\lvert g \rvert$, which gives the shapes of the sixteen permutations of $D_8$ in $S_{16}$. Infinite groups, faithful actions on smaller sets such as $U(9)$ in $S_5$, and what the theorem does not tell us.
Three families at a glance
| Dihedral group $D_n$ | Rubik's cube group | Symmetric group $S_n$ | |
|---|---|---|---|
| elements | symmetries of a regular $n$-gon | moves of the cube | permutations of $\{1, \ldots, n\}$ |
| order | $2n$ | 43,252,003,274,489,856,000 | $n!$ |
| generated by | a rotation $r$ and a reflection $s$ | six quarter turns | transpositions |
| product $ab$ means | first $b$, then $a$ | first $a$, then $b$ | first $b$, then $a$ |
| abelian | no, for $n \ge 3$ | no | no, for $n \ge 3$ |
| largest element order | $n$ | 1260 | largest lcm of a partition of $n$ |
Each is a group of permutations: $D_n$ permutes the $n$ vertices, the cube group permutes 48 stickers, and $S_n$ contains every permutation of $n$ objects. By Cayley's theorem, so is every group.
Related topics
$\mathbb{Z}_n$ and its units come from Congruence and Modular Arithmetic, and the group of units $R^\times$ and the matrices from Rings. The order of a unit was first defined with Fermat's little theorem, and the RSA cryptosystem of Public-Key Cryptography rests on powers in $U(n)$. The next unit, Cosets, Normal Subgroups and Quotient Groups, proves Lagrange's theorem that the order of a subgroup divides the order of the group, and repeats the construction of quotient rings with one operation.
References
- Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 7, §§7.1 to 7.5. Brooks/Cole, Cengage Learning. The course text. record · 44 pages
- Joyner, W. D. (1997). Mathematics of the Rubik's Cube. Lecture notes, United States Naval Academy. record · 3 pages
- Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026), Chapters 3 to 6 and 9. Free online at judsonbooks.org. record · 44 pages
- Rokicki, T., Kociemba, H., Davidson, M., and Dethridge, J. (2013). The diameter of the Rubik's cube group is twenty. SIAM Journal on Discrete Mathematics, 27(2), 1082 to 1105. record · 3 pages