Regular UPSC news, every day
‹ News Blitz Science & Technology Settled

AI turns Fermat’s existing proof into computer-checkable code

First brief 8 Sep, 7:55 pm IST Updated 8 Sep, 7:55 pm IST 1 development 2 min read Latest ↓
Andrew Wiles in Boston in 1995; historical photograph, not the 2026 AI experiment
Photo: Klaus Barner / Wikimedia Commons · CC BY-SA 3.0

Where it stands

Anthropic has released a computer-checked version of Fermat’s Last Theorem. The company announced the work on 4 September 2026. Claude translated established mathematics into the Lean proof language over 11 days. The result contains about 13 million lines of code. Andrew Wiles had already proved the theorem; the new achievement is machine verification. The released repository explains how the checks were performed. The result verifies existing mathematics. It does not show that AI discovered a proof of a previously unsolved problem.

Background

A mathematical proof explains why a statement must be true. Checking a few examples cannot prove a statement about every possible number. Fermat’s theorem concerns whole-number powers greater than 2. Wiles’s proof was published in 1995. Formalisation rewrites mathematical reasoning in a precise language that a computer can check. A proof assistant checks the logical steps; a chatbot’s confident prose alone provides no such guarantee.

How it developed

  1. 1995: publication of Wiles’s proof
    How it started

    The established theorem supplies the starting point

    Wiles’s proof was published in 1995. The new project follows the established line of mathematical reasoning. The task was to express that reasoning in Lean, not to discover the theorem for the first time.

  2. 4 September 2026 release; 7 September Nature coverage
    New fact

    The research release explains what the computer checked

    Anthropic announced the formalisation on 4 September 2026. The repository provides the theorem statement and verification records. The checks connect the result to the standard statement in Lean’s mathematics library. The repository also explains the assumptions and checking tools that must be trusted. These checks concern formal correctness. The code does not replace a human-readable account of the reasoning.

Why it matters for UPSC

GS3 · Artificial intelligenceGS3 · Scientific research

For GS3, distinguish generating an answer from verifying the reasoning behind the answer. Formal verification can help check AI-generated mathematics. A verified proof still needs a clear explanation for human readers.

Key terms

FormalisationWriting mathematical statements and proofs in a precisely defined language so that a computer can check the logical steps.
Proof assistantSoftware that checks a mathematical proof against formal rules. Lean is one example. This differs from asking a chatbot whether an answer looks correct.
AxiomA starting assumption in a mathematical system. A formal proof establishes a conclusion from stated assumptions and rules.
Fermat’s Last TheoremConsider positive whole numbers a, b and c. The equation aⁿ + bⁿ = cⁿ has no solution for a whole-number exponent n greater than 2.
Sources (3)
Sign in Today’s news
Current affairs Daily news Daily quiz News Blitz Shorts Economic Survey 2025-26 Subjects
Polity Economy Geography Environment History Science & Tech Intl. Relations Internal Security Art & Culture Social Issues
All subjects Exam info UPSC Syllabus Prelims syllabus Mains syllabus Exam pattern Eligibility & attempts OBC & EWS checker Resources Free downloads Booklist 2026 Previous year papers Video notes YouTube channel