Concept

Lagrange theorem

The rule that the size of any subgroup divides the size of the group containing it. It follows from the cosets all having the same size, and it is what limits which subgroups a group can have at all.

Named by 6 essays across one field — each of them below, with the objects they name alongside it.

Every relabelling of a 4-gon's corners, and the 8 that are motions. All 24 permutations of the corners drawn one by one, with the 8 that preserve every distance marked; the rest deform the polygon and are not symmetries.

Eight ways to leave a square alone

A square can be picked up and put back so that nothing looks different. There are exactly eight ways to do it, and the number is not taken on trust here — it is what a search through all twenty-four relabellings of the corners comes back with.

algebra · Symmetry groups
16 colourings in 6 classes. Every way of colouring the corners, with the ones a motion carries to each other placed on the same row; the number of rows is the number of genuinely different colourings.

Colourings nobody can tell apart

Sixteen ways to colour four corners in two colours, and only six of them are genuinely different. The count can be got by pooling the sixteen — or by never forming a single class and instead averaging how many colourings each motion leaves untouched.

algebra · Symmetry groups
A subgroup of 2, and the 4 blocks it cuts the group into. The 8 symmetries of a 4-gon, split into 4 blocks by composing every element onto the subgroup {e, r²}. The blocks all have 2 elements and no element is in two of them.

The blocks a subgroup cuts out

Take any part of a group that is closed under composition, and it slices the whole group into blocks of its own size that do not overlap. Everything Lagrange's theorem says is arithmetic about that picture — and whether the blocks can be multiplied is a separate question with a surprising answer.

algebra · Symmetry groups
Orbit times stabiliser is 8, on every row. A table of 5 things the 8 symmetries of a 4-gon can move. Each row draws every position the thing can be carried to and lists the motions that leave it where it is; the two counts multiply to 8 on every row.

Twenty-four ways to set a cube down

Count the rotations of a cube from its corners and the answer is eight times three. Count from its edges and it is twelve times two; from its faces, six times four. Three different pictures give one number because each count is the same theorem — the places a thing can go, times the motions that leave it where it is — and the same theorem splits Cayley's sixteen trees into twelve and four and proves that a group of eight has a centre.

algebra · Symmetry groups
36 3-tuples with product e, and the 3 that no turn moves. Every ordered choice of 3 elements of the 6 symmetries of a 3-gon whose product is the identity, in cards grouped by cyclic turning. 3 cards hold a single tuple repeating one element; the other 11 hold 3 each.

Necklaces made of symmetries

Lagrange's theorem says a subgroup's size divides the group's, and the converse is false. One piece of the converse is true: every prime that divides the size is the order of some element. The proof threads the group's own elements onto a necklace whose product is nothing, turns it, and counts — the argument that proved Fermat's little theorem with beads, with the beads replaced by motions.

algebra · Symmetry groups
Positions at each distance, and what sequences could reach. 0:1/1 1:9/9 2:54/54 3:321/324 4:1847/1944 5:9992/11664 6:50136/69984 7:227536/419904 8:870072/2519424 9:1887748/15116544 10:623800/90699264 11:2644/544195584

Every position of the pocket cube

The two-by-two Rubik's cube has 3,674,160 positions once its orientation in the hand is ignored, few enough to visit every one. Breadth-first search finds that none is more than eleven face turns from solved, or fourteen quarter turns, and that only 2,644 positions sit at that distance. Counting move sequences proves only nine; the gap between nine and eleven is the cube's relations, the first of which appear at three turns. Two faces alone reach 29,160 positions, arranged by a copy of the symmetric group on five things acting on six corners.

algebra · Cayley graph

Named alongside it

The objects these essays reach for when they reach for this one.

Counting argumentDihedral groupGroup actionCyclic groupOrbitCosetEquivalencePermutationStabiliserSymmetryAlternating groupAutomorphism

All concepts