Dyadic decomposition of a Type II sum
ProvedVaughan.bilin_eq_sum_blockTcircle-methodexponential-sumsnumber-theoryvinogradov
The Type II bilinear sum decomposes into dyadic blocks in the variable:
where block collects the with , truncated at . The truncation is free: the coefficients vanish for , so only contributes. Splitting this way is what lets the single-block Cauchy--Schwarz estimate be applied with a definite value of , at a total cost of a factor .
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 bilin_eq_sum_blockT (f : ArithmeticFunction ℝ) (U V N : ℕ) (α : ℝ) :
bilin f (((moebius : ArithmeticFunction ℝ) - muT V) * zeta) α N
= ∑ j ∈ range (Nat.log 2 N + 1),
bilin (blockT f U (N / (V + 1)) j)
(((moebius : ArithmeticFunction ℝ) - muT V) * zeta) α N := by sorry
end VaughanSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 3.2