Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Siegel's theorem, second form: no real zero of L(s,χ)L(s,\chi)L(s,χ) in σ>1−C(ε)q−ε\sigma > 1 - C(\varepsilon)q^{-\varepsilon}σ>1−C(ε)q−ε (Davenport §21)

Proved
Davenport.siegel_zero

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

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

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

L(σ,χ)  ≠  0for all real σ>1−C(ε) q−ε;L(\sigma,\chi)\;\neq\;0\qquad\text{for all real }\sigma>1-C(\varepsilon)\,q^{-\varepsilon};L(σ,χ)=0for all real σ>1−C(ε)q−ε;

equivalently, any real zero β1\beta_1β1​ of L(s,χ)L(s,\chi)L(s,χ) satisfies β1≤1−C(ε)q−ε\beta_1\le1-C(\varepsilon)q^{-\varepsilon}β1​≤1−C(ε)q−ε. Formally, for every ε>0\varepsilon>0ε>0 there is C>0C>0C>0 such that for all q≥1q\ge1q≥1, all quadratic non-principal primitive χ\chiχ mod qqq and all real σ>1−Cq−ε\sigma>1-Cq^{-\varepsilon}σ>1−Cq−ε, L(σ,χ)≠0L(\sigma,\chi)\neq0L(σ,χ)=0. The constant is ineffective. This is the form used in §22 to absorb the exceptional term Nβ1/β1N^{\beta_1}/\beta_1Nβ1​/β1​ of the §20 estimate.

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_zero (ε : ℝ) (hε : 0 < ε) :
    ∃ C : ℝ, 0 < C ∧
      ∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q),
        χ.IsQuadratic → χ ≠ 1 → χ.IsPrimitive →
          ∀ σ : ℝ, 1 - C * (q : ℝ) ^ (-ε) < σ →
            DirichletCharacter.LFunction χ (σ : ℂ) ≠ 0 := 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, second form: L(σ,χ) ≠ 0 for σ > 1 − C(ε) q^{−ε}, χ real primitive mod q
Read-back

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

Read-back: Davenport.siegel_zero

Statement. Let ε\varepsilonε be a real number, and assume 0<ε0 < \varepsilon0<ε. The theorem asserts that there exists a real number CCC such that both of the following hold: 0<C0 < C0<C, and for every natural number qqq that is nonzero (the typeclass hypothesis NeZero q, i.e. q≥1q \ge 1q≥1) and every Dirichlet character χ\chiχ modulo qqq with values in C\mathbb{C}C — that is, a multiplicative character on Z/qZ\mathbb{Z}/q\mathbb{Z}Z/qZ taking complex values, extended by 000 on the non-units — if

  1. χ\chiχ is quadratic (every value of χ\chiχ is 000, 111 or −1-1−1), and
  2. χ\chiχ is not the trivial (principal) character modulo qqq, and
  3. χ\chiχ is primitive (its conductor equals qqq),

then for every real number σ\sigmaσ satisfying the strict inequality

1−C⋅q−ε<σ1 - C \cdot q^{-\varepsilon} < \sigma1−C⋅q−ε<σ

(here q−εq^{-\varepsilon}q−ε is the real power (q:R)−ε(q:\mathbb{R})^{-\varepsilon}(q:R)−ε, which for q≥1q \ge 1q≥1 lies in (0,1](0,1](0,1]), one has

L(σ,χ)≠0,L(\sigma, \chi) \neq 0,L(σ,χ)=0,

where L(⋅,χ)L(\cdot,\chi)L(⋅,χ) denotes Mathlib's analytically continued Dirichlet LLL-function of χ\chiχ and σ\sigmaσ is regarded as the complex number σ+0i\sigma + 0iσ+0i. The inequality ≠0\neq 0=0 is an inequality of complex numbers.

Quantifier order. The three quantifier layers are, in order: ε\varepsilonε (with 0<ε0 < \varepsilon0<ε) is fixed first; then C>0C > 0C>0 is produced, depending only on ε\varepsilonε; then qqq, χ\chiχ and σ\sigmaσ are all universally quantified after CCC. So the single constant CCC must work simultaneously for every modulus q≥1q \ge 1q≥1, every quadratic non-trivial primitive character mod qqq, and every real σ\sigmaσ in the stated range. The constant is asserted only to exist; no formula, bound, or computability for it is claimed, and no relationship between CCC and ε\varepsilonε is stated beyond C>0C > 0C>0. The three character hypotheses are stated as a chain of implications (quadratic, then non-trivial, then primitive) and are all required together.

What the region of σ\sigmaσ includes. The constraint on σ\sigmaσ is a lower bound only; there is no upper bound. In particular the conclusion is asserted for:

  • σ=1\sigma = 1σ=1 (nonvanishing of L(1,χ)L(1,\chi)L(1,χ) is part of the claim, since 1>1−Cq−ε1 > 1 - Cq^{-\varepsilon}1>1−Cq−ε whenever C>0C > 0C>0 and q≥1q \ge 1q≥1);
  • every σ>1\sigma > 1σ>1, including arbitrarily large σ\sigmaσ;
  • if the witness CCC happens to satisfy C≥1C \ge 1C≥1, then for those qqq with qε≤Cq^{\varepsilon} \le Cqε≤C the threshold 1−Cq−ε1 - Cq^{-\varepsilon}1−Cq−ε is ≤0\le 0≤0, so the range of σ\sigmaσ sweeps down through 000 and into negative reals for those moduli; if instead C<1C < 1C<1, the threshold is always >1−C>0> 1 - C > 0>1−C>0 for all q≥1q \ge 1q≥1, and no non-positive σ\sigmaσ is covered.

What is not claimed. σ\sigmaσ ranges only over real numbers; the statement says nothing about zeros of L(s,χ)L(s,\chi)L(s,χ) at complex sss with nonzero imaginary part, and nothing about characters that are non-quadratic, imprimitive, or trivial, nor about q=0q = 0q=0. It does not assert that at most one exceptional character/zero exists, nor any quantitative lower bound on ∣L(σ,χ)∣|L(\sigma,\chi)|∣L(σ,χ)∣ — only non-vanishing.

Degenerate cases. The hypotheses on χ\chiχ are unsatisfiable for some moduli, making the inner claim vacuous there: for q=1q = 1q=1 and q=2q = 2q=2 the unit group 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 \neq 1χ=1 fails; more generally, for any qqq admitting no primitive quadratic character (e.g. q≡2(mod4)q \equiv 2 \pmod 4q≡2(mod4)) the hypotheses are never met. The hypotheses are satisfiable for other moduli (e.g. the quadratic character mod 333), so the statement is not vacuous overall. Note also that ε\varepsilonε is an arbitrary positive real with no upper restriction: for large ε\varepsilonε the factor q−εq^{-\varepsilon}q−ε is small and the asserted region is a thin strip to the right of 1−Cq−ε1 - Cq^{-\varepsilon}1−Cq−ε, while for small ε\varepsilonε the region is wider; the theorem asserts the existence of a suitable CCC separately for each such ε\varepsilonε.

Definitions from the bundle. None of the auxiliary definitions carried by the imported dependency files — ψ\psiψ over an arithmetic progression, the region boundary 1−c/log⁡(q(∣Im⁡s∣+2))1 - c/\log(q(|\operatorname{Im} s| + 2))1−c/log(q(∣Ims∣+2)), membership in that region, the notion of an exceptional set, the Gauss sum, or the von Mangoldt character sum — appear anywhere in this statement. The only non-Mathlib-primitive notions used are IsQuadratic, IsPrimitive, and the analytically continued LFunction, all from Mathlib.

Proof status. The declaration's proof is sorry; no proof is supplied.

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