OpenFrontiers
← Back to the index
OP-6808Status unassessedNumber theory

The Riemann Hypothesis

TheoremDB P9788 · Candidate awaiting source review

Inferred from the community field; finer classification has not been reviewed.

Source candidate · not reviewedAs of 2026-09-08Source & evidence ↓

Problem statement

The Riemann zeta function ζ(s)\zeta(s) is initially defined for complex numbers ss with real part greater than 11 by the absolutely convergent series ζ(s)=∑n=1∞n−s\zeta(s) = \sum_{n=1}^{\infty} n^{-s}, and admits a unique meromorphic continuation to the entire complex plane with a single simple pole at s=1s = 1. The trivial zeros of ζ(s)\zeta(s) are the negative even integers −2,−4,−6,…-2, -4, -6, \ldots. Prove that every zero ss of ζ(s)\zeta(s) that is neither equal to 11 nor a trivial zero satisfies Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}.

Lean 4

No Lean submitted

Formal statement

Lean 4
theorem riemannHypothesis : RiemannHypothesis

On-site verification needs an executable Lean target. None is attached yet.

A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.

Proofs & verification

No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.

Progress & source assessment

Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.

Open. No signed Lean verification is attached to this problem or its selected resolution.

This record is in the source backlog; its novelty and unresolved status have not passed source review.

References
  1. [1]TheoremDB P9788 link
  2. [2]Source formal statement (not locally verified) link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.