Monomial pair sum bounded by the finite tau-squared sum over moduli
Provedgpy_monomialPairSum_abs_lenumber-theory
Let be a tuple of shifts, let be a level, let be monomial indices, and let be a coordinate. The monomial pair sum is the sum over good support pairs of , where is the combined modulus and goodness at is the witness condition described in the companion per-modulus bound. Then
using for and the per-modulus bound at each . The modulus range is finite because every support pair has combined modulus at most . This is the whole-sum form of the error-side control for the monomial evaluation. Formalization Note: the support set, the good-pair condition, and the divisor count are all unfolded into explicit finite sums, filters, and cardinalities.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_monomialPairSum_abs_le {k : ℕ} (h : Fin k → ℕ) (R : ℕ)
(a b : ℕ) (i : Fin k) (hR : 2 ≤ R) :
abs (∑ d ∈ (Fintype.piFinset (fun _ => Finset.Icc 1 R)).filter (fun d => ∏ i, d i ≤ R),
∑ e ∈ (Fintype.piFinset (fun _ => Finset.Icc 1 R)).filter (fun d => ∏ i, d i ≤ R),
if (∃ w, (∀ j, Nat.lcm (d j) (e j) ∣ w + h j) ∧
Nat.Coprime (w + h i) (Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j))))
then (ArithmeticFunction.moebius (∏ j, d j) : ℝ)
* (ArithmeticFunction.moebius (∏ j, e j) : ℝ)
* (-(Real.log ((∏ j, d j : ℕ) : ℝ) / Real.log R)) ^ a
* (-(Real.log ((∏ j, e j : ℕ) : ℝ) / Real.log R)) ^ b
/ ((Nat.totient (Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j))) : ℕ) : ℝ)
else 0)
≤ ∑ L ∈ Finset.Icc 1 (R ^ 2),
(((Fintype.piFinset (fun _ : Fin (k + 1) => Finset.Icc 1 L)).filter
(fun d => ∏ i, d i = L)).card : ℝ) ^ 2 := by sorrySource
GPY conditional monomial evaluation: the whole monomial sum is bounded by the finite tau-squared sum, from the modulus grouping and the per-modulus bound