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 PGL2(F5)≅S5 in its sharply 3-transitive action on six points; it also gives an exotic transitive embedding S5↪S6, and that embedding is the source of the unique non-trivial outer automorphism of S6. This is the densest cluster of coincidences in finite group theory.
at a glance
#
subsection
main fact
30.1
Two-face 6-corner puzzle
phenomenon: 120 states, not 720
30.2
pair-pattern proof
15/3 = 5 pair patterns, faithful S₅ action
30.3
ℙ¹(𝔽₅) & PGL₂(𝔽₅)
∣PGL2(Fq)∣=q(q+1)(q−1)
30.4
sharply 3-transitive
3 → 3 lifts uniquely
30.5
cross-ratio invariant
(a,b;c,d)=(a−d)(b−c)(a−c)(b−d)
30.6
S₆ outer automorphism
unique; induced by exotic S₅ ↪ S₆
30.7
synthemes & duads
6 totals; S₆ permutes them
30.8
Mathieu
PGL₂(𝔽₅) ⊂ M₁₀ ⊂ M₁₁ ⊂ M₁₂ ⊂ M₂₄
30.9
icosahedron
PSL₂(𝔽₅) ≅ A₅ ≅ I (rotations)
30.10
generators / presentation
⟨S,T∣S2=T5=(ST)3=1⟩
30.11
order histogram experiment
sample 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:
Combinatorial (30.2): six corners partition into three pairs in 15 ways, falling into 5 essentially different pair patterns V W X Y Z. The group ⟨R,U⟩ acts faithfully on these 5 patterns and realises all of S5.
Projective (30.3–30.5): label the six corners by P1(F5)={0,1,2,3,4,∞}. Each of R, U realises a Möbius transformation (a 2×2 mod-5 matrix of non-zero determinant); together they generate the full PGL2(F5).
Equivalence (30.2 ↔ 30.3) is a finite Cayley correspondence: in PGL2(F5), "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
no moves yet
★ identity
reachable120 = 5!
naive bound720 = 6!
Only 120 — this group is S5≅PGL2(F5) in its sharply 3-transitive action on P1(F5). The classical "outer automorphism of S6" wonder.
30.2 Pair-pattern proof
Six corners split into three pairs in (26)(24)(22)/3!=15 ways. But we want R-and-U-stable pair sets; the group ⟨R,U⟩ 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 S5.
Lemma 30.1 — pair action is faithful
Different corner permutations induce different permutations of the 5 patterns; the corner group injects into S5. Conversely, R and U each act as a 4-cycle on patterns, and two staggered 4-cycles in S5 already generate S5 (a classical fact: Sn is generated by an (n−1)-cycle plus a transposition, and by suitable pairs of cycles). Hence the corner group is exactly S5, order 120. ∎
The arithmetic 5=15/3 uses a non-trivial fact: each of the 5 equivalence classes contains exactly 3 pairs. This reflects centraliser structure in PGL2(F5) — 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 F, the projective line P1(F) is the set of non-zero 2-vectors modulo scaling: P1(F)=(F2∖{0})/F∗, i.e. [x:y] and [λx:λy] (λ=0) are the same point. Over Fq, the line has q−1q2−1=q+1 points.
In affine coordinates, each [x:y] with y=0 is [z:1] for z=x/y∈F, plus a single point at infinity[1:0] denoted ∞. Over F5:P1(F5)={0,1,2,3,4,∞},∣P1(F5)∣=6.
Definition 30.3 — projective linear group
For a field F, setGL2(F)={M∈M2(F):detM=0},Z={λI:λ∈F∗}≤GL2(F),PGL2(F)=GL2(F)/Z.PGL2(F) acts on P1(F) by Möbius transformations z↦(az+b)/(cz+d) — scalar matrices give the same Möbius, so the centre Z is killed.
Order (general q): GL2(Fq) = "two linearly independent columns" = (q2−1)(q2−q); ∣Z∣=q−1. So
∣PGL2(Fq)∣=q−1(q2−1)(q2−q)=q(q+1)(q−1).
For q=5: ∣PGL2(F5)∣=5⋅6⋅4=120=5!, the same as ∣S5∣. They are in fact isomorphic; 30.4 provides the explicit witness.
Small table (sanity check):
q
∣P1(Fq)∣=q+1
∣PGL2∣
familiar group
2
3
6
S3
3
4
24
S4
4
5
60
A5 (note: F₄ not prime)
5
6
120
S5
7
8
336
PGL2(F7) (no longer S_n)
9
10
720
PGL2(F9), PGammaL related to S₆
The coincidence PGL2≅Sn happens only for q∈{2,3,5} (i.e. n=q+1∈{3,4,6}). q=5 is the final and most dramatic member. Moreover PSL2(F5)≅A5 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,∞}
0
1
2
3
4
∞
∞
3
2
0
4
1
cycle (0 ∞ 1 3)
30.4 The sharply 3-transitive action
Definition 30.4 — sharply k-transitive
An action of G on X is sharply k-transitive if for any two ordered k-tuples of distinct points (x1,…,xk) and (y1,…,yk), there is a uniqueg∈G with g⋅xi=yi for all i.
Theorem 30.5 (classical)
For any field F, PGL2(F) acts on P1(F) sharply 3-transitively. In particular over F5: given two triples of distinct points (a,b,c),(a′,b′,c′), there is exactly one Möbius taking the first to the second.
Proof sketch (existence): we show any triple (a,b,c) of distinct points can be moved to the standard triple(0,1,∞); composition then takes any to any. Explicitly:
fa,b,c(z)=(z−c)(b−a)(z−a)(b−c)
satisfies f(a)=0,f(b)=1,f(c)=∞. (Verify by direct substitution. If any of a,b,c equals ∞, replace z by 1/(z−a) first; the formula stays valid in the limit.)
Proof sketch (uniqueness): if two Möbius transformations f1,f2 both send (a,b,c)→(a′,b′,c′), then f2−1∘f1 fixes three points. But a Möbius z↦(αz+β)/(γz+δ) with three fixed points must satisfy αz+β=z(γz+δ) at three values of z; a degree-≤2 polynomial with three roots must be zero, forcing γ=0,α=δ,β=0 — the identity. ∎
Three points can be moved freely; four points must have one invariant — otherwise sharp 3-transitivity would silently upgrade to 4-transitivity, but ∣G∣=120=6⋅5⋅4⋅3. The invariant is the cross-ratio:
(a,b;c,d)=(a−d)(b−c)(a−c)(b−d)∈F∪{∞}.
Theorem 30.6 (cross-ratio invariance)
For any ϕ∈PGL2(F) and any 4 distinct points (a,b,c,d):(ϕ(a),ϕ(b);ϕ(c),ϕ(d))=(a,b;c,d).Conversely: equal cross-ratios mean the two quadruples are PGL2-equivalent. So the cross-ratio is the complete invariant of 4-tuples under PGL2.
Sketch: by 30.4, (a,b;c,d)=fa,b,c(d). For any ϕ, uniqueness in 30.4 forces fϕ(a),ϕ(b),ϕ(c)=fa,b,c∘ϕ−1, so fϕ(a),ϕ(b),ϕ(c)(ϕ(d))=fa,b,c(d). ∎
Possible values: over F5, a cross-ratio of 4 distinct points lies in P1(F5)∖{0,1,∞}={2,3,4} (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
(0,1;∞,2)=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 n=6, Aut(Sn)=Sn (every automorphism is inner; Out(Sn)=1). The exception n=6 has Out(S6)≅Z/2. The outer automorphism is induced by the "exotic" embedding S5↪S6 coming from PGL2(F5); it swaps the class of transpositions (size 15) with the class of "products of three disjoint transpositions" (also size 15).
Two embeddings S5↪S6:
embedding
description
on 6 elements
standard
S₅ fixes one of the 6 elements
intransitive — the 6th point is isolated
exotic
PGL₂(𝔽₅) ≅ S₅ acting on ℙ¹(𝔽₅) transitively
transitive — sharp 3-transitivity
Since Aut(S5)=S5 internally, the two embeddings "should be equivalent" inside S5 — but their images in S6 are not conjugate (one is transitive, the other not). This pair of non-conjugate copies of S5 inside S6 is the heart of the outer automorphism. Formally: a bijection sending the exotic S5 to the standard S5 (via 6 synthematic totals ↔ original 6 points, see 30.7) extends to a non-inner ϕ:S6→S6.
Key invariant
For n=6, only one class of order-2 elements in Sn has size (2n) (the transpositions), so any automorphism preserves the transposition class and is forced to be inner. For n=6, 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 S6 number (26)=15; cycle-type (2,2,2) elements number 23⋅3!6!=48720=15. ✓
30.7 Synthemes & duads — Sylvester's six totals
Sylvester (1844) gave a purely combinatorial construction of the outer automorphism using duads and synthemes:
Duad = a 2-subset of {1..6}. Total (26)=15.
Syntheme = a partition of {1..6} into 3 duads. Count: 23⋅3!6!=15, so 15 synthemes.
Synthematic total = a set of 5 synthemes whose 15 duads cover all (26)=15 duads (each duad appearing exactly once). Equivalently: a 1-factorisation of K6 (partition the 15 edges into 5 perfect matchings). There are exactly 6 totals.
Theorem 30.8 (Sylvester)
S6 acts on the 6 totals, giving a homomorphism Φ:S6→S{6 totals}≅S6. Since S6 has only one non-trivial normal subgroup (A6, index 2), Φ is either trivial or injective. It is in fact injective and sends transpositions to cycle type (2,2,2) — 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 (26)=15
30.8 Mathieu connection — from PGL₂(𝔽₅) to M₂₄
The 120-element PGL2(F5) sits at the foot of a tower of multiply transitive extensions. Mathieu's five sporadic simple groups M11,M12,M22,M23,M24 (1861, 1873) form this tower:
group
order
acts on
transitivity
PGL2(F5)≅S5
120
6 points
sharply 3-transitive
M10
720
10 points
sharply 3-transitive
M11
7,920
11 points
sharply 4-transitive
M12
95,040
12 points
sharply 5-transitive
M22
443,520
22
3-transitive
M23
10,200,960
23
4-transitive
M24
244,823,040
24
5-transitive
M12 is the largest sharply 5-transitive group (Jordan, 1872: no sharp k-transitive group beyond Sn,An exists for k≥6). M12 is the only Mathieu with a non-trivial outer automorphism — built by exactly the same "exotic transitive" trick as Out(S6). Conway & Curtis's Miracle Octad Generator (MOG, 1973) realises M24 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 PGL2(F5) isPSL2(F5)=SL2(F5)/{±I}. Its order is 120/2=60, and famouslyPSL2(F5)≅A5 which in turn is the rotation group I of the icosahedron. Three identifications of the same 60-element group:
A5≅PSL2(F5)≅I=rotations of the icosahedron / dodecahedron.
The icosahedron has 12 vertices, falling into 6 antipodal pairs; each pair receives a label from P1(F5). A5 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
12 vertices = 6 antipodal pairs, each pair labelled by a point of ℙ¹(𝔽₅)
∞ → ∞
0 → 0
1 → 1
2 → 2
3 → 3
4 → 4
T has order 5 (rotation by 2π/5 about a "north" vertex); S has order 2 (half-turn through an edge midpoint); and (ST)3=e. The presentation ⟨S,T∣S2=T5=(ST)3=e⟩ is the standard one for PSL2(F5)≅A5.
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 A5 is unsolvable yet has the structure of a 60-element simple group. Klein took the trinity PSL2(F5)≅A5≅I as the heart of his book.
30.10 Explicit generators and presentation
Two simple Möbius transformations generate PSL2(F5). Set
T:z↦z+1,S:z↦−z1.
with matrices
T≡(1011),S≡(01−10)≡(0140)(mod5).
Check: T5=I (5 ≡ 0 mod 5), S2=−I which is trivial in PSL, and ST:z↦−1/(z+1) has order 3 (direct computation gives (ST)3=id). So
PSL2(F5)=⟨S,TS2=T5=(ST)3=1⟩≅A5.
This is the von Dyck triangle group (2,3,5), the rotation group of the spherical triangle Δ(2,3,5) — icosahedral geometry. To upgrade to PGL2(F5)≅S5, append one diagonal element
D≡(2001),D:z↦2z.
D has determinant 2, not a square in F5∗, so D∈/PSL2. Then ⟨S,T,D⟩=PGL2(F5), 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 P1(F5) labels so that
R≡z↦(some Mo¨bius),U≡z↦(another Mo¨bius);
Jaap Scherphuis's labelling gives R = (0 1 2 3) (a 4-cycle on P1 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 ⟨R,U⟩=S5, then the order of a random ⟨R, U⟩ word, viewed as a permutation of the 6 corners, should match the conjugacy-class sizes of S5:
order
S₅ cycle type
class size
share
1
(1)⁵ (identity)
1
0.83%
2
(2, 1, 1, 1) + (2, 2, 1)
10 + 15 = 25
20.83%
3
(3, 1, 1)
20
16.67%
4
(4, 1) + (2, 2, 1) (note: (2,2,1) has order 2, not 4)
30
25.00%
5
(5)
24
20.00%
6
(3, 2)
20
16.67%
Sum: 1+25+20+30+24+20=120 ✓. Warning: the cycle types above are those of S5 acting on 5 elements; in our 6-point Möbius action, the corresponding cycle types differ. For example a transposition in S5 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
order
theory (S₅ share)
sample share
bar
1
0.83%
1.65%
2
20.83%
17.40%
3
16.67%
19.10%
4
25.00%
28.30%
5
20.00%
16.75%
6
16.67%
16.80%
theory (all 120 elements of S₅) ⟨R, U⟩ samples
"S6 is the only symmetric group with an outer automorphism; that outer automorphism is equivalent to the transitive action of PGL2(F5) on six points; equivalent to the rotation group of the icosahedron; equivalent to the seed of the sporadic Mathieu group M12. 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
J. Scherphuis, The two-face six-corner puzzle and PGL₂(F₅) — jaapsch.net/puzzles/pgl25.htm. The starting point for this section.
J. Baez, Some Thoughts on the Number 6 — math.ucr.edu/home/baez/six.html. The classic expository essay on the S₆ outer automorphism, covering synthemes, Mathieu groups, and the icosahedral connection.
J. Conway, R. Curtis, S. Norton, R. Parker, R. Wilson, ATLAS of Finite Groups (Oxford, 1985). The standard reference for all 26 sporadic simple groups, including maximal-subgroup tables for M₁₁, M₁₂, M₂₄ (in which PGL₂(F₅) appears).
M. Suzuki, Group Theory I, II (Springer Grundlehren 247, 248, 1982–1986). The standard reference for classical groups (GL, SL, PSL, PGL, PΓL).
M. Aschbacher, Finite Group Theory (Cambridge Studies in Adv. Math. 10, 2nd ed. 2000). Compact modern survey, background for the classification of finite simple groups.
D. Surowski, Workbook in Higher Algebra. Develops the PGL₂(F₅) action on ℙ¹(F₅) and the cross-ratio as exercises.
H. S. M. Coxeter & W. O. J. Moser, Generators and Relations for Discrete Groups (Springer Ergebnisse 14, 4th ed. 1980). Standard presentations for triangle groups (2, 3, 5) etc., with icosahedral geometry.
F. Klein, Vorlesungen über das Ikosaeder (1884, English transl. Lectures on the Icosahedron, Dover 1956). Solving the quintic using PSL₂(F₅) ≅ A₅ ≅ I.
O. Hölder, "Bildung zusammengesetzter Gruppen," Math. Ann. 46 (1895) — original discovery of Out(S6).
J. J. Sylvester, "Elementary researches in the analysis of combinatorial aggregation," Phil. Mag. 24 (1844). Origin of the duad/syntheme/synthematic-total terminology.