AIYINGFrom AI Awareness to Accomplishment
Showing posts with label Proof Verification. Show all posts
Showing posts with label Proof Verification. Show all posts

Saturday, November 21, 2026

Did Claude Help Prove the Riemann Hypothesis? What Still Needs Checking

AIYING · PO Thinking Lab

Did Claude Help Prove the Riemann Hypothesis? What Still Needs Checking



By Ravindra Dastikop with ChatGPT · 21 November 2026

Mathematician Levent Alpöge, who works at Anthropic, says he used Claude to help develop a proof of the Riemann hypothesis. If independently verified, the proof would settle a problem dating back to 1859. On 21 November 2026, the Clay Mathematics Institute still listed the problem as unsolved.

Why the problem matters

Prime numbers turn up at irregular intervals. Mathematicians can estimate how many primes lie below a large number, but the actual count varies around that estimate. The Riemann hypothesis would put strong bounds on that variation.

Riemann approached this question through the zeta function. The hypothesis says that every nontrivial zero of that function has real part exactly ½. Checking individual zeros can support the hypothesis. A proof must establish the claim for every nontrivial zero.

Try the PO provocation

PO: Every AI-assisted proof comes with instructions for checking it.

Imagine receiving the announcement together with the exact theorem, the assumptions it depends on, and instructions a mathematician could follow to reproduce the formal check. The first question becomes much more specific. Can someone outside the original team verify that this argument establishes the theorem as stated?

What reviewers need to check

Reporting on the claim describes a formalization in Lean, a proof assistant. Lean can check whether a formal argument establishes a stated theorem from its definitions and assumptions. Reviewers still have to connect that formal statement to the mathematical claim in the headline.

  1. Read the exact statement. Does it cover every nontrivial zero of the Riemann zeta function?
  2. Inspect the assumptions. Does the argument depend on an additional hypothesis that itself needs proof?
  3. Reproduce the check. Can independent reviewers verify the complete proof with the stated versions and dependencies?

Those questions explain why the announcement matters and where the work now sits. As of 21 November 2026, Alpöge had reported a Claude-assisted proof, and independent verification was still pending.

Try it on a smaller claim

Consider this statement: For every positive integer n, the expression n² + n + 41 is prime. It gives a prime at n = 1, 2, and 3. Before opening the check, try to find a value of n that makes the expression divisible by 41.

Reveal a counterexample

At n = 40, the expression is 1,600 + 40 + 41 = 1,681, which is 41 × 41. A single counterexample settles this universal claim.

Apply TAJ. Think by writing down the exact claim. Ask AI to identify the step on which the argument depends. Judge that step by checking the arithmetic or assumptions yourself. Accomplish something you can share: a short explanation of what your check established.

Sources

Accomplish with AI

Powered by Blogger.

Featured post

Did Claude Help Prove the Riemann Hypothesis? What Still Needs Checking

AIYING · PO Thinking Lab Did Claude Help Prove the Riemann Hypothesis? What Still Needs Checking By Ravindra Dastikop with ChatGP...

Search This Blog

List of blogs

Search This Blog

About

Translate

Instant Stories

Read in Your Language

Test

share this

ShareThis

Popular Posts