Elektrine lite

← Feed

@antoinechambertloir@mathstodon.xyz

2026-09-11 19:46 UTC

#Math #AI 18/n This summer mathematical serial had a guest episode that doesn't involve new mathematics, but the “autoformalization (by the Anthropic team) of Fermat's Last Theorem”. There are several things to explain here, namely - What is Fermat's Last Theorem? (and why do we bother about it?) - Why would we want to formalize proven theorems, and why Fermat's Last Theorem?- What is meant by *auto*formalization? Formalization of mathematics is an activity in which I took a small part in the last 5 years, and I would like to say a bit about why one would find interest in it. As I explained above, “formal proofs” are texts written in a formal language similar to a computer language that a computer program (the proof assistant) can compile, so that if the output is successful, we understand that the content of the formal proof actually reflects a correct mathematical proof. The main motivation for writing them, at least the main motivation that was given for all important formalization programs, was to certify the accuracy of some proofs of which the complexity or the size didn't suppress all doubts.

Replies (1)

  • #Math #AI 19/n One such example was the formalization, by Georges Gonthier, of the proof by Appel and Haken of the four colour theorem. This theorem says that if you draw a map on sheet of papers, with as many countries as you wish (but countries need to consist of only one piece, no islands nor colonies here), then it is possible to draw countries with only four colours so that countries sharing a common boundary have distinct colors. The history of that theorem is really surprising. It was proved in 19th century, but it took 10 years to observe that the given proof was wrong. It was relatively easy to show that 5 colors indeed suffice, and several new wrong proofs appeared in 20th century. Only in 1976 did Appel and Haken propose a working proof, but that proof used a computer program to enumerate a large number of configurations, which another program could solve effectively, the theorem being that this long list of examples was sufficient to conclude. Several problems arise at once: how can we be sure that the first computer program actually generates all configurations described by the mathematical theorem, and does not miss any, and how can be be sure that all of them are treated correctly? The list is so long that no single human, nor any small group of humans, could check all of them, what we need is really a third computer program that will certify the combination of the mathematical proof, the configuration generator, and the solution for each generated configuration.

    Open ##5153668