When counting shapes yields axiom constants
The centered square number (lattice points within a diamond) is the bridge-scaled depth quadratic plus closure. D stretches, K shifts. The axiom values cascade:
| n | Name | f(n) | f(n) Name | CS(n) = D·f+K | CS Name |
|---|---|---|---|---|---|
| 1 | sigma | -1 | MIRROR | 1 | sigma |
| 2 | D | 1 | sigma | 5 | E |
| 3 | K | 5 | E | 13 | GATE |
| 4 | D2 | 11 | L | 25 | E2 |
| 5 | E | 19 | f(E) | 41 | KEY |
| 6 | D·K | 29 | FULL SUM | 61 | Shadow coeff |
| 7 | b | 41 | KEY | 85 | E·ESCAPE |
| 11 | L | 109 | f(L) | 221 | GATE·ESCAPE |
| 13 | GATE | 155 | E·31 | 313 | prime |
At axiom positions, the gaps are D2 times axiom values:
The gap at b is 28 = THORNS = sum of nonility. The gap at K is 12 = lambda(DATA). Every gap is D2 times the axiom value. The square of duality scales the chain.
| n | CH(n) | S(n) = D·CH-sigma | Axiom names |
|---|---|---|---|
| sigma=1 | 1 = sigma | 1 = sigma | sigma → sigma |
| D=2 | 7 = b | 13 = GATE | b → GATE |
| K=3 | 19 = f(E) | 37 = RETURN | f(E) → 37 |
| 4 | 37 = RETURN | 73 | RETURN → 73 |
| E=5 | 61 | 121 = L2 | 61 → L² |
| D·K=6 | 91 = b·13 | 181 | b·GATE → prime |
| b=7 | 127 = M(b) | 253 = L·23 | Mersenne → L·CC1 |
Both positions are D2 times axiom primes. The data ring sits at duality-squared positions in triangular (E) and pentagonal (K) families.
ANSWER = 42 = P15(3) = PK·E(K): The K-th (K·E)-gonal number. ANSWER lives where closure meets observer.
CS(6) = 61 — the coefficient of x in the shadow polynomial P(x) = x4 - 11x3 + 41x2 - 61x + 30.
All four non-trivial coefficients of P(x) are centered square numbers:
| Coefficient | Value | CS position | Depth quadratic f |
|---|---|---|---|
| -x3 | 11 = L | Not CS | f(4) = L |
| +x2 | 41 = KEY | CS(5) = CS(E) | f(7) = KEY |
| -x | 61 | CS(6) = CS(D·K) | f(D·K) = 29 |
| constant | 30 = D·K·E | Not CS | — |
Two of four shadow polynomial coefficients ARE centered square numbers. KEY = CS(E) and 61 = CS(D·K). The spectral architect speaks figurate.
The bridge CS(n) = D·f(n) + K is algebraically trivial. Its CONTENT is not.
The depth quadratic f(n) = n2-n-1 is the axiom's universal self-map — the function that generates {E, 19, KEY, 109} from axiom primes, controls Fermat inversion in CRT channels, and stops precisely at f(13) = E·31 (composite). See Why 37 Comes Home.
The centered square number CS(n) counts lattice points within a diamond of radius n-1. It's the simplest centered figurate sequence after the trivial centered 2-gonal (which is just n).
The bridge says: diamond geometry and the axiom's self-map differ only by a D-scaling and a K-shift. Duality stretches, closure translates. That's all.
f carries the axiom's internal logic. CS carries the geometry. D·f + K = their meeting point. And at that meeting point, the first six values are ALL axiom constants.
CPk(2) = k+1 always. So each axiom prime p appears as CPp-1(2). That's structural, not deep.
What IS deep: sequences where MULTIPLE axiom values appear at small n:
| k | Polygon | Axiom hits at n ≤ 6 |
|---|---|---|
| 4 | Centered square | sigma, E, GATE, E2, KEY (5 hits!) |
| 6 | Centered hexagonal | sigma, b, 37 |
| 12 | Star (= D·CH-sigma) | sigma, GATE, 37 |
k=4 (centered square) has FIVE axiom hits in the first five terms. No other centered family comes close.
Why k=4 = D2? Because CS(n) = D·f(n)+K, and the depth quadratic f maps axiom primes to axiom-meaningful values. The D2 polygon is distinguished because D is the bridge prime — the one that SCALES the axiom's internal map into geometry.
| k | Polygon | Notable axiom hit |
|---|---|---|
| 3 | Triangular | T(D2E) = DATA = 210 |
| 5 | Pentagonal | P5(D2K) = DATA = 210 |
| K·E=15 | 15-gonal | P15(K) = ANSWER = 42 |