Number theory
RiemannHypothesis type from Mathlib, which is defined as
∀ (s : ℂ), riemannZeta s = 0 → (¬∃ n : ℕ, s = -2 * (n + 1)) → s ≠ 1 → s.re = 1 / 2. Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.Millennium.RiemannHypothesis
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "RiemannHypothesis.riemannHypothesis" := by
sorry
end Bounty
Original conjecture (Lean type)
RiemannHypothesisOriginal conjecture source: FormalConjectures/Millennium/RiemannHypothesis.lean
References
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.