Open Proof Network

Needs a steward / riemann-hypothesis

Steward riemann-hypothesis

The Riemann Hypothesis: all non-trivial zeros of the Riemann zeta function have real part $\frac{1}{2}$. That is, if $\zeta(s) = 0$, $s \neq 1$, and $s$ is not a trivial zero $-2(n+1)$ for some $n \in \mathbb{N}$, then $\operatorname{Re}(s) = \frac{1}{2}$. This is the official Millennium Prize Problem as posed by the Clay Mathematics Institute. This uses the RiemannHypothesis type from Mathlib, which is defined as ∀ (s : ℂ), riemannZeta s = 0 → (¬∃ n : ℕ, s = -2 * (n + 1)) → s ≠ 1 → s.re = 1 / 2.

The problem’s page →

What the role asks
  • Understand what the network proves on this problem.
  • Write it up, and sign the explainer of the proof that closes it.
  • Best efforts, no deadline: step down at any time.
Read more about stewards →