Claims · 20 dated claims on The digit-sum twist, each with its tag and its witness; newest 2026-10-05.
Proved The two-position lemma: if F keeps two consecutive digits and beta = norm((b - 1) alpha), then abs(g_F(u + alpha) g_F(b u + alpha)) <= fill G_F(beta/(b + 1)) at every u, G_F bounded by explicit pair, kernel and variance forms, so sup_t abs(hat w_k(t)) <= fill^k (1 - c)^(floor(k/2)) with c = c(b, F, beta) > 0 whenever beta > 0, c about (2/3) beta^2 at small beta and large base, from the variance form; on the lattice beta = 0 the supremum is fill^k, attained at t = -alpha. Witness: gelfond.md The two-position lemma
Proved The twisted peel: for every alpha, shift s and depth i, sum_(a < b^i) abs(hat w_i(s + a/b^i)) <= B_b(F)^i, so the per-digit certificate (W) and the hybrid l^1 bound of the unconditional dissection hold for the digit-sum-twisted transform with the same constants; the digit-uniform chain does not transfer as written, its telescoping needing beta = 0. Witness: gelfond.md The twisted peel
Proved For F with two consecutive digits and (W), alpha_1 < 1/5, and beta = norm((b - 1) alpha) > 0: abs(sum_(n in S_F, n <= x) mu(n) e(alpha s_b(n))) <= C A_F(x) x^(-delta), and the same for Lambda, for every delta < alpha_b min(1/5 - alpha_1, sigma)/4 with sigma = gamma (1 - 4 alpha_1)/(5 - 4 alpha_1), C effective and uniform in beta >= beta_0; the major arcs need no L-function; at one excluded digit it holds from base 92317. Witness: gelfond.md The power saving
Proved Under the same hypotheses with (W) in its per-digit form PB_b(m) < fill b^(-4/5), for q >= 2 coprime to b - 1, the primes of S_F equidistribute in the classes of s_b(p) mod q: sum_(n in S_F, n <= x, s_b(n) = c mod q) Lambda(n) = psi_F(x)/q + O(A_F(x) x^(-delta)) for every delta below delta_0 at beta = 1/q, and the prime count is (1 + o(1)) pi_F(x)/q; at one excluded digit from base 92317. Witness: gelfond.md Primes of a design by digit sum
Proved With two consecutive digits the twisted transform keeps full mass at some frequency at every depth exactly when (b - 1) alpha is an integer, where the twist is the character e(alpha n) of n mod b - 1 and the twisted meter is a combination of untwisted meters in progressions mod b - 1; at alpha = 0 the zero-free-region input of the untwisted dissection is used only near the preimages l/b^j of frequency 0, while its region C1 also caps at root-log through Lemma A' with no L-function. Witness: gelfond.md The lattice and the ceiling
Verified At base 10 missing 7, sup_t abs(hat w_k(t))/fill^k for k = 1..8 stays below the proved (1 - c)^(floor(k/2)) at all eleven off-lattice classes sampled, attained 0.071152 against proved 0.521973 at k = 8, alpha = 1/2, upper eighth root 0.718676 against 0.921947, and equals 1 at t = -alpha at the five lattice classes 0, 1/9, 1/3, 2/3, 4/9; base 37 missing 18 agrees to k = 4. Witness: lab/py/digit-sum-twist, verb sup
Verified The twisted peel at base 10 missing 7: B_10(F) <= 24.702781 against the floor 18, and 960 checks of Sigma_i(s) <= B^i over sixteen classes of alpha, twelve shifts and depths 1..5, largest ratio 0.999914, the one-step identity to 1.40 * 10^-11. Witness: lab/py/digit-sum-twist, verb peel
Verified Below 10^7 on base 10 missing 7 and missing 0 the twisted Mobius meter stays at most 0.0005 A_F(10^7) at all sixteen classes, and psi_F(10^7; alpha)/psi_F(10^7) sits within 0.0013 of the Ramanujan value on the lattice, -0.5000 at 1/3, and within 0.0076 of the average of e(alpha s_b(n)) over the design's elements coprime to 90 off it. Witness: lab/py/digit-sum-twist, verb meter
Verified The 266823 primes of base 10 missing 7 below 10^7 deviate from 1/q in their digit-sum classes by at most 0.0088 at q = 2, 4, 5 and by 0.05348, 0.10263, 0.24272 at q = 7, 8, 10, against 0.04846, 0.09911, 0.23939 for the design's elements coprime to 90, the primes within 0.02213 of that model at every q coprime to 9; missing 0 reads the same. Witness: lab/py/digit-sum-twist, verb gelfond
Verified The exponent: delta_0 >= 4.678 * 10^-9 at base 92317, beta = 1/2, region A binding through 1/5 - alpha_1 >= 1.871 * 10^-8; 3.47 * 10^-10 at beta = 10^-3, region C binding; 6.741 * 10^-8 on the chord wall at 39363; 2.819 * 10^-4 at base 10^6, where sigma binds, the switch from region A falling at 100084 at beta = 1/2 and 93409 at beta = 0.2 by bisection; and c >= 0.1500 at alpha = 1/2 at base 10 missing 7. Witness: lab/py/digit-sum-twist, verb lemma
Verified The shape is in print for the full digit set: the survey arXiv:1910.13402, read at source, proves a weak Mauduit-Rivat at large base with the full-digit two-position bound, its Lemma 8.4 (2) with delta = norm((b - 1) alpha)^2/(4 b^4), and the major arcs bounded by supremum times count, its Lemma 10.1; Mauduit-Rivat 2010 and Martin-Mauduit-Rivat 2014 have unrestricted digits; a stated search found no digit-sum theorem for primes or mu on a missing-digit set. Witness: gelfond.md Against the literature
Verified The consecutive pair is needed in the two-position lemma: at base 5, F = {0, 2} and alpha = 1/8, off the lattice with beta = 1/2, every phase (3 * 5^j + 1)/8 lies in Z/2, so abs(hat w_k(3/8)) = fill^k at every k, read as 1 to twelve digits at k = 4, 8, 12. Witness: lab/py/digit-sum-twist, verb lemma
Refuted At base 10 the twisted supremum decays at alpha = 1/3. Witness: 9/3 = 3 puts 1/3 on the lattice and abs(hat w_k(-1/3)) = fill^k at every k, read as 1 to twelve digits at k = 8; lab/py/digit-sum-twist, verb sup
Verified The step 3 wall of the certificate (W) at one excluded digit is interval-certified: in mpmath interval arithmetic at 200 bits, 1/5 - alpha_1 >= 1.87123612 * 10^-8 at base 92317 and <= -4.82092732 * 10^-8 at base 92316, so with the climbing gap of the large-base paper (W) holds at every base from 92317 on a rounding-safe evaluation, and the digit-sum power saving is Proved there. Witness: lab/py/digit-sum-twist, verb lemma
Proved For F with two consecutive digits and a shifted-grid certificate below 1/5, and every N coprime to b: sum_(n in S_F, n <= x, n = r mod N) mu(n) << A_F(x) exp(-c sqrt(log x)) at every r, and the same sum of Lambda(n) is kappa_F A_F(x)/phi(N) up to that error at every r prime to N, the local constant splitting evenly; the dissection runs with the transform translated by a/N, regions A and B unchanged, the major arcs moved to l/(N_a b^j); at one missing digit from base 584. Witness: gelfond.md Progressions and every modulus
Proved The input (M_N): for R = N b, at every u <= x, every r and every d dividing a power of R with d <= exp(sqrt(log x)/2), M(u; d, r) << x exp(-c sqrt(log x)) and psi(u; d, r) = 1_(gcd(r,d)=1) u/phi(d) + O(x exp(-c sqrt(log x))), effective in R, the exceptional zeros confined to the real primitive characters of conductor dividing 8 rad(R), from Chang-Martin Lemma 2.1, Proposition 2.3 and Lemma 2.4 read at source, Siegel never used; the Mobius half is (M) of mobius.md with rad(base) read as rad(N b), the von Mangoldt half (M_Lambda) of coprime.md under the same swap. Witness: gelfond.md Progressions and every modulus
Proved Under (W) per-digit, at one missing digit from base 92317: for every q >= 2, g = gcd(q, b - 1) and N coprime to b, the primes of S_F with p = r_1 mod N and s_b(p) = r_2 mod q carry (g/q) kappa_F A_F(x)/phi(lcm(N, g)) of Lambda when the two classes agree mod gcd(N, g) and define a unit, and only the error term otherwise, error exp(-c sqrt(log x)), the implied constant and c effective and depending on b, F, N and q; at N = 1 the digit sum of primes is uniform on the classes prime to g. Witness: gelfond.md Progressions and every modulus
Verified At base 10 below 10^8, 2079504 primes missing 7 and 3103338 missing 0: p mod 9, s_10(p) mod 3 and (p mod 7, s_10(p) mod 3) sit within 0.83 square-root units of the law; the even share of s_10(p) reads 0.48942, 0.49588 and 0.49464 at 10^6, 10^7 and 10^8 missing 7, not monotone in x, drifting 10.92 units from 1/2 at 10^8, while every class sits within 2.37 units of the design's strings prime to 30030. Witness: lab/py/digit-sum-twist, verb lattice
Verified The slow parity of s_10(p) is the prime 11 = b + 1 alone: the even share of the design's 8-digit strings is 0.50000 prime to 30, 0.49583 prime to 330 and 2310, 0.49996 prime to 390 missing 7; the bias from 11 oscillates with the parity of the digit count and at even counts falls by 0.54, 0.50, 0.49 per two digits against abs(g_F(1/22))^2/fill^2 = 0.480, the frequency 5/11 putting every phase at norm = 1/22 = x_0, the extremal point of the two-position lemma. Witness: lab/py/digit-sum-twist, verb lattice
Verified arXiv:2108.09212, read at source in its abstract and Theorems 1-3, carries the prime count of a one-missing-digit set in progressions mod d coprime to b, the main term (1/phi(d)) (b/phi(b)) per last digit, summed over d <= X^(1/3 - delta), log-power error, X = b^k, b large and unspecified; its constant depends on b and delta and is ineffective, through Bombieri-Vinogradov in its proof; it names no Mobius sum and no digit sum. Witness: gelfond.md Progressions and every modulus