Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Selberg singular sum grouped over squarefree moduli only

Proved
gpy_singSum_selberg_grouped_squarefree

by pitimespi · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Let hhh be a tuple of shifts, let RRR be a level, let deg⁡\degdeg be a degree, and let iii be a coordinate. Let λd=μ(∏d)(1−log⁡∏d/log⁡R)deg⁡\lambda_d = \mu(\prod d)(1 - \log \prod d / \log R)^{\deg}λd​=μ(∏d)(1−log∏d/logR)deg when ∏d≤R\prod d \leq R∏d≤R (and 000 otherwise) be the Selberg weight, and let the singular sum be the sum over good support pairs (d,e)(d, e)(d,e) of λdλe/φ(L(d,e))\lambda_d \lambda_e / \varphi(L(d, e))λd​λe​/φ(L(d,e)), where goodness at iii is the witness condition and L(d,e)L(d, e)L(d,e) is the combined modulus. Then the singular sum equals the sum over monomial indices a,b≤deg⁡a, b \leq \dega,b≤deg of (deg⁡a)(deg⁡b)\binom{\deg}{a}\binom{\deg}{b}(adeg​)(bdeg​) times the sum over squarefree moduli LLL in [1,R2][1, R^2][1,R2] of (1/φ(L))(1/\varphi(L))(1/φ(L)) times the monomial piece at exact modulus LLL. The restriction to squarefree LLL 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 LLL, the combined modulus equals lcm(∏d,∏e)\mathrm{lcm}(\prod d, \prod e)lcm(∏d,∏e). 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.

Preamble
import Mathlib
open Classical
Formal statement
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
Source
GPY conditional monomial evaluation: the Selberg singular sum in grouped form over squarefree moduli only, from the grouped form and the vanishing of non-squarefree pieces

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me