Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Per-modulus monomial piece bounded by the squared divisor count

Proved
gpy_monomialPairSumAtL_abs_le

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

number-theory

Let h=(h1,…,hk)h = (h_1, \dots, h_k)h=(h1​,…,hk​) be a tuple of shifts, let R≥2R \geq 2R≥2 be a level, let a,ba, ba,b be monomial indices, let iii be a coordinate, and let LLL be a modulus. Consider the tuples d,ed, ed,e of positive integers with each entry at most RRR and total product at most RRR. A pair (d,e)(d, e)(d,e) is good at iii when some witness www satisfies the joint divisibility system lcm(dj,ej)∣w+hj\mathrm{lcm}(d_j, e_j) \mid w + h_jlcm(dj​,ej​)∣w+hj​ for all jjj and w+hiw + h_iw+hi​ is coprime to the combined modulus L(d,e)=lcmjlcm(dj,ej)L(d, e) = \mathrm{lcm}_j \mathrm{lcm}(d_j, e_j)L(d,e)=lcmj​lcm(dj​,ej​). The monomial piece at exact modulus LLL is the sum over good pairs with L(d,e)=LL(d, e) = LL(d,e)=L of μ(∏d)μ(∏e)(−log⁡∏d/log⁡R)a(−log⁡∏e/log⁡R)b\mu(\prod d)\mu(\prod e) (-\log \prod d / \log R)^a (-\log \prod e / \log R)^bμ(∏d)μ(∏e)(−log∏d/logR)a(−log∏e/logR)b. Then

∣piece at L∣≤τk+1(L)2,\left| \text{piece at } L \right| \leq \tau_{k+1}(L)^2,∣piece at L∣≤τk+1​(L)2,

where τk+1(L)\tau_{k+1}(L)τk+1​(L) counts ordered factorizations of LLL into k+1k+1k+1 positive factors. This is the error-side control for the monomial evaluation: every surviving term has Möbius factor at most 111 in absolute value and log-ratio at most 111, and the number of surviving good pairs at modulus LLL is at most τk+1(L)2\tau_{k+1}(L)^2τk+1​(L)2 by the Selberg fiber bound. 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_monomialPairSumAtL_abs_le {k : ℕ} (h : Fin k → ℕ) (R : ℕ)
    (a b : ℕ) (i : Fin k) (L : ℕ) (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 (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)
      ≤ (((Fintype.piFinset (fun _ : Fin (k + 1) => Finset.Icc 1 L)).filter
        (fun d => ∏ i, d i = L)).card : ℝ) ^ 2 := by sorry
Source
GPY conditional monomial evaluation: the per-modulus monomial piece is bounded by the fiber count, from the tuple support, the Möbius bound, the log-ratio bound on the support, and the Selberg fiber bound

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