Where unique factorization meets the axiom chain
An imaginary quadratic field Q(√(-d)) has class number 1 when its integers factor uniquely — just like ordinary integers do. There are exactly nine such values of d. This was conjectured by Gauss, proved by Stark and Heegner in 1967.
The first five are {1, 2, 3, 7, 11} — the axiom chain without E=5. The remaining four are generated by K=3 through the Cunningham map c(n) = 2n+1. E is the only axiom prime excluded. The observer sees double: h(-5) = 2.
▮ axiom primes ▮ excluded (h>1) ▮ K-generated 163 = c(K4)
Every axiom prime except E=5 is a Heegner number. Why? Because h(-5) = D = 2. The observer's field has two ideal classes — it sees double. This is the algebraic shadow of E² self-blindness: the observer cannot see itself without ambiguity.
5 is also the only axiom prime that splits in Z[i] (the Gaussian integers): 5 = (2+i)(2-i). Seeing = splitting = ambiguity. The observer pays for perception with uniqueness.
ALL 9 Heegner numbers = axiom primes OR Cunningham images of K-products.
Axiom: {σ=1, D=2, K=3, b=7, L=11}
Cunningham: c(K²)=19, c(K·b)=43, c(K·L)=67, c(K4)=163
K (Socrates, closure) generates every Heegner number through the axiom.
Apply c(K·p) for each axiom element p. Heegner iff p ∉ {D, E}:
| p | K·p | c(K·p) | Heegner? | If not: h |
|---|---|---|---|---|
| σ=1 | 3 | 7 | YES (= b) | |
| D=2 | 6 | 13 | NO | h(-52) = D |
| K=3 | 9 | 19 | YES | |
| E=5 | 15 | 31 | NO | h(-31) = K |
| b=7 | 21 | 43 | YES | |
| L=11 | 33 | 67 | YES (= SOUL) |
The failures carry axiom primes as class numbers: h(-52)=D=2, h(-31)=K=3. The Missing-DE pattern: D and E are the only elements whose Cunningham lift fails.
Powers of K through the Cunningham map: c(Kn) = 2·3n+1.
Heegner at n ∈ {1, 2, 4} = {σ, D, D²}. Smooth zone: h is axiom-smooth for n=0..8 (K² consecutive). First failure at n = K² = 9.
n=7 collapse: c(K7) = c(2187) = 4375 = E4·b. At sunset, only b survives.
Subtract D·K = 6 from each odd axiom prime squared:
K² - D·K = 9 - 6 = 3 = K (Heegner)
E² - D·K = 25 - 6 = 19 (Heegner)
b² - D·K = 49 - 6 = 43 (Heegner)
L² - D·K = 121 - 6 = 115 = E·23 (not Heegner: D·K too small to reach 163)
Three consecutive odd axiom primes squared minus D·K = three consecutive Heegner primes.
All 5 splitting Heegner d's are Eisenstein norms N(a,b) = a² + ab + b² of axiom-smooth pairs:
Inert: {D=2, L=11} (both 2 mod 3). Ramified: K=3. Unit: σ=1. The Eisenstein lattice Z[ω] (where ω = e2πi/3) knows the axiom.
Using the alternate Eisenstein form E3(a,b) = a² - ab + b², ALL seven representable Heegner numbers have minimal representations at axiom pairs:
| h | (a, b) | disc = 4h - 3a² | √disc |
|---|---|---|---|
| 1 = σ | (0, σ) | 4 = D² | D |
| 3 = K | (σ, D) | 9 = K² | K |
| 7 = b | (σ, K) | 25 = E² | E |
| 19 = f(E) | (D, E) | 64 = D6 | D³ |
| 43 | (σ, b) | 169 = 13² | GATE |
| 67 = SOUL | (D, K²) | 256 = D8 | D4 |
| 163 | (K, D·b) | 625 = E4 | E² |
The b-values walk the chain: σ, D, K, E, b, K², D·b.
The a-values use {void, σ, D, K} = void + shadow chain prefix.
Non-representable: {D=2, L=11} = CC1(D) axiom primes (all ≡ 2 mod K).
163 has TWO E3 representations sharing the same b-value:
E3(K, D·b) = 9 - 42 + 196 = 163
E3(L, D·b) = 121 - 154 + 196 = 163
D·b - K = 14 - 3 = 11 = L. The third vertex IS the protector. K + L = D·b.
And remarkably: E3(K, L) = 9 - 33 + 121 = 97 = G (the bridge element).
163 - G = 163 - 97 = 66 = D·K·L. The gap = the protector's product.
CRT(163) = (K, σ, GATE, D4, K²). The largest Heegner carries GATE in its E-channel.
The 7 minimal discriminant square roots are {D, K, E, D3, GATE, D4, E2}. Neither b=7 nor L=11 appears. Two mechanisms:
GATE BLOCKING: b at a=1 needs h=13=GATE (not Heegner).
L at a=1 needs h=31=M(E) (not Heegner). 4·L-3 = KEY=41 (not square).
D-POWER SHADOWING: b at a=3 gives h=19, but 19=K+D4,
so disc(a=2)=D6=(D3)² shadows. Same for L at h=67=K+D6.
Sum of 7 values: 72 = D3·K2 (spider legs × stop).
Count = b = 7 (same as representable Heegner count).
Exactly K=3 Heegner numbers have the form K + D2n:
n=1: K+D² = b = 7
n=2: K+D4 = f(E) = 19
n=3: K+D6 = SOUL = 67
The tower stops at n=K (self-referential). Beyond: K+D8=259=b·37 (not Heegner).
Only 3 bases p produce Heegner numbers via p + D2n:
p = -1 (mirror): n=1 → K = 3. Count = σ = 1.
p = K (closure): n=1,2,3 → {b, f(E), SOUL}. Count = K = 3.
p = b (depth): n=1 → L = 11. Count = σ = 1.
Total produced = E = 5 Heegner. The observer counts them.
Counts by base: {σ, K, σ} = palindromic, centered on closure.
K → representable. b → non-representable (L). The tower KNOWS which can be represented.
h=D=2: disc values {D3=8, E=5}. Sum = 8+5 = 13 = GATE.
h=L=11: disc values {44, KEY=41, D5=32, ESCAPE=17}. Sum = 134 = D·SOUL.
The bridge's disc sum IS the gate. The protector's disc sum = duality·perceiver.
Of 9 Heegner numbers, exactly two are mirrors of universal primitive roots of Z/210Z:
DATA - 163 = 47 = CC1(D)[4] — primitive root
DATA - 67 = 143 = L·GATE — primitive root
SOUL = 67 and 163 are mirror images of primitive roots. They are multiplicatively opposite but spectrally identical: cos(2πk/p) = cos(2π(p-k)/p).
The + cross and the × cross are the same cross, rotated. The bridge between addition and multiplication (the discrete log) connects Heegner to SOUL.
The Cunningham chain CC1(D): 2 → 5 → 11 → 23 → 47 → 95. Each prime's discriminant gives an increasing class number:
| d | h(-d) | Axiom | Ratio |
|---|---|---|---|
| 11 | 1 | σ | |
| 23 | 3 | K | 3/1 = K |
| 47 | 5 | E | 5/3 = E/K = Kolmogorov |
| 95 | 8 | D³ | 8/5 = golden ratio |
| 191 | 13 | GATE | 13/8 = golden ratio |
| 383 | 17 | ESCAPE+1 |
Consecutive ratios include E/K = 5/3 (Kolmogorov turbulence exponent) and 8/5, 13/8 (Fibonacci/golden ratio convergents). See the full D-chain story →
Standard view: The nine Heegner numbers are special discriminants where unique factorization holds. Their selection seems arbitrary.
Axiom view: The first five Heegner numbers {1,2,3,7,11} = axiom primes minus E=5. E is excluded because h(−5) = D = 2 (not unique). The Cunningham map from K=3 generates ALL nine Heegner numbers. The axiom selects them.
Each representable Heegner h has a minimal E3 representation with discriminant 4h-3a2. The sqrt(disc) values are ALL axiom-named:
| h | sqrt(disc) | 4h-3 | a=1 status |
|---|---|---|---|
| 1 | D=2 | 1=σ2 | SELECTED |
| 2 | — | 5=E | |σ+Di|2 |
| 3 | K=3 | 9=K2 | SELECTED |
| 7 | E=5 | 25=E2 | SELECTED |
| 11 | — | 41=KEY | |D2+Ei|2 |
| 19 | D3=8 | 73=D6+K2 | |D3+Ki|2 |
| 43 | GATE=13 | 169=GATE2 | SELECTED |
| 67 | D4=16 | 265=D8+K2 | |D4+Ki|2 |
| 163 | E2=25 | 649=L*59 | NOT Gaussian |
Disc Ratio Theorem: sum(disc) = D4 * sum(sqrt(disc)) = D7K2 = 1152.
Blocked Sum: 5+41+73+265+649 = 1033 = D10+K2 = |D5+Ki|2 (prime!). The Catalan identity E+K=D3 forces this.
Non-Rep Gate: D+L = GATE = 13. All 9 Heegner sum = 316 = D2*79.
The blockers |Dk+Ki|2 are values of the Gaussian norm family: |Dn+Ki|2 = D2n+K2 = 4n+9. The first value is |D+Ki|2 = 13 = GATE.
This sequence has a covering set built entirely from axiom vocabulary:
| Covering prime q | Period | Residue class |
|---|---|---|
| GATE=13 | DK = 6 | n = σ mod DK |
| 37 = PRODIGAL | DK2 = 18 | n = ESCAPE mod DK2 |
| 61 = e3(shadow) | DKE = 30 | n = Kb mod DKE |
| 73 = H0 | K2 = 9 | n = K mod K2 |
| 97 = G | D3K = 24 | n = b mod D3K |
| 181 = p42 | DK2E = 90 | n = L mod DK2E |
Covering Sum = 462 = THIN/E. The self-blind observer is absent from the sum — third manifestation of E2 self-blindness.
Primes at n = {σ,K,E,K2,KE} = {1,3,5,9,15}. The GATE guards n=1 mod 6. H0=73 guards n=3 mod 9. Each prime self-covers its own birth position.
GATE2 Period: 132 | 4n+9 iff n = b mod DK*GATE. At n=7: GATE2*G = 169*97.
D-Chain Class Numbers · Partition Bridge · Eta Bridge · Modular Forms · Heegner Numbers · D-Power Gaussian Primes