Group Theory as a Symmetry Puzzle

A symmetry is a move that leaves the shape looking identical — the moves form a group

Compose symmetries — do one move, then another

Click a generator · the shape animates · the group element updates

Canvas · live permutation algebra

SHAPE / GROUP

DRIVE IT

r — rotation generator s — reflection generator current element / node vertex labels (the "colours")

Each corner carries a coloured, numbered token. A symmetry only permutes the tokens — the outline never changes. The sequence of moves you apply is a word; the token arrangement it lands on is a single group element.

CURRENT ELEMENT

arrangement after your moves

e (identity — no move yet)

WALKTHROUGH

Stay on the triangle (D₃) in mode ①. Press r a few times: the whole triangle spins by 120° and the tokens cycle. After three presses you're back to e — so r³ = e.
Press Back to e, then s: the triangle flips across an axis. Press s again — you're home. Every reflection is its own undo: s² = e.
Now build a word: press s then r. The readout names the single element you landed on (some rᵏs). Six presses can only ever land on six arrangements — the group is closed.
Open mode ②. The same moves now hop a token around the Cayley graph: blue arrows are r, gold rungs are s. The inner ring is the rotations; the outer ring is the reflections.
Open mode ③. Hover any cell to read row · column = result. Switch to the square (D₄) and watch the table grow to 8×8 — same rules, and srs = r⁻¹ still holds.

AHA

THE INSIGHT

A group is the set of moves that leave something looking the same. That "leaves it looking the same" is the whole definition of symmetry — and the astonishing part is that these moves obey algebra: composing any two always gives a third move on the same finite list (closure), every move has an exact undo (inverses), and there's a do-nothing move (identity). You are not memorising a table; you are discovering the arithmetic that symmetry forces to exist.

RESEARCH NOTE

The symmetries of a regular \(n\)-gon form the dihedral group \(D_n\) of order \(2n\): \(n\) rotations and \(n\) reflections. The relation \(srs^{-1}=r^{-1}\) says "reflect, spin, reflect back" reverses the spin — the source of every non-abelian surprise in the table. Further reading: Armstrong, Groups and Symmetry; the classification of the finite symmetry groups (cyclic, dihedral, and the polyhedral \(A_4,S_4,A_5\)); Cayley's theorem — every group is a group of permutations, exactly what the tokens show.

EXPLANATION

Start with the loosest possible idea of symmetry: a symmetry of a shape is any rigid motion that maps the shape onto itself — you could not tell, from the outline alone, that anything happened. For a regular triangle those motions are exactly three rotations (by 0°, 120°, 240°) and three reflections (across the three axes through a vertex and the opposite edge's midpoint). That's six motions. For a square there are four rotations and four reflections — eight. In general a regular \(n\)-gon has \(2n\) symmetries, and this collection is called the dihedral group \(D_n\).

Why "group," and not just "set"? Because these motions combine, and the combination has structure. Do one symmetry, then another: the net effect is still a symmetry of the shape — you never land on something new (this is closure, and it's exactly why six presses of the triangle's buttons can only ever produce six arrangements, never a seventh). There is a do-nothing motion, the identity \(e\). Every motion can be undone by another motion on the list (its inverse): rotations undo by rotating back, and every reflection undoes itself. And composition is associative. Those four facts — closure, identity, inverses, associativity — are the entire definition of a group. A group is not a mysterious abstraction bolted onto symmetry; it is simply the bookkeeping that symmetry already obeys.

The multiplication table (or Cayley table) writes this bookkeeping down: in the cell for row \(a\), column \(b\), you record the single motion equal to "do \(b\), then do \(a\)." Two features leap out. Every row and every column is a permutation of the whole element list — no motion appears twice in a line (this is the "Latin square" property, and it is Cayley's theorem in miniature: each group element acts as a shuffle of the others). And the table is not symmetric across its diagonal, because \(D_n\) is non-abelian for \(n\ge 3\): "flip then rotate" generally differs from "rotate then flip." The precise way they differ is captured by the relation \(srs = r^{-1}\) — conjugating a rotation by a reflection reverses it. Everything in the table follows from just \(r^n=e\), \(s^2=e\), and that one twisting rule, which is why we say \(D_n=\langle r,s \mid r^n=s^2=e,\; srs=r^{-1}\rangle\).

The Cayley graph is the same information drawn as a map. Put one dot per group element, and from each dot draw a coloured arrow for "multiply by a generator": a blue arrow for \(r\) (these chain into a ring — the rotation cycle) and a gold edge for \(s\) (these are their own reverse, so they're drawn as rungs linking the rotation ring to its mirror copy). Walking the graph is composing elements; a closed loop back to the start is a relation like \(r^3=e\). This is the deep payoff: an abstract algebraic object becomes a concrete, finite, navigable network you can literally trace with a finger. And it generalises far beyond cardboard — the same machinery classifies crystals, catalogues the ways a molecule can vibrate, powers error-correcting codes and public-key cryptography, and underlies the Standard Model's particle families. Learn to see the group hiding inside a triangle, and you have learned to see the hidden arithmetic of sameness everywhere.