The digit progressions

Claims · 13 dated claims on The digit progressions, each with its tag and its witness; newest 2026-10-05.

13 claims
  • Proved For a digit progression P = {u, u + r, .., u + (L-1) r} at base base, abs(hat P_i(t)) = abs(hat I_(L,i)(r t)) with I_L = {0..L-1}, and with r = r_1 r_0, r_1 dividing a power of base and gcd(r_0, base) = 1, every shifted grid sum of P at level i is at most gcd(r, base^i) <= r_1 times that of I_L at the dilated shift, with equality at r_1 = 1, so a certificate (C, alpha_1) of I_L is a certificate (r_1 C, alpha_1) of every progression of length L and step r, whatever its start, its exponent a function of (L, base) alone. Witness: mobius.md, The digit progressions.
  • Proved At a denominator d whose part prime to base is d_0, a progression of step r keeps the decay of Lemma A' whenever d_0 does not divide r_0, in the window abs(r eta) < y^(-2/3)/(4 base (base - 1)); at d = g > 1 dividing r_0 its transform has the full mass L^k at l/g at every level, and the class d = g e, g > 1 dividing r_0 and e dividing a power of base, is paid by (M) at the moduli dividing a power of base r_0 up to exp(sqrt(log x)/2), whose exceptional zeros lie on real characters of conductor dividing 8 rad(base r_0). Witness: mobius.md, The digit progressions.
  • Proved If I_L carries a shifted-grid certificate below 1/5, every progression P of length L at that base has abs(M_P(x)) <= C A_P(x) exp(-c sqrt(log x)) at every x >= 2 with C, c computable from base and P, and when its step divides a power of base the prime count holds with kappa_P = (base/phi(base)) #{f in P : gcd(f, base) = 1}/L. Witness: mobius.md, The digit progressions.
  • Proved Every interval of length 2 <= L <= base - 1 has sum_(r < base) abs(D_L((t + r)/base)) <= 2L + (2 base/pi) H_(floor(base/2)) + (1 - 2/pi)(base^2 + 1)/(2 base) at every t, a shifted-grid certificate with C = 1. Witness: mobius.md, The digit progressions.
  • Proved The Mobius bound holds on every digit interval and every digit progression of length at least c base at every base from B(c), the least base from which 2 + K(base)/c < base^(1/5) with K(base) = (2/pi)(log(base/2) + gamma + 1/base) + (1 - 2/pi)(base^2 + 1)/(2 base^2), with B(9/10) = 121872, B(3/4) = 377657, B(1/2) = 4980971, B(1/3) = 66917470, B(1/4) = 417306678, B(1/5) = 1705120674 and B(1/10) = 125105365918, and the prime count with kappa_P holds there on every interval. Witness: mobius.md, The digit progressions; lab/py/digit-progressions, verb wall.
  • Proved At every odd base >= 3 the interval {0..(base-3)/2} has T phi <= (lambda - 1) phi for phi(t) = 1 + abs(sin(pi t))/2 and lambda the half interval's closed form, and its alpha_1 is below 1/5 at every odd base >= 94953, failing at 94951, and below 1/4 from 3799. Witness: mobius.md, The digit progressions; lab/py/digit-progressions, verb wall.
  • Proved At every odd base >= 94953 the odd digits O = {1, 3, .., base-2} have abs(M_O(x)) <= C A_O(x) exp(-c sqrt(log x)) at every x >= 2, and the same bound holds on every interval of length (base-1)/2, with the prime count there, and on {0, 2, .., base-3} and {2, 4, .., base-1}. Witness: mobius.md, The digit progressions.
  • Proved At every even base >= 4 the half interval H = {0..base/2 - 1} has T phi <= lambda_H phi with lambda_H = 3 base/4 + (base/pi)(log(base + 4) + gamma) + 2(1 - 2/pi)(base + 2)^2/(8 base), and its alpha_1 is below 1/5 at every even base >= 61270, failing at 61268, and below 1/4 from 2414. Witness: mobius.md, The digit progressions; lab/py/digit-progressions, verb wall.
  • Proved At every even base >= 61270 the Mobius bound holds on H, on every interval of length base/2 and on the even and odd digits {0, 2, .., base-2} and {1, 3, .., base-1}, and the prime count holds with kappa = 1 on H and kappa = 2 on the odd digits. Witness: mobius.md, The digit progressions.
  • Conjecture On a progression whose step has a part r_0 > 1 prime to base, the sum of Lambda(n) over S_P up to x equals the sum over its members of kappa_P prod_(p dividing r_0) (p/(p-1)) 1_(p does not divide u R_len), R_len = (base^len - 1)/(base - 1) at the member's length len, within O(A_P(x) exp(-c sqrt(log x))); on the odd digits at odd base that is 2 base/(base - 1) on the members of odd length and 0 on the rest. Witness: lab/py/digit-progressions, verb meter.
  • Verified The uniform interval bound holds against the one-step reading at every length 2..base-1 of every base 3..80, 99..106 and 1000..1003, at most 0.756412 of it at base 1003, L = 1002, and 3436 progression cells at bases 3..13 read from their own digits meet the grid-sum identity through gcd(r, base^i) to 1.892 * 10^-12. Witness: lab/py/digit-progressions, verb census.
  • Verified At ten pairs of base and step with r_0 from 2 to 6, the transform at l/d over 200 levels is at most 7.273 * 10^-6 of full at every d <= 60 off the lost class, and full at every d > 1 dividing r_0 by construction. Witness: lab/py/digit-progressions, verb lost.
  • Verified The two sharp certificates hold on grids of shifts, the odd digits' at every odd base 3..401 and at six larger bases up to 100001 with T phi at most 0.999866 of (lambda - 1) phi, and the even base's at every even base 4..400 and at six larger bases up to 100000 with T phi at most 0.997022 of lambda_H phi. Witness: lab/py/digit-progressions, verb check.