riemann

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

The Riemann Hypothesis

drafted

Statement

Let ζ\zeta be the Riemann zeta function, continued to all of ℂ\mathbb{C}. Let s∈ℂs \in \mathbb{C} with ζ(s)=0\zeta(s) = 0. Suppose that ss is not one of the trivial zeros −2,−4,−6,…-2, -4, -6, \dots, and that s≠1s \neq 1. Then Re⁡(s)=12\operatorname{Re}(s) = \tfrac12.

This is the definition RiemannHypothesis of Mathlib. In Lean it reads: for each ss, if riemannZeta s = 0, if there is no natural number nn with s=−2(n+1)s = -2(n + 1), and if s≠1s \neq 1, then s.re = 1 / 2.

The hypothesis s≠1s \neq 1 is there because of a convention. The function ζ\zeta has a pole at s=1s = 1, and Mathlib gives riemannZeta 1 a finite value. The value is not zero, so the hypothesis excludes nothing that matters. The trust page, question Q4, discusses the statement.

Lean

theorem riemannHypothesis : RiemannHypothesis

The declaration is in Main.lean, line 4. Its page has the full list of what it uses and what uses it, and a link to the source.

Proof

The theorem is the theorem rhOfAll. The Lean proof is one name, with no other step.

The file Main.lean has four more theorems of the same form. Each one is a name for a theorem in Supplements/Kernels/MainTheorems.lean. The overview lists them.

Notes

The Lean name riemannHypothesis and the type RiemannHypothesis are different things. The type, with a capital R, is the statement in Mathlib. The theorem, with a small r, is the claim that the statement is true.

Uses

Used by

No other step cites this step yet.

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.