Vaughan's Lemma 2.2 with decay
ProvedVaughan.sum_min_div_lecircle-methodexponential-sumsnumber-theoryvinogradov
A weighted form of the classical sum-of-reciprocals-of-distances estimate. Let with and , and let satisfy the two caps
that is . Then there is an absolute constant with
This refines the standard bound and is exactly the estimate that makes Type I sums nontrivial. It is deduced from the uniform-cap bound over a single block by a dyadic decomposition of the range of , the extra factor being what supplies the saving rather than .
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 sum_min_div_le :
∃ C : ℝ, 0 < C ∧ ∀ (T N q : ℕ) (a : ℤ) (α : ℝ) (g : ℕ → ℝ), 0 < q →
Nat.Coprime a.natAbs q → |α - (a : ℝ) / (q : ℝ)| ≤ 1 / (q : ℝ) ^ 2 →
(∀ k : ℕ, 0 ≤ g k) → (∀ k : ℕ, (k : ℝ) * g k ≤ (N : ℝ)) →
(∀ k : ℕ, 2 * nrm ((k : ℝ) * α) * g k ≤ 1) →
(∑ k ∈ Icc 1 T, g k)
≤ C * ((N : ℝ) / (q : ℝ) + (T : ℝ) + (q : ℝ)) * (1 + Real.log (1 + (q : ℝ)))
* (1 + Real.log (1 + (T : ℝ))) := by sorry
end VaughanSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 2.1, Lemma 2.2