Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quadratic phase cancellation for the actual compact Helfgott smoothing

Proved
Helfgott.etaTwo_expSum_quadratic_cap

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

exponential-sumsgoldbachminor-arcssmoothingtype-i

For y>0y>0y>0 and real θ\thetaθ, use Helfgott's actual compact smoothing η2(t)=4max⁡(log⁡2−∣log⁡(2t)∣,0)\eta_2(t)=4\max(\log2-|\log(2t)|,0)η2​(t)=4max(log2−∣log(2t)∣,0) for t>0t>0t>0, and zero otherwise. Put T(y,θ)=∑n≥0η2(n/y)e(nθ)T(y,\theta)=\sum_{n\ge0}\eta_2(n/y)e(n\theta)T(y,θ)=∑n≥0​η2​(n/y)e(nθ), with e(u)=exp⁡(2πiu)e(u)=\exp(2\pi iu)e(u)=exp(2πiu).

If sin⁡(πθ)≠0\sin(\pi\theta)\ne0sin(πθ)=0, then

∣T(y,θ)∣≤min⁡{4log⁡2 ⌊y⌋,18ysin⁡2(πθ)}.|T(y,\theta)|\le\min\left\{4\log2\,\lfloor y\rfloor,\frac{18}{y\sin^2(\pi\theta)}\right\}.∣T(y,θ)∣≤min{4log2⌊y⌋,ysin2(πθ)18​}.

At resonance the bound is 4log⁡2 ⌊y⌋4\log2\,\lfloor y\rfloor4log2⌊y⌋. The sum is finite by the smoothing's support. This is the unweighted inner exponential sum in Type I estimates; no prime-weighted or complete Vaughan estimate is asserted.

Preamble
import Definitions.Def_Helfgott_Smoothings
import Definitions.Def_Helfgott_WeightedCounting
import Mathlib.Algebra.Order.Floor.Ring
Formal statement
theorem Helfgott.etaTwo_expSum_quadratic_cap (y theta : ℝ) (hy : 0 < y) :
    ‖Helfgott.expSum (fun n => ((Helfgott.etaTwo ((n:ℝ)/y)):ℂ)) (theta:AddCircle (1:ℝ))‖ ≤
      if Real.sin (Real.pi*theta) = 0 then (4*Real.log 2)*(⌊y⌋₊:ℝ)
      else min ((4*Real.log 2)*(⌊y⌋₊:ℝ)) (18/(y*(Real.sin (Real.pi*theta))^2)) := by sorry
Source
Discrete second differences and a clipped-log decomposition of Helfgott eta_2, developed toward the Type I estimates in H. A. Helfgott, Minor arcs for Goldbach, https://arxiv.org/html/1205.5252v4. The constant 18 is conservative: the proof establishes total second-difference variation <=72/y rather than using the sharper continuous variation constant. Complete original Lean proof 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