Fiber-weighted error sums are bounded by divisor-weighted endpoint sums
Provedgpy_fiberWeight_sum_le_divWeightedErrSumLet be a tuple of shifts, let be a level, let be a degree, let be a coordinate, and let be a model for prime counts in arithmetic progressions. For a modulus , let the fiber weight at be the total over support pairs whose combined modulus is and which are good at , where is the Selberg weight and goodness at is the witness condition (some satisfies the joint divisibility system and is coprime to the combined modulus). Let the max coprime-residue error at height and modulus be the largest value of over residues coprime to (or if there are none), and let count ordered factorizations of into positive factors. Then\n\n
\n\nThis is the bridge from fiber weights to divisor weights: termwise, the Selberg fiber weight is at most by the Selberg fiber bound, and the errors are nonnegative. Formalization Note: the support set, the good-pair condition, the Selberg weight, the divisor count, and the max coprime-residue error are all unfolded into explicit finite sums, filters, and cardinalities.
import Mathlib open Classical
theorem gpy_fiberWeight_sum_le_divWeightedErrSum {k : ℕ} (h : Fin k → ℕ)
(R deg : ℕ) (hR : 2 ≤ R) (M : ℕ → ℕ → ℝ) (i : Fin k) (Y₁ Y₂ : ℕ) :
∑ L ∈ Finset.range (R ^ 2 + 1),
(∑ p ∈ (((Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 R)).filter
(fun d => ∏ i, d i ≤ R)) ×ˢ
((Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 R)).filter
(fun d => ∏ i, d i ≤ R))).filter
(fun p => (∃ w, (∀ j, Nat.lcm (p.1 j) (p.2 j) ∣ w + h j) ∧
Nat.Coprime (w + h i)
(Finset.lcm Finset.univ (fun j => Nat.lcm (p.1 j) (p.2 j)))) ∧
Finset.lcm Finset.univ (fun j => Nat.lcm (p.1 j) (p.2 j)) = L),
abs ((if ∏ i, p.1 i ≤ R then
(ArithmeticFunction.moebius (∏ i, p.1 i) : ℝ)
* (1 - Real.log ((∏ i, p.1 i : ℕ) : ℝ) / Real.log R) ^ deg
else 0)
* (if ∏ i, p.2 i ≤ R then
(ArithmeticFunction.moebius (∏ i, p.2 i) : ℝ)
* (1 - Real.log ((∏ i, p.2 i : ℕ) : ℝ) / Real.log R) ^ deg
else 0)))
* ((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)
+ (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))
≤ (∑ L ∈ Finset.range (R ^ 2 + 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))
+ (∑ L ∈ Finset.range (R ^ 2 + 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)) := by sorry