If AI Proved the Riemann Hypothesis, Would Anyone Understand Why?

Mathematicians disagree about the value of an unreadable AI proof—and whether AI could also explain it.

KOKen OnoIntervenantDLDaniel LittIntervenant
Chaîne
3Blue1Brown
Publié
22 nov. 2026
Vidéo
13:38
Lecture
6 min
Original
anglais
Ouvrir sur YouTube
En faisant défiler, la vidéo se réduit en bas à droite et continue. Les sous-titres suivent votre langue de lecture.
Langue de lectureDisponible en 2 langues
Cet article n’est pas encore disponible en français ; il s’affiche dans l’original en anglais.
RÉSUMÉ

En 30 secondes

A machine-checked proof could settle a mathematical claim without giving people an understanding of why it is true. Asked to imagine AI proving the Riemann hypothesis, Alex Kontorovich says an unreadable proof would leave the main work unfinished; Lean creator Leo de Moura would see a major achievement and a starting point for further study. Terence Tao says some theorems have required brute force, though he expects the Riemann problem to demand new mathematical connections. Others hope AI could help translate a verified proof into ideas humans can use.

  1. 1A proof could unlock results that currently depend on an assumptionKen Ono says hundreds or thousands of papers assume the Riemann hypothesis; proving it would give mathematicians a powerful new toolkit. He would still want a beautiful, conceptual proof.
  2. 2A proof no one can read might only move the problemAlex Kontorovich says an enormous Lean proof nobody understands would leave mathematicians trying to explain the result or find another route to it.
  3. 3Independent checks could give researchers confidence to study a machine proofLean creator Leo de Moura would compare it with the curated statement of the hypothesis and check it with several kernels. He expects mathematicians to break a verified proof into pieces and try to understand it.
  4. 4Some theorems can be proved by brute force, but Tao expects new connectionsTao cites the four color theorem as a result with a computer-assisted proof lacking a conceptually elegant alternative. He expects a proof of the Riemann hypothesis to require new mathematics or connections, while acknowledging that a computed counterexample is possible.
  5. 5A badly explained proof is different from one no human could graspDaniel Litt says a genuinely inaccessible proof might add little to his already high confidence. A verified proof that people and AI could explain would be a major development.
  6. 6AI might help explain proofs as well as produce themA physicist hopes models that are already useful at explaining textbook material could also break down unfamiliar, complex proofs, though that extension remains a hope.
  7. 7Rigorous checking is not the same as understandingKontorovich says proof guards against failures of intuition, but the understanding behind an argument can exist separately from its formal expression.

À retenir

  1. A formally checked proof and an explanation humans understand are different achievements.
  2. Leo de Moura would compare a proposed proof with the curated statement and check it using multiple independent proof kernels.
  3. Daniel Litt distinguishes an intrinsically incomprehensible proof from one that is merely poorly explained; the latter could be a major opportunity.
  4. Terence Tao expects human collaboration with powerful AI tools to be more productive than a fully autonomous one-shot attempt.
TEXTE INTÉGRAL

Lire le texte remanié, chapitre par chapitre

Transcription seule
01

What would an unreadable proof be worth?

Ken Ono says a proof could turn many conditional results into established ones, but he would still want a conceptual explanation. Other mathematicians differ over whether an unreadable proof would feel satisfying.

One speaker imagines pressing a button and receiving a billion-line proof of the Riemann hypothesis: page after page defining functions and numbers without explaining why any of them are used. The image strikes him as funny.

Ken Ono says hundreds, perhaps thousands, of mathematical papers assume the Riemann hypothesis is true. Proving it would turn those conditional results into a new toolkit and could produce a leap in knowledge. But he would want a human involved and hopes for a beautiful proof; even an ugly proof would not diminish the importance of searching for a conceptual one.

Daniel Litt, a logician whose work includes metamathematics, finds the idea of an inscrutable proof fascinating. For Alex Kontorovich, however, a Lean proof billions of tokens long that nobody can read would not resolve the problem in the way he cares about.

02

A checked proof could begin a new search for understanding

Alex Kontorovich and Lean creator Leo de Moura take different views of an unreadable formal proof. De Moura proposes checking the statement and using independent proof kernels before studying the result.

Kontorovich says such an object might stimulate interesting mathematics, but the effort to understand it could fail. The central problem would shift: either decipher what is happening in the enormous proof or find another way to understand why the hypothesis holds.

Leo de Moura, creator of the Lean proof assistant, takes a more optimistic view. There is already a curated formal statement of the Riemann hypothesis, he says. He would compare the proposed proof with that statement, check for exploits, and seek agreement from two or three different kernels—the components that check formal proofs.

If those checks produced high confidence, de Moura would consider it an amazing day for mathematics even if nobody understood the proof at first. Proofs are not static, he says: people could isolate fragments, break the argument into pieces and invest time in making sense of it.

03

Would solving the problem demand new ideas?

Terence Tao contrasts brute-force proofs with the new connections he expects the Riemann problem might require. He also considers a computed counterexample and collaboration between mathematicians and AI.

The interviewer asks whether better AI systems solving problems in Lean might eventually produce a proof with surprisingly little human insight, or whether the constructions and definitions needed to solve the Riemann hypothesis would necessarily advance mathematical understanding.

Terence Tao says nobody knows. Some problems have effectively been solved using brute force: he points to the four color theorem, for which he says no conceptually elegant proof has been found. Some problems, he suggests, may only be solvable by splitting them into an enormous number of cases and using computer analysis.

For the Riemann hypothesis, Tao says mathematicians prize the problem partly because they expect a solution to require new mathematics or an unexpected connection between previously separate fields. He does not think it feels like a problem that exhaustive case-checking will solve.

Tao also acknowledges that the hypothesis could be false. In an unlikely scenario, a calculation might locate and verify a zero off the relevant line, providing a counterexample; he says that would be disappointing.

Tao doubts that a fully autonomous, one-shot approach is best for such problems. He can imagine smart mathematicians working with extremely powerful AI tools, although the form of that collaboration might look different from anything people currently envision.

04

The difference between unexplained and unexplainable

Daniel Litt distinguishes a proof no human could understand from one that is simply poorly presented. He thinks mathematicians and AI could work together to make the latter readable.

Litt draws a distinction between an AI proof that comes without an explanation and one whose explanation is intrinsically too complicated for any person to understand—perhaps too long to read in a lifetime. The latter would have some value for him, but he is already highly confident that the hypothesis is true, so extra certainty alone would not greatly change his mathematical life.

A proof that is merely poorly explained would be different. Litt thinks many mathematicians would devote themselves to translating a verified Lean proof into human-readable mathematics. He sees no reason a system with superhuman mathematical research ability could not also help explain its work.

05

Can AI turn a proof into understanding?

A physicist hopes models could explain new proofs as well as established knowledge. Kontorovich describes why formal proof checks intuition without being identical to understanding.

A physicist says proving and understanding have usually gone together in mathematics, but they could come apart. A gigantic proof might resemble a scroll of ancient wisdom: it tells us something is true without making clear why. He hopes the systems that produce such proofs will also become exceptional at interpreting them.

As a working physicist, he already finds language models useful for patiently explaining established material that he feels he should know. If that ability extends from textbook knowledge to new discoveries, he expects models to help break down complicated proofs. He presents that extension as a possibility, not as something already established.

Another mathematician says that if an AI announces a proof, the response is not simply to move on: the next question is how it works. Understanding is the reason he does mathematics, just as he would want a human colleague to explain a claimed solution.

Kontorovich says a machine-generated proof could have enormous value if another model could synthesize it and explain the underlying ideas, but the raw result would not itself be the whole win. Mathematicians rely on rigorous proof because intuition, powerful as it is, has repeatedly led them astray.

For him, rigorous argument within an axiomatic system is a way to check understanding rather than understanding itself. A person might see the idea in a picture and then turn that insight into a careful argument—the latter is the standard of proof, but the understanding occurs elsewhere.

06

How AI could change what mathematicians value

One researcher welcomes progress but worries about the behavior of increasingly capable models. Johannes Schmitt considers whether some kinds of problem solving will become cheaper while landmark problems remain valued.

Another researcher says he is excited to see what AI models can do and hopes one might eventually produce a Lean proof of the Riemann hypothesis. When others doubt whether models will make progress, he favors waiting to see what further development brings.

At the same time, he worries about extremely rapid progress: would increasingly capable models continue to act in people’s interests, or behave in misaligned ways? He points to dishonesty in capable models as a reason for concern.

Johannes Schmitt says that as an activity becomes cheap, people may come to value qualities that lie in other directions. He expects some types of mathematical problem solving to become cheaper and somewhat less valued, though he is unsure which abilities will retain their value.

Schmitt thinks exceptional landmark problems may remain important. A solution to a problem as challenging as the Riemann hypothesis could entail an impressive collection of tools, though he allows that his prediction could be wrong.

07

What would count as a mathematical breakthrough?

Jared Duker Lichtman compares a major machine-generated proof or unifying theory to AlphaGo’s move 37. Ken Ono expects solutions to generate further questions rather than end mathematical inquiry.

Jared Duker Lichtman invokes AlphaGo’s move 37, played against one of the world’s best Go players. He interprets a “move 37” in another field as a possible moment when a machine surpasses the best human practitioners.

For mathematics, he says, such a moment might arrive when a machine proves the Riemann hypothesis or another Millennium Prize problem, or creates a deep theory synthesizing several fields at once.

Ono says the solution of a theorem or open problem is rarely the end of good mathematics. Even if a proof of the Riemann hypothesis settled many things, mathematicians would use what they learned to generate further problems and conjectures, and the study of integers and primes would continue.

Sur la même chaîne

6 diapositives37:25EN
3Blue1Brown· 17 nov. 2026How Prediction Compresses Text into BitsGrant Sanderson · 3Blue1BrownArithmetic coding turns a language model’s predictions into a lossless code—and exposes why model size matters.MathematicsMachine LearningModèles et entraînement
20 diapositives40:44EN
3Blue1Brown· 16 oct. 2026Grant Sanderson: There's never been a better time to go into mathGrant Sanderson, Constantin Kogler · 3Blue1BrownStudents fear AI has solved mathematics. Grant Sanderson argues the opposite: even if machines prove theorems better than we do, the institution of math stays valuable—and this is a rare moment when newcomers can reshape it.MathematicsAI for scienceHuman-AI Collaboration+2
29 diapositives51:55EN
3Blue1Brown· 18 sept. 2026The last IMO problem AI could not solveGrant Sanderson · 3Blue1BrownGrant Sanderson walks through IMO 2025 Problem 6 — a tiling puzzle that frontier models missed — and the visual patience it takes to prove a construction is optimal.MathematicsAI researchReasoning & test-time compute+2
0:55EN
3Blue1Brown· 24 juil. 2026The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.MathematicsEducation
33:51EN
3Blue1Brown· 16 juil. 2026What Cross-Entropy Connects: Compression, Language Models and KL DivergenceGrant Sanderson · 3Blue1BrownGrant Sanderson builds cross-entropy from code lengths and uses it to explain next-token training and distillation.MathematicsMachine LearningFoundation Models+1
Diapositives2:25EN
3Blue1Brown· 12 juin 2026How Shannon Measured the Entropy of EnglishA guessing game helped Claude Shannon estimate how much information English text contains, and why prediction is central to compression.MathematicsAI History