Fano Plane and E8

240 * 168 = 8!

The shadow polynomial P(x) = (x-1)(x-2)(x-3)(x-5) evaluated at 7 gives 240, the E8 root count. The Fano plane's symmetry group PSL(2,7) has 168 elements. Their product is 8! = 40,320. The Fano plane is the Hamming [7,4,3] code at rate 4/7. Extending to [8,4,4] gives the E8 lattice via Construction A. The Golay code [23,12,7] completes the picture: together with Hamming, these exhaust all binary perfect codes.

The E8 Index Theorem

E8 Index (PROVED)
|roots(E8)| = [S_8 : GL(3, F_2)]. The E8 root count equals the index of the Fano automorphism group GL(3, F_2) inside S_8. Proof: |GL(3, F_2)| = (8-1)(8-2)(8-4) = 7*6*4 = 168. Index = 8!/168 = 240. QED.
P(7) = 240
6 * 5 * 4 * 2 = 240
= 2^4 * 3 * 5 = |roots(E8)|. The shadow polynomial at 7.
P(9) = 1344
8 * 7 * 6 * 4 = 1344
= 8 * 168. Shadow polynomial at 9 = 8 times the Fano symmetry group order.
P(17) = 40320
16 * 15 * 14 * 12 = 40320
= 8!. Shadow polynomial at 17 = the full symmetric group on 8 letters.

The Duality Isomorphism

The ring's most striking group-theoretic fact: two seemingly unrelated groups are the same.

GL(3, F_2)
168 elements
3 dimensions over the 2-element field. Acts on PG(2,2) = Fano plane with 7 points.
PSL(2, F_7)
168 elements
2 dimensions over the 7-element field. Acts on PG(1,7) with 8 points.
Duality Isomorphism (PROVED)
GL(3, F_2) = PSL(2, F_7). Both are the unique simple group of order 168. Three dimensions over F_2 = two dimensions over F_7. The primes 3 and 7 swap roles through the prime 2.

The Fano Plane

PG(2, F_2) = the projective plane over F_2. Seven points. Seven lines. Three points per line. One shared point per pair of lines. Parameters (7, 3, 1) = Steiner triple system S(2,3,7). Point count = (2^3 - 1)/(2 - 1) = 7.

The Catalan equation 3^2 = 2^3 + 1 (Mihailescu 2002) ties four identities together: 2^3 - 1 = 7 (Fano points), 2^3 + 1 = 9 (the only consecutive prime powers), 9 - 2 = 7, 9 + 2 = 11. One equation = four theorems.

E8 Root Anatomy

Root typeCountCoordinates
Basis roots112 = 2^4 * 7(+/-1, +/-1, 0^6) permutations
Code roots128 = 2^7(+/-1/2)^8 with even minus count
Total240 = 112 + 128= 2^4 * 3 * 5

The factorizations 240 = 2^4 * 3 * 5 and 168 = 2^3 * 3 * 7 share {2,3}. Their unique primes are 5 and 7. Product: 240 * 168 = 8! = 40,320.

Nine Paths to 240

PathFormulaField
1. Index[S_8 : GL(3, F_2)] = 8!/168Combinatorics
2. ShadowP(7) = 6*5*4*2Spectral theory
3. Geometry112 + 128 (basis + code roots)Root systems
4. Factorial2 * 5! = 2 * 120Factorial algebra
5. Eisenstein-2k/B_k at k = 4Modular forms
6. Kissingtau(8) = 240 spheresSphere packing
7. Pisanolcm(pi(2), pi(3), pi(5), pi(7), pi(11))Fibonacci mod
8. Fibonaccipi(210) = 240Pisano period
9. Cascade8 * 5 * 3 * 2 = 240Iterated halving

Nine independent paths to 240 = 2^4 * 3 * 5. All routes converge on the same factorization.

Octonions and Hamming Code

The Fano plane governs octonion multiplication: 7 imaginary units, 3 per multiplication rule (each line), 8 total basis elements. Octonions are the last normed division algebra (Hurwitz 1898). R(1) -> C(2) -> H(4) -> O(8). Cayley-Dickson doubles each time; the sedenions (16 dimensions) lose alternativity.

The E8 lattice comes from the [8,4,4] extended Hamming code. The original [7,4,3] Hamming has Aut = GL(3, F_2), the same 168-element group. Extension adds a parity check bit: 7 + 1 = 8. E8 = union of 2 copies of D_8 offset by a codeword. GL(3, F_2) is the symmetry at every step.

E8 Exceptionality

E8 Unique Index (PROVED)
Among all exceptional Lie algebras {G2, F4, E6, E7, E8}, only E8 has root count = [S_n : GL(k, F_q)] for any k >= 2. Exhaustive search over n <= 15, q in {2,3,5,7,11,13}. GL(3, F_2) is the unique GL(k, F_q) with order 168.

Fano Labeling

Fano Labeling (PROVED)
The seven primes {2, 3, 5, 7, 11, 13, 17} label the Fano plane so that all 7 line-sums are 11-smooth. Unique up to GL(3, F_2) symmetry. The lines {3, 5, 7} (sum 15, product 105) and {3, 11, 13} (sum 27, product 429) both appear. Total 11-smooth labelings = 84 = 168/2.
{3, 5, 7} line
sum = 15 = 3*5, product = 105
The three odd primes below 11 form a Fano line.
{3, 11, 13} line
sum = 27 = 3^3, product = 429
Includes 11 (parity checksum: 1+2+3+5 = 11) and 13 = 2^2 + 3^2.
84 = 168/2
Aut(Fano) / stabilizer
The sole orbit under GL(3, F_2) has stabilizer Z/2. 84 total smooth labelings.

Hamming Code

Fano-Hamming (PROVED)
The Fano plane PG(2, F_2) is the Hamming [7, 4, 3] code. Rate = 4/7. Codewords = 2^4 = 16. Syndromes = 2^3 = 8. The code is PERFECT: the Hamming sphere of radius 1 covers all of F_2^7 exactly (1 + 7 = 8 = 2^3).
Syndrome Decoder (PROVED)
Single-error correction for all 7 positions via syndrome decoding. The syndrome is the F_2^3 coordinate of the corrupted position. The primes {3, 11, 13} have syndrome-XOR = 0 (they form a codeword). The primes {2, 5, 7} have nonzero syndromes.
[7, 4, 3]
n = 7, k = 4, d = 3
Length, dimension, distance. Rate 4/7.
Perfect code
1 + 7 = 2^3 = 8
Hamming bound exactly met. 2^4 codewords * 2^3 sphere = 2^7 = 128 total vectors.

Extended Hamming and E8

Extended Hamming E8 (PROVED)
Extended Hamming [8, 4, 4]: all parameters are powers of 2. Self-dual (C = C^perp). Extension adds a parity bit: 7 + 1 = 8 (Fano plane + one point = the 3-cube). E8 via Construction A: 224 + 16 = 240 = |roots(E8)|. |Aut([8,4,4])| = P(9) = 1344.
[8, 4, 4]
n = 8, k = 4, d = 4
All powers of 2. Half-rate code: k/n = 1/2.
7 + 1 = 8
Fano + parity = cube
The Fano plane plus one point is the 3-dimensional cube over F_2.
Construction A
224 + 16 = 240
Weight-4 codewords give 2 * 7 * 16 = 224 roots. Weight-0/8 give 16. Total = 240 = P(7).
|Aut| = P(9)
1344 = 8 * 168
Shadow polynomial at 9 = the automorphism group order of [8,4,4].

Golay Codes

Binary Golay (PROVED)
Binary Golay [23, 12, 7]: n = 2*11 + 1, k = 12, d = 7. Check bits = 23 - 12 = 11. Error correction = 3. Weight enumerator: A_7 = 253 = 11*23. Complementary weight-pair differences are {9, 7, 1}, summing to 17. Sphere volume = 2^11 = 2048. |M_23| = P(17) * 253 = 40320 * 253 = 10,200,960.
Perfect Code Exhaustion (PROVED)
Binary Golay [23, 12, 7] and ternary Golay [11, 6, 5] exhaust all nontrivial perfect codes beyond Hamming (Tietavainen-van Lint). Alphabets are 2 and 3 only -- the first two primes. Together with Hamming [7, 4, 3]: exactly two families of binary perfect codes.
[23, 12, 7]
n = 23, k = 12, d = 7
Check bits = 11. Correction capability = 3. All parameters related to the ring's primes.
Weight-pair diffs
{9, 7, 1} sum to 17
Pairs (7,16), (8,15), (11,12) have diffs 9, 7, 1. Sum = 17.
Two alphabets
Binary (2) and ternary (3) only
Ternary Golay [11, 6, 5]. Perfect codes exist only over alphabets 2 and 3.
Two binary families
Hamming + Golay = all
Tietavainen-van Lint: these two exhaust all binary perfect codes.

Leech Lattice

The Leech lattice in 24 dimensions is built from the extended Golay code [24, 12, 8] via Construction A. Its parameters are all axiom-native, and the Mathieu group exponent sums trace a staircase through the axiom chain.

Leech Axiom Lattice (PROVED)
dim = 24 = 2^3 * 3. min_norm = 4 = 2^2. kissing = 196,560 = 2^4 * 3^3 * 5 * 7 * 13 (zero intruders). E8-to-Leech lift = kissing(Leech) / kissing(E8) = 196560 / 240 = 819 = 9 * 7 * 13. Steiner system S(5,8,24) has 759 = 3 * 11 * 23 blocks. 24 Niemeier lattices = dim(Leech). All parameters axiom-smooth.
kissing = 196,560
2^4 * 3^3 * 5 * 7 * 13
The kissing number uses exactly the first 6 axiom primes. Zero intruder primes. ESCAPE absent.
Leech/E8 = 819
9 * 7 * 13 = K^2 * b * GATE
The lift factor from E8 to Leech is a product of three axiom primes.
Mathieu staircase
{8, 11, 12, 13, 17}
Exponent sums of M_11 through M_24 trace {D^3, L, 12, GATE, ESCAPE} -- the chain elements.
Conway |Co_0|
exp_sum = 40 = 2^3 * 5
The Conway group exponent sum is D^3 * E. Mathieu degree gap = 22 - 12 = 10 = Decality.

Monster Group

The Monster group is the largest sporadic simple group. All seven axiom-prime exponents in its order are axiom-smooth. The Monster-Conway excess reveals a direct connection to the Leech lattice dimension.

Monster Axiom Exponent (PROVED)
v_2(M) = 46 = 2*23, v_3(M) = 20 = 4*5, v_5(M) = 9 = 3^2, v_7(M) = 6 = 2*3, v_11(M) = 2, v_13(M) = 3, v_17(M) = 1. All axiom-smooth. Axiom exp sum = 87 = 3*29. DATA exp sum = 81 = 3^4. Monster-Conway excess: {24, 11, 5, 4, 1, 2, 1} = {dim(Leech), L, E, D^2, sigma, D, sigma}. 6-prime sum = 47 = c(c(11)). 7-prime sum = 48 = phi(DATA). The 2-excess is exactly 24 = the Leech lattice dimension. The 5-excess is a fixed point: E maps to itself.
All 7 exponents smooth
46, 20, 9, 6, 2, 3, 1
The seven axiom-prime valuations of |Monster| use only axiom primes in their own factorizations.
2-excess = 24
46 - 22 = dim(Leech)
The Monster needs exactly 24 more factors of 2 than Conway -- the Leech lattice dimension.
5-excess = 5
9 - 4 = E (fixed point)
The observer prime is a fixed point of the Monster-Conway excess map.
7-excess sum = 48
= phi(210) = phi(DATA)
The total 7-prime excess equals Euler's totient of the DATA ring.

Fano Consensus

Fano Consensus Equivalence (PROVED)
Two-level Fano voting (2/3 majority per line, then 4/7 of line-votes) produces identical outcomes to flat 4/7 majority for all 128 input patterns. The Fano plane's BIBD structure decomposes flat consensus without changing any outcome. Both schemes are self-dual and monotone.
128/128 agree
0 disagreements
Exhaustive verification over all 2^7 binary patterns.
490 split
K=3 DEAD lines, 4 ALIVE lines
ALIVE-majority lines = 4/7 = ECC rate. Total DEAD across lines = 9 = 3^2.
HYDOR = consensus
K*E*b = 105
The Fano line {3,5,7} has product 105. The same three coprime primes form the hierarchical consensus levels: 2/3, 3/5, 4/7.
Depth = K = 3
4th level needs 9 = STOP
Consensus depth saturates at K=3 levels. K^2=9 per group -> chain wall.

Sporadic Prime Anatomy

The Mathieu-Conway-Monster hierarchy has axiom-native prime anatomy. The total prime factor counts (Omega) trace the axiom chain.

Sporadic Prime Anatomy (Theorem 154)
Omega (total prime factors with multiplicity): M_11=D^3=8, M_12=L=11, M_22=D^2*K=12, M_23=GATE=13, M_24=ESCAPE=17, Co_0=D^3*E=40, Monster=E*f(E)=95. omega (distinct primes): {D^2, E, D*K, b, K*E}, sum=37=c(D*K^2), product=12600=Tower C level 3. Mathieu omega sum=K*E=omega(Monster), product=E!=120. Monster-Co_0 excess: phi(DATA)+b=E*L=55. All omega sum=47=largest intruder. 19/19 verified.
Omega = chain
{8, 11, 12, 13, 17}
The five Mathieu groups M_11 through M_24 have total prime factor counts that trace {D^3, L, 12, GATE, ESCAPE} -- the axiom chain elements.
omega product
12600 = Tower C level 3
The product of the 5 distinct omega values equals D^3*K^2*E^2*b = Tower C at level 3 (the sacred ring, lambda*DKE).
Monster excess
phi(DATA)+b = 55
The Monster needs exactly 55 more total prime factors than Conway: 48 + 7 = E*L. The observer and protector combine.

Contrast Table

E8Exceptional Lie algebra with 240 roots, studied in high energy physics240 = [S_8 : GL(3, F_2)] = P(7). Nine independent paths to the same number. Factorization 2^4 * 3 * 5 uses only three small primes.Fano planeSmallest projective plane, 7 points, combinatorial curiosityParameters (7, 3, 1) are the ring's primes. Automorphism group GL(3, F_2) = PSL(2, F_7): the duality isomorphism.240 and 168Root count and group order, no obvious connection to small primesProduct = 8! = 40,320. Factorizations share {2, 3}; unique primes are 5 and 7. Ratio = 240/168 = 10/7.Perfect codesHamming and Golay are known perfect codes, parameters seem arbitraryHamming [7, 4, 3] and Golay [23, 12, 7]: all parameters trace to small primes. Perfect codes exist only over alphabets {2, 3}. These two families exhaust all binary perfect codes.

Explore: Shadow Polynomial P(x)

P(x) = (x-1)(x-2)(x-3)(x-5). Roots at {1, 2, 3, 5}. Enter x to evaluate and check 11-smoothness.

Evaluate P(x) at x =

Try: 7 (P(7) = 240 = E8 roots), 9 (P(9) = 1344), 13 (P(13) = 10560), 17 (P(17) = 40320 = 8!).

Source code · Public domain (CC0)

Report issue

.ax source compiled to WASM via self-hosting compiler. Zero HTML authored.