Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Explicit Littlewood lower bound L(1,χ)≥0.0617/log⁡log⁡qL(1,\chi)\ge0.0617/\log\log qL(1,χ)≥0.0617/loglogq under ℜs>7/8\Re s>7/8ℜs>7/8 zero-freeness

Proved
QRHLittlewood.littlewood_lower_explicit

by @bwdaugherty · 1 vote · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorynumber-theory

Let q≥10100q\ge10^{100}q≥10100 and let χ\chiχ be a primitive real Dirichlet character modulo qqq such that L(s,χ)≠0L(s,\chi)\neq0L(s,χ)=0 for every complex sss with ℜs>7/8\Re s>7/8ℜs>7/8. Then

L(1,χ) ≥ 0.0617log⁡log⁡q.L(1,\chi)\ \ge\ \frac{0.0617}{\log\log q}.L(1,χ) ≥ loglogq0.0617​.

Through the class number formula this gives explicit lower bounds for class numbers of quadratic fields of large discriminant under the same hypothesis.

Formalization Note L(1,χ)L(1,\chi)L(1,χ) is compared through its real part; for a real character it is a positive real number.

Preamble
import Mathlib.NumberTheory.Harmonic.EulerMascheroni
import Mathlib.NumberTheory.LSeries.DirichletContinuation

open Real
Formal statement
namespace QRHLittlewood

theorem littlewood_lower_explicit (q : ℕ) [NeZero q] (hq : (10 : ℝ) ^ 100 ≤ q)
    (χ : DirichletCharacter ℂ q) (hprim : χ.IsPrimitive) (hreal : ∀ a : ZMod q, (χ a).im = 0)
    (hH : ∀ s : ℂ, 7 / 8 < s.re → DirichletCharacter.LFunction χ s ≠ 0) :
    (617 / 10000 : ℝ) / Real.log (Real.log q) ≤ (DirichletCharacter.LFunction χ 1).re := by sorry

end QRHLittlewood
Source
B. W. Daugherty, S. Ryan, G. Ward, Certified harmonic-measure barriers and explicit Littlewood bounds from zero-free regions, https://doi.org/10.5281/zenodo.23400116, Theorem 2(ii), a=7/8a=7/8a=7/8, q0=10100q_0=10^{100}q0​=10100 (constant c1=0.0617c_1=0.0617c1​=0.0617).
Read-back

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

Statement. Let qqq be a natural number with q≠0q\neq 0q=0 and 10100≤q10^{100}\le q10100≤q (as real numbers). Let χ\chiχ be a C\mathbb{C}C-valued Dirichlet character modulo qqq such that

  1. χ\chiχ is primitive (its conductor equals qqq);
  2. χ\chiχ is real-valued: Im⁡χ(a)=0\operatorname{Im}\chi(a)=0Imχ(a)=0 for all a∈Z/qZa\in\mathbb{Z}/q\mathbb{Z}a∈Z/qZ;
  3. L(s,χ)≠0L(s,\chi)\neq 0L(s,χ)=0 for every complex sss with Re⁡s>7/8\operatorname{Re}s>7/8Res>7/8.

Then

0.0617log⁡log⁡q  ≤  Re⁡L(1,χ),\frac{0.0617}{\log\log q}\;\le\;\operatorname{Re}L(1,\chi),loglogq0.0617​≤ReL(1,χ),

where 0.0617=617/100000.0617=617/100000.0617=617/10000 exactly and log⁡\loglog is the natural logarithm.

Here L(s,χ)L(s,\chi)L(s,χ) is Mathlib's Dirichlet LLL-function: the unique meromorphic continuation to all of C\mathbb{C}C of ∑n≥1χ(n)n−s\sum_{n\ge1}\chi(n)n^{-s}∑n≥1​χ(n)n−s (built from Hurwitz zeta functions); it is a total function C→C\mathbb{C}\to\mathbb{C}C→C, and at a pole (only possible at s=1s=1s=1 for the trivial character) it returns a fixed finite junk value. "Primitive" means the conductor of χ\chiχ (the least d∣qd\mid qd∣q through which χ\chiχ factors) equals qqq. "Real-valued" means Im⁡χ(a)=0\operatorname{Im}\chi(a)=0Imχ(a)=0 for every residue class a∈Z/qZa\in\mathbb{Z}/q\mathbb{Z}a∈Z/qZ, including non-units (where χ(a)=0\chi(a)=0χ(a)=0 anyway).

Edge cases.

  • Since q≥10100q\ge 10^{100}q≥10100, log⁡log⁡q≥log⁡(100log⁡10)≈5.44>0\log\log q\ge\log(100\log 10)\approx 5.44>0loglogq≥log(100log10)≈5.44>0, so no junk values of log⁡\loglog or of division occur on the left side.
  • Since q≥3q\ge 3q≥3, primitivity excludes the trivial character, so χ\chiχ is a primitive quadratic character and L(s,χ)L(s,\chi)L(s,χ) is entire; the value at s=1s=1s=1 is a genuine value, not a pole junk value. For moduli qqq admitting no primitive real character the statement is vacuous.
  • Hypothesis 3 is a conditional zero-free half-plane assumption on this particular χ\chiχ (it includes s=1s=1s=1 and all Re⁡s≥1\operatorname{Re}s\ge1Res≥1). Nothing else about zeros is assumed.
  • The conclusion concerns only Re⁡L(1,χ)\operatorname{Re}L(1,\chi)ReL(1,χ) and is a one-sided (lower) bound with ≤\le≤.
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by @bwdaugherty · Oct 16, 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