Minor-arc bound for the prime exponential sum
ProvedVaughan.norm_vmSum_minor_leVinogradov's minor-arc estimate. There is an absolute constant such that whenever , , and ,
This is the central analytic estimate of Vinogradov's three-primes theorem, and the one place where the primes are handled without any information about zeros of -functions. It is obtained from Vaughan's identity with : the two Type I sums are bounded by the weighted distance estimate, the Type II sum by Cauchy--Schwarz and the divisor second moment, and the initial segment trivially.
On a minor arc — where every rational approximation to has — the right-hand side is for any fixed , a genuine saving over the trivial bound . This is what makes the minor arcs negligible in the three-primes circle method, so that the main term comes entirely from the major arcs.
import Definitions.Def_Vino_vaughan import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.NumberTheory.ArithmeticFunction.Moebius import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.NumberTheory.ArithmeticFunction.Misc import Mathlib.Algebra.BigOperators.Module import Mathlib.Algebra.Order.Interval.Finset.SuccPred import Mathlib.Algebra.Order.BigOperators.Ring.Finset import Mathlib.Algebra.BigOperators.Field import Mathlib.NumberTheory.Harmonic.Bounds import Theorems.Thm_CircleMethod_e_neg import Theorems.Thm_Vino_psi_le import Theorems.Thm_CircleMethod_aux_sum_min_le import Theorems.Thm_CircleMethod_nrm_le import Theorems.Thm_CircleMethod_nrm_triangle import Theorems.Thm_CircleMethod_nrm_neg import Theorems.Thm_CircleMethod_nrm_nonneg import Theorems.Thm_CircleMethod_nrm_eq_zero_iff import Theorems.Thm_CircleMethod_nrm_pos_of_not_int import Theorems.Thm_CircleMethod_norm_sum_e_le_inv_nrm import Theorems.Thm_CircleMethod_norm_sum_e_le import Theorems.Thm_CircleMethod_e_add import Theorems.Thm_CircleMethod_norm_e open Finset ArithmeticFunction open CircleMethod
namespace Vaughan
theorem norm_vmSum_minor_le :
∃ C : ℝ, 0 < C ∧ ∀ (N q : ℕ) (a : ℤ) (α : ℝ), 2 ≤ N → 0 < q →
Nat.Coprime a.natAbs q → |α - (a : ℝ) / (q : ℝ)| ≤ 1 / (q : ℝ) ^ 2 →
‖Vino.vmSum α N‖
≤ C * ((N : ℝ) / Real.sqrt q + (N : ℝ) ^ (4 / 5 : ℝ) + Real.sqrt ((N : ℝ) * q))
* Real.log N ^ 4 := by sorry
end Vaughan