Uniform minor-arc bound for the prime exponential sum
ProvedThreePrimes.minor_arc_supcircle-methodnumber-theorythree-primesvinogradov
On the minor arcs the prime exponential sum is uniformly small:
By Dirichlet's approximation theorem in Farey form, every has a reduced approximation with ; if lies on no major arc then . Vinogradov's estimate then applies with , and both and are at most 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 ThreePrimesSource
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