Riemann hypothesis
A famous unsolved conjecture in mathematics about the location of the nontrivial zeros of the Riemann zeta function lying on the critical line.
As defined in 99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity
Other definitions
Conjecture that all nontrivial zeros of the Riemann zeta function lie on the critical line where the real part is one half.
Lex Fridman Podcast #503 - AI Crisis in Math
Where it comes up · 10
- Dwarkesh Patel Podcast - Grant Sanderson – AI and the future of math3 claims
- Dwarkesh Patel Podcast - Terence Tao – Kepler, Newton, and the true nature of mathematical discovery3 claims
- Conversations with Tyler - Terence Tao2 claims
- Lex Fridman Podcast #503 - AI Crisis in Math2 claims
- Terence Tao2 claims
- 99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity2 claims
- Terence Tao – How the world’s top mathematician uses AI2 claims
- Grant Sanderson (@3blue1brown) — Past, present, & future of mathematics1 claim
and 2 more
Most important claims · 10 of 19Search all claims for “Riemann hypothesis” →
- Over time mathematicians developed a heuristic but extremely accurate conceptual model that the prime numbers, while deterministic and not actually random, behave like a pseudo-random set with a density of 1/log(X); this random model underpins beliefs in the twin prime conjecture and the Riemann hypothesis, and is why prime-based cryptography is believed secure.Dwarkesh Patel Podcast - Terence Tao – Kepler, Newton, and the true nature of mathematical discovery
- Kontorovich explains the Riemann hypothesis as the claim that all nontrivial zeros of the zeta function lie on the critical line with real part one half; the zeros act like frequencies that reconstruct the prime distribution, so the RH says all these waves share the same amplitude, like an orchestra with every instrument at equal volume.Lex Fridman Podcast #503 - AI Crisis in Math
- Some problems may only be solvable by splitting into an enormous number of cases and doing brute-force, uninsightful computer analysis—the four color theorem is the famous example, for which no conceptually elegant proof has been found and maybe never will be—so it is genuinely unknown whether an AI proof of something like the Riemann hypothesis would necessarily advance human understanding or just be incomprehensible.Dwarkesh Patel Podcast - Terence Tao – Kepler, Newton, and the true nature of mathematical discovery
- Gödel's incompleteness theorem practically doesn't come up for working mathematicians because the constructed contradiction has the same self-referential flavor as 'this statement is a lie'—a pathology rarely encountered in natural questions; for problems like the Riemann hypothesis or twin primes, mathematicians strongly expect there is an answer, and the theorem's relevance sits only at the edges of theory (e.g. Paris–Harrington).Grant Sanderson (@3blue1brown) — Past, present, & future of mathematics
- If the Riemann hypothesis were proven false, it would be a serious blow to the random model of the primes, implying a secret hidden pattern; since one unknown pattern probably implies more, and patterns can lead to cryptographic exploits, mathematicians would rapidly abandon prime-based cryptography.Dwarkesh Patel Podcast - Terence Tao – Kepler, Newton, and the true nature of mathematical discovery
- The Riemann hypothesis precisely quantifies the apparently random distribution of prime numbers, and many results in number theory are conditional on it, so their strength increases if it is true and they say nothing otherwise.Conversations with Tyler - Terence Tao
- Because NP-complete problems are universal, one can encode enormities into them — designing millions of boxes that fit into a car trunk if and only if there is a short proof of the Riemann hypothesis, or such that fitting them requires breaking a cryptographic code — which is why an easy intuition that real-world NP-complete instances are easy is misleading: if P equaled NP you could mine billions of dollars of Bitcoin or compress all of Wikipedia optimally, which would require deeply understanding human knowledge.99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity
- Most claims mathematicians believe true (like the Riemann hypothesis) already have fairly compelling informal heuristic arguments — the Riemann hypothesis should hold unless the primes have some surprising periodic structure — so formalizing heuristic estimation would not shock mathematicians, though perhaps 10% of accepted compelling heuristic arguments would turn out not quite right if formalized.Paul Christiano — Preventing an AI takeover
- A Riemann solution could come as a lightning bolt connecting two fields, a new mountain of theory, or brute-force hustle over a very long chain of reasoning; these differ in how easily humans can digest the result, with brute force raising the worst digestion problem.Dwarkesh Patel Podcast - Grant Sanderson – AI and the future of math
- Kontorovich argues that mathematics is about understanding why something is true, so a bare fact that is true without an explanation contributes nothing to knowledge.Lex Fridman Podcast #503 - AI Crisis in Math