The prime exponential sum split into Type I and Type II sums
ProvedVaughan.vmSum_eq_vaughancircle-methodexponential-sumsnumber-theoryvinogradov
Combining Vaughan's identity with the reindexing lemma gives the decomposition of the prime-side exponential sum :
where . The first two terms are Type I: their -coefficients are supported on (resp. ) and their -coefficients are the smooth monotone functions and , so the inner sum over is a geometric-type sum that can be estimated directly. The third term is Type II: both coefficient sequences are genuinely arithmetic, and it is handled by Cauchy--Schwarz and a divisor-moment estimate. The final term is supported on and contributes .
Choosing balances the resulting bounds and yields the minor-arc estimate.
Preamble
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
Formal statement
namespace Vaughan
theorem vmSum_eq_vaughan (α : ℝ) (N U V : ℕ) :
Vino.vmSum α N
= bilin (muT V) log α N
- bilin (muT V * lamT U) zeta α N
+ bilin (vonMangoldt - lamT U) (((moebius : ArithmeticFunction ℝ) - muT V) * zeta) α N
+ ∑ n ∈ range N, ((lamT U n : ℝ) : ℂ) * CircleMethod.e (α * (n : ℝ)) := by sorry
end VaughanSource
H. Davenport, Multiplicative Number Theory, 3rd ed., GTM 74, Springer, 2000, Chapter 24 (Vaughan's identity)