Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Siegel's theorem: L(1,χ)>C(ε) q−εL(1,\chi) > C(\varepsilon)\,q^{-\varepsilon}L(1,χ)>C(ε)q−ε (Davenport §21)

Proved
Davenport.siegel

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

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

Siegel's theorem, first form (Davenport §21, opening sentence): for any ε>0\varepsilon>0ε>0 there exists a positive number C(ε)C(\varepsilon)C(ε) such that, if χ\chiχ is a real primitive character to the modulus qqq, then

L(1,χ)  >  C(ε) q−ε.L(1,\chi)\;>\;C(\varepsilon)\,q^{-\varepsilon}.L(1,χ)>C(ε)q−ε.

Formally, for every ε>0\varepsilon>0ε>0 there is C>0C>0C>0 such that for all q≥1q\ge1q≥1 and all quadratic (IsQuadratic), non-principal, primitive Dirichlet characters χ\chiχ modulo qqq, C q−ε<Re⁡L(1,χ)C\,q^{-\varepsilon}<\operatorname{Re}L(1,\chi)Cq−ε<ReL(1,χ). Since L(1,χ)L(1,\chi)L(1,χ) is real for a real character, the real part is the value itself. The constant C(ε)C(\varepsilon)C(ε) is ineffective (the proof gives no way to compute it); the statement is a plain existential.

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 siegel (ε : ℝ) (hε : 0 < ε) :
    ∃ C : ℝ, 0 < C ∧
      ∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q),
        χ.IsQuadratic → χ ≠ 1 → χ.IsPrimitive →
          C * (q : ℝ) ^ (-ε) < (DirichletCharacter.LFunction χ 1).re := 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; §21 (Siegel's theorem), pp. 126–131, first form: for any ε > 0 there exists C₁(ε) > 0 such that L(1,χ) > C₁(ε) q^{−ε} for every real primitive character χ mod q
Read-back

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

Read-back of Davenport.siegel.

Fix a real number ε\varepsilonε and assume ε>0\varepsilon > 0ε>0 (no upper bound on ε\varepsilonε is imposed). The statement asserts: there exists a real number CCC such that C>0C > 0C>0 and such that, for every natural number qqq that is nonzero (the instance hypothesis NeZero q\mathrm{NeZero}\ qNeZero q, i.e. q≥1q \ge 1q≥1) and for every Dirichlet character χ\chiχ modulo qqq with values in C\mathbb{C}C satisfying the three hypotheses

  • χ\chiχ is quadratic: every value of χ\chiχ lies in {0,1,−1}\{0, 1, -1\}{0,1,−1},
  • χ≠1\chi \neq 1χ=1, i.e. χ\chiχ is not the trivial (principal) character modulo qqq,
  • χ\chiχ is primitive: the conductor of χ\chiχ equals qqq,

one has the strict inequality

C⋅q−ε  <  Re⁡ L(1,χ),C \cdot q^{-\varepsilon} \;<\; \operatorname{Re}\, L(1, \chi),C⋅q−ε<ReL(1,χ),

where q−εq^{-\varepsilon}q−ε is the real power of the real number qqq with exponent −ε-\varepsilon−ε, and L(1,χ)L(1,\chi)L(1,χ) denotes the value at s=1s = 1s=1 of the analytically continued Dirichlet LLL-function attached to χ\chiχ (Mathlib's DirichletCharacter.LFunction), of which only the real part is taken.

Quantifier order matters here: CCC is chosen after ε\varepsilonε but before qqq and χ\chiχ, so a single positive constant CCC, allowed to depend only on ε\varepsilonε, must work simultaneously for all admissible moduli qqq and all admissible characters χ\chiχ mod qqq. Conversely, CCC is only required to exist — nothing pins down its value, no explicit formula is demanded, and no claim of effectivity or computability is made.

Several features of the claim are worth spelling out literally. The conclusion is a lower bound and it is strict (<<<, not ≤\le≤). It bounds the real part Re⁡ L(1,χ)\operatorname{Re}\, L(1,\chi)ReL(1,χ) only; the statement does not assert that L(1,χ)L(1,\chi)L(1,χ) is a real number, and it makes no claim about ∣L(1,χ)∣|L(1,\chi)|∣L(1,χ)∣ or about L(1,χ)L(1,\chi)L(1,χ) being nonzero as a complex number (though a positive lower bound on the real part does force L(1,χ)≠0L(1,\chi) \ne 0L(1,χ)=0). There is no "for all sufficiently large qqq" clause and no exclusion of small moduli: the inequality is asserted for every q≥1q \ge 1q≥1 admitting such a χ\chiχ. The modulus q=0q = 0q=0 is excluded by the NeZero\mathrm{NeZero}NeZero instance, so the degenerate real power 0−ε0^{-\varepsilon}0−ε never arises; for q≥1q \ge 1q≥1 we have q−ε>0q^{-\varepsilon} > 0q−ε>0, so the left-hand side C q−εC\, q^{-\varepsilon}Cq−ε is genuinely positive.

The hypotheses are vacuously unsatisfiable for some moduli, in which case the assertion says nothing about them: for q=1q = 1q=1 and q=2q = 2q=2 the group of units of Z/qZ\mathbb{Z}/q\mathbb{Z}Z/qZ is trivial, so the only Dirichlet character mod qqq is the trivial one and the hypothesis χ≠1\chi \ne 1χ=1 can never hold; more generally, for any qqq admitting no primitive nontrivial quadratic character the universally quantified statement is empty. The theorem therefore constrains CCC only through those qqq that do carry a primitive nontrivial quadratic character.

Finally, note what the statement does not involve. The imported definitions from the bundle — ψ(N;q,a)\psi(N; q, a)ψ(N;q,a) (psiAP, a truncated von Mangoldt sum over an arithmetic progression), regionBoundary, InRegion, IsExceptionalSet (a zero-free-region-with-at-most-one-exception predicate), and the character sums gaussE and vmSumChar — appear nowhere in the assertion; they are only ambient definitions in the dependency files. The statement mentions no exceptional zero, no Siegel zero, no zero-free region, and no arithmetic progression: it is exactly the single inequality Cq−ε<Re⁡ L(1,χ)C q^{-\varepsilon} < \operatorname{Re}\, L(1,\chi)Cq−ε<ReL(1,χ) under the three hypotheses above, for a constant C>0C > 0C>0 depending only on ε\varepsilonε.

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