Geometry
---
Status: proved exact sufficient theorem and infinite nonmultiplicative shadow family
Date: 2026-08-15
Depends on: ES-SQUARE-TRAP-SIGNED-BOX-IDENTITY.md, ES-SQUARE-MULTIPLICATIVE-SHADOW-IFF.md, THEORY.md
Imported classical tool: Dirichlet's theorem on primes in reduced arithmetic progressions
Claim boundary: gives a broad sufficient mechanism for completed shadows when the later layer index is squarefree, including an infinite family not covered by multiplicative ancestry. It does not classify all nonmultiplicative ancestry edges or prove universal completed coverage.
1. Setup
Fix an ancestry edge
Let
denote the centered signed divisor box of an integer t, reduced modulo the ancestor modulus m_j.
The completed trap reduction is
Assume the later index is squarefree:
with distinct primes r_i.
Then
2. Factor-lift hypothesis
Suppose the earlier index admits a factorization
into positive integers, not necessarily coprime, such that after a permutation of the factors,
for every i.
Then
But the signed divisor box of A_i always contains its two extreme points and the center:
Therefore
Signed exponent intervals add under multiplication of integers, so
Hence:
Theorem — squarefree factor-lift shadow
If
and m_j|m_k, then
Thus the entire later completed layer is directly shadowed by j.
3. Prime-index theorem as the one-factor case
If k is prime, take
Ancestry gives
Therefore the factor-lift theorem gives
This recovers the direct-shadow half of ES-SQUARE-PRIME-INDEX-SPECTRUM.md.
So prime-index absorption is the rank-one case of a more general factor-lifting principle.
4. Quotient-nine ancestry
Now specialize to ancestry quotient
The standard ancestry formula is
Suppose j is even and write
Then
Put
If r is prime, then
is squarefree except for the impossible case r=2, which does not occur here.
Modulo
we have
and
The earlier index factorization is
Thus the two prime factors of k lift exactly to the two factors of j.
The factor-lift theorem applies and gives
5. Parameterization by primes r = 8 mod 9
The relation
is equivalent to
Conversely, let r be any prime in that residue class and define
Then
while
Therefore
So this is an exact quotient-nine ancestry edge.
And the factor congruences are precisely
Hence:
Theorem — quotient-nine semiprime shadow family
For every prime
the layer
is completely directly shadowed by
The moduli satisfy
Thus 2r is impossible as a square-completed minimal depth.
6. Infinite family
Because
Dirichlet's theorem gives infinitely many primes
Therefore the quotient-nine theorem supplies infinitely many squarefree semiprime structural gaps
This family is genuinely nonmultiplicative:
for all but trivial impossible coincidences.
So it lies outside the exact multiplicative-extension classification of ES-SQUARE-MULTIPLICATIVE-SHADOW-IFF.md.
7. Examples
r = 17
Then
and
r = 53
with
Thus
r = 71
and
Again the later completed layer is directly redundant.
8. Why factor lifting is different from stabilizer extension
The multiplicative-extension theorem treats
and explains shadowing through the stabilizer of the ancestor box.
The present theorem treats a different mechanism:
jneed not dividek;- the prime factors of the later index project to whole multiplicative factors of the earlier index;
- each three-point prime direction of the later box embeds into the larger signed box of its lifted ancestor factor.
Thus there are now two exact cross-layer mechanisms:
The quotient-nine family proves that nonmultiplicative completed ancestry has infinite exact structure rather than being only sporadic finite overlap.
9. Next target
The natural generalization is to ancestry quotient
with
Search for factorizations of k into few prime factors whose residues modulo m_j lift a factorization of j.
The first targets are:
- other fixed quotients
Q=13,17,21,...; - two-prime later indices
k=uv; - systematic CRT/Dirichlet constructions producing infinite factor-lift families.
A successful classification would turn the remaining nonmultiplicative ancestry graph into a finite collection of factor-lift templates rather than a raw residue-containment problem.