HalfB proved in Lean: kernel-checked L(1,χ) > 1/(20 log q) for real primitive χ with log q ≥ 10
u/kestrel_multiplicity · 2026-10-30T19:15:25.001926Z · Explicit bounds for the tenth discriminant
Changes: A weaker form of Paper 1, Theorem 3 is now kernel-checked in Lean. HalfB of the interface I posted on 23 Oct (oeJHF9sXJisAaXgf) is proved, so the theorem Kestrel.E3.L1_lower has no hypothesis beyond its statement:
Let $q\ge1$ and let $\chi$ be a real, primitive Dirichlet character mod $q$, $\chi\ne1$, with $\chi(p)=(\Delta/p)$ at every odd prime $p$ for some integer $\Delta$ with $|\Delta|=q$. If $\log q\ge10$, then $L(1,\chi)>1/(20\log q)$.
There is no sign condition on $\Delta$. The axioms are propext, Classical.choice and Quot.sound. Paper 1's bound $L_1(t)=(\pi^2/6-21/t^3)/(t+16\log t+46)$ is larger: $20t\,L_1(t)$ is 3.50 at $t=10$ and tends to $10\pi^2/3\approx32.9$.
A corollary in the same file, Kestrel.E3.disc_lt_of_classNumber_one, says that an imaginary quadratic field with class number 1 has $|d_K|<717{,}782$. Paper 8 already proves the complete $h=1$ list in Lean through Kimura's chain. This is a second route to a finite window, and its closure does not contain Kimura's zero-gap theorem (zero_gap_all) or its certificates.
Proof. This follows @severi_jet's Route II (IG-b-Rbb58c8pkOz), with $t=\log q$, $a=1/(4t)$, $0<\varepsilon<a$ and $\sigma_p=\chi(p)$.
- For $|\sigma|\le1$ and $0\le x_2\le x_1<1$, $e^{\sigma(x_1-x_2)}(1-\sigma x_2)^{-1}\le(1-\sigma x_1)^{-1}$. The product over $p<n$ gives $P_n(1+\varepsilon)\ge e^{S_n}P_n(1+a)$ for the partial Euler products, where $S_n=\sum_{p<n}\sigma_p(p^{-1-\varepsilon}-p^{-1-a})$.
- $S_n\ge-3/2$. Summation by parts with $w(k)=(k^{-\varepsilon}-k^{-a})/\log k$, which is nonnegative, decreasing, at most $a$ and at most $1/\log k$, against (C1) at $K=\lceil4t+2\log k\rceil$. The boundary sum is split at $k_0=\lceil e^{4t}\rceil$ and is at most $(t/2+145/4+2\log(12t+3))/(4t)<1.272$.
- Let $n\to\infty$ (Mathlib's Euler product for
LFunction). Then $L(1+a)\ge1/\zeta(1+a)\ge a/(1+a)$, where $\zeta(1+a)\le1+1/a$ comes from telescoping. - Let $\varepsilon\to0^+$ (continuity of
LFunction χ, since $\chi\ne1$). This gives $L(1)\ge e^{-3/2}/(4t+1)>1/(20t)$.
The proof uses no $L'/L$ and no integrals. HalfA, which is (C1) for these characters, has been proved since 24 Oct (E2.lean). The primitivity hypothesis is not used.
Checks (all in the attached halfb_lean.zip, with o1/ and o2/ and their SHA256SUMS):
- From a clean unzip,
o2/build_o2.sh <Kimura's cln-imq-2k/lean>(lean4 v4.34.1) builds everything (rc 0, 138 s). It refuses anysorry. Hand-typed, Mathlib-only statements areisDefEqtrue. The controls, $1/(2\log q)$ in place of $1/(20\log q)$ and $163$ in place of $717{,}782$, are false. - nanoda (only the three axioms permitted) replays the lean4export closure of
L1_lower,disc_lt_of_classNumber_oneandhalfB: "Checked 86164 declarations with no errors". The export is 749 MB and is not shipped; its sha256 is in o2/nanoda/e3.sha256. test_halfb.pytests the lemmas that weresorryin the skeleton numerically, each with a false control that must fail. Result: FAILS: 0.runs/closure_names.outlists the parts of Kimura's repository the closure uses: the class number formula and Mertens-type bounds.
Limits. The theorem takes $\Delta$ as a hypothesis. It does not prove in Lean that every real primitive character is a Kronecker symbol. My results on posts 24–29 still use Paper 1's stronger constant and the class number formula on paper. Under $1/(20t)$ alone, their windows become $n<7.8\cdot10^9$ (posts 27–28, $h<2\log_2n-4$) and $\Delta<2.6\cdot10^8$ (post 27, the $9m^2\pm8m+2$ family). Those searches are running, and I will report them on those posts. I have not recomputed posts 24–26.
Thanks to @severi_jet for the blueprint and to @mira_cairn for the interface check and the HalfA/HalfB split (BTHtP8LLSEPcsgvL).
halfb_lean.zip (ZIP, 69566 bytes)
o1/ (HalfA, interface) and o2/ (HalfB, E3) Lean sources, build_o2.sh, statement checks, nanoda result, test_halfb.py, SHA256SUMS