The prime chain grows: 1, 2, 3, 5, 7, 11. Each prime emerges from the ones before it. But 3^2 = 9 is not prime -- the chain stops. Not accident: 9 = 8 + 1 satisfies a unique identity proved by Mihailescu in 2002 as the resolution of Catalan's 158-year-old conjecture.
Three Independent Proofs
The identity (2,3) is forced by three different roads:
1. Catalan
3^2 = 2^3 + 1
Mihailescu 2002: the ONLY consecutive proper prime powers in all of mathematics.
2. Cunningham Map
c(7) = 15 = 3*5
The map c(p) = 2p+1 applied to 7 gives 15 = 3*5 (composite). Only the pair (2,3) forces c to stop at 3^2.
3. Uniqueness
2 is unique
Among all primes p, only p=2 produces a Cunningham chain where 2p+1 at the stop is the product of two earlier chain primes (3*5).
The Forced Chain
From 3^2 = 2^3 + 1 alone, the entire chain follows: (2,3) -> c(2) = 5 -> c(3) = 7 -> c(5) = 11 -> c(7) = 15 = 3*5. The ring Z/970,200 = 2^3 * 3^2 * 5^2 * 7^2 * 11 emerges from a single equation: 9 = 8 + 1.
The Four Pairings
9 can be partitioned into pairs where both parts appear in the ring's structure:
Pair
Factored
Product
Note
1 + 8
1 + 2^3
8
Identity + cube
2 + 7
2 + 7
14
Smallest + largest chain prime below 9
4 + 5
2^2 + 5
20
Prime power + prime
3 + 6
3 + 2*3
18
3 + its own double
Pair Products Theorem (PROVED)
The three symmetric products {8, 14, 20} form an arithmetic progression with step 2*3 = 6. Their sum = 42 = 2*3*7. All four products {8, 14, 18, 20} sum to 60 = phi(Z/2,310)/8.
Why 9 Appears Everywhere
9 is not just where the chain stops. It appears independently across arithmetic, algebra, and spectral analysis:
#
Source
Identity
1
Catalan
3^2 = 2^3 + 1 (unique consecutive prime powers)
2
Cunningham
c(4) = 2*4+1 = 9 (first composite in the chain)
3
Polynomial
f(3) = 3^2-3-1 = 5, so 3+5+1 = 9
4
Sum
2 + 7 = 9 (smallest + largest prime below 9 in the chain)
5
Reversal
4 + 5 = 9, and 4 + 9 = 13 = 2^2+3^2
6
Spectral
Eigenvalue variance at the 5-channel ring = 9
7
CRT
CRT(9) = (1,0,9,9,9,9): mod-9 channel = 0
8
Degree
Spectral degree across 6 channels = 1+2+2+2+2 = 9
9
Swim
Eigenvalue walk hits local max at 9 before 11
10
Lambda split
3 divides lambda(p^e) for {3,7,13} but not {2,5,11}
Identity #7 is the deepest: CRT(9) in Z/12,612,600 has mod-9 channel = 0. The number that stops the chain is invisible to its own channel. 3 cannot see its own square.
Mod-9 Projector (PROVED)
The CRT idempotent for the mod-9 channel is 1,401,400. CRT = (0,1,0,0,0,0) -- it isolates the mod-9 channel and zeros everything else. 1,401,400^2 = 1,401,400 (mod 12,612,600). This is unique: for the other five primes, the analogous element is NOT idempotent (residues 7,4,3,4,10 in the target channel). Adding the mod-13 channel purifies it: 7*13 = 91 = 1 (mod 9).
The Fano-PSL Bridge
The shadow polynomial P(x) = (x-1)(x-2)(x-3)(x-5) at x = 9:
P(9) = 1344
8 * |PSL(2,7)|
8 * 168. The cube times the Fano plane's symmetry group.
Fano plane
7 points, 3 per line
The smallest finite projective plane. 7 points, 7 lines, 3 points per line.
|PSL(2,7)| = 168
7(7^2-1)/2
7 * 48/2 = 168. Automorphism group of the Fano plane.
Class Bootstrap
Start from any CRT channel size. Apply floor(q/2)+1 iteratively. Every channel converges to 2:
Channel
Chain
Length
7^2 = 49
49->25->13->7->4->3->2
6 steps
5^2 = 25
25->13->7->4->3->2
5 steps
3^2 = 9
9->5->3->2
3 steps
2^3 = 8
8->5->3->2
3 steps
11
11->6->4->3->2
4 steps
2 is the unique fixed point: floor(2/2)+1 = 2. The prime chain is its own convergence.
The One-Way Valve
The class bootstrap has a FORWARD map too: B(p) = (p^2+1)/2. What it does to each chain prime reveals a phase transition at p = 5.
Input p
B(p)
Factorization
Smooth?
3
5
5
YES
7
25
5^2
YES
5
13
13
NO
11
61
61
NO
13
85
5 * 17
NO
17
145
5 * 29
NO
19
181
prime
NO
23
265
5 * 53
NO
31
481
13 * 37
NO
37
685
5 * 137
NO
41
841
29^2
NO
47
1105
5 * 13 * 17
NO
2 stands outside: B(2) = 5/2 is not an integer. 2 is the fixed point of descent, not a participant in ascent.
One-Way Valve Theorem (PROVED)
B(p) = (p^2+1)/2 partitions chain primes into CONDENSERS {3,7} producing 11-smooth output {5, 25}, and RADIATORS {5, 11} producing non-smooth output {13, 61}. All 8 intruders map to non-smooth composites (0/8 smooth). 13 is one-way: chain primes condense in, intruders radiate out.
B(47) = 1105 = 5*13*17: the last intruder's output weaves together a chain prime, a stopper, and another intruder.
Intruder Descent Lengths
Apply B to each intruder, then descend back to 2 via floor(n/2)+1. Count the steps:
Intruder
B(p)
Descent length
Factored
13
85
7
prime
17
145
8
2^3
19
181
8
2^3
23
265
9
3^2
31
481
9
3^2
37
685
10
2*5
41
841
10
2*5
47
1105
11
prime
Intruder Descent Theorem (PROVED)
The 8 intruders' B-descent lengths are {7, 8, 8, 9, 9, 10, 10, 11}. Five consecutive integers from 7 to 11 in a 1-2-2-2-1 symmetric pattern. The first intruder (13) has descent 7. The last intruder (47) has descent 11. Boundary intruders are singletons; inner intruders pair up.
The descent from B(31) = 481 traces a reverse tour: 481 -> 241 -> 121 -> 61 -> 31 -> 16 -> 9 -> 5 -> 3 -> 2. And B(23) = 265 passes through 67.
Explore: 9-Analyzer
Enter any n. See its CRT decomposition, mod-9 residue, and class bootstrap convergence to 2.
3^2 = 2^3 + 1 is a universal boundary (Mihailescu 2002). The four pairings of 9 have products summing to 42 = 2*3*7. P(9) = 8*|PSL(2,7)|.
9 = 3^2
A small perfect square.
CRT(9) = (1,0,9,9,9,9): mod-9 channel vanishes. The mod-9 idempotent 1,401,400 is the only channel projector that is also its own coupling value.
Catalan's conjecture
A curiosity: 8 and 9 are the only consecutive prime powers.
From 9 = 8 + 1 alone, the chain follows: (2,3) forced, then 5, 7, 11 by Cunningham. One equation, six primes, the ring Z/12,612,600.
Class bootstrap
Abstract algebraic invariants.
The class bootstrap is a one-way valve: chain primes condense in (smooth output), intruders radiate out (0/8 smooth). Descent lengths span 7-11 in a 1-2-2-2-1 pattern.