Divisor-weighted error sum bounded by the sup weight times the unweighted sum
Provedgpy_divWeightedErrSum_le_of_sum_boundLet be a model for prime counts in arithmetic progressions, let be a height, let be a range bound, and let be a tuple dimension. Let the divisor-weighted error sum be , where counts ordered factorizations of into positive factors and is the max coprime-residue error at height and modulus . Suppose the weight is at most throughout the range, with , and the unweighted max-error sum is at most . Then\n\n
\n\nThis is precisely what the plain BV record buys, and no more: the factor is the whole obstruction, since it is super-polylogarithmic at primorial-type moduli and is not absorbed by re-choosing a logarithmic exponent. Formalization Note: the divisor count and the max coprime-residue error are unfolded into explicit finite sums, filters, and cardinalities.
import Mathlib open Classical
theorem gpy_divWeightedErrSum_le_of_sum_bound {k : ℕ} (M : ℕ → ℕ → ℝ)
(Y' Q : ℕ) {W B : ℝ} (hWnn : 0 ≤ W)
(hw : ∀ L ∈ Finset.range (Q + 1),
(((Fintype.piFinset (fun _ : Fin (k + 1) => Finset.Icc 1 L)).filter
(fun d => ∏ i, d i = L)).card : ℝ) ^ 2 ≤ W)
(hsum : ∑ L ∈ Finset.range (Q + 1),
(if hne : (((Finset.range L).filter (fun r => Nat.Coprime r L)).image
(fun r => abs ((((Finset.range (Y' + 1)).filter
(fun p => Nat.Prime p ∧ p ≡ r [MOD L])).card : ℝ) - M Y' L))).Nonempty
then (((Finset.range L).filter (fun r => Nat.Coprime r L)).image
(fun r => abs ((((Finset.range (Y' + 1)).filter
(fun p => Nat.Prime p ∧ p ≡ r [MOD L])).card : ℝ) - M Y' L))).max' hne
else 0) ≤ B) :
(∑ L ∈ Finset.range (Q + 1),
(((Fintype.piFinset (fun _ : Fin (k + 1) => Finset.Icc 1 L)).filter
(fun d => ∏ i, d i = L)).card : ℝ) ^ 2
* (if hne : (((Finset.range L).filter (fun r => Nat.Coprime r L)).image
(fun r => abs ((((Finset.range (Y' + 1)).filter
(fun p => Nat.Prime p ∧ p ≡ r [MOD L])).card : ℝ) - M Y' L))).Nonempty
then (((Finset.range L).filter (fun r => Nat.Coprime r L)).image
(fun r => abs ((((Finset.range (Y' + 1)).filter
(fun p => Nat.Prime p ∧ p ≡ r [MOD L])).card : ℝ) - M Y' L))).max' hne
else 0)) ≤ W * B := by sorry