riemann

The Lean code claims a proof of the Riemann Hypothesis. This site has not checked the claim yet. See what is checked.

EveryCharacter from Green, VWin and HypsAlt

drafted

Statement

Assume three inputs. The Lean local name of each input is in parentheses.

  1. (hGh_G) The statement GlobalTheory.GLq.Green. For each prime gg, each label datum LL and each d>0d > 0, there is a map P↦τPP \mapsto \tau_P from polynomials over ℤ/g\mathbb{Z}/g to complex functions on GLd(𝔽g)\mathrm{GL}_d(\mathbb{F}_g) with three properties. For each prime label PP (a monic irreducible polynomial of degree dd with nonzero constant term), τP\tau_P is a cuspidal character attached to LL and PP, and τP(1)=∏i=1d−1(gi−1)\tau_P(1) = \prod_{i=1}^{d-1} (g^i - 1). The map is injective on prime labels. Each cuspidal character is τP\tau_P for some prime label PP.
  2. (hVh_V) The statement VWin, that is, VWinAt ψ 401 for each primitive Dirichlet character ψ\psi.
  3. (hh) A proof that the type HypsAlt N DefiniteSideCondition is nonempty, where N(𝒞)N(\mathcal{C}) is Closed 𝒞 fun Fm _ => LinkN Fm. HypsAlt is a record of 46 fields about a class 𝒜\mathcal{A} of families, a selection of bundles and many bounds. Closed 𝒞 P means: there is ε1>0\varepsilon_1 > 0 such that for each ε∈(0,ε1]\varepsilon \in (0, \varepsilon_1] there are thresholds such that PP holds for each family of 𝒞\mathcal{C} with parameter ε\varepsilon whose constants are above the thresholds. LinkN is a bound on a weighted count of twisted places.

Then EveryCharacter holds: for each N≥1N \geq 1, each Dirichlet character χ\chi modulo NN and each ss with Re⁡(s)>12\operatorname{Re}(s) > \tfrac12 and (χ≠1\chi \neq 1 or s≠1s \neq 1), the Dirichlet L-function has L(s,χ)≠0L(s, \chi) \neq 0.

Lean

theorem UpperTheory.Top.every_character_of_green_v_win (hG : GlobalTheory.GLq.Green) (hV : UpperTheory.Top.VWin) (h : Nonempty (_root_.GlobalTheory.Fc.HypsAlt (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) _root_.GlobalTheory.Fc.DefiniteSideCondition)) : UpperTheory.EveryCharacter

The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopPlug.lean, line 16. Its page has the full list of what it uses and what uses it, and a link to the source.

Proof

The proof has two steps.

Step 1. Primitive characters. The theorem zero_free_all_of_green_v_win takes hGh_G, hVh_V and hh and proves ZeroFreeAll. By definition, ZeroFreeAll is ZeroFreeOn fun _ => True. It says: for each primitive Dirichlet character ψ\psi (a value of the structure PChar, with a conductor N≥1N \geq 1) and each ss with Re⁡(s)>12\operatorname{Re}(s) > \tfrac12, L(s,ψ)≠0L(s, \psi) \neq 0. The theta matching chapter describes this proof. In short, it takes one record from hh. It turns hGh_G into a large implication TopShapeAlt by shape_closed_link_n_of_green. It feeds the 46 fields of the record into that implication and gets the statement TopG. Then zeroFreeAll_of_topG with λ=3/2\lambda = 3/2 gives ZeroFreeAll, and hVh_V supplies the hosts for each ψ\psi through supplyChi.

Step 2. All characters. The theorem imprimitive proves ZeroFreeAll → EveryCharacter. Let χ\chi be a Dirichlet character modulo NN and let χ∗\chi^* be the primitive character that induces χ\chi, with conductor q∣Nq \mid N. Mathlib gives the Euler product relation

L(s,χ)=L(s,χ∗)∏p∣N(1−χ∗(p) p−s),L(s, \chi) = L(s, \chi^*) \prod_{p \mid N} \bigl(1 - \chi^*(p) \, p^{-s}\bigr),

when χ∗≠1\chi^* \neq 1 or s≠1s \neq 1. This condition follows from the hypothesis χ≠1\chi \neq 1 or s≠1s \neq 1: if χ∗=1\chi^* = 1, then χ\chi is the trivial character, since χ\chi is the change of level of χ∗\chi^*. The first factor is not zero by ZeroFreeAll, applied to χ∗\chi^*. For each prime pp, ∣χ∗(p)∣≤1|\chi^*(p)| \leq 1 and ∣p−s∣=p−Re⁡(s)<1|p^{-s}| = p^{-\operatorname{Re}(s)} < 1. So ∣χ∗(p)p−s∣<1|\chi^*(p) p^{-s}| < 1, and the factor 1−χ∗(p)p−s1 - \chi^*(p) p^{-s} is not zero. A product of nonzero numbers is not zero.

The Lean term is imprimitive (zero_free_all_of_green_v_win hG hV h).

Notes

The branch does not take any theta input. The inputs ThetaIntegralsAgree and LocalMatching reach this proof only inside the record hh. See EveryCharacter from theta integrals and local matching.

The statement Green is about the characters of the finite groups GLd(𝔽g)\mathrm{GL}_d(\mathbb{F}_g). The step from it to a statement on Dirichlet L-functions is inside shape_closed_link_n_of_green and the record HypsAlt. This page does not follow that link.

ZeroFreeAll has no exception at s=1s = 1. For the trivial character modulo 11, L(s,1)L(s, 1) is the Riemann zeta function, which has a pole at s=1s = 1. In Mathlib the function DirichletCharacter.LFunction still has a value at s=1s = 1, so the statement is well formed. This page does not check how the chain proves the case s=1s = 1 for the trivial character. The step imprimitive never needs that case. It applies ZeroFreeAll at s=1s = 1 only when χ≠1\chi \neq 1, and then χ∗≠1\chi^* \neq 1.

The step imprimitive is a complete and short argument from Mathlib facts. The weight of this branch is in zero_free_all_of_green_v_win.

Uses

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: Formalism.MainNotions.LinkN.

Used by

Status

Drafted. The text follows the Lean code, but no person has checked it against the code with the rules of spec 05.7 yet. If you check it, tell us.

A model wrote the first draft (writer@claude-opus-5-5). A person checks it before its status goes up.

The source of this page. Markdown. Something is wrong? Report it.