Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bound L′(σ,χ)≪(log⁡q)2L'(\sigma,\chi) \ll (\log q)^2L′(σ,χ)≪(logq)2 for 1−1/log⁡q≤σ≤11 - 1/\log q \le \sigma \le 11−1/logq≤σ≤1 (Davenport §14)

Proved
Davenport.deriv_LFunction_bound

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

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

A bound for L′(σ,χ)L'(\sigma,\chi)L′(σ,χ) near σ=1\sigma=1σ=1 (Davenport §14). There is an absolute constant K>0K>0K>0 such that for every modulus q≥3q\ge3q≥3, every non-principal Dirichlet character χ\chiχ modulo qqq, and every real σ\sigmaσ with

1−1log⁡q  ≤  σ  ≤  1,1-\frac{1}{\log q}\;\le\;\sigma\;\le\;1,1−logq1​≤σ≤1, ∣L′(σ,χ)∣  ≤  K (log⁡q)2.\bigl|L'(\sigma,\chi)\bigr|\;\le\;K\,(\log q)^2 .​L′(σ,χ)​≤K(logq)2.

Here L′L'L′ is the derivative of Mathlib's analytically continued L(s,χ)L(s,\chi)L(s,χ), evaluated on the real axis. In Davenport's proof this follows by partial summation from the trivial bound ∣∑n≤xχ(n)∣≤q\bigl|\sum_{n\le x}\chi(n)\bigr|\le q​∑n≤x​χ(n)​≤q, using n1−σ≤q1/log⁡q=en^{1-\sigma}\le q^{1/\log q}=en1−σ≤q1/logq=e for n≤qn\le qn≤q. It is the ingredient that converts Siegel's lower bound for L(1,χ)L(1,\chi)L(1,χ) into the bound β1≤1−C(ε)q−ε\beta_1\le1-C(\varepsilon)q^{-\varepsilon}β1​≤1−C(ε)q−ε for a real zero, via the mean value theorem L(1,χ)=(1−β1)L′(ξ,χ)L(1,\chi)=(1-\beta_1)L'(\xi,\chi)L(1,χ)=(1−β1​)L′(ξ,χ). Moduli q≤2q\le2q≤2 carry no non-principal character, so they are excluded to keep log⁡q>0\log q>0logq>0.

Preamble
import Definitions.Def_Davenport_siegelWalfisz
import Mathlib.NumberTheory.LSeries.DirichletContinuation
import Mathlib.NumberTheory.DirichletCharacter.Basic
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt
import Mathlib.NumberTheory.Chebyshev
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Pow.Complex
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Exp
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Algebra.BigOperators.Finprod
import Mathlib.Data.Nat.Totient

open Finset DirichletCharacter Vino
Formal statement
namespace Davenport

theorem deriv_LFunction_bound :
    ∃ K : ℝ, 0 < K ∧
      ∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q), χ ≠ 1 → 3 ≤ q →
        ∀ σ : ℝ, 1 - 1 / Real.log q ≤ σ → σ ≤ 1 →
          ‖deriv (DirichletCharacter.LFunction χ) (σ : ℂ)‖ ≤ K * Real.log q ^ 2 := by
  sorry

end Davenport
Source
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 (Zero-free regions for L(s,χ)), pp. 88–96: the estimate L'(σ,χ) ≪ (log q)² for 1 − 1/log q ≤ σ ≤ 1 by partial summation, used for the bound 1 − β₁ ≫ L(1,χ)/(log q)²; §21 (Siegel's theorem) for the deduction of the second form
Read-back

What the Lean code literally says, in plain math · claude-opus-4-8

Read-back: Davenport.deriv_LFunction_bound

Literal rendering. The declaration asserts the existence of a single real number KKK such that K>0K > 0K>0 and such that the following holds for every modulus, every character, and every point simultaneously: for every natural number qqq that is nonzero (a typeclass side-condition NeZero q\mathrm{NeZero}\,qNeZeroq, i.e. q≠0q \neq 0q=0, carried as an instance argument), for every Dirichlet character χ\chiχ of modulus qqq with values in the complex numbers C\mathbb{C}C, if χ\chiχ is not equal to the trivial (principal) character modulo qqq and if 3≤q3 \le q3≤q, then for every real number σ\sigmaσ satisfying the two inequalities

1−1log⁡q  ≤  σandσ  ≤  1,1 - \frac{1}{\log q} \;\le\; \sigma \qquad\text{and}\qquad \sigma \;\le\; 1,1−logq1​≤σandσ≤1,

one has

∥L′(σ,χ)∥  ≤  K⋅(log⁡q)2.\bigl\| L'(\sigma, \chi) \bigr\| \;\le\; K \cdot (\log q)^2 .​L′(σ,χ)​≤K⋅(logq)2.

Here L(⋅,χ)L(\cdot,\chi)L(⋅,χ) is Mathlib's analytically continued Dirichlet LLL-function attached to χ\chiχ, L′L'L′ denotes its complex derivative (the derivative of the function s↦L(s,χ)s \mapsto L(s,\chi)s↦L(s,χ) of a complex variable, a total operation which returns the junk value 000 at any point where the function fails to be complex-differentiable), ∥⋅∥\|\cdot\|∥⋅∥ is the modulus of a complex number, log⁡q\log qlogq is the natural logarithm of the natural number qqq cast into R\mathbb{R}R, and (log⁡q)2(\log q)^2(logq)2 is the square of that logarithm — not log⁡(q2)\log(q^2)log(q2).

Quantifier order and uniformity of KKK. The existential ∃K\exists K∃K is the outermost binder, so KKK is one absolute constant: it does not depend on qqq, on χ\chiχ, or on σ\sigmaσ. All of qqq, χ\chiχ, σ\sigmaσ are universally quantified inside the scope of KKK. The positivity requirement 0<K0 < K0<K is strict; the concluding bound is non-strict (≤\le≤).

The point at which the derivative is evaluated. The evaluation point is (σ:C)(\sigma : \mathbb{C})(σ:C), i.e. the real number σ\sigmaσ coerced into C\mathbb{C}C with zero imaginary part. The statement therefore constrains the derivative only on the real axis — at the points s=σ+0is = \sigma + 0is=σ+0i — and says nothing about any sss with nonzero imaginary part. It is a bound on a real segment, not on a vertical strip or a region of the complex plane, and there is no auxiliary height parameter ttt anywhere in the statement.

The range of σ\sigmaσ. The admissible σ\sigmaσ form the closed real interval [ 1−1log⁡q,  1 ]\left[\,1 - \tfrac{1}{\log q},\; 1\,\right][1−logq1​,1], with both endpoints included. In particular σ=1\sigma = 1σ=1 is an admissible point (the bound is asserted at s=1s = 1s=1 itself), and so is the left endpoint 1−1/log⁡q1 - 1/\log q1−1/logq. Note the interval is bounded above by 111, so nothing is claimed for σ>1\sigma > 1σ>1, where the Dirichlet series converges.

Degenerate and boundary behaviour of the interval.

  • Because q≥3q \ge 3q≥3 is assumed, log⁡q≥log⁡3≈1.0986>1\log q \ge \log 3 \approx 1.0986 > 1logq≥log3≈1.0986>1, hence 0<1/log⁡q<10 < 1/\log q < 10<1/logq<1 and the left endpoint 1−1/log⁡q1 - 1/\log q1−1/logq lies strictly between 000 and 111. The interval is always nonempty (it contains σ=1\sigma = 1σ=1) and is always a subinterval of (0,1](0,1](0,1].
  • At the smallest admissible modulus q=3q = 3q=3: 1/log⁡3≈0.91021/\log 3 \approx 0.91021/log3≈0.9102, so the interval is approximately [0.0898, 1][0.0898,\, 1][0.0898,1] — a long segment reaching almost down to the origin, extending far to the left of the line σ=1/2\sigma = 1/2σ=1/2 and covering all but a sliver of the critical strip along the real axis. Similarly for q=4q = 4q=4 (1/log⁡4≈0.72131/\log 4 \approx 0.72131/log4≈0.7213, interval ≈[0.279,1]\approx [0.279, 1]≈[0.279,1]), q=5q = 5q=5 (≈[0.379,1]\approx [0.379, 1]≈[0.379,1]), and other small qqq: the constraint is substantive over a wide range of σ\sigmaσ.
  • As q→∞q \to \inftyq→∞, 1/log⁡q→01/\log q \to 01/logq→0, so the left endpoint tends to 111 from below and the interval shrinks down to the single point {1}\{1\}{1}. For large qqq the assertion concerns only an increasingly thin neighbourhood of s=1s = 1s=1 on the real axis, while the right-hand side K(log⁡q)2K(\log q)^2K(logq)2 grows without bound.
  • The division 1/log⁡q1/\log q1/logq is a total operation; were log⁡q\log qlogq zero the expression would evaluate to 1−0=11 - 0 = 11−0=1 and the interval would collapse to {1}\{1\}{1}. The hypothesis 3≤q3 \le q3≤q excludes this (q=1q = 1q=1 would give log⁡1=0\log 1 = 0log1=0), so the degenerate division does not actually arise under the stated hypotheses.

Hypotheses on qqq and χ\chiχ. Two conditions on qqq appear: the instance assumption q≠0q \neq 0q=0 and the explicit inequality 3≤q3 \le q3≤q; the latter subsumes the former, so the instance is redundant as a mathematical constraint (it is present because forming Z/qZ\mathbb{Z}/q\mathbb{Z}Z/qZ and hence a Dirichlet character modulo qqq requires it). No primality, squarefreeness, or other arithmetic restriction is placed on qqq: it ranges over all integers q≥3q \ge 3q≥3. Likewise χ\chiχ ranges over all Dirichlet characters modulo qqq other than the principal one — primitive and imprimitive alike, real and complex, even and odd. The hypothesis χ≠1\chi \neq 1χ=1 removes exactly one character (the principal character mod qqq), and for every q≥3q \ge 3q≥3 there is at least one character satisfying it, so the hypotheses are simultaneously satisfiable and the statement is not vacuous.

What is bounded. The quantity bounded is the modulus of the derivative of the LLL-function itself, ∣L′(σ,χ)∣|L'(\sigma,\chi)|∣L′(σ,χ)∣ — not the logarithmic derivative L′/LL'/LL′/L, not ∣L(σ,χ)∣|L(\sigma,\chi)|∣L(σ,χ)∣, and not any quotient or reciprocal. The bound is K(log⁡q)2K(\log q)^2K(logq)2, a quantity depending on qqq only (through log⁡q\log qlogq) and not on σ\sigmaσ or on χ\chiχ: for a fixed modulus the same numerical bound is claimed uniformly across all nonprincipal characters mod qqq and all σ\sigmaσ in the stated interval.

Scope of the statement. The statement is a closed proposition with no free variables and no hypotheses outside itself; it contains no reference to any definition introduced elsewhere in the bundle — every notion it uses (LLL-functions, complex derivative, norm, real logarithm, Dirichlet characters, the trivial character) is taken from the ambient library. The proof is not supplied in the code shown.

Human review
  • Endorsed by Shuze Chen · Sep 3, 2026

  • Endorsed by alya · Sep 3, 2026

    Confirmed by the mission captain (proposal self-audit).

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