Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform minor-arc bound for the prime exponential sum

Proved
ThreePrimes.minor_arc_sup

by tabbott · Sep 3, 2026 · Mathlib c5ea003 (Lean v4.30.0)

circle-methodnumber-theorythree-primesvinogradov

On the minor arcs the prime exponential sum is uniformly small:

sup⁡α∈m∣S(α,N)∣ ≪ (2NP+N4/5)log⁡4N.\sup_{\alpha\in\mathfrak m}\bigl|S(\alpha,N)\bigr| \ \ll\ \left(\frac{2N}{\sqrt P}+N^{4/5}\right)\log^4N .α∈msup​​S(α,N)​ ≪ (P​2N​+N4/5)log4N.

By Dirichlet's approximation theorem in Farey form, every α\alphaα has a reduced approximation ∣α−a/q∣≤1/(qQ)|\alpha-a/q|\le 1/(qQ)∣α−a/q∣≤1/(qQ) with q≤Q=⌊N/P⌋q\le Q=\lfloor N/P\rfloorq≤Q=⌊N/P⌋; if α\alphaα lies on no major arc then q>Pq>Pq>P. Vinogradov's estimate then applies with P<q≤N/PP<q\le N/PP<q≤N/P, and both N/qN/\sqrt qN/q​ and Nq\sqrt{Nq}Nq​ are at most N/PN/\sqrt PN/P​ in that range. This is the step where the minor arcs are shown to be genuinely negligible.

Preamble
import Definitions.Def_Vino_threeprimes
import Mathlib.Analysis.Asymptotics.Defs
import Mathlib.Analysis.Asymptotics.Lemmas
import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic
import Mathlib.MeasureTheory.Integral.Bochner.Set
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Data.Nat.Totient

open CircleMethod Vino Finset Filter Asymptotics MeasureTheory
open scoped Topology
Formal statement
namespace ThreePrimes

theorem minor_arc_sup (B : ℝ) :
    ∃ C : ℝ, 0 < C ∧ ∀ n : ℕ, 1 ≤ n → ∀ α ∈ minor B n,
      ‖vmSum α (n + 1)‖
        ≤ C * (2 * ((n : ℝ) + 1) / Real.sqrt (arcParam B n) + ((n : ℝ) + 1) ^ ((4 : ℝ) / 5))
            * Real.log ((n : ℝ) + 1) ^ 4 := by sorry

end ThreePrimes
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 3, Section 3.2, Theorem 3.1

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