contents
§30

The two-face corner group — PGL₂(𝔽₅) ≅ S₅, the miracle on six points

Take the subgroup of the cube generated by two adjacent face turns (say R, U), looking only at corner permutations (ignore twist). The two faces share 6 corners (4 + 4 − 2). Naïvely 6! = 720, but the actual order is 120 = 5!. This 120-element group is in its sharply 3-transitive action on six points; it also gives an exotic transitive embedding , and that embedding is the source of the unique non-trivial outer automorphism of . This is the densest cluster of coincidences in finite group theory.

at a glance
#subsectionmain fact
30.1Two-face 6-corner puzzlephenomenon: 120 states, not 720
30.2pair-pattern proof15/3 = 5 pair patterns, faithful S₅ action
30.3ℙ¹(𝔽₅) & PGL₂(𝔽₅)
30.4sharply 3-transitive3 → 3 lifts uniquely
30.5cross-ratio invariant
30.6S₆ outer automorphismunique; induced by exotic S₅ ↪ S₆
30.7synthemes & duads6 totals; S₆ permutes them
30.8MathieuPGL₂(𝔽₅) ⊂ M₁₀ ⊂ M₁₁ ⊂ M₁₂ ⊂ M₂₄
30.9icosahedronPSL₂(𝔽₅) ≅ A₅ ≅ I (rotations)
30.10generators / presentation
30.11order histogram experimentsample matches S₅ class sizes

30.1 The two-face six-corner puzzle

Turn R and U on a full 3×3×3 (or 2×2×2) any number of times and observe the six corners in the shared R-and-U region: which slots do they land in? The question was first catalogued by Jaap Scherphuis (jaapsch.net/puzzles/pgl25.htm). Because we only use these two faces, the six corners never leave their six slots. A naïve upper bound is 6! = 720, but empirically only 120 distinct permutations occur — exactly 5!. This 120-element group admits two equivalent descriptions:

Equivalence (30.2 ↔ 30.3) is a finite Cayley correspondence: in , "pairings of 6 points" = "fixed pairs of involutions" = "matrices mod centre" all have dimension 5 (cosets of the Klein 4-group). This 5 is exactly why 120 of the 720 permutations remain.

6-corner sim
press R / U, watch the corner permutation; only 120 = 5! states reachable
0slot 01slot 12slot 23slot 34slot 45slot 5
no moves yet
identity
reachable 120 = 5!
naive bound 720 = 6!
Only 120 — this group is in its sharply 3-transitive action on . The classical "outer automorphism of " wonder.

30.2 Pair-pattern proof

Six corners split into three pairs in ways. But we want R-and-U-stable pair sets; the group groups the 15 pairs into 5 equivalence classes of 3 each, labelled V W X Y Z. Each face turn permutes the 5 labels by some element of .

Lemma 30.1 — pair action is faithful
Different corner permutations induce different permutations of the 5 patterns; the corner group injects into . Conversely, R and U each act as a 4-cycle on patterns, and two staggered 4-cycles in already generate (a classical fact: is generated by an -cycle plus a transposition, and by suitable pairs of cycles). Hence the corner group is exactly , order 120. ∎

The arithmetic uses a non-trivial fact: each of the 5 equivalence classes contains exactly 3 pairs. This reflects centraliser structure in — each involution's fixed-pair set is a pair-pattern, and the involutions fall into 5 conjugacy classes × 3 involutions each = 15. More in 30.3.

30.3 ℙ¹(𝔽₅) and PGL₂(𝔽₅)

Definition 30.2 — projective line
For a field , the projective line is the set of non-zero 2-vectors modulo scaling: i.e. and () are the same point. Over , the line has points.

In affine coordinates, each with is for , plus a single point at infinity denoted . Over :

Definition 30.3 — projective linear group
For a field , set acts on by Möbius transformations — scalar matrices give the same Möbius, so the centre is killed.

Order (general ): = "two linearly independent columns" = ; . So

For : , the same as . They are in fact isomorphic; 30.4 provides the explicit witness.

Small table (sanity check):

qfamiliar group
236
3424
4560 (note: F₄ not prime)
56120
78336 (no longer S_n)
910720, related to S₆

The coincidence happens only for (i.e. ). is the final and most dramatic member. Moreover is the smallest non-Abelian simple group (60 elements) and the rotation group of the icosahedron (30.9).

Möbius playground · on ℙ¹(𝔽₅)
tweak the 2×2 mod-5 matrix; live 6-point action + cycle decomposition
matrix (mod 5)
det = 3 · ∈ GL₂(𝔽₅)
action on ℙ¹(𝔽₅) = {0,1,2,3,4,∞}
01234
32041
cycle (0 ∞ 1 3)

30.4 The sharply 3-transitive action

Definition 30.4 — sharply k-transitive
An action of on is sharply -transitive if for any two ordered -tuples of distinct points and , there is a unique with for all .
Theorem 30.5 (classical)
For any field , acts on sharply 3-transitively. In particular over : given two triples of distinct points , there is exactly one Möbius taking the first to the second.

Proof sketch (existence): we show any triple of distinct points can be moved to the standard triple ; composition then takes any to any. Explicitly:

satisfies . (Verify by direct substitution. If any of equals , replace by first; the formula stays valid in the limit.)

Proof sketch (uniqueness): if two Möbius transformations both send , then fixes three points. But a Möbius with three fixed points must satisfy at three values of ; a degree-≤2 polynomial with three roots must be zero, forcing — the identity. ∎

Count check: sharp 3-transitivity gives . ✓

30.5 The cross-ratio — the only invariant

Three points can be moved freely; four points must have one invariant — otherwise sharp 3-transitivity would silently upgrade to 4-transitivity, but . The invariant is the cross-ratio:

Theorem 30.6 (cross-ratio invariance)
For any and any 4 distinct points :Conversely: equal cross-ratios mean the two quadruples are -equivalent. So the cross-ratio is the complete invariant of 4-tuples under .

Sketch: by 30.4, . For any , uniqueness in 30.4 forces , so . ∎

Possible values: over , a cross-ratio of 4 distinct points lies in (the values 0, 1, ∞ correspond to degenerate quadruples). So just 3 values up to ordering of the 4 points (and the Klein-4 action by point-swaps preserves the cross-ratio). The detailed orbit counting is a nice exercise.

cross-ratio calculator + Möbius invariance
pick 4 points, apply a Möbius, watch the cross-ratio stay fixed
four points
3
apply a Möbius transformation, watch invariance
det = 0 · singular
transformed quadruple(2, 2, 2, )
new cross-ratio

30.6 The outer automorphism of S₆ — the unique exception

Theorem 30.7 (Hölder 1895)
For every , (every automorphism is inner; ). The exception has The outer automorphism is induced by the "exotic" embedding coming from ; it swaps the class of transpositions (size 15) with the class of "products of three disjoint transpositions" (also size 15).

Two embeddings :

embeddingdescriptionon 6 elements
standardS₅ fixes one of the 6 elementsintransitive — the 6th point is isolated
exoticPGL₂(𝔽₅) ≅ S₅ acting on ℙ¹(𝔽₅) transitivelytransitive — sharp 3-transitivity

Since internally, the two embeddings "should be equivalent" inside — but their images in are not conjugate (one is transitive, the other not). This pair of non-conjugate copies of inside is the heart of the outer automorphism. Formally: a bijection sending the exotic to the standard (via 6 synthematic totals ↔ original 6 points, see 30.7) extends to a non-inner .

Key invariant
For , only one class of order-2 elements in has size (the transpositions), so any automorphism preserves the transposition class and is forced to be inner. For , two conjugacy classes have size 15 — transpositions (cycle type (2, 1, 1, 1, 1)) and triple-disjoint-transposition products (cycle type (2, 2, 2)) — and an automorphism can swap them.

Check: transpositions in number ; cycle-type elements number . ✓

30.7 Synthemes & duads — Sylvester's six totals

Sylvester (1844) gave a purely combinatorial construction of the outer automorphism using duads and synthemes:

Theorem 30.8 (Sylvester)
acts on the 6 totals, giving a homomorphism Since has only one non-trivial normal subgroup (, index 2), is either trivial or injective. It is in fact injective and sends transpositions to cycle type — so realises the outer automorphism.
six synthematic totals viewer
pick σ = (1 2) and watch how it scrambles the 6 totals in cycle type (2, 2, 2) — that's the outer automorphism
σ ∈ S₆ (acting on {1..6}) = [1, 2, 3, 4, 5, 6]
pick a σ to see its action
selected: total A
123456
132546
142635
152436
162345
5 synthemes, 15 duads — covering exactly

30.8 Mathieu connection — from PGL₂(𝔽₅) to M₂₄

The 120-element sits at the foot of a tower of multiply transitive extensions. Mathieu's five sporadic simple groups (1861, 1873) form this tower:

grouporderacts ontransitivity
1206 pointssharply 3-transitive
72010 pointssharply 3-transitive
7,92011 pointssharply 4-transitive
95,04012 pointssharply 5-transitive
443,520223-transitive
10,200,960234-transitive
244,823,040245-transitive

is the largest sharply 5-transitive group (Jordan, 1872: no sharp -transitive group beyond exists for ). is the only Mathieu with a non-trivial outer automorphism — built by exactly the same "exotic transitive" trick as . Conway & Curtis's Miracle Octad Generator (MOG, 1973) realises through the Steiner system S(5, 8, 24). Reference: J. Conway et al., ATLAS of Finite Groups (1985).

30.9 PSL₂(𝔽₅) and the icosahedron

The "square-determinant" subgroup of is Its order is , and famously which in turn is the rotation group of the icosahedron. Three identifications of the same 60-element group:

The icosahedron has 12 vertices, falling into 6 antipodal pairs; each pair receives a label from . contains elements of order 1, 2, 3, 5: order-5 rotations through opposite vertices (2π/5), order-3 through opposite face centres (2π/3), order-2 through midpoints of opposite edges. Counts: 1 + 15 + 20 + 24 = 60.

icosahedron with ℙ¹(𝔽₅) labels
press T (vertex 2π/5) and S (edge-midpoint π) to watch vertices shuffle
0011223344
12 vertices = 6 antipodal pairs, each pair labelled by a point of ℙ¹(𝔽₅)
00
11
22
33
44
T has order 5 (rotation by 2π/5 about a "north" vertex); S has order 2 (half-turn through an edge midpoint); and . The presentation is the standard one for .

This is the subject of Felix Klein's Lectures on the Icosahedron (1884): roots of quintic equations can be expressed via icosahedral functions (a kind of elliptic modular function), trading on the fact that is unsolvable yet has the structure of a 60-element simple group. Klein took the trinity as the heart of his book.

30.10 Explicit generators and presentation

Two simple Möbius transformations generate . Set

with matrices

Check: (5 ≡ 0 mod 5), which is trivial in , and has order 3 (direct computation gives ). So

This is the von Dyck triangle group , the rotation group of the spherical triangle — icosahedral geometry. To upgrade to , append one diagonal element

has determinant 2, not a square in , so . Then , doubling 60 → 120. Full presentation: Coxeter–Moser (1965) §6.5.

Cube correspondence: as corner permutations, R is a 4-cycle on 4 corners and U is a staggered 4-cycle, sharing 2 corners. Choose labels so that

Jaap Scherphuis's labelling gives R = (0 1 2 3) (a 4-cycle on fixing 4 and ∞) and U = (0 4 ∞ 1) (the staggered 4-cycle). The exact labelling is not unique; any choice that turns R, U into a pair of 2×2 mod-5 matrices works.

30.11 Experiment — ⟨R, U⟩ order distribution matches S₅ classes

If , then the order of a random ⟨R, U⟩ word, viewed as a permutation of the 6 corners, should match the conjugacy-class sizes of :

orderS₅ cycle typeclass sizeshare
1(1)⁵ (identity)10.83%
2(2, 1, 1, 1) + (2, 2, 1)10 + 15 = 2520.83%
3(3, 1, 1)2016.67%
4(4, 1) + (2, 2, 1) (note: (2,2,1) has order 2, not 4)3025.00%
5(5)2420.00%
6(3, 2)2016.67%

Sum: ✓. Warning: the cycle types above are those of acting on 5 elements; in our 6-point Möbius action, the corresponding cycle types differ. For example a transposition in corresponds to a Möbius transformation acting on 6 points with cycle type (2, 2, 1, 1) — two transpositions and two fixed points. This "cycle type shift" between the two embeddings is the operational core of 30.6's transposition ↔ (2,2,2) swap.

⟨R, U⟩ order histogram
sample N random words (length ≤ maxLen), compute the order of the resulting corner permutation, compare with S₅ class sizes
ordertheory (S₅ share)sample sharebar
10.83%1.65%
220.83%17.40%
316.67%19.10%
425.00%28.30%
520.00%16.75%
616.67%16.80%
theory (all 120 elements of S₅) ⟨R, U⟩ samples
" is the only symmetric group with an outer automorphism; that outer automorphism is equivalent to the transitive action of on six points; equivalent to the rotation group of the icosahedron; equivalent to the seed of the sporadic Mathieu group . This chain of equivalences is not a coincidence — it is the densest implosion of finite symmetry we know."
— John Baez, Some Thoughts on the Number 6 (2015 essay)

References

cuberoot.me · Rubik's Cube as a Group · 2026