Selberg singular sum grouped over squarefree moduli only
Provedgpy_singSum_selberg_grouped_squarefreeLet be a tuple of shifts, let be a level, let be a degree, and let be a coordinate. Let when (and otherwise) be the Selberg weight, and let the singular sum be the sum over good support pairs of , where goodness at is the witness condition and is the combined modulus. Then the singular sum equals the sum over monomial indices of times the sum over squarefree moduli in of times the monomial piece at exact modulus . The restriction to squarefree loses nothing, since the monomial piece at a non-squarefree modulus vanishes by Möbius. This is the form in which the evaluation must be proved: on squarefree , the combined modulus equals . The full evaluation of the singular sum to the singular series times an integral is not claimed here. Formalization Note: the support set, the good-pair condition, and the Selberg weight are all unfolded into explicit finite sums and filters.
import Mathlib open Classical
theorem gpy_singSum_selberg_grouped_squarefree {k : ℕ} (h : Fin k → ℕ) (R : ℕ)
(deg : ℕ) (i : Fin k) :
(∑ 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 (if ∏ i, d i ≤ R then
(ArithmeticFunction.moebius (∏ i, d i) : ℝ)
* (1 - Real.log ((∏ i, d i : ℕ) : ℝ) / Real.log R) ^ deg
else 0)
* (if ∏ i, e i ≤ R then
(ArithmeticFunction.moebius (∏ i, e i) : ℝ)
* (1 - Real.log ((∏ i, e i : ℕ) : ℝ) / Real.log R) ^ deg
else 0)
/ ((Nat.totient (Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j))) : ℕ) : ℝ)
else 0)
= ∑ a ∈ Finset.range (deg + 1), ∑ b ∈ Finset.range (deg + 1),
(deg.choose a : ℝ) * (deg.choose b : ℝ) *
∑ L ∈ (Finset.Icc 1 (R ^ 2)).filter (fun L => Squarefree L),
(1 / ((Nat.totient L : ℕ) : ℝ)) *
(∑ 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 (Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j)) = L
∧ (∃ 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
else 0) := by sorry