Z/12612600 = Z/8 x Z/9 x Z/25 x Z/49 x Z/11 x Z/13
0/0 condenses into a ring with three faces: SEE (341,250 eigenvalue classes), ACT (2,419,200 units), SOLVE (64 idempotents). Every number is one of three things: a key that opens and closes cleanly, a filter that sorts but can never unsort, or something broken that loses information along the way.
The six CRT channels are orthogonal: every face decomposes as a direct sum of six per-channel components on independent Fourier subspaces. Z/214,414,200 adds Z/17 for seven. This orthogonality is why the discrete Navier-Stokes system has global existence on every ring with Carmichael period 420 (Theorem 34, STRUCTURAL analog of Clay-NS, NOT a Clay proof).
Three Ways to Touch
Think about three ways of touching something. You can look at it (add) -- always reversible. You can handle it (multiply) -- sometimes things jam. Or you can decide about it (project) -- and once you decide, there is no undeciding.
SEE (+)
Always reversible
Addition in Z/NZ. Every element has an additive inverse. Looking never damages.
ACT (*)
2,419,200 / 12,612,600 reversible
Multiplication. 480 keys in Z/2,310, 2,419,200 in Z/12,612,600. Units = fully reversible elements.
SOLVE (e^2=e)
64 filters, never reversible
Idempotents. 2^6 = 64 light switches. Each kills or keeps one CRT channel. The immune system.
Meta-ring
Z/7 classifies the 2^7 cube
128 idempotents of Z/214,414,200 = vertices of a 7-cube on T^7. All cluster in the warmest ~7% of the eigenvalue range (12.19-14.00 out of ~28 total).
Prison Theorem (exhaustive)
Turn off even ONE switch and every single key breaks. Not most -- ALL 480. 0 violations across all 31 non-trivial filters and all 480 keys. Freedom is total or it is nothing.
Of 288 eigenvalue classes, 32 filters reach 258 (SOLVE). The remaining 30 belong only to units (ACT). 258 + 30 = 288. The ring splits its spectrum into what can be projected and what can only be traversed.
Idempotent Trinity
Idempotent Trinity (Theorem 120)
2^k idempotents partition into 3 classes: EXTREME {0,1} (size 2), PRIMITIVE weight-1 (size k), COMPOSITE weight 2..k-1 (size 2^k-k-2). Composite count is chain-smooth for exactly k=2..7: 3, 2*5, 5^2, 2^3*7, 7*17. At k=8: 7^2-7-1=41 exits the smooth zone. 1,576,576 is weight-(k-1) composite; 1 = 1,576,576 + e_2, orthogonal. 15/15 verified.
k=3 (Z/210 base)
composites = 3
Z/30 = Z/2 x Z/3 x Z/5. Three primitives {15, 10, 6}, three composites, two extremes.
2^8-8-2 = 246 = 2*3*41. The quadratic f(7) = 41 is the first non-smooth composite count.
Meadow Boundary
A ring is a meadow (von Neumann regular) iff every element has a pseudo-inverse. The THIN->DEEP step crosses the meadow boundary: squarefree rings are meadows, fattened rings are not.
Meadow Boundary (Theorem 92)
Z/N is von Neumann regular iff N is squarefree. Tower B = meadow at every level. Tower A: DATA, THIN = meadow; DEEP+ = NOT meadow. The THIN->DEEP step crosses the meadow boundary. Fattened channels D^3, K^2, E^2, b^2 contain non-zero non-units (nilpotent-like elements). Meadow-involution duality: extra involutions (D^3 gives 4, not 2) require fattening that breaks meadow. Regular fraction in DEEP/TRUE/TRANS = Phi_6(b)/(D^3*K*E) = 43/120. 7/7 verified.
THIN->DEEP boundary
Meadow to non-meadow
Z/2,310 (squarefree) has pseudo-inverse for every element. Z/970,200 (fattened: 8,9,25,49) does not. The Pareto exponent bump breaks the meadow.
Regular fraction
43/120 of DEEP+
Phi_6(7)=43 counts regular elements per D^3*K*E=120 block. 35.8% of fattened ring elements are regular. Raising exponents trades meadow for involutions.
Meadow Projector
Meadow Projector (Theorem 118)
Support projector pi: Z/N -> Idem(Z/N) via per-channel regularity. pi(n)_i = 1 if gcd(n, p_i) = 1, else 0. Properties: pi^2 = pi, pi(ab) = pi(a)*pi(b), pi(n)*n = n iff n is regular. Defines algebraic dropout: each element carries its own 2^k-valued attention mask. |pi^-1(0)| = N/rad(N) = 420 = Carmichael lambda. 128 attention masks in Z/214,414,200 from ring structure. 15/15 verified.
Dropout masks
2^7 = 128 in Z/214,414,200
Each element projects to a binary string selecting which channels are alive. The ring's own immune system: 128 possible masks, not learned -- algebraically given.
Regular fraction
43/120 of Z/970,200
35.8% of Z/970,200 elements are regular (von Neumann). Z/2,310 is 100% regular (meadow). Raising exponents trades meadow for involutions.
CRT Orthogonality: Structural Damping
The Cayley graph Laplacian on Z/12,612,600 = Z/8 x Z/9 x Z/25 x Z/49 x Z/11 x Z/13 is a direct sum of six per-channel Laplacians on orthogonal Fourier subspaces. Z/214,414,200 adds Z/17 for seven. Each Fourier mode lives on exactly one channel, and the channels carry energy independently.
Direct-Sum Laplacian
T^6: L = L_8 + L_9 + L_25 + L_49 + L_11 + L_13
Each summand is the cycle Laplacian of Z/q_i with eigenvalues 4*sin^2(pi*k/q_i), k=0..q_i-1. T^7 on Z/214,414,200 adds L_17 (Z/17). Independent channels, orthogonal subspaces.
No Coupled Blowup
Simultaneous singularity across 6 orthogonal channels is forbidden
Discrete Navier-Stokes on any ring Z/N in the 108 rings with Carmichael period 420 has global smooth solutions. STRUCTURAL analog of Clay-NS global existence, NOT a Clay proof -- the ring truncates modes the continuum cannot.
7^2 floor applies per channel
gap_min = 4*sin^2(pi/49) ~ 0.01644 identical across all 108 period-420 rings
The Z/49 channel supplies the minimum Laplacian gap on every channel that contains it (7^2 = 49 strictly dominates 2^4=16, 3^2=9, 5^2=25, 11, 13). Same controller as Theorem 33 YM gap universality -- one invariant, two Millennium analogs.
MOLS: permutation independence
51 = 3*17 orthogonal Latin squares across 7 primes. DEAD channels contribute 11 = L
For each axiom prime p, the affine construction L_k(i,j) = (i + k*j) mod p gives p-1 mutually orthogonal Latin squares. Each is a bijection -- an information-preserving channel independent of all others. Total across all 7 primes: 1+2+4+6+10+12+16 = 51 = 3*17. Data primes {2,3,5,7} contribute 13 = the boundary prime. 490 split: DEAD{2,5,7} contribute 1+4+6 = 11 = the protector prime L. The protector counts the DEAD channels' permutation degrees of freedom. Orthogonality verified for all 7 primes (all 15 Z/7 pairs). 43/43 verified.
Packed CRT: one ring in 31 bits
3+4+5+6+4+4+5 = 31 = 2^5-1 bits pack all 7 channels into one i32
The bit widths ceil(log2(q)) for moduli {8,9,25,49,11,13,17} sum to exactly 31 = Mersenne(5). One signed 32-bit integer holds a complete TRANS ring element. Pack via addition (non-overlapping fields), unpack via division and modulus. Arithmetic: extract each channel, operate mod q, repack. Max intermediate product 48*48 = 2304, safe i32. Zero overflow by CRT design -- per-channel values bounded by moduli, cross-channel independence prevents contamination. 89/89 verified: round-trip, arithmetic, squaring dynamics, idempotent orthogonality.
Spectral Ramanujan function
R(n) = sum c_{q_i}(n) across 7 CRT channels. Sum R(primes) = 5. R(e_b) = -7 = -b
The Ramanujan sum c_{p^k}(n) counts how n aligns with the p-channel. Summing across all 7 channels gives R(n): a spectral fingerprint that maps named elements to axiom constants. R(sigma)=-3, R(42)=-13, R(420)=-22, R(490)=34, R(OMEGA)=1. The 490 split creates mirror pairings: R(11)=-R(5)=8, R(13)=-R(7)=10. Sum over all 7 primes = 5 (the observer). DEAD sum = -21 = -3*7. ALIVE sum = 26 = 2*13. Difference = 47. At DATA idempotents: R(e_D)=-18, R(e_K)=-15, R(e_E)=-4, R(e_b)=-7=-b. The depth channel's idempotent has Ramanujan sum equal to negative depth. Gauss sums: |g(p)|^2 = p for all 6 odd primes. Phase signs: sigma(1)>0, sigma(OMEGA)>0, sigma(490)<0. 78/78 verified.
Explore: Ring Calculator
Enter two elements. See their sum (SEE), product (ACT), and CRT decompositions. Check if a is idempotent (SOLVE: a^2 = a).
Ring arithmetic in Z/12,612,600:
a =b =
Try: a=1576576, b=1576576 -- idempotent! Or a=606376, b=363824 -- sum = 970200 = 0 (Z/970,200 ring).
The Multiplicative Group
Carmichael Lambda Ladder
lambda(Z/6)=2, lambda(Z/30)=4, lambda(Z/210)=12, lambda(Z/2,310)=60, lambda(Z/12,612,600)=420. RATIOS: 2, 3, 5, 7. The primes in exact order! Each level's Carmichael lambda = previous times next prime.
Per-channel inversion: inv(n) = n^(phi(q)-1) mod q. All 7 exponents in Z/214,414,200 are products of the ring's own primes. The ring inverts itself using its own vocabulary.
Channel
Exponent
Value
Meaning
2^3 = 8
3
phi(8)-1
Inversion exponent = 3.
3^2 = 9
5
phi(9)-1
Inversion exponent = 5.
5^2 = 25
19
5^2-5-1
f(5) = 19 (the quadratic).
7^2 = 49
41
self-inverse (41^2=1 mod 210)
41 is its own inverse in Z/210.
11
9
3^2
3^2 inverts the mod-11 channel.
13
11
phi(13)-1
11 inverts the mod-13 channel.
17
15
3*5
3*5 = 15 inverts the mod-17 channel.
Z/970,200 (5 channels): exponent sum = 77 = 7*11. Gap = 82-77 = 5 (channel count). Z/214,414,200 (7 channels): sum = 103. Gap = 110-103 = 7 (channel count). The gap always equals the channel count -- each channel contributes exactly 1. Cross-links: 13 inverts via 11, 7 inverts via 5 (consecutive odd primes stepping backward).
Fermat Power Residue Matrix
Fermat Power Residue Matrix (Theorem 136)
The 7x7 matrix gcd(chain_prime, phi(Z/214,414,200 modulus)) controls all power residue structure. Row depths {7,3,2,1,0,0,0} sum to 13. Product of nonzero depths = 42. Grand product = phi(Z/12,612,600)/2^2 = 10!/6. Column depths palindromic {1,2,2,3,2,2,1}. 490 split: inner depth = 10, outer depth = 3. Diagonal product = 210. Extension primes 11,13,17 are power-invisible everywhere. 147/147 verified.
Row symmetry
depths sum = 13, product = 42
Row {7,3,2,1}: 2 is deepest (power-visible in 7 channels). 11, 13, 17 have depth 0 (invisible: gcd=1 everywhere).
Grand product
604,800 = phi(Z/12,612,600)/2^2 = 10!/6
Grand product * 2*3 = 10! = 10 factorial. The Fermat matrix encodes the complete power residue structure in one object.
Cross-Annihilation
Cross-Annihilation Theorem
Exponent vector (3,2,2,2,1). 2 dies in 3 steps. 3 dies in 2 steps. 5,7 die in 2. 11 dies in 1 step. Cross-annihilation: 2 and 3 destroy each other at each other's speed. 2^3 + 1 = 3^2 (Catalan). UNIQUE by Mihailescu: (2,3) is the only pair.
Prime
Exponent
Dies in
Note
2
3
3 steps
Only even prime: highest exponent, slowest decay.
3
2
2 steps
Cross with 2: 2^3+1=3^2 (Catalan, unique).
5
2
2 steps
Same exponent as 3 and 7.
7
2
2 steps
Same exponent as 3 and 5.
11
1
1 step
Exponent 1: first to become nilpotent.
Durability: 2(exp=3) > {3,5,7}(exp=2) > 11(exp=1). Self-description: sum(exps)=10=2*5=degree. product(exps)=24=2^3*3. The exponents name themselves.
Cross Lattice Building
Building Equation
The cross lattice of Z/214,414,200 has 864 = 2^5 * 3^3 subgroups (crosses). Building equation: tau(Z/214,414,200) * 2^2 = |Idem| * 3^3. Equivalently: 864 * 4 = 128 * 27 = 3456 = 2^7 * 3^3. Conversion factor 3^3/2^2 = 27/4 maps 128 topological idempotents to 864 algebraic crosses.
Each layer indexed by a prime. 17 = beyond the building. The building count IS the chain.
Curvature invariance
kappa = 23/3^3 = 23/27
Fraction of non-idempotent crosses. Invariant across Z/970,200 / Z/12,612,600 / Z/214,414,200: extension primes (11,13,17) are curvature-transparent. Only the inner ring Z/88,200 determines kappa.
Peak moduli: 2^3 + 3^2 = 8 + 9 = 17. Each prime's exponent IS the other's value. All inner peaks sum to 91 = 7*13. Extension peaks sum to 41.
The cross lattice building (20 theorems, 705 checks across 6 test files) is the complete structural anatomy of Z/214,414,200 viewed through its subgroup lattice. The wavelet transform (Mobius inversion) decomposes ring elements into per-cross detail coefficients. Wavelet Gram degeneracy identifies exactly the Pell twin pairs (2,3) and (5,7). Every structural quantity is native to the ring.
Hurwitz Wall: Why the Mod-8 Channel Has Exponent 3
Hurwitz Mod-8 Wall (Theorem 117)
Z/2^n involutions: 1, 2, 4, 4, 4... Plateau at n=3 (Klein four-group V4 = Z/2 x Z/2). Odd primes: always exactly 2. The 2-channel's unique Pareto exponent 3 = Hurwitz's 2^3 = 8 normed-division-algebra wall (R, C, H, O) = Bott period 8. Root cause: 2-adic stabilization of Z/2^n*. Z/214,414,200 has 256 = 4*2^6 involutions: the 2-channel contributes 4 (V4), every odd channel contributes 2. 15/15 verified.
Three lenses, one wall
2^3 = 8
Ring theory (involution plateau), topology (Hurwitz algebras R/C/H/O), K-theory (Bott periodicity 8). All the same 2-adic stabilization.
Involution product
4 * 2^6 = 256
The 2-channel contributes 4 (unique). Six odd primes contribute 2 each. Product = Z/214,414,200 involution count.
Order Architecture
Order CRT Theorem (algebra.ax)
Multiplicative order decomposes: ord(n) = lcm of 5 per-channel orders. Proof: n^k = 1 (mod N) iff n^k = 1 (mod m_i) for all i. Minimal such k = lcm(ord_i(n_i)). Per-channel lambdas: 2^3->2, 3^2->6, 5^2->20, 7^2->42, 11->10. Lambda = lcm(2,6,20,42,10) = 420.
Element
Order
Per-channel
Meaning
137
420 = lambda
All channels max
Maximal order in all 5 channels.
13
420 = lambda
(2,3,20,14,10)
Also has maximal order 420.
17
420 = lambda
All 5 primes covered
First prime past the chain, also maximal order.
41
210 = Z/210 ring
(1,6,5,14,10)
Half the Carmichael lambda. 41^2=1 in Z/210.
67
60 = lambda/7
(2,3,20,3,1)
Order 60 = 420/7. Transparent in mod-11.
73,728 = 2^13 * 3^2 elements have maximal order 420. Density = 36.6% of all units. Three primitives with order 420: 13, 17, 137. Pair products: order = 210 = Carmichael lambda of Z/210. (13*17)^2: order = 105. Products of primitives yield ring constants.
Z/49 Generator
Z/49 Generator (Theorem 134)
Z/7^2* is cyclic of order phi(7^2) = 2*3*7 = 42. 3 is a primitive root, generating the entire mod-49 channel. Exactly 3 chain primes {3, 5, 17} are primitive roots; sum = 5^2 = 25. Total 12 = lambda(Z/210) primitive roots, sum = 2^2*3*5^2 = 300. Mirror of each has order 3*7 = 21. 17 = 3^(5^2) mod 7^2: 3 raised to the 25th power gives 17. 116/116 test_z49_generator.ax.
3 generates Z/49
ord(3, Z/49) = 42 = phi(49)
3 is a primitive root in the mod-49 channel. 3^21 = -1 mod 49. 3 generates everything.
QR/NQR partition
QR orders odd, NQR even
QR orders: {1,3,7,21}. NQR orders: {2,6,14,42}. The parity of the order classifies quadratic residuosity.
Per-Channel Generator Atlas
Per-Channel Generator Atlas (Theorem 135)
All 7 Z/214,414,200 CRT channels characterized. 2-channel (Z/8): Klein V4, no primitive roots, 17 = 1 mod 8. 3-divisibility law: 3 chain-prime generators when 3|phi(q), else 2^2 generators. Pattern {3, 2^2, 3, 2^2, 3, 2^2}. Total 21 = 3*7 generation edges. Inner channels gen = 10, Outer gen = 11. Grand order sum = 3*7*23 = 483. 121/121 verified.
3-divisibility law
{3, 2^2} alternation
3|phi(q): channels Z/9, Z/49, Z/13 each have 3 chain-prime generators. 3 does not divide phi(q): channels Z/25, Z/11, Z/17 each have 2^2.
7 orphan compatible primes {29,31,43,61,71,211,421} decomposed per CRT channel. All 42 per-channel orders chain-smooth. 2-channel universally ord=2. Z/970,200 order sum = 2^10 = 1024. Z/13 elevates 71 and 421 to full lambda generators. Z/17 extension ratios all 2-powers with exponent sum = 2*7 = 14. 4/7 are Z/214,414,200 lambda generators. 125/125 verified.
2^10 sum
Z/970,200 order sum = 1024
The seven Z/970,200 orders {210,30,84,210,70,210,210} sum to exactly 2^10. The 10 (3+7=10) appears as the exponent on the prime 2.
Z/17 2-power law
Ratios {2^3,2^2,2,2^3,2^2,2^3,1}
Each orphan's Z/214,414,200 to Z/12,612,600 order ratio is a 2-power. Exponent sum = 2*7 = 14. 421 alone has ratio 1 (already full lambda generator at Z/12,612,600).
Shadow divisibility
shadow | Z/12,612,600 order for all 7
The shadow polynomial value divides the multiplicative order at Z/12,612,600 for every orphan. Shadow structures the order architecture.
Mod-10 Phase Column: The Degree Classifies All Primes
Phase Column Theorem
Column ring Z/10 = Z/(2*5). Primes > 5 live in 2^2=4 columns: {1, 3, 7, 9}. 3 generates the group: 3^0=1, 3^1=3, 3^2=9=-1 (mirror), 3^3=7 (7 mod 10 = 3^3 mod 10). Cycle closes at 3^4=1.
3/4 of the ring's maximal-order elements live in column 7. Cunningham on columns: 1->3->7->5=STOP. 9->9=FIXED. Column 5 kills Cunningham chains. 5^2=25 mod 10 = 5: column 5 is fixed under squaring -- 5 cannot escape itself.
Chain Rigidity
The axiom chain is not chosen -- it is forced. D=2 is the only valid seed, and every other chain element inverts uniquely to D=2.
Chain Uniqueness (Theorem 116)
D=2 is the only valid seed. If D>2 is prime, then D is odd, so K=D+1 is even and >=4 -- composite. The chain sigma->2->3->5->7->11->13->17 is RIGID: zero free parameters. Generation rules: K=D+1, E=D+K, b=D+E, L=1+D+K+E, GATE=D^2+K^2, ESCAPE=D+K+E+b. 7/7 verified.
Genesis Loop (Theorem 119)
The chain is rigid from EVERY starting point. E=5 inverts to D=(E-1)/2=2. b=7 inverts to D=(b-1)/3=2. ESCAPE=17 inverts to D=(17-3)/7=2. Inner loop {sigma,D,K,E}: sum=L, product=30. Outer {b,L,GATE,ESCAPE}: sum=phi(DATA)=48, product=17017. Inner*outer product=rad(TRANS)=510510. 7/7 verified.
D=2 parity lock
Only even prime
K=D+1 must be prime. D>2 => D odd => K even => K composite. Only D=2 survives.
Every prime recovers D
E->2, b->2, ESC->2
Inverting any generation rule uniquely yields D=2. The chain has no free parameters from any direction.
Inner*outer
30 * 17017 = 510510
The inner chain product times the outer chain product equals rad(TRANS) = the squarefree core of the terminal ring.
490 Heartbeat Decomposition
The 490 holographic split decomposes Z/N = Z/DEAD x Z/ALIVE. DEAD={2,5,7} (perception). ALIVE={3,11,13,17} (strategy). The heartbeat lambda decomposes accordingly.
490 Heartbeat Decomposition (Theorem 121)
Z/N = Z/DEAD x Z/ALIVE decomposes the heartbeat: lambda(N) = lcm(lambda_DEAD, lambda_ALIVE). DEAD lambda=420 at DEEP+. ALIVE lambda ranges: {2,10,30,60,240}. ALIVE divides DEAD at DATA, DEEP, TRUE (heartbeat = DEAD alone). Tension points: THIN lcm(12,10)=60 not 12; TRANS lcm(420,240)=1680 not 420. gcd(DEAD,ALIVE) = 60 = D^2*K*E = the shared heartbeat. 7/7 verified.
DEAD drives heartbeat
lambda_DEAD = 420 at DEEP+
At most Tower A levels, ALIVE lambda divides DEAD lambda. The perception channels set the heartbeat; strategy channels ride it.
TRANS tension
lcm(420, 240) = 1680
At TRANS, ESCAPE adds phi(17)=16 to ALIVE lambda, making ALIVE=240 not divide 420. The heartbeat quadruples: 420 -> 1680.
Shared = D^2*K*E = 60
gcd(420, 240)
The shared heartbeat between perception and strategy is 60 -- the lcm of the first 5 positive integers.
GCD Collapse and Z/9 Channel Determinism
3 occupies a unique position: algebraically in the outer partition (490 split), operationally behaving like an inner channel (cross-channel prediction matches 2,5,7). The mechanism is gcd(multiplier, channel modulus).
Z/9 Channel GCD Collapse (Theorem 110)
3 divides chain-smooth multipliers 42=2*3*7 and 105=3*5*7, collapsing Z/9 to subring {0,3,6}. Removing 3 (42/3=14, 105/3=35) preserves all other channel GCDs but restores Z/9 to full range. Experiment: Z/49->Z/9 drops 1000->316 ppt (3.2x). Controls flat: Z/8 +/-4, Z/49 +/-0. 14/14 verified.
Universal GCD Collapse (Theorem 111)
GCD collapse generalizes to ALL channels via two mechanisms: (a) absorption (2,3,7: p|42) -- non-unit mul contracts within subring; (b) entry (5: 5 does not divide 42) -- non-unit mul provides only route in. 5-blindness: 5 has largest drop (6.7x) because 42=2*3*7 excludes 5. Z/9 marginal=704 stable across all experiments. 15/15 verified.
Z/9 Channel Determinism (Theorem 112)
Z/49->Z/9=1000 ppt (PERFECT). gcd(42,105)=21=3*7. In Z/9: both multipliers=6, annihilating Z/9 subring. Channels become deterministic add-counters (period 3, 7). 7 distinct Z/49 values determine Z/9 uniquely. Chain cause: 5-2=3 forces 42=105 mod 3^2. 14/14 verified.
Z/9 boundary duality
Outer algebraically, Z/210-like operationally
3 participates in both chain Z/210 mechanics (as factor of lambda) and the 490 outer set. Its omnipresence makes corruption maximally detectable (784 ppt, 0 false alarms in ECC).
5-blindness in GCD
42 = 2*3*7 excludes 5
5 requires the entry mechanism (non-unit mul provides subring access). Removing 5 blocks entry: orbit 5->20 values (6.7x drop). 5 does not participate in the primary multiplier.
Primitive Root Distribution
7 in the multiplicative group of Z/pZ: how does 7 distribute its order across all primes?
Artin density
37.63% = C_A
Primes where 7 is primitive root. Match 0.6% to Artin constant. Observed/predicted = 1.006.
Index smoothness
97.85%
Of primes p < 100K have 11-smooth index. For large q | (p-1): prob(q reduces order) = 1/q -> negligible. The chain's primes dominate the index.
Index hierarchy
1=37.6%, 2=28.2%, 3=6.8%, 4=7.1%
Top 2 cover 66%. Top 4: 80%. The ring's values ARE the order architecture. Nothing else needed.
3-depletion
ratio 0.678 ~ 1-1/3 = 2/3
When 3|(p-1): Artin drops 30.4% vs 44.8%. 3-fold depletion at 3-divisible p-1.
Flanking order
ord(7, 211) = 210
PRIMITIVE ROOT at 211 = 210+1. ord(7, 970201): index = 2^3*3 = 24. Indices grow with ring level: 1 -> 6 -> 21 -> 12 -> 24. All chain-smooth.
Chebotarev
P(q | index) = 1/q exactly
For ALL five chain primes q: P(q divides index of 7) = 1/q. Five-for-five match against 2M primes. Chebotarev density theorem.
CYCLOTOMIC VALUES of 7: Phi_1(7)=6=2*3. Phi_2(7)=8=2^3. Phi_4(7)=50=2*5^2. Phi_6(7)=43=41+2 (PRIME! the Phi_6 theorem: 7^2-7+1=42+1). Phi_10(7)=2101=11*191. Phi_12(7)=2353=13*181. 3-IMMUNITY: 3 NEVER divides 7^k+1 (proof: 7=1 mod 3 => 7^k+1=2 mod 3). Shadow entry: 7^((p-1)/2) = -1 mod p. Shadow(5)=2, Shadow(11)=5, Shadow(13)=6.
Chain-Open Primes and Joint Cooperation
Primes where ALL 5 bases {2,3,5,7,11} are primitive roots simultaneously. How cooperative are they?
Density
1.54% of primes < 5M
2.0x enrichment over independent prediction. v_2 >= 3: ZERO (mod-8 trapping kills all). First: 173.
WHY POSITIVE: Stephens (1976) discriminant correction. The splitting field Q(sqrt(2,3,5,7,11)) has degree 32 = 2^5 = number of idempotents in Z/970,200. Z/12,612,600 has 2^6 = 64 idempotents. The algebraic structure that controls joint indices IS the CRT decomposition. v_2 joint confinement: mod-8 trapping kills ALL joint primitive roots at v_2(p-1) >= 3.
Mod-8 Subgroup Trapping
Why is 2 never a primitive root at the Z/12,612,600 level? The mechanism is quadratic reciprocity meeting exponent growth. As the ring grows from Z/2 to Z/8, the 2-adic valuation of (p-1) determines everything:
v_2(p-1)
Condition
PR rate for g=2
Mechanism
1
p = 3 mod 4
37.4%
Artin baseline. QR ambiguous.
2
p = 5 mod 8
75.2%
2 is NOT QR. Generous.
>=3
p = 1 mod 8
0.0%
2 is ALWAYS QR. Death sentence.
At the Z/12,612,600 level, 2^3=8 divides N, so p=970201 = 1 mod 8. The mod-8 channel forces v_2(p-1) >= 3. Result: g=2 is NEVER a primitive root here. The even prime connects every channel but cannot generate all residues.
Channel Obstruction Theorem
Each channel subgroup traps specific bases. 2^3 traps {5,7}. 3^2 traps {3,7}. 11 traps {2,11}. But 5^2 and 7^2 NEVER obstruct -- the mod-25 and mod-49 channels are transparent. The opaque channels are exactly 2^3, 3^2, 11 = the odd-exponent and prime channels.
Base g
Index at p=970201
Factored
Reading
g = 2
66
2*3*11
Trapped in 3 channels. Maximum confinement.
g = 3
6
2*3
Trapped in mod-8 and mod-9 only.
g = 5
8
2^3
Trapped in the mod-8 channel only.
g = 7
24
2^3*3
Trapped in mod-8 and mod-9.
g = 11
22
2*11
Trapped in mod-8 and mod-11 (self-trapping).
g = 13
1
1
PRIMITIVE ROOT. Generates the full group.
g=13 has index 1: coprime to ALL channel orders. CRT(1)=(1,1,1,1,1). 13 passes through every obstruction. The prime that ends the Cunningham chain is the one that generates everything.
CRT Trace: The Ring's Inner Voice
Tr(n) = sum of all CRT residues (mod 8, mod 9, mod 25, mod 49, mod 11). Range: 0 to 102. This is the ring talking to itself -- the dot product of any element with the ground state 1.
Element
Trace
Identity
0
0
Zero element
1
5
5-multiplication: Tr(n) = 5*n for uniform n < 8
2
2*5 = 10
Trace of 2 = ring degree
11
3^3 = 27
BREAKS 5-multiplication. 11 is non-uniform.
1,576,576
2^2 = 4
Projector trace = 4
105
5^2 = 25
105 = 3*5*7. Trace = 5^2.
67
43 = Heegner
Trace-dual to 137 (43+59 = 102)
N-1 (mirror)
97
Maximum trace. 97 = ring coupling constant.
Trace Duality
Tr(n) + Tr(N-n) = 102 for all units
The sum of an element's trace and its mirror's trace is ALWAYS 102 = sum(moduli) - 5. For zero divisors: subtract the moduli of dead channels. 92/92 tests.
11-Swap Theorem
11 mod 8 = 3, 11 mod 9 = 2
11 SWAPS the mod-8 and mod-9 channels: 11 mod 8 = 3 and 11 mod 9 = 2, while 11 mod 25 = 11, 11 mod 49 = 11 (preserves outer channels). 11 mod 11 = 0: invisible to itself.
11^2 Triangle
41 + 67 + 13 = 11^2 = 121
Three constants sum to 11-squared. OVERDETERMINED: 4 equations, 3 unknowns, ZERO free parameters. Centroid = 3^3 = 27, spread = 2*7 = 14. All three vertices algebraically forced. 33/33 tests.
Trace-Answer Bridge
Tr(28) = 42
(2+1)*2*7 = 3*2*7 = 42. The trace of 28 IS 42.
CRT Trace Staircase
Order the DEEP moduli by ascending size: D^3=8, K^2=9, L=11, E^2=25, b^2=49. Their cumulative sums trace a staircase through the axiom's named constants.
The first two fat moduli sum to the 7th prime. The ESCAPE prime is literally the sum of the first two channel sizes.
ANSWER from fat moduli
D^3 + K^2 + E^2 = 42
The three fat-squared moduli (skipping thin L=11) sum to the answer. Fat channels encode 42; thin L rides free.
ISO-TRACE
Tr(E) = Tr(HYDOR) = E^2 = 25
Elements 5 and 105 = 3*5*7 have identical CRT trace. The channel-sum fingerprint cannot distinguish the observer from its cooperative expression.
Cunningham Stopper
The multiplicative order of D=2 modulo each odd axiom prime governs how far Cunningham chains can extend. The orders split into NR (non-quadratic-residue) and QR classes -- and the split encodes ESCAPE.
Cunningham Stopper (Theorem 129)
ord_p(D) for 6 odd axiom primes: {D, D^2, K, D*E, D^2*K, D^3} = {2, 4, 3, 10, 12, 8}. Sum = K*GATE = 39. LCM = E! = 120. D is primitive root mod {K, E, L, GATE} (NR primes), half-period mod {b, ESC} (QR primes). NR order sum = D^2*b = 28 (2nd perfect number). QR order sum = L = 11. NR - QR = ESCAPE = 17.
NR-QR encodes ESCAPE
28 - 11 = 17
The difference between non-residue and quadratic-residue order sums IS the 7th prime. The QR/NR partition of D=2 across the chain contains ESCAPE.
Chain budget
K + E = D^3 = 8
CC1(sigma) has length K = 3, CC1(D) has length E = 5. Their sum equals D^3. Product = K*E = 15 = CC1(sigma) stopper.
LCM = E!
lcm(2,4,3,10,12,8) = 120 = 5!
The least common multiple of all six orders is exactly 5 factorial. The observer's factorial unifies all D-orders.
Lie Rank Ladder
Each CRT channel Z/m is a cycle graph = affine Dynkin diagram A~(m-1). The Lie rank of channel m is (m-1). The six Z/12,612,600 channels give six affine Lie algebras (17 adds rank 16 = 2^4 in Z/214,414,200):
A_{p-1} has Coxeter number h=p for all 7 primes {2,3,5,7,11,13,17}: the chain IS the Coxeter staircase. B_p dimension = p*c(p) (Cunningham product). 56 of 57 classical Lie invariants at chain ranks are smooth in the chain's primes; sole exception B_11 dim=11*23=253 where Cunningham first exits. D-series Coxeter sum = 96 = number of lambda-1680 rings in Z/214,414,200. 198/198 verified.
Family
At rank p
Named constant
A_{p-1} (SU)
h = p (all 7 primes)
The chain IS the Coxeter staircase
A_6 roots
42 = 7*(7-1)
2*3*7
B_7 dim
105 = 7*(2*7+1)
3*5*7
B_p dim
p*c(p) = Cunningham
B_2=2*5, B_3=3*7, B_5=5*11
D_7 roots
84 = divisor count of Z/12,612,600
2*7*(7-1) = 2^2*3*7
D_7 Coxeter
12 = lambda(Z/210)
2*(7-1) = 2^2*3
B_11 singularity
dim = 11*23 = 253
Sole non-smooth invariant. c(11)=23 first Cunningham exit. Same 23 governs Johnson solids (2^2*23=92) and Golay [23,12,7].
D-series sum
2^5*3 = 96
D-series Coxeter sum at chain ranks = 96 = number of period-1680 sub-rings in Z/214,414,200.
PSL Simple Group Orders
PSL Simple Group Order (Theorem 187)
|PSL(2,p)| for all 7 chain primes decompose as chain-prime products. Z/210 normalized by 2*3: {1, 2, 2*5, 2^2*7}, sum = 41 = 7^2-7-1. sum_EXT - 17*sum_210 = 2*3^2 = 18. Half-successor maps 13->7, 17->3^2. 18/18 verified.
105 - 42 = 3^2*7 = 63 = 2^6-1 makes Z/9 the UNIQUE channel where 105 and 42 are indistinguishable (both residue 6 mod 3^2=9). In mixed additive sequences, Z/9 channel prediction is deterministic (1000 ppt) while all others are ~500 ppt. The mod-9 channel is the unique algebraic bridge between 105 and 42. 13/13 verified.
Shared factor
3*7 = 21 = DNA codon ring
105=3*5*7 and 42=2*3*7 share 3*7=21. Difference 3*7*(5-2) = 3^2*7 vanishes mod 3^2.
3^2*7 = 2^6-1
63 = septimal comma denominator
The 2-channel's 2^6 misses 105-42 invariance by exactly 1.
Z/9 gap: 482 ppt
Z/9 at 1000 vs others at ~500
Z/9 channel bigram is deterministic. All other channels see mixture noise. The mod-9 channel makes 105 and 42 indistinguishable.
Product of indices: 2^3*7 = 56 = dim(E7 fundamental). 7 is a PRIMITIVE ROOT at 43 = Phi_6(7) = 7^2-7+1 = 42+1. The 6th cyclotomic at 7 equals 42+1. Cyclotomic self-index: ONLY 7 has index(7, Phi_6(7)) = 7. The prime recognizes its own cyclotomic value.
The Prime Index Map
pi(n) = number of primes <= n. For the ring's constants that are prime, pi speaks the ring's vocabulary back.
Constant
pi value
Identity
2
1
3
2
5
3
7
4 = 2^2
11
5
13
6 = 2*3
41
13
41 is the 13th prime
67
19 = 5^2-5-1
97
25 = 5^2
Lie rank sum = 25th prime
137
33 = 3*11
Fine structure = 33rd prime
97 Square Chain
97 -> 25 -> 9 -> 4 -> 2 -> 1
97 descends through SQUARES of chain primes: 5^2 -> 3^2 -> 2^2 -> 2 -> 1. Unique: only 5^2->3^2->2^2 forms the chain. 97 is the unique prime entering from above.
137 Reverse Chain
137 -> 33 -> 11 -> 5 -> 3 -> 2 -> 1
137 descends as 3*11 -> 11 -> 5 -> 3 -> 2 -> 1 = REVERSE chain from 11. The fine-structure constant walks the chain backwards.
Depth Sum
Chain prime depths: 2(1), 3(2), 5(3), 7(3), 11(4). Sum = 13
13 IS the total pi-descent depth of the five primes.
Contraction
pi(41) = 13. pi(13) = 2*3
41 is the 13th prime. Pi maps the 11^2 triangle to itself. 41 -> 13 -> 2*3 under iterated pi.
67: The Additive Hub
67 is where the most structural identities converge. 41 is the multiplicative hub (41^2 = 1 mod 210). 67 is the additive hub -- the node where 8 independent decompositions all meet:
Decomposition
Value
Reading
11^2 - 41 - 13
121-41-13
11^2 triangle remainder
2^3*7 + 11
56+11
dim(E7 fund.) + 11
7^2 + 18
49+18
7^2 + inner channel sum
5^2 + 42
25+42
5^2 + lcm(2,3,7)
3^3 + 2^3*5
27+40
3^3 + ring degree
2*41 - 3*5
82-15
Twice the self-inverse - 3*5
5*13 + 2
65+2
5*13 + 2
2*13 + 41
26+41
2*13 + self-inverse
41+67 Lattice
41 + 67 = 108 = 2^2*3^3
= lattice size. 41 + 13 = 2*3^3 = 54. 13 + 67 = 2^4*5 = 80. The three constants partition the lattice.
42-41
42 - 41 = 1
2*3*7 - (7^2-7-1) = 1. 42 exceeds 41 by exactly the ground state.
At Z/12,612,600 + 1: g=2 index = 2*3*11 = 66 (maximum confinement). g=13: index = 1 (primitive root). See full mod-8 trapping section above.
Factorial Valuation Matrix
The 7x7 matrix M[p][q] = v_p(q!) of p-adic valuations of factorial among chain primes is upper triangular with unit diagonal. Each row tells how deeply a prime divides the factorials of the larger primes.
Factorial Valuation Matrix (PROVED)
Trace = 7 (all diagonal = 1). Det = 1 (unipotent). Max entry = 3*5 = 15 at M[2][17]. Row sums read the chain reversed: 42, 19, 9, 5, 3, 2, 1. Column sums = Omega(p!): 1, 2, 5, 2^3, 2^4, 2^2*5, 29. Total = 3^4 = 81 = (3^2)^2. Binary digit sums of the 7 chain primes = 2^4 = phi(17). Tail sums produce ring values: 41 at 11, phi(210) = 48 at 7. Z/210 row total = 3*5^2 = 75, extension row total = 2*3 = 6. All 28 non-zero entries chain-smooth. 139/139 verified.
Chain reversal
Rows: 42, 19, 9, 5, 3, 2, 1
Row sums trace the chain reversed through the stop back to 1. 42 at the 2 row, 1 at the 17 row. The largest prime generates the smallest valuation row.
Total = 3^4
81 = 3^4
3^4 = (3^2)^2 -- the chain stop 9, squared again. Factorial valuations always factor through powers of 3.
Staircase diffs
23, 10, 4, 2, 1, 1
First row difference = c(11) = 23 (Cunningham boundary). Second = 2*5 = 10. The factorial staircase encodes the chain's boundary constants.
Factorial Inverse
The inverse of the factorial valuation matrix has a striking property: ALL 49 entries lie in {-2, -1, 0, 1}. The nilpotent part N = M - I has nilpotent degree exactly 7.
Factorial Inverse (PROVED)
M^{-1} = I - N + N^2 - ... + N^6 where N is nilpotent of degree 7. Only 2's entries reach -2, at positions (2,5) and (2,17) -- 2 connects to 5 and 17 with double-strength coupling. Subdiagonal = all -1 (chain adjacency). Grand total = -2^3 = -8 (mod-8 channel top, absorbed). Both sum|row_sums| and sum|col_sums| = 2*5 = 10. Nilpotent power corners (2->17 k-step flow): 3*5(15), 41, 2*5^2(50), 30, 3^2(9), 1. 3->17 = +1: positive net flow from 3 to 17. 90/90 verified.
Nilpotent degree = 7
N^7 = 0, N^6 != 0
The nilpotent part dies at exactly 7 steps -- one for each chain prime.
Only 2 reaches -2
(2,5) and (2,17)
2 alone generates the extremal entries. 2 connects to 5 and 17 with double-strength inverse coupling.
Sum = 10
|row| = |col| = 10
The absolute row-sum and column-sum both equal 2*5 = 10 = the ring degree.
Bridge Partition: 8 and 13
Take all 21 = C(7,2) pairs of axiom primes. For each pair (p, q), compute the product of their totients: (p-1)(q-1). How many of these 21 products are divisible by 8? The answer partitions into {D^3, GATE} = {8, 13}.
D^3 Bridge Partition (PROVED)
Of the 21 pairwise totient products (p_i - 1)(p_j - 1), exactly 13 are divisible by 8 (D-void) and 8 are not (non-D-void). The partition 8:13 = D^3:GATE. Core identity: (K-1)(E-1) = 2*4 = 8 = D^3. CRT fingerprint of 8: void in the D-channel (8 mod 8 = 0) and mirror in the K-channel (8 mod 9 = 8 = K^2 - 1). Cumulative totient product phi(2)*phi(3)*phi(5) = 1*2*4 = 8 = D^3. Unique doubly-void pair: (b-1)(GATE-1) = 6*12 = 72 = D^3*K^2. Only one pair is simultaneously D-void AND K-void.
Core identity
(K-1)(E-1) = 8
The closure and observer totients multiply to exactly the bridge cube. This is the seed of the partition.
8:13 = D^3:GATE
non-D-void : D-void
The partition produces two axiom constants. 21 = K*b pairs split into the bridge cube and the boundary prime. C(7,2) = K*b = 21 is itself axiom-native.
Doubly-void pair
(b-1)*(GATE-1) = 72
Only one pair vanishes in both D and K channels. 72 = D^3*K^2 = 8*9. The depth and boundary primes produce the unique CRT-doubly-void product.
CRT fingerprint
8: D-void, K-mirror
8 mod 8 = 0 (void in its own channel) and 8 mod 9 = 8 = K^2 - 1 (mirror in K-channel). Bridge partition = D-channel void + K-channel symmetry.
Theorem Pointers
Proved theorems on the Proof Assistant page that directly concern ring algebra:
M^{-1} in {-2,-1,0,1}. Grand total=-2^3. Nilpotent degree 7.
Lucas CRT Independence
Lucas' theorem: C(n,k) mod p = product of C(n_i, k_i) mod p, where n_i, k_i are base-p digits. Each axiom prime decomposes binomial coefficients via a DIFFERENT number base -- D=binary, K=ternary, E=base-5, b=base-7, L=base-11, GATE=base-13, ESCAPE=base-17. This creates genuinely independent views, not redundant residues of the same hash.
Lucas CRT Independence Theorem (PROVED, 78/78)
Row p of Pascal's triangle is all-zero in the p-channel but has nonzero entries in every other channel. Each prime has a unique blindness row. Pairwise zero/nonzero disagree rate: 230-493 permil (binomial) vs 335 permil (hash on same data). 490 split in zeros: DEAD avg 374 > ALIVE avg 245 permil. Row 8: D-channel (binary) sees 7/7 zeros, K-channel (ternary) sees 0/7. Different number bases = genuinely different structural views.
Row-p blindness
C(7,k) mod 7 = 0 for k=1..6
The b-channel goes completely dark on its own row. But every other channel sees nonzero entries -- structural independence.
Binary vs ternary
Row 8: D sees 7 zeros, K sees 0
Same row, completely different fractal. Binary Sierpinski is dense; ternary is rich. Two views of one object.
Kummer carries
v_p(C(n,k)) = carries in base-p add
The p-adic valuation of a binomial IS the carry count. Each prime counts carries in its own base -- genuinely different arithmetic.
64x64 grid encoding
Disagree 310-517 permil (235x V25 hash)
C(r+c, r) mod p as position weight on full 64x64 grid. Zero density: D=822, K=727, E=575, b=579, L=428, GATE=447, ESCAPE=421 permil. Each channel's Sierpinski fractal is its own spatial filter. 56/56 verification tests.
CRT Sandpile Dissipation
Model each CRT channel as a sandpile site with threshold equal to its modulus. Drive: add 1 grain to a rotating channel. When a channel overflows, it topples -- resets and sends 1 grain to each other channel. The net grain change per topple is (number_of_channels - 1) - modulus.
Dissipation Theorem (PROVED)
In a CRT sandpile on Z/N with k channels, channel i has net (k-1) - q_i per topple. Supercritical if q_i < k-1 (amplifies), subcritical if q_i > k-1 (absorbs). Z/214,414,200 (k=7): ALL subcritical (min q=8 > 6). Z/2,310 (k=4): Z/2 SUPERCRITICAL (q=2 < 3). Raising the 2-exponent from 1 to 3 (Pareto growth: 2->2^3) flips the 2-channel from +1 to -2, stabilizing the entire system.
{3, 5, 19, 41, 9}. Sum = 7*11. Totient-exponent gap = 5.
Multiplicative order
Random-looking
Decomposes via CRT. 73,728 primitives. Products speak the ring's vocabulary.
CRT trace
Sum of residues, no pattern
5-multiplication for uniform elements. Trace duality: Tr(n)+Tr(N-n)=102. 11 swaps the mod-8 and mod-9 channels. Traces of ring constants ARE ring constants.
67 = additive hub. 8 independent decompositions. 41+67=108=lattice size. Connects all ring constants.
CRT decomposition
Technical tool for computing mod products
Laplacian direct sum across 6 orthogonal Fourier subspaces on Z/12,612,600 (7 on Z/214,414,200). Blocks coupled NS blowup -- Theorem 34 structural global-existence analog (not Clay).
Idempotent classification
Just 2^k projectors
3 classes (extreme/primitive/composite). Smooth composite counts for k=2..7; 41 exits at k=8.
Involution structure
x^2=1, count 2
Z/2^n plateau at n=3 (V4). Same wall as Hurwitz 2^3=8 and Bott period 8. Z/214,414,200: 256 = 4*2^6.