Type I bilinear sums
ProvedVaughan.typeI_boundcircle-methodexponential-sumsnumber-theoryvinogradov
Type I estimate. There is an absolute constant with the following property. Let , , . Let be supported on with , and let be monotone with for . Then
The proof is the classical two-step argument: for each fixed the inner sum over is handled by partial summation and the geometric-series bound, giving ; summing this over is precisely the weighted distance estimate above. The saving is genuine whenever is neither very small nor very large — which is exactly the situation on the minor arcs.
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 typeI_bound :
∃ C : ℝ, 0 < C ∧ ∀ (N M q : ℕ) (a : ℤ) (α : ℝ) (f g : ArithmeticFunction ℝ) (F G : ℝ),
0 < q → Nat.Coprime a.natAbs q → |α - (a : ℝ) / (q : ℝ)| ≤ 1 / (q : ℝ) ^ 2 →
(∀ m : ℕ, |f m| ≤ F) → (∀ m : ℕ, M < m → f m = 0) →
Monotone (fun k : ℕ => g k) → (∀ k : ℕ, k ≤ N → g k ≤ G) →
‖bilin f g α N‖
≤ C * F * G * ((N : ℝ) / (q : ℝ) + (M : ℝ) + (q : ℝ)) * (1 + Real.log (1 + (q : ℝ)))
* (1 + Real.log (1 + (M : ℝ))) := by sorry
end VaughanSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 3.1, Lemma 3.1 (Type I estimate)