Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A log-free capped reciprocal-square sine bound on a rational block

Proved
Helfgott.quadratic_rational_block_bound

by flyingviper · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

explicit-boundsexponential-sumsgoldbachminor-arcstype-i

Let q≥2q\ge2q≥2, (∣a∣,q)=1(|a|,q)=1(∣a∣,q)=1, α=a/q+β\alpha=a/q+\betaα=a/q+β, and ∣β∣≤q−2|\beta|\le q^{-2}∣β∣≤q−2. For 0≤N≤q0\le N\le q0≤N≤q, arbitrary real offset MMM and phase θ\thetaθ, and A,C≥0A,C\ge0A,C≥0, define F(t)=min⁡(A,C/sin⁡2t)F(t)=\min(A,C/\sin^2t)F(t)=min(A,C/sin2t) away from sine zeros and F(t)=AF(t)=AF(t)=A at a sine zero. Then

∑j=0N−1F(πα(M+j)+θ)≤2A+min⁡{2Cq2, A+2qAC}.\sum_{j=0}^{N-1}F(\pi\alpha(M+j)+\theta) \le 2A+\min\{2Cq^2,\ A+2q\sqrt{AC}\}.j=0∑N−1​F(πα(M+j)+θ)≤2A+min{2Cq2, A+2qAC​}.

This conservative Type I kernel estimate has no logarithmic loss. It includes arbitrary shifts, signed numerators, short blocks, zero coefficients, and exact resonances. It does not assert Helfgott's sharper published constants or a complete Vaughan estimate.

Preamble
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
open scoped BigOperators
Formal statement
theorem Helfgott.quadratic_rational_block_bound (a : ℤ) (q N : ℕ) (hq : 2 ≤ q)
    (haq : Nat.Coprime a.natAbs q) (hN : N ≤ q) (alpha beta theta M A C : ℝ)
    (halpha : alpha = (a:ℝ)/(q:ℝ)+beta)
    (hbeta : |beta| ≤ 1/(q:ℝ)^2) (hA : 0 ≤ A) (hC : 0 ≤ C) :
    (∑ j ∈ Finset.range N,
      if Real.sin (Real.pi*alpha*(M+(j:ℝ))+theta) = 0 then A
      else min A (C/(Real.sin (Real.pi*alpha*(M+(j:ℝ))+theta))^2)) ≤
      2*A+min (2*C*(q:ℝ)^2) (A+2*(q:ℝ)*Real.sqrt (A*C)) := by sorry
Source
Classical rational-grid spacing and reciprocal-square summation, in the role of Lemma 3.1 of H. A. Helfgott, Minor arcs for Goldbach, https://arxiv.org/html/1205.5252v4. Constants here are conservative. The spacing proof is adapted with attribution from accepted Prove2Me submission 968ef56d-d4b0-42b8-99aa-5a18c7253fab by marwahaha, retaining the Apache 2.0 attribution to Gershon Bialer. The capped quadratic-series and kernel proofs are new Lean proofs written by Codex.

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