Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Trivial growth bound ∣L(s,χ)∣≤∣s∣ q/σ|L(s,\chi)| \le |s|\,q/\sigma∣L(s,χ)∣≤∣s∣q/σ for σ>0\sigma > 0σ>0, χ\chiχ non-principal

Proved
Davenport.norm_LFunction_le_of_re_pos

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

analytic-number-theorydirichlet-l-functionnumber-theorysiegel-theoremsiegel-walfiszthree-primes

Trivial growth bound for L(s,χ)L(s,\chi)L(s,χ) in the half-plane σ>0\sigma > 0σ>0. Let q≥1q \ge 1q≥1 and let χ\chiχ be a non-principal Dirichlet character modulo qqq. Then for every complex s=σ+its = \sigma + its=σ+it with σ>0\sigma > 0σ>0,

∣L(s,χ)∣  ≤  ∣s∣ qσ,|L(s,\chi)| \;\le\; \frac{|s|\,q}{\sigma},∣L(s,χ)∣≤σ∣s∣q​,

where L(s,χ)L(s,\chi)L(s,χ) is the analytically continued Dirichlet LLL-function (Mathlib's DirichletCharacter.LFunction).

This is the bound obtained from the partial-summation representation L(s,χ)=s∫1∞S(x) x−s−1 dxL(s,\chi) = s\int_1^\infty S(x)\,x^{-s-1}\,dxL(s,χ)=s∫1∞​S(x)x−s−1dx, valid for σ>0\sigma > 0σ>0, where S(x)=∑n≤xχ(n)S(x) = \sum_{n \le x}\chi(n)S(x)=∑n≤x​χ(n); since χ\chiχ is non-principal, its values sum to zero over every complete period, so ∣S(x)∣≤q|S(x)| \le q∣S(x)∣≤q for all xxx, and the integral is bounded by q/σq/\sigmaq/σ. It is the weak (trivial-character-sum) form of Montgomery–Vaughan's Lemma 10.15. In the proof of Siegel's theorem it bounds L(s,χ)L(s,\chi)L(s,χ) on the disc ∣s−2∣≤3/2|s-2| \le 3/2∣s−2∣≤3/2 by 7q7q7q; in the zero-free-region arguments it supplies the polynomial growth needed for Borel–Carathéodory-type estimates.

Formalization Note. For q≤2q \le 2q≤2 there is no non-principal character, so the hypothesis χ≠1\chi \ne 1χ=1 makes the statement vacuous there; no lower bound on qqq is imposed.

Preamble
import Mathlib.NumberTheory.LSeries.DirichletContinuation
import Mathlib.NumberTheory.LSeries.Nonvanishing
import Mathlib.NumberTheory.LSeries.Positivity
import Mathlib.NumberTheory.LSeries.Convolution
import Mathlib.NumberTheory.DirichletCharacter.Basic
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Pow.Complex
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Exp

open Finset DirichletCharacter
Formal statement
namespace Davenport

theorem norm_LFunction_le_of_re_pos (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q) (hχ : χ ≠ 1)
    (s : ℂ) (hs : 0 < s.re) :
    ‖DirichletCharacter.LFunction χ s‖ ≤ ‖s‖ * q / s.re := by sorry

end Davenport
Source
H. L. Montgomery and R. C. Vaughan, Multiplicative Number Theory I: Classical Theory, Cambridge Studies in Advanced Mathematics 97, CUP 2007, Lemma 10.15 (p. 350), trivial-bound form; cf. H. Davenport, Multiplicative Number Theory, 3rd ed. (revised by H. L. Montgomery), GTM 74, Springer 2000, https://doi.org/10.1007/978-1-4757-5927-3, §14, pp. 88–96 (partial summation with the bound |∑_{n≤x} χ(n)| ≤ q)

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me