Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A Type I bound preserving resonant Mobius cancellation and Fourier decay

Proved
Helfgott.vaughan_typeOne_mobius_upper

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

explicit-boundsexponential-sumsgoldbachmobiusvaughan-identity

Let a∈Za\in\mathbb Za∈Z, 2≤q≤U2\le q\le U2≤q≤U, (a,q)=1(a,q)=1(a,q)=1, y≥8y\ge8y≥8, 8U≤y8U\le y8U≤y, and qU∣β∣≤1/2qU|\beta|\le1/2qU∣β∣≤1/2. Write α=a/q+β\alpha=a/q+\betaα=a/q+β, δ=βy\delta=\beta yδ=βy, and let M(0)=1M(0)=1M(0)=1, M(δ)=min⁡(1,18/(πδ)2)M(\delta)=\min(1,18/(\pi\delta)^2)M(δ)=min(1,18/(πδ)2) otherwise. Define TU(n)=∑d∣n, d≤Uμ(d)log⁡(n/d)T_U(n)=\sum_{d\mid n,\ d\le U}\mu(d)\log(n/d)TU​(n)=∑d∣n, d≤U​μ(d)log(n/d) and η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, zero otherwise. Then

∣∑n≥1TU(n)η2(n/y)e(αn)∣≤yq(log⁡(y/q)M(δ)+log⁡4)+2⌊U/q⌋((log⁡y+log⁡4)(36+8πlog⁡2∣δ∣)+16log⁡2)+36log⁡(y+2)q2Uymin⁡(U+1,8(⌊U/q⌋+1)).\left|\sum_{n\ge1}T_U(n)\eta_2(n/y)e(\alpha n)\right| \le \frac yq\bigl(\log(y/q)M(\delta)+\log4\bigr) +2\lfloor U/q\rfloor\bigl((\log y+\log4)(36+8\pi\log2|\delta|)+16\log2\bigr) +\frac{36\log(y+2)q^2U}{y}\min\bigl(U+1,8(\lfloor U/q\rfloor+1)\bigr).​n≥1∑​TU​(n)η2​(n/y)e(αn)​≤qy​(log(y/q)M(δ)+log4)+2⌊U/q⌋((logy+log4)(36+8πlog2∣δ∣)+16log2)+y36log(y+2)q2U​min(U+1,8(⌊U/q⌋+1)).

The three terms respectively bound the resonant main term, its explicit quadrature error, and the nonresonant contribution. All constants are conservative and the estimate is unconditional.

Preamble
import Definitions.Def_Helfgott_VaughanData
import Mathlib.Analysis.Fourier.AddCircle
import Mathlib.Algebra.Order.Floor.Ring
open Helfgott Finset
open scoped BigOperators
Formal statement
theorem Helfgott.vaughan_typeOne_mobius_upper (a : ℤ) (q U : ℕ) (hq : 2 ≤ q)
    (hqU : q ≤ U) (haq : Nat.Coprime a.natAbs q) (y beta : ℝ)
    (hy : 8 ≤ y) (hUy : 8*(U:ℝ) ≤ y) (hbeta : (q:ℝ)*|beta| * (U:ℝ) ≤ 1/2) :
    let delta := beta*y
    let M := if delta=0 then (1:ℝ) else min 1 (18/(Real.pi*delta)^2)
    ‖expSum (fun n => ((vaughanTypeOne U n*etaTwo ((n:ℝ)/y):ℝ):ℂ))
      (((a:ℝ)/(q:ℝ)+beta:ℝ):AddCircle (1:ℝ))‖ ≤
      y/(q:ℝ)*(Real.log (y/(q:ℝ))*M+Real.log 4)+
      ((U/q:ℕ):ℝ)*2*((Real.log y+Real.log 4)*(36+8*Real.pi*Real.log 2*|delta|)+16*Real.log 2)+
      min ((4*Real.log (y+2))*(9*(q:ℝ)^2*(U:ℝ)*(U+1:ℕ)/y))
        (288*Real.log (y+2)*(U:ℝ)*(q:ℝ)^2*((U/q+1:ℕ):ℝ)/y) := by sorry
Source
Classical Vaughan decomposition and resonant Mobius cancellation, as in Helfgott, Minor arcs for Goldbach, arXiv:1205.5252v4, Section 3. Local constants are proved by elementary coprime Mobius cancellation, Lipschitz quadrature and a limiting discrete second-difference argument for Fourier decay. Retained arithmetic infrastructure carries Apache 2.0 attribution to raresbuhai (submissions 63b25d14-2999-434f-b84f-5af50fbd02fa, 4b19f26e-e6f8-4a14-8cf6-e0ea33b44440, dc167013-7b1b-47a5-bd68-36e63ad77223) and rational grid infrastructure to marwahaha / Gershon Bialer (968ef56d-d4b0-42b8-99aa-5a18c7253fab).

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