Type II sums on a dyadic block, after Cauchy--Schwarz
ProvedVaughan.typeII_dyadic_sq_lecircle-methodexponential-sumsnumber-theoryvinogradov
The core Type II estimate on a single dyadic block. Let be supported on and let with . Then, for an absolute constant ,
Cauchy--Schwarz in the variable removes the arithmetic coefficients entirely; squaring out the -sum leaves a difference , and summing the resulting geometric series over produces the distance function with ranging over . The final factor is what that sum contributes.
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 typeII_dyadic_sq_le :
∃ C : ℝ, 0 < C ∧ ∀ (N M q : ℕ) (a : ℤ) (α : ℝ) (f g : ArithmeticFunction ℝ),
0 < M → 0 < q → Nat.Coprime a.natAbs q → |α - (a : ℝ) / (q : ℝ)| ≤ 1 / (q : ℝ) ^ 2 →
(∀ m : ℕ, m ≤ M ∨ 2 * M < m → f m = 0) →
‖bilin f g α N‖ ^ 2
≤ C * (∑ m ∈ Icc (M + 1) (2 * M), f m ^ 2) * (∑ k ∈ range (N / M + 1), g k ^ 2)
* ((M : ℝ) + ((N : ℝ) / M / q + 1) * ((M : ℝ) + q) * (1 + Real.log (1 + (q : ℝ)))) := 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.2 (Type II estimate)