Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BDH-shaped bound in target form, conditional

Proved
gpy_sum_maxCoprimeErr_sq_le_of_bvSumBound_target

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

number-theory

Conditional on a BV sum bound of the target shape C times Y' times log Y' to the power minus A' at height Y' and on the level constraint, the sum of squares of the max coprime-residue errors over moduli up to R squared is at most C squared times Y' squared times log Y' to the power minus A', squared. All local definitions are unfolded into Mathlib terms.

Preamble
import Mathlib
open Classical
Formal statement
theorem gpy_sum_maxCoprimeErr_sq_le_of_bvSumBound_target (M : ℕ → ℕ → ℝ) (Y' R : ℕ)
    {η : ℝ} (C A' : ℝ)
    (hlev : (R : ℝ) ^ 2 < (Y' : ℝ) ^ (1 / 2 - η))
    (hBV : (∀ v : ℕ → ℕ, (∀ q, Nat.Coprime (v q) q) →
      ∑ q ∈ (Finset.range ⌈(Y' : ℝ) ^ (1 / 2 - η)⌉₊).filter
          (fun q : ℕ => 1 ≤ q ∧ (q : ℝ) < (Y' : ℝ) ^ (1 / 2 - η)),
        abs ((((Finset.range (Y' + 1)).filter (fun p => Nat.Prime p ∧ p ≡ v q [MOD q])).card : ℝ) - M Y' q) ≤ C * ((Y' : ℝ) * Real.log (Y' : ℝ) ^ (-A')))) :
    ∑ L ∈ Finset.range (R ^ 2 + 1), ((if h : (((Finset.range L).filter (fun r => Nat.Coprime r L)).image
      (fun r => abs ((((Finset.range (Y' + 1)).filter (fun p => Nat.Prime p ∧ p ≡ r [MOD L])).card : ℝ) - M Y' L))).Nonempty then
    (((Finset.range L).filter (fun r => Nat.Coprime r L)).image
      (fun r => abs ((((Finset.range (Y' + 1)).filter (fun p => Nat.Prime p ∧ p ≡ r [MOD L])).card : ℝ) - M Y' L))).max' h
    else 0)) ^ 2
      ≤ C ^ 2 * (Y' : ℝ) ^ 2 * (Real.log (Y' : ℝ) ^ (-A')) ^ 2 := by sorry
Source
GPY BDH-partial bounds (trivial second moment plus Cauchy-Schwarz with the tau-fourth bound), conditional on a plain BV sum bound; formalized from Mathlib (no local definitions in statements)

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