<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mathematics on Kuldeep Pisda</title><link>https://kdpisda.in/tag/mathematics/</link><description>Recent content in Mathematics on Kuldeep Pisda</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 06 Sep 2026 09:00:00 +0530</lastBuildDate><atom:link href="https://kdpisda.in/tag/mathematics/index.xml" rel="self" type="application/rss+xml"/><item><title>Claude Just Produced the First Computer-Checked Proof of Fermat's Last Theorem</title><link>https://kdpisda.in/claude-fermats-last-theorem-lean-proof/</link><pubDate>Sun, 06 Sep 2026 09:00:00 +0530</pubDate><guid>https://kdpisda.in/claude-fermats-last-theorem-lean-proof/</guid><description>&lt;p&gt;On September 4, Anthropic disclosed that Claude, working largely autonomously over 11 days, produced the first end-to-end, computer-checked proof of Fermat&amp;rsquo;s Last Theorem in the Lean proof assistant. Along the way it wrote 13 million lines of Lean code and proved 29,500 intermediate theorems, more than five times the size of Mathlib, the community library those theorems build on.&lt;/p&gt;
&lt;p&gt;This matters less because of the theorem itself, Andrew Wiles already proved Fermat&amp;rsquo;s Last Theorem in 1995, and more because of what got checked. Wiles&amp;rsquo;s proof ran 129 pages and took a team of expert reviewers over a year to verify; two months into that process, a reviewer&amp;rsquo;s question exposed a gap that took Wiles another year to close. Formalizing a proof in Lean removes that ambiguity entirely: either the proof assistant accepts every step down to Lean&amp;rsquo;s three basic axioms, or it does not. What used to take human referees years now took a fleet of agents eleven days, and that compression is the actual story for anyone tracking what AI does to the economics of verification.&lt;/p&gt;</description></item></channel></rss>