In Z/12,612,600, zero is not absence -- zero is the universal annihilator. Among 64 idempotent projections (2^6, one per on/off configuration of 6 CRT channels), zero is the unique element killed by every single one. No other element falls through every sieve. Zero falls through all 64.
Universal Sacrifice Theorem
The ring Z/12612600Z has exactly 64 idempotent elements -- projectors that satisfy e*e = e. Each idempotent e defines a kernel: ker(e) = {n : e*n = 0}. Question: what lies in the intersection of ALL 64 kernels?
Universal Sacrifice (PROVED)
0 is the UNIQUE element in the intersection of all ker(e) across all 64 idempotents. Proof: 0*e = 0 for all e (ring axiom). For any x != 0, there exists some idempotent e such that x*e != 0 (the 64 idempotents span the full CRT decomposition, so every nonzero element survives at least one projection). Verified: intersection = {0} and ONLY {0}. 1/12612600 = unique.
This is not metaphor. The ring has 12,612,600 elements. 64 sieves. Exactly one element is caught by every sieve. The sacrifice is arithmetic.
The Wound Landscape
1,576,576 = 2^420 mod 12,612,600. CRT = (0, 1, 1, 1, 1, 1). The mod-8 channel is dead. All 5 others are 1. This is the terminal projector -- multiplying any element by it zeros out the mod-8 channel and preserves the rest.
Image Theorem (PROVED)
image(1,576,576) = {n : n mod 8 = 0}. The projector's image is exactly the mod-8 zero set. 1,576,575 = N/8 elements carry the mod-8 = 0 condition. That is 12.5% of the ring.
Annihilator Theorem (PROVED)
ann(1,576,576) = {x : x * 1,576,576 = 0} consists of exactly 8 elements. All 8 have every non-mod-8 channel equal to 0. CRT addresses: (0,0,0,0,0,0), (1,0,0,0,0,0), ..., (7,0,0,0,0,0). The projector annihilates exactly the elements that live only in the mod-8 channel.
Image size
1,576,575 = N/8
Elements the projector can reach. 12.5% of the ring.
Annihilators
8
Elements that kill the projector. The mod-8-only set.
Idempotent
x^2 = x
Applied once, forever. Multiplying by 1,576,576 twice gives the same result.
CRT
(0, 1, 1, 1, 1, 1)
Mod-8 dead. Mod-9, 25, 49, 11, 13 all alive.
The Broadcasting Theorem
The projector (0,1,1,1,1,1) acts as the identity in every non-mod-8 channel. Multiplying it by any prime p places p into each surviving channel. But channels have finite capacity (modulus 9, 25, 49, 11, 13).
Broadcasting Theorem (PROVED)
Primes below 9 broadcast purely: 1,576,576 * 2 = (0,2,2,2,2,2), *3 = (0,3,3,3,3,3), *5 = (0,5,5,5,5,5), *7 = (0,7,7,7,7,7). Each sends itself uniformly to all channels. Primes >= 9 overflow: *11 = (0,2,11,11,0,11), *13 = (0,4,13,13,2,0). The mod-11 and mod-13 channels die (p mod p = 0). The mod-9 channel distorts (too small to hold 11 or 13).
The distortion equals the receiving channel's modulus: 11 sends 2 to mod-9 (loss = 11 - 2 = 9). 13 sends 4 to mod-9 (loss = 13 - 4 = 9). 13 sends 2 to mod-11 (loss = 13 - 2 = 11). Channel capacity IS the cost of carrying an oversized message.
Projector * p
CRT = (mod8, mod9, mod25, mod49, mod11, mod13)
Pattern
p = 2
(0, 2, 2, 2, 2, 2)
Pure broadcast
p = 3
(0, 3, 3, 3, 3, 3)
Pure broadcast
p = 5
(0, 5, 5, 5, 5, 5)
Pure broadcast
p = 7
(0, 7, 7, 7, 7, 7)
Pure broadcast
p = 11
(0, 2, 11, 11, 0, 11)
Mod-9 distorts, mod-11 dies
p = 13
(0, 4, 13, 13, 2, 0)
Mod-9+11 distort, mod-13 dies
Primes below 9 broadcast purely. Primes at or above 9 lose themselves in their own channel. 9 is the distortion threshold.
Self-annihilation
exponent-1 primes
11 and 13 have exponent 1 in N. p mod p = 0: they die in their own channel. 3, 5, 7 survive (p < p^2).
Cross-visibility
11 visible in mod-13 (11), 13 visible in mod-11 (2)
Each exponent-1 prime leaves a trace in the other's channel.
Threshold
9 = 3^2
The smallest non-mod-8 modulus. Primes 11 and 13 exceed it. This is where faithful broadcasting breaks.
490-Broadcasting Duality
Two independent splits partition the 6 primes into 3+3. The 490 split classifies by zero-divisor structure: 490 = 2*5*49, so {2, 5, 7} are inner (490 divides their CRT projector) and {3, 11, 13} are boundary. Broadcasting classifies by which primes survive in their own channel through the projector. In Z/214,414,200 (7 channels), 490 splits 3+4: inner = {2, 5, 7}, boundary = {3, 11, 13, 17}.
490 inner {2,5,7}
490 boundary {3,11,13}
Broadcast survives
5, 7 (inner + survive)
3 (boundary + survive)
Broadcast dies
2 (inner + dies)
11, 13 (boundary + dies)
490-Broadcasting Duality (PROVED)
2 is the only prime that dies both ways: zeroed by the projector AND inner in the 490 split. 3 is the only prime that lives both ways: boundary in 490 AND broadcasts purely. {5, 7} are inner but survive broadcasting. {11, 13} are boundary but die in broadcasting. The two 3+3 splits are complementary.
2 (doubly dead)
inner + dies in broadcast
The only prime killed by both classifications.
3 (doubly alive)
boundary + survives broadcast
The only prime kept by both.
5, 7
inner + survive broadcast
Zeroed in the 490 projector but broadcast their values into all channels.
11, 13
boundary + die in broadcast
Alive in 490 but die in their own channel when broadcasting (exponent 1).
Zero-Divisor Depth
A zero-divisor is any element whose multiplication can reach 0 through a nonzero partner. The fraction of zero-divisors = 1 - phi(N)/N = 1 - product(1 - 1/p). For 5 primes: 16/77 units, 61/77 zero-divisors. Prime by prime:
Prime Added
Formula
Grief %
Meaning
p = 2
1 - 1/2
50.0%
Half the ring is even
+ p = 3
1 - 1/2 * 2/3
66.7%
Adds 16.7%
+ p = 5
1 - 1/2 * 2/3 * 4/5
73.3%
Adds 6.7%
+ p = 7
1 - 1/2 * 2/3 * 4/5 * 6/7
77.1%
Adds 3.8%
+ p = 11
1 - 16/77 * 10/11
79.2%
Adds 2.1%
+ p = 13
1 - 192/1001
80.8%
Adds 1.6%
The fraction depends only on which primes are present, not on their exponents. Every ring sharing {2,3,5,7,11,13} has exactly 80.82% zero-divisors (192/1001 units). The ratio 192/1001 = 2^6*3 / (7*11*13).
Nilpotent Count Theorem (PROVED)
Nilpotent count = N/rad(N) = 12,612,600 / 30,030 = 420. Exactly 420 nilpotent elements, each headed for full annihilation. rad(N) = 2*3*5*7*11*13 = 30,030 (the squarefree kernel). The Carmichael lambda divides every element's period.
The 42 Theorem
Doubling the projector: does projector + projector = 2? It depends on the ring.
42 Theorem (PROVED)
In a lambda-420 ring, the projector doubled equals 2 if and only if the 2-exponent is at most 1. Of the 84 lambda-420 rings dividing Z/12,612,600: exactly 42 satisfy this, exactly 42 do not. Perfect half-and-half. The 42 that satisfy decompose: 21 with no factor of 2 (projector = 1, so 1+1 = 2) + 21 with 2^1 (mod-2 channel, both zero). 42 = 2*3*7.
In rings with 2-exponent >= 2, the doubled projector overshoots. The mod-8 channel has (0+0) = 0, but the direct number 2 has mod-8 value 2. They disagree. 42/84 = 1/2 (exact half).
Sacrifice Factorization
The multiplication table of Z/NZ has zero entries wherever a*b = 0. The total count factors as: product over p^e || N of p^e * (p + e(p-1)) / p. For Z/12,612,600: 76,248,900 zero entries. Each channel's cost ratio involves the NEXT prime in the chain:
Channel
Ratio
Value
Reading
mod 8 (2^3)
(2+3)/2
5/2
Next prime ratio
mod 9 (3^2)
(3+4)/3
7/3
Next prime ratio
mod 25 (5^2)
(5+8)/5
13/5
Next prime ratio
mod 49 (7^2)
(7+12)/7
19/7
19 is the first non-chain prime
mod 11
(11+10)/11
21/11
21 = 3*7
mod 13
(13+12)/13
25/13
25 = 5^2
The chain passes the cost forward. Each prime pays with what follows it. The formula (p + e(p-1))/p forces the NEXT prime at each step. Self-referential pricing.
Explore: The Wound
Enter any element n. Multiplying by 1,576,576 zeros out the mod-8 channel and preserves the other five. The projection is idempotent: applying it twice gives the same result.