The Riemann Hypothesis from the right half-plane
drafted
Statement
Suppose that for each with and . Then the Riemann Hypothesis is true: each zero of that is not a trivial zero and not has .
Lean
theorem Formalism.VW.rh_of_right (hz : ∀ s : ℂ, 1 / 2 < s.re → s ≠ 1 → riemannZeta s ≠ 0) : RiemannHypothesis
The declaration is in Formalism/GammaFactorNonvanishing/RhOfRight.lean, line 5. Its page has the full list of what it uses and what uses it, and a link to the source.
Proof
Let be a zero of , not a trivial zero, with . Compare with . There are three cases.
Case . The hypothesis gives . This is a contradiction, so this case does not occur.
Case . This is the claim.
Case . We show that this case does not occur. Put . Then .
First, , because (Mathlib, riemannZeta_zero). So . Also is not , because .
The functional equation of Mathlib (riemannZeta_one_sub) says: if is not and , then
Here , so the left side is . We show that each factor on the right is not zero.
- , and because .
- , because (Mathlib,
Complex.Gamma_ne_zero_of_re_pos). - , by the hypothesis, because and .
- . Suppose that it is zero. Then for an integer , so and . If , then , which is not less than . If , then , which we excluded. If , then is a trivial zero, which we excluded.
So the right side is not zero, but the left side is zero. This is a contradiction.
Notes
This step is classical and uses only Mathlib. The Lean proof follows the argument above line by line. The case split on and the conversions between integers, natural numbers and complex numbers take most of its lines.
Mathlib writes the functional equation with and , not with the completed zeta function . The two forms are equivalent.
Uses
The proof cites no other step.
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.