The singular sum as a rescaled good part of the first-moment coefficient
Provedgpy_singSum_eq_rescaled_goodPartnumber-theory
For a tuple , level , general coefficients , and a coordinate , the singular sum is exactly the good-restricted, -rescaled version of the first-moment coefficient's summands: each good pair contributes , and each non-good pair contributes . No approximation is involved; this is the exact sum-level comparison between the first-moment coefficient and the singular sum. Formalization Note: the singular sum, the support set, goodness, and compatibility are all written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_singSum_eq_rescaled_goodPart {k : ℕ} (h : Fin k → ℕ) (R : ℕ)
(lam : (Fin k → ℕ) → ℝ) (i : Fin k) :
(∑ d ∈ (Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 R)).filter
(fun d => ∏ i, d i ≤ R),
∑ e ∈ (Fintype.piFinset (fun _ : Fin k => 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 lam d * lam e /
((Nat.totient (Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j))) : ℕ) : ℝ)
else 0)) =
∑ d ∈ (Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 R)).filter
(fun d => ∏ i, d i ≤ R),
∑ e ∈ (Fintype.piFinset (fun _ : Fin k => 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
(((Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j)) : ℕ) : ℝ) /
((Nat.totient (Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j))) : ℕ) : ℝ)) *
(if (∀ i ∈ Finset.univ, ∀ j ∈ Finset.univ,
h i ≡ h j [MOD Nat.gcd (Nat.lcm (d i) (e i)) (Nat.lcm (d j) (e j))])
then lam d * lam e /
Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j))
else 0)
else 0) := by sorrySource
GPY first-moment comparison, formalized from Mathlib (compatible pairs, good pairs, and the singular sum)