Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Abel summation bound for monotone weights

Proved
Vaughan.norm_sum_mul_e_le_of_monotone

by tabbott · Sep 3, 2026 · Mathlib c5ea003 (Lean v4.30.0)

circle-methodexponential-sumsnumber-theoryvinogradov

Partial summation. Let g:N→Rg:\mathbb N\to\mathbb Rg:N→R be monotone with g(0)≥0g(0)\ge0g(0)≥0, let θ∈R\theta\in\mathbb Rθ∈R, and suppose every partial exponential sum is bounded: ∥∑k<Je(kθ)∥≤B\bigl\|\sum_{k<J}e(k\theta)\bigr\|\le B​∑k<J​e(kθ)​≤B for all J≤KJ\le KJ≤K. Then

∥∑k<Kg(k) e(kθ)∥ ≤ 2 g(K−1) B.\Bigl\|\sum_{k<K}g(k)\,e(k\theta)\Bigr\|\ \le\ 2\,g(K-1)\,B .​k<K∑​g(k)e(kθ)​ ≤ 2g(K−1)B.

Abel summation transfers a bound on the unweighted partial sums to the weighted sum, at the cost of the total variation of the weight — which for a monotone nonnegative ggg is just g(K−1)g(K-1)g(K−1). This is how the sharp geometric-series bound min⁡(K,1/(2∥θ∥))\min(K,1/(2\|\theta\|))min(K,1/(2∥θ∥)) is carried over to the smooth coefficients log⁡\loglog and ζ\zetaζ that appear in the Type I sums.

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 norm_sum_mul_e_le_of_monotone (g : ℕ → ℝ) (hmono : Monotone g) (h0 : 0 ≤ g 0)
    (θ : ℝ) (K : ℕ) (B : ℝ)
    (hB : ∀ J, J ≤ K → ‖∑ k ∈ range J, e ((k : ℝ) * θ)‖ ≤ B) :
    ‖∑ k ∈ range K, ((g k : ℝ) : ℂ) * e ((k : ℝ) * θ)‖ ≤ 2 * g (K - 1) * B := by sorry

end Vaughan
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 2.1 (partial summation); Davenport, Multiplicative Number Theory, Chapter 25

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me