levels-and-designs.md
4.2 kB · markdown
Levels and designs
- 2026-09-09 [Proved] The product law: for 1-periodic
f, gthe mean off(mx) g(nx)over the unit interval issum_j hat f(j n') hat g(-j m')withg = gcd(m,n),m' = m/g,n' = n/g, and the covariance is the same sum overj != 0; the parity specialisation returns1/15, 1/3, 1/3at(3,5), (3,9), (5,15)andgcd^2/(mn)at all 820 pairs to 40. Witness: lab/py/stack-levelscheck_parity. - 2026-09-09 [Proved] The base-3 carpet stack correlates 3-adically, not by gcd: the shadow at level
levelhashat f_level(k) = (-1)^k 2^level sin(pi k/3^level) prod_{i <= level} cos(2 pi k/3^i)/(pi k), zero exactly when3^level | k, soCov(f_level(mx), f_level(nx)) = G_level(m' mod 3^level, n' mod 3^level)/(m' n')withG_level(a, 3^level - b) = -G_level(a, b)andG_level(0, b) = 0; at level 1 the closed form is(2/9) chi(m') chi(n')/(m' n')withchithe character mod 3, exact at all 1600 ordered pairs to 40; the covariance vanishes whenever|v_3(m) - v_3(n)| >= level, and the 2D field carries the same zero set throughCov_2D = Cov_1D (M + (2/3)^(2 level)). Witness: lab/py/stack-levelscarpet_law_level1,carpet_kernel. - 2026-09-09 [Proved] Levels are products, not layers:
f_level(x) = prod_{i < level} f_1(3^i x), so a layer at levelleveland scalenis the product of level-1 layers atn, 3n, ..., 3^(level-1) n, withf_level(nx) <= f_{level-1}(3nx)pointwise and gap measure(2/3)^(level-1)/3; levellevel-1at scale3nis not redundant against levellevelat scalen,Cov(f_2(x), f_1(3x)) = 4/27againstCov(f_1(x), f_2(3x)) = 0. Witness: lab/py/stack-levelscheck_levels. - 2026-09-09 [Proved] Coprime independence is the half period's: the 1-periodic odd strip
p(x) = 1ifffloor(2x)odd carries covarianceg^2/(4mn), nonzero at 159 of the 490 coprime pairs to 40 and1/60at(3, 5), while the tree'schi_nat oddncarries(g^2 - 1)/(4mn), zero at every coprime pair;p(nx) = chi_{2n}(x), so this is the landed law read at even scales, a sharpening and not a break, and the prime detector is a statement about odd scales under the half-period sampling. Witness: lab/py/stack-levelscheck_parity. - 2026-09-09 [Proved] Design pairs at level 1: two base-3 one-digit-removed shadows correlate by
c/(27 m' n')withcin-6, -3, 3, 6, zero exactly when 3 dividesm' n', so no two base-3 designs are coprime-independent; a base-2 strip against a base-3 shadow correlates byc/(18 m' n')withcin-3, 0, 3, and the odd strip against the Sierpinski shadow is exactly zero at all 1600 scale pairs, because the centred middle-thirds indicator is even and the centred strip odd underx -> -x. Witness: lab/py/stack-levelsdesign_law_33,design_law_23. - 2026-09-09 [Proved] The parity layers are linearly independent: the Gram matrix
gcd(m,n)^2/(mn)over oddm, n <= 2K + 1has determinantprod_{k odd <= 2K+1} J_2(k)/k^2 = prod_{k odd} prod_{p | k} (1 - p^-2), fromk^2 = sum_{d | k} J_2(d)and a unitriangular incidence factorisation on the factor-closed odd set, exact atK = 1..12,11399736556781568/21994507608198125atK = 12, positive. Witness: lab/py/stack-levelscheck_gram. - 2026-09-09 [Conjecture] The carpet zero law is exact at every level,
Cov(f_level(mx), f_level(nx)) = 0iff3^level | m' n', and the cross-level lawCov(f_level(mx), f_{level'}(nx)) = 0iff3^level | n'or3^{level'} | m'likewise: Proved atlevel = 1from the closed form, Verified only overm, n <= 40andlevel <= 3, 14400 ordered triples with zero breaches and zero unpredicted zeros. Witness: lab/py/stack-levelscarpet_kernel,check_levels. - 2026-09-09 [Refuted] The gcd law and coprime independence hold outside the parity family: at base 3 level 1 coprime layers carry
(2/9) chi(m') chi(n')/(m' n'), witnessCov(f_1(x), f_1(2x)) = -1/9, a coprime pair, anticorrelated; the zero set isv_3(m) != v_3(n), not coprimality. Witness: lab/py/stack-levelscarpet_law_level1. - 2026-09-09 [Refuted] The carpet kernel is separable above level 1:
G_2(1,1) G_2(4,4) - G_2(1,4)^2 = 76/729, so notheta(a) theta(b)form exists atlevel >= 2and the level-1 character law does not lift. Witness: lab/py/stack-levelscheck_carpet.