Friday, November 20, 2026

The AI autumn of mathematics

This message started from a succession of posts on the Mastodon server, written from September 10 to September 13, written in the middle of the explosion of AI-proven results in mathematics. My goal was to explain to a large audience what it means to prove a theorem, what it means to have formalized proofs, and why this could be relevant. I was asked to gather them into a more readable form, but other duties postponed my promise. Meanwhile, there were several other developments, some of them dramatic, but I don't think that they really change my view beyond the obvious additional level of sideration (and sickness). 

The most recent case of the finite time solution of the forced Navier-Stokes equation has been discussed a lot in the recent days (this was September 10, 2026), both on this network and in the mainstream press, and I wish to try to give a perspective on what happened recently. This is prompted by a friend informing me this morning of two annoying additional stories that taint the recent public success of AI generated proofs and will hopefully lead the mathematical community to address the question of predation and plagiarism. 

However, I won't address here the even more important questions posed by AI companies beyond merely quoting some of them: 

  • its energetic cost; 
  • its impact on minerals and other natural resources; 
  • its direct and immediate consequences on the ecosystem (water heating, pollution, land waterproofing, etc.);
  • its impact on the work market, in particular those prompted by (actual or alleged) productivity gains; - its impact on learning, cognition, etc.;
  • its impact on the economic structure, tremendous announced gains/losses of companies that look like a Ponzi scheme; 
  • its impact on the power structure, who owns what, who gives access to what; 
  • its impact on the political structure, the surveillance capitalism, etc. 

These are fundamental issues that should be addressed more clearly in the mainstream medias, and that, in my view, suffice to object to the existence of AI. 

Anyway, what does it mean for academic math? 

Mathematical proofs, from objects to language

Before going on specific matters, I need to go back to what math is and to what it does. (TL-DR;-) As far as it goes about automatization, math is probably the easiest of all sciences.

In 1994, the mathematician William Thurston published a paper with the title “On proof and progress in mathematics” in which starts with stating the question What is it that mathematicians accomplish? His answer — you might find it circular — is that mathematicians are those scientists who push the human understanding of mathematics forward.

This means that mathematicians have under the eyes a whole range of (abstract) objects for which they use sometimes colloquial names (group, ring, field, memberhip, sheaf, relation, knot, crystal…) and sometimes more specific names (perfectoid, hypersolvable, function, proof, set…) and they try to better understand the properties that these objects possess, and the relations between them.

A whole field of mathematics is motivated by the fact that some of these objects model phenomena of the actual world in which we live, with the idea that the behaviour of the abstract mathematical objects might help us make actual decisions.

But a large part of mathematics is just motivated by these abstract objects themselves, possibly with the hope that, some day, they could be useful to the real world, and sometimes in the expectation that they will never be useful to it. For example when being useful means helping killing people.

We have traces of mathematical activity for more than 3000 years now, so it seems that this human desire to understand, in an abstract way, our surrounding world is quite deeply ingrained in our minds.

This quest has been parallel to the development of science, often prompted by questions of other sciences, but what happened in the modern era (beginning of 19th century, say), is more explicit desire for rigour in the argumentation. Not that mathematics lacked rigour, it always had a lot, like all science do, but mathematicians felt the need to have more precise definitions for their abstract objects. Mostly because standard reasoning often led mathematicians to oddities, if not mere absurdities.

Let me quote just here the discovery by Bertrand Russell that if you wish to talk about collections of which things may, or may not belong, you need to be extremely careful. Russel's remark is simple: imagine you can create collections of anythings, for example collections of collections, and so on (after all, you can have a bag to keep all of your bags together…), then it might be possible that a collection be a member of itself (the idea of an idea is an idea…), and you could look at the collection R of all collections that are not a member of itself. This collection R is paradoxical : saying that the collection R is a member of R exactly means that it is not a member of R.

After this logical disaster, mathematicians took a great more care to elaborate the way they can argue so that they don't fall into such absurdities. And they devised a way for that, which is the idea that mathematics could be (should it be?) framed in a specific language that is completely specified and devoid of any ambiguity. (Think about when Marx writes that “the history of all previous societies has been the history of class struggles”, what does he exactly mean by history, by societies, by class, by struggle?) 

This quest seems to go back to the philosopher Wilhelm Leibniz, and at the beginning of 20th century, the mathematician Giuseppe Peano suggested a very specific way of writing mathematics that, theoretically, so he believes, would solve the problem.

I copy the first nine lines of his work on “natural numbers” (the numbers 1, 2, 3,…) and maybe you'll feel relieved that we don't learn to write this in high school. 

Peano axioms for the natural numbers, in his own writing style. (From Arithmetices principia, p. 1.)Moreover, mathematicians refined their model of argumentation (so called proofs) so that it fits such a specific way of being written.

The outcome is called a “formal proof”, with the idea that no mathematician ever writes an actual formal proof, but that we produce an argumentation that, to the eye of a trained mathematician, could be transformed more or less mechanically into such a proof.

After World War 2, the development of computers made possible that computers handle formal writings and formal proofs, and this started a scientific field (at the interaction of mathematics and computer science) of automated theorem proving. This is quite an interesting scientific activity, because experience shows that progress in that field relies both on a deep understanding of both computer science (otherwise, nothing works so well, algorithms are too slow…) and the mathematics involved. Computer scientists are also pretty much interested in that, because a formal mathematical proof of a formal mathematical statement is very close to an argumentation that your software code actually executes in the way you have specified. And it's not so bad to know that the software that manages train schedules doesn't behave in an unpredictable way when two trains arrive at the station almost at the same time.

A large number of softwares have been developed to that aim, Automath (by N. G. de Bruijn) was maybe the first one in 1967, I wish to name Coq/Rocq that has been developed in France using ideas from computer software, and Lean has been quoted many times recently, in particular because it is the one mentioned in these AI stories.

This is slightly off topic here, but I wish to make a digression and mention that mathematicians also discovered with quite a surprise that not everything can be proved: there are seemingly natural mathematical statements (the one which are well specified, without any ambiguity in them) about which one cannot conclude if one only follows the strict reasoning rules that I evoked. This has the interesting philosophical conclusion that many of our mathematical objects, those given by inambiguous specifications as requested above, are in fact not as well specified as we wished. This has the humble consequence that Hilbert's motto about mathematical quest, We must know, we will know (Wir müssen wissen, wir werden wissen), is in part hopeless. You can even listen to him saying these words at the end of a 1930 radio address.

Let us go swiftly to modern times and to modern mathematics.

Mathematical problems

As all scientific fields, it is organized along certain rules, the kind of rules that sociology of science could detail, and also explain their utility and their problems.

First there is a multi-faceted compartmentalization of the mathematical activity:

  • It mostly takes place in research departments of universities, but there are also research departments in private companies (especially for applied research), as well as public places where fundamental research is done (Institute for Advanced Study in Princeton, or the Chinese Academy of sciences, etc.)
  • The activity is separated along broad research themes (my department has a handful of large teams, each of them could be split into 3 or 4 smaller if needed), which has the consequence that few people have a deep understanding of what happens in the offices next to them.
  • The field is driven by several lighthouses, whatever their actual scientific relevance is: In 1900, Hilbert had proposed 23 problems, in 2000 the Clay foundation proposed 10 other problems, each area of mathematics has a small list of questions which are thought of as particularly important (and for which mathematicians often use the word conjecture).
  • There are also lists of possibly easier problems, the kind of those should be accessible as soon as you have a basic knowledge of a small are of mathematics. There are even problems that are thought of as accessible, meaning that a professional mathematician who knows a moderate sample of the bibliography should be able to solve them. This makes possible to have an ongoing science, with incremental successes. Many PhD theses are of this kind which I find regrettable, meaning that a professional mathematician is often in position to solve it before the apprentice mathematician even could—only ethics and communication can prevent that. 
  • Finally, prizes, medals, journal rankings, institution rankings, academic positions etc. that assess (and distort) in real time the scientific value that mathematicians give to individual achievements.

Already several years ago, AI companies have decided to enter the game of mathematics.
Their official motivation (I quote from memory one of the Google Deepmind leaders, last year at Leiden) is to provide us with new tools. But sometimes, the word escapes them that they wish to simply “solve mathematics”.

It should be made clear that in now way can anybody “solve mathematics”.

What is possible is solving a given mathematical question, or more likely, proving something related to a given mathematical question that the mathematical community views as an advance towards that question. Once a problem is solved, new problems emerge, either because the earlier question now makes it possible to set, or because we naturally turn our eyes to something else. Mostly, solving a question indicates that some mathematical tools are powerful and we wish to try those tools on questions that we feel could be addressed with them.

What is also possible is “disrupting mathematics” by disrupting the fragile equilibrium of the field, as a sociological construct. But they wouldn't want to do that, would they?

A hot mathematical summer 

I will now try to summarize the events of this hot mathematical summer.

Mid July, Levent Alpöge, a mathematician trained at Harvard in number theory who is now working for the AI company Anthropic,  published a counterexample to the so-called “Jacobian conjecture”. This was a natural question in a field called algebraic geometry that had been put forward in the 1960s by mathematicians such as Zariski and Abhyankar, especially because its statement doesn't require anything more than basic undergraduate algebra. (As it happens very often, earlier traces of this question can be found, back to the end of the 19th century.)

We are facing here a basic question, which was clearly an open conjecture in the field, but whose sociological status was unclear. Indeed, very few prominent mathematicians decided to tackle it, while a number of people with less competence devoted a lot of their energy to prove it. We now know that it has been in vain, but even there, one could have doubted the mathematical interest of the question, and one important algebraic geometer said me so in very clear terms around 2012.

Indeed, this conjecture asserted that every family \((f_1,..,f_n)\) of \(n\) polynomials in \(n\) variables with complex coefficients whose Jacobian is a nonzero constant is invertible. (Conversely, it is quite easy to prove that for any such family which is invertible, the Jacobian is a nonzero constant.) What this colleague made me observe is that it is extremely unlikely that one gets such a family for which we can prove that the Jacobian is a nonzero constant *without* already knowing that it is invertible. So what is this conjecture good for?

Anyway, we now know for sure that the conjecture is false. And although we have a proof, meaning an intelligible text that mathematicians could read and understand, we don't really know how Alpöge came to produce this example, beyond his claims: he just published a tweet saying the following:

hello there the jacobian conjecture is false thanx to my close friend akhil for asking about it and my other close friend fable for working during the world cup final

((1+xy)^3 z + y^2 (1+xy) (4+3xy), y + 3 x (1+xy)^2  z + 3 x y^2 (4+3xy), 2 x - 3 x^2 y - x^3 z): \C^3\to \C^3, has jacobian determinant -2, and sends (0, 0, -1/4), (1, -3/2, 13/2), and (-1, 3/2, 13/2) to (-1/4, 0, 0)

Here, “akhil” is another mathematician, Akhil Mathew, and “fable” is not really a friend but one of the AI softwares that was just released by Alpöge's company Anthropic.

So what happened?

If we digest the tweet, we can guess that Mathew has suggested to Alpöge that the Jacobian conjecture might be wrong (already a nice insight), or maybe that it would just be worth being investigated by this software (and then, some credit would go to Alpöge to try to search both for a proof and a disproof).

Automatizing mathematics 

What happened really, we will probably never know, but we can think about how this kind of software works.

This software, Claude Fable 5, is a fairly sophisticated program that belongs to the class of “large language models” (LLM). Basically, this means that it generates text (language) according to probabilistic rules that are sufficiently well crafted that the outcome looks very well written, but still, at the heart, this is a randomly generated text.

Of course, there is no hope that a purely random text would be of any use for anybody, so the heart of the work of the LLM engineers was first to make these probabilistic rules particularly well chosen. On can already see this as a remarkable achievement of that kind of technology, but it is important to make two additional observations: 

  • The crafting of these probabilistic rules is obtained by a recent technique in machine learning (reinforcement learning and transformers), that requires, to work properly, an extremly large number of data. To that aim, the AI companies basically scanned every possible literature, and used human workers (in particular from the Global south) to “train” the software. It is for this reason that researchers in artificial intelligence and linguistics coined the term “stochastic parrots”: this software randomly repeats what it has read.
  • This random text generation does not entail any notion of truth, and even any relation to the actual world. To reach the possibility of doing math, this software now combines text generation with proof verification in the sense discussed earlier. The reason that makes it workable in mathematics is precisely that the mathematical language is well specified, and we have means to assert the validity of a mathematical argument, combined with the performance of proof assistants.

This kind LLM technology is called “agentic” because it has the possibility to launch programs that can either be proof assistants that will try to check specific assertions, or other LLM agents that are instructed to counter-reason the arguments of the first one, in the hope of finding limitations of the initial plan.

While I know a fair amount of mathematics from my own reading, and my own practice, I am not a specialist of these technologies, I have no idea at all of how these multi-agents are combined, and I may be slightly off here. But one of my objections that I had earlier regarding LLM technology and “intelligence” is that I see no argument for which automatic generation of arguments, possibly looking in various directions at the same time, has anything to do with the stunning phenomenon called intelligence that we, humans, are used to experiment — and that we seem to share with some other living species. My basic objection is that it is up to the builders of those tools to demonstrate by thought, not by experiment, why it should work.

On the possibility of automatizing mathematics

We see that these technological systems are presented to us as sorts of “ultimate theorem proving” machines, capable of producing proofs of the most difficult questions that mathematicians asked themselves. 

However, there cannot be any such machine, and we know that since 1936. 

Indeed, at the time where Hilbert framed his program and formulated the decision problem which we talk about using its German name, Entscheidungsproblem (remember the above “We must know”?), some logicians were studying this question thoroughly and came to a negative answer.

First came Tarski and Gödel who observed that in a (reasonable) formal system where one can talk of theorems and their proofs, there must be undecidable statements: things that look like a valid theorem but of which no proof exists, and of which no proof of the opposite exists neither. This means that even if we believe that the axioms of such formal systems describe mathematical objects of some idealized mathematical world, those axioms cannot explain all properties of those objects. Of course, one could add axioms to settle undecidable questions, but new undecidable questions would automatically arise. (“Reasonable” means that the list of axioms of such a formal system can be printed by some computer program, and that they are strong enough so as to allow to talk about numbers and arithmetic.)

Then came Church and Turing who first gave a proper definition to what it means to make a computation (Church's lambda-calculus), or to run a program (Turing's machines). Then they proved that there is no computer program that, given any other program, could decide whether it would run to an end or compute indefinitely. Turing's proof is not so difficult for us, who are accustomed to computer programming, but this was 1936, and Turing needed to imagine what a computer could be. Then, Turing could essentially mimick Russel's argument explained above. 

There is another argument against the principle for this kind of technology that I have learned from the philosopher Walter Dean. Computer science has defined precisely what an algorithm is and given means to evaluate how efficient those algorithms are. Moreover, it has delimited various classes of problems regarding efficiency of the algorithms that can solve them. Two classes are of prominent importance:

  • Problems for which we know fast algorithms (called P in the computer science jargon);
  • Problems for which we don't know fast algorithms but for which we have efficient way to check solutions (called NP in that jargon).

A hard question in computer science is to prove that the class NP is really larger than the class P, this is what computer scientists believe, but can't prove. The difficulty of some problems in the NP class is at the heart of modern cryptography (hence the whole security of Internet), and if you have heard about quantum computing (or things such as “post-quantum cryptography”), this is because it would make the two classes much closer one from the other, and “breaking” those cryptographic protocols.

The relation with my thread is that finding a proof of a theorem is a hard problem of the NP class, even for classes of very simple theorems. Which means that we can reasonably check proofs, as proof assistants do, but that it is very unlikely that there be efficient algorithms to find proofs. (Of course, it is an empirical fact that the theorems that we are interested in are not at all random, so that they might be easier to prove than general statements, in the same way that the SAT problem is as difficult as the most difficult NP problem, but there are solvers that in practice work extremely well. Still we don't understand why this should be the case.)

The outcome of this reflection is that I am very skeptical of everything that comes from the LLM world.

What this summer taught me is that I was partly wrong. 

Plagiarism as a service?

But this morning, bang!, I was informed by a friend of a paper that appeared on September 4th on the database of mathematical publications, by three prominent algebraic geometers, Lev Borisov, Ofer Gabber and Adrian Vasiu, entitled “On endomorphisms of affine spaces and the Jacobian problem”. This 176-page (!) paper is precisely devoted to counterexamples to the Jacobian conjecture and to various companion conjectures in commutative algebra.

As is now often the case in mathematical papers, it ends with an AI statement that says that no AI was used, nor were any of their results computer-based nor suggested by computer-generated data. But one of the authors, Vasiu, added a puzzling paragraph where he explains that an earlier version of the file (from January 2025) had accidentally been made accessible on the Internet (I could explain how such things happen), and he says that he believes that its content had leaked to the database of material that AI companies use for generating texts. Indeed, on July 23, some AI could produce a 37-page that makes a detailed comparison between Alpöge's example and the theory of Borisov-Gabber-Vasiu as explained in the leaked version of their work.

On the opposite, the disproof of the Jacobian conjecture published by ulam.ai on the basis of Alpöge's tweet contains no reference to any serious bibliography, and nothing of Borisov-Gabber-Vasiu.

I needed several toots to tell this story of the Jacobian conjecture that ran from July 19th to September 4th, but the story doesn't stop here!

One month later, Alpöge published a counterexample to another conjecture, and also a longer text building a complex structure on the 6-dimensional sphere. I have not much to say about them. The first one is presented on the form of a tweet, while the second one takes the form of a long paper, that starts with something that looks like some genuine mathematical insight, but the text lacks a proper introduction that would explain where the idea comes from, whether there had been earlier attempts  in a similar vein, etc.

On August 1st, another company, Open AI released a paper “Ten advances in mathematics and theoretical computer science” giving a proof of 10 new results in several areas of mathematics. Most of them seem to be optimization of existing work, but some look genuinely new. Still, the writing is often inadequate, with a much too strong emphasis being put on the proven results.

For example, the existence of non-sofic groups is presented as “addressing a central open question in group theory”, while it is certainly not central.

Moreover, the solution to this question seems to have benefited from AI-work by mathematician Andreas Thom who had used Chat-GPT (OpenAI's LLM) to investigate that question. The answers he gets are really puzzling, and I can join him on one point, “can we trust OpenAI with unpublished mathematics”?

Indeed, if it happens that private discussions on Chat-GPT help train the model, people using this technology would basically have all OpenAI mathematicians spying what they do behind their back. Of course, OpenAI says that no such thing happens, but how can we know? 

Formalization of mathematics

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.

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 stated and proved in 19th century, but it took 10 years to observe that the given proof was in fact wrong. It was also 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.

This is what Georges Gonthier did in 2008, thus bringing a definitive certainty to the solution of that long-standing question. In fact, Gonthier discovered that the proof didn't really work, but he could make the argument work.

I should (and will) ask Gonthier about his underlying motivation, but my understanding is that, as one of the developers of the proof assistant Coq (now named Rocq), he wished to prove the mathematical community that the technology was mature enough to tackle spectacularly long proofs. Another reason is that Coq/Rocq is also the basis for a purely computer science activity that is very close to checking mathematical proofs, namely checking computer programs, and this has applications in industry.

But for us, mathematicians, why would we want to write formal proofs of mathematical theorems for which we basically have a good understanding? Most of mathematicians probably don't care — at least didn't case one year ago.  Even for participants, motivations vary, and I can't say for sure about all of my colleagues, but mine was really to participate building a mathematical assistant that has enough modern mathematics coded in it so that we can use it in the development of our new proofs.  For example, the system would make us check that all hypotheses of the intermediate results effectively hold when we use them.  Moreover, proof assistants may be enriched by automatization tools that could check elementary hypotheses, and even do proofs that we feel are standard.

Nevertheless, in the development of such proof assistants, it is tempting to try to push them beyond their obvious boundaries by setting some difficult challenges, both to get some kind of psychological reward and to have a better understanding of the large scale behaviour of such systems.  Moreover, when in par with the modern progress of mathematical research, these challenges prove that the emerging technology is fit to current science.  Therefore, roughly one year ago, the mathematician Kevin Buzzard embarked in a 5-year project to turn the proof of “Fermat's Last Theorem” into a formal proof that a computer could confirm.

Fermat's Last Theorem 

I should recall here what Fermat's Last Theorem is (or was): it is a statement for which the 17the century mathematician Pierre de Fermat wrote that he had a proof, but for which no proof has been available for a long time, until Andrew Wiles could prove it in 1995. The story itself is quite remarkable, Fermat's statement was just written around 1637 as a marginal note in his own edition of the book Arithmetica by the Greek mathematician Diophantus (roughly 2nd century c.e.), a comment that has been actually printed in the edition published later by Fermat's son.

This statement follows a theorem of Diophantus about sums of two squares that are still squares (such as \(3^2+4^2=5^2\)) and how such expressions can be produced. Such relations may look odd to non-mathematicians, but we have lists of them on very old Babylonian clay tablets, roughly 4000 years old, written in cuneiform script, such as Plimpton 322. At the time of Diophantus, such expressions were also thought in relation with the Pythagoras theorem and reflect the possibility of right triangles all of three lengths are natural numbers. Fermat's remark is that if one replaces squares by cubes or higher powers, no such expressions exist.  Precisely, in the English translation copied from Wikipedia, the book goes on with a paragraph:

Observation by Sir Pierre de Fermat
If an integer \(n\) is greater than 2, then \(a^n + b^n = c^n\) has no solutions in non-zero integers \(a\), \(b\), and \(c\). I have a truly marvelous proof of this proposition which this margin is too narrow to contain.

 


This seemingly innocuous remark prompted a lot of mathematics, born from the desire to provide a proof of this statement, starting with Euler in 1770 for the particular case \(n = 3\). Actually, most of the proofs given for particular cases happened to be incorrect at some point but they could be adjusted at the cost of new and interesting mathematics. However, a general proof remained elusive. It is only around 1980 that the question could be linked to another field of mathematics, the theory of elliptic curves and modular forms, by means of another open question. It is this latter question that Andrew Wiles (partly with Richard Taylor) could solve in 1995, and that was known to imply Fermat's Last Theorem, finally turning Fermat's observation into a theorem!

When one puts all of the arguments together, the proof of Fermat's Last Theorem appears to be gigantic: it combines an incredible number of ideas from basically all areas of mathematics in its most modern form: algebra, geometry, number theory, real and complex analysis, spectral theory (but apparently no probability theory nor statistics)…

The story did not really end here because mathematicians went on understanding Wiles's arguments, streamlining some of them, generalizing some other further (and I understand that Kisin and Taylor have been particularly active there). That led to proofs of other questions in number theory, and also to a proof of Fermat's Last Theorem that is conceptually simpler.

That new proof builds on now established results but, to the best of my knowledge, it has not been published in full. In particular, having it written in in the detailed form of a formal proof would also guarantee that this approach is correct and offer some form of publication. Hence Buzzard's project.

This task of formalizing mathematics appears to be quite difficult. It takes a lot of time and energy, and it leads to computer code that is very big. For example, the mathematical library Mathlib that accompanies the proof assistant Lean consists in roughly 10,000 files adding to some 2,5 million lines of code! Every modification in a file can have repercussions in many others, and such a library is difficult to maintain, requiring human skills in software maintenance and mathematics.

Moreover, the current state of the Mathlib library is not fit for proofs that are as complex as that of Fermat's Last Theorem, an incredible amount of intermediate mathematics is still missing. Therefore, Buzzard organized his project so that it could also have interesting repercussions for the library.

On the other hand, the development of LLMs has suggested that they could be tuned to formalize automatically theorems for which a proof is provided (as a PDF file, or a collection of PDF files, say).  To me, the motivation looks more than providing a benchmark for LLMs than participating to building a mathematical library, because the code generally misses all qualities that we expect from the code of a mathematical library: verbose, not reusable, practically impossible to adjust afterwards, etc.

For AI companies, the goal is also kind of a stress test of the techniques underlying the agentic LLMs that I described above, that need to convert the generated arguments into computer code that proof assistants can check.
For those companies, the interest of this additional layer is that it gives the LLM technology some relation to truth, a relation that it fundamentally lacks otherwise. Consequently, the possibility autoformalization makes possible for them to avoid one layer in the verification tower, they don't need anymore to have human beings building a complete mathematical library.

One week ago, on September 4th, Anthropic announced that it had more or less done the same job, namely generated a complete formalization of the proof of Fermat's Last Theorem. They claim that the work took 11 days, “largely autonomously”, so that we now have 13 million lines of Lean code that contains a complete proof of that theorem.

Those files compile, but require 20 more times to Buzzard's computer to compile than the Mathlib library (which on my computer requires several hours), and that computer has 96 cores and 500GB RAM.  So this is a new kind of formalized proof, one that escapes standard computers and belongs to the world of supercomputers, thus pushing back farther the gap between mathematics and its formalized form.

In other words, what Anthropic did is clearly an impressive technical achievement, one that might be relevant to AI industry, but is definitely irrelevant for mathematics.

Anthropic says the work consumed “about 6 billion tokens”. The selling price of AI models ranges from $5 to $50 per million tokens. It is natural to choose the upper figure since it is unlikely that they would use more basic models than the one thay offer, and we are around $300,000.  On the other hand, the press has published independent figures that suggest it could cost these AI companies as much as 70 times more than the price they say. Let's use 50 times, and we get $15 million.

This is 3 times the amount the EPSRC allotted to Buzzard for his 5-year program.

For comparison, the 2025 budget of the NSF (the US agency for science) is around $9B,  and that of the ANR (the French agency) is around $1B.

Still, this is an impressive technological achievement. 

Epilogue

We are now November 20th, 2026, and many additional events have shaken the mathematical world during the last two months, in particular OpenAI's bulk release of hundreds of proofs, comprising one of a “quasi-Riemann hypothesis”, or Axiom Math's formalization of the classification of finite simple groups. Levent Alpöge's announcement, this morning, that he has led the Claude software to producing a (formalized) proof of the Riemann hypothesis already creates another moment of sideration, on day 2 of Anthropic IPO (initial public offering) that will divest an incredible amount of money from pensions to capital.
 
Meanwhile, several voices tried to formulate the conditions that would still make mathematics a promising human endeavor. This “progress” brutally affects the very conditions in which we can imagine doing mathematics, it makes visible how our pretend-meritocratic race to producing more mathematics more rapidly is just pathetic, and will force us to reconsider the inner reasons for why we were led to mathematics. In an academic world were positions are scare, young people will certainly be more affected  and they need our intellectual and emotional support. On the other hand, the youth political movements that we observe in France and in several other countries indicate that they may have a better conscience of how to live in a corrupted world. The Association of human mathematics has been created to protect the human aspects of doing mathematics, young mathematicians have played a major role in its creation, and I am glad to have joined it.  

 

Monday, April 13, 2026

On the theorem of Gelfand-Mazur

In its classical statement, the theorem of Gelfand-Mazur is the following:

Theorem 1. — Let $K$ be a complete normed field which is an extension of the field $\mathbf C$ of complex numbers. Then $K=\mathbf C$.

As in the history of any theorem, the reality is a bit more complicated. The theorem proved by Stanislas Mazur in 1938 concerns all fields $F$, extensions of the field $\mathbf R$ of real numbers, which can be endowed with a norm:

Theorem 2 (S. Mazur, 1938). — Let $F$ be a field which is an extension of the field $\mathbf R$ of real numbers. If the field $F$ admits an algebra norm (that is, $\|ab\|\leq \|a\|, \|b\|$ for $a,b\in F$), then it is continuously isomorphic to $\mathbf R$, $\mathbf C$, or the field $\mathbf H$ of quaternions. If, moreover, the norm is multiplicative, then there is an isometric isomorphism.

This theorem is viewed by Stanislas Mazur as a generalization of Frobenius's theorem (1877) that treats the case where $F$ is finitely dimensional over $\mathbf R$: he replaces this assumption by the more general one that the field can be given an algebra norm. It is stated, with little arguments, in his 1938 note to Comptes rendus de l'Académie des sciences. In 2007, Pierre Mazet found why the proof had been skipped during the publication of this note and managed to recover it, see his paper in the Gazette de la Société mathématique de France.

In 1939, Israel Gelfand proved his version independently motivated by his theory of normed algebras. His statement, equivalent to the above one, is the following:

Theorem 3 (I. Gelfand, 1939). — The $A$ be normed algebra over the complex numbers. Then the residue field of every maximal ideal of $A$ is equal to $\mathbf C$.

There are well known classical proofs of these results in the literature, which most of the time rely on Liouville's theorem that bounded holomorphic entire functions are constant. The goal of this note is to record two proofs which I learned from browsing the online Bourbaki archives. I won't discuss the real or quaternionic aspects of that proof and concentrate on the first theorem.

1. A proof using covering theory

This proof is sketched in the tribu n°84 (p. 26 of the PDF file) of the Bourbaki group, where they record the decisions of their March 1972 meeting in Jerba (Tunisia), in relation with the preparation of their 11th chapter of Topologie générale. It goes as follows:

1) Démonstration de Gelfand-Mazur
Soit $K$ un corps normé complet sur $\mathbf C$, distinct de $\mathbf C$. Le groupe additif $K^+$ et le groupe multiplicatif $K^*$ sont simplement connexes et l'exponentielle fait de $K^+$ un revêtement de $K^*$, non trivial puisque $\exp(2\pi i)=1$. C'est idiot.

which, in English, gives the following: Both $K$ and $K^*$ are simply connected, and the exponential map makes $K$ a covering $K^*$; this covering is nontrivial since $\exp(2\pi i)=1$. And they add: This is dumb.

It may be worth giving a bit of detail to this very short argument.

They implicitly assume that $K$ is commutative when they consider the exponential map $$\exp : K \to K^*, \quad z \mapsto \sum_{n=0}^\infty\frac1{n!} z^n $$ and say that it is a covering. As over the complex numbers, one can prove that the series converges everywhere, and commutativity allows to prove the standard relation $\exp(a+b)=\exp(a)\exp(b),$ as well as show that the exponential is its own derivative. As a consequence, this derivative never vanishes and the exponential gives a local homeomorphism from $K$ to $K^*$. Moreover, this homeomorphism is locally trivial, because one can split it locally by way of the logarithm, which is given, for $\|z\|<1$ by the formula $$ \log(1+z)=\sum_{n=1}^\infty (-1)^{n-1} \frac1n z^n. $$ Again, the functional equation $$\exp(\log(1+z))=1+z$$ requires commutativity, using legitimate manipulation of power series and their evaluations.

The field $K$ itself is simply connected, because it is contractible.

The simple connectedness of $K^*$ will use the hypothesis that $K$ is not equal to $\mathbf C$. We need to prove that any loop in $K^*$ is homotopic to a constant loop. First, we observe that, by uniform continuity and local convexity, it is homotopic to a piecewise linear loop in $K^*$. Now, such a loop is homotopic to its projection to the unit sphere, and the image of the projected loop has empty interior — since $K$ is not equal to $\mathbf C$, that the unit sphere is not locally more 1-dimensional. In particular, our loop omits one point. Then, a stereographic projection turns the loop one that lives in the equatorial plane of the sphere, which is contractible, so that the loop is homotopic to a constant loop.

Finally, the theory of coverings shows that this covering has to be an isomorphism, which it isn't since $\exp(2\pi i)=1$. This contradiction implies that $K=\mathbf C$, Q.E.D.

In fact, a 1952 paper by Ernst Witt gives a closely related proof in a one-page paper. For the same reason that $K^*$ is simply connected, Witt writes that the differential relation $x^{-1} d x = d y$ gives a global isomorphism between the multiplicative group ($x \neq 0$) and the additive group ($y$). And he concludes that this isn't possible becasuse the multiplicative group $K^*$ admits the element~$-1$ of order~$2$, while $K$ has none since its characteristic is~$0$.

2. Tornheim's proof

There is an other, earlier, proof in these archives in a rédaction n° 283 written by Serge Lang where he sketches the proof given by Leonard Tornheim in 1951. (A variant of this proof, only valid for multiplicative norms, had been given by Alexander Ostrowski in 1917. It has been used recently by Dustin Clausen and Peter Scholze in theor development of complex analytic geometry in the condensed setting.) The classical proof by complex analysis argues by contradiction, considering an element $a\in K$ such that $a\notin \mathbf C$ and considers the function $z\mapsto 1/(z-a)$ from $\mathbf C$ to $K$. This function is holomorphic, bounded (it tends to $0$ at infinity), hence constant, which it clearly isn't. To avoid the theory of holomorphic functions with values in the field $K$, Tornheim argues as follows. The function $z\mapsto \| 1/(z-a)\|$ is continuous on $\mathbf C$, nonzero, and tends to $0$ at infinity, hence it attains it maximum $M$ on a nonempty closed subset $D$ of $\mathbf C$. It suffices to prove that $D$ is also open. By translation, it suffices to prove that if $0\in D$, then $D$ contains a small ball around $0$. Now, consider a strictly positive real number $r$, an integer $n\geq 1$ and a primitive $n$-root of unity $\omega\in\mathbf C.$ One sets $$ S_n(r) = \frac 1n \sum_{k=0}^{n-1} \frac 1{a-\omega^k r}.$$ Since the rational function $ \sum_{k=0}^{n-1} 1/(T-\omega^k r)$ is the logarithmic derivative of $\prod_{k=0}^{n-1}(T-\omega^k r)=T^n-r^n$, it is equal to $n T^{n-1}/(T^n-r^n).$ Consequently, $$ S_n (r)= \frac{a^{n-1}}{a^n - r^n} = \frac 1{a - r\cdot (r/a)^{n-1}} .$$ If $r<|a|$, we obtain $\lim_{n\to+\infty} S_n(r) = 1/a$. On the other hand, the assumption that $0\in D$ means that $M=1/\|a\|$, and the definition of $D$ implies that $ \| S_n(r)\| \leq M = 1/\| a\|$. Consequently, for $n$ large enough, all terms in the definition of $S_n(r)$ must be of norm $1/\| a\|.$ Taking $n$ arbitrarily large, the circle of radius $r$ centered at the origin contains a dense set of points of $D$. Since $D$ is closed, the whole circle is contained in $D$. This is valid for all $r<\|a\|$, and this proved that the ball of radius $\| a\|$ is contained in $D$. Q.E.D.

Wednesday, February 18, 2026

Joyal's proof of Cayley's formula for the enumeration of trees

That formula of Cayley asserts that there are $n^{n-2}$ trees with vertices labeled $1,\dots,n$. This is a chapter in graph theory, in which graphs are “simple”. More precisely, let's call a graph structure on a set $V$ (called “vertices”) is the datum of a subset $E$ of 2-element subsets of~$V$, called “edges”. So an edge is of the form $\{a,b\}$, where $a$ and $b$ are distinct elements of $V$, and we say that the edge links $a$ to $b$.

A path in this graph is a sequence $(a_0,a_1,\dots,a_n)$ where $a_0,\dots,a_n$ are vertices such that $\{a_{k-1},a_k\}$ is an edge, for each $k\in\{1,\dots,n\}$; this path has length $n$, and it connects $a_0$ to $a_n$. A graph is said to be connected if every two vertices are connected by some path.

A loop is a path whose first vertex $a_0$ equals the last one $a_n$. Examples of loops are paths of length $0,$ given by one vertex. Less trivial examples are obtained by taking an edge $\{a,b\}$ and considering the path $(a,b,a)$; a path that does not contain this pattern will be called a path without back and forth. (There's a translation issue between English and French, for the French wording for this expression is sans aller-retour, which seems more natural to me — you first go somewhere before returning back.) In any case, if every loop without back-and-forth in the graph has length $0$, then one says that the graph is a forest. Finally, a tree is a connected forest.

In a connected graph, any two vertices $a,b$ are connected by some path, and if the graph is a tree, then there is a unique such path which has no back-and-forth. Indeed, if there were two such paths $(a,a_1,\dots,a_{m-1},b)$ and $(a,b_1,\dots,b_{n-1},b)$ connecting $a$ to $b$, where, say, $m+n$ is minimal, then one can build the loop $(a,a_1,\dots,a_{m-1},b,b_{n-1},\dots,b_1,a)$. By definition of a tree, this loop must have some back-and-forth. It must be $(a_{m-1},b,b_{n-1})$, for otherwise the two given paths would have had some back-and-forth. In particular, $a_{m-1}=b_{n-1}$ and the two paths $(a,a_1,\dots,a_{m-1})$ and $(a,b_1,\dots,b_{m-1})$ have no back-and-forth, connect the same pair of points, and their lengths are smaller. This furnishes the desired contradiction.

Theorem (Cayley). — If $V$ is a finite set of cardinality $n\geq 2$, then there are $n^{n-2}$ structures of tree on $V$.

Here is the proof of this theorem that Joyal gives in his paper “Une théorie combinatoire des séries formelles” (Advances in Mathematics 42 (1): 1‑82). I thank François Lamarche for having urged me to read that paper.

Joyal's idea consists in considering the structure of an “animal” obtained by selecting two vertices of a tree. Given two vertices $a,b$, the vertices in the unique path linking $a$ to $b$ are called its vertebrae, and the set of vertices is called its spine. We now need to prove that there are $n^n$ structures of animal on a non-empty set with $n$ elements. (This combinatorial description does not work well for $n=0$, there are no animals with $0$ elements, but $0^0=1$.)

Now, each vertex $x$ in an animal is connected to some vertebra, and there is a preferred vertebra $v(x)$ for which there is a path $(x,\dots,v(x))$ that does not contain any other vertebra than $v(x)$. Note that all vertices $y$ in that path satisfy $v(y)=v(x)$. In particular, $v(v(x))=v(x)$, that is, the map $v$ is idempotent.

Given some vertebra $t$, let us consider the subgraph $T_t$ of the given tree with set of vertices $v^{-1}(t)$. It is again a graph, and is even a tree since each of its vertices is connected to $t$, and a subgraph of a forest is a forest.

As a conclusion, animals $(a,b,T)$ with vertex set $V$ are in bijection with ordered pairs consisting of the sequence $(a,\dots,b)$ of vertebrae forming the spine together with a family of disjoint trees indexed by the spine and whose union if $V$.

On the other hand, one can associate to any self-map $f\colon V\to V$ a similar structure of an idempotent map $v\colon V\to V$ together with a tree structure of $v^{-1}(t)$ for every $t\in V$. Indeed, let $S$ be the set of periodic points for $f$, that is, elements $x\in V$ for which there exists $n\geq 1$ with $f^n(x)=x$. If $x$ is periodic for $f$, then so is $f(x)$, so that $f$ induces a map $f_S$ from $S$ to $S$. That map is bijective. On the other hand, for every $x\in V$, the sequence $x, f(x),f^2(x),\dots$ will eventually repeat itself, because $V$ is finite, so that there exist integers $m$ and $n$ such that $0\leq m < n$ and $f^m(x)=f^n(x)$. In particular, $f^m(x)=f^{n-m}(f^m(x))$ is periodic for $f$. Let us then denote by $v(x)$ the first periodic point in the sequence $x,f(x),f^2(x),\dots$ of iterates of $x$. (Technically, $v(x)=f^m(x)$ where $m$ is the smallest integer such that $f^m(x)$ is periodic for $f$.

For each periodic point $s\in S$, let $V_s$ be the set $v^{-1}(s)$. We define a tree with set of vertices $V_s$ as follows: its edges are simply the pairs $\{x,f(x)\}$, for $x\in V_s\setminus\{s\}$. To convince oneself that this actually forms a tree, it maybe better to imagine its construction from the vertex set $s$. One has an edge from $s$ to all non-periodic points $x\in V$ such that $f(x)=s$. And then an edge from each of these points $x$ to the points $y\in V$ such that $f(y)=x$ (and such $y$ are distinct from $x$, and are non-periodic), etc. building the tree from its root $s$.

In conclusion, self-maps $f$ are in bijections with triples $(S,f_S, (V_s))$ where $S$ is a subset of $V$, $f_S$ is a bijection of $S$ and $(V_s)$ is a family of disjoint trees disjoint containing $s$ such that $V=\bigcup V_s$.

To conclude this proof of Cayley's theorem, it remains to observe that for each subset $S$ of $V$, there are $\operatorname{Card}(S) !$ ways to, either put the elements of $S$ in some linear order, or to define a bijection of $S$. In both cases, it remains to additional families of trees are equinumerous, so that the number of self-maps of $V$ is equal to the number of animals with vertex set $V$, as claimed.

Friday, February 13, 2026

Associated prime ideals and regular elements in polynomial rings

This post is here to record a fact that ought to be better known and for which I ought to have known a proper proof beforehand.

Let's start by defining two thirds of the terms of the title.

By polynomial ring, I simply mean a ring of polynomials $A[T_1,T_2,\dots]$ over a commutative ring $A$, in any number of indeterminates. The most important case here will however be that of a ring of polynomials in one single indeterminate, everything would follow from that one by “standard” arguments. For simplicity, I'll write $A[T]$ for such  a ring of polynomials.

Regular elements in a ring $R$ are those which are not zero divisors. Explicitly, $a\in R$ is regular if $ab=0$ implies $ b=0$ for any $b\in R$. Or $a$ is a zero divisor if there exists a nonzero $b\in R$ such that $ab=0$.

The classic result linking these two notions that I have in mind is the following result.

Proposition. — Let $A$ be a commutative ring. If $P\in A[T]$ is not regular, then there exists a nonzero $a\in A$ such that $aP=0$.

There is a classic, rather elementary, proof of that result which I recall first. Let us first treat the case where is only one indeterminate. By assumption, there exists a nonzero polynomial $Q\in Q[T]$ such that $PQ=0$, and we may choose $Q$ to be of minimal degree. Write $P=\sum_{k=0}^m a_k T^k$ and $Q=\sum_{k=0}^n b_k T^k$, where $m$ and $n$ are the degrees of $P$ and $Q$, so that $a_m\neq 0$ and $b_n\neq 0$.

Lemma. — One has $a_k Q=0$ for all $k$.

The result being obvious for $k>m$, we may argue by decreasing induction on $k$, assuming that $a_\ell Q=0$ for all $\ell>k$. Then, in the product $PQ$, the term of largest degree is $a_k b_n T^{k+n}$, so that $a_k b_n=0$. In particular, the polynomial $a_kQ$ has degree $<n$. Since $P(a_k Q)=a_k PQ=0$, and by the choice of $Q$, we have $a_kQ=0$, as claimed.

Given the lemma, we see that $a_k b_\ell=0$ for all integers $k$ and $\ell$. Choosing any nonzero coefficient $b_\ell$ of $Q$, we obtain $b_\ell P=0$. This concludes the proof of the proposition when there is only one indeterminate.

To treat the general case, it is probably possible to make an induction on the number of indeterminates that appear in an equality $PQ=0$, where $Q$ is a nonzero element of $A[T]$. Another possibility, closer to the above proof, would be to choose a graded monomial ordering, for example the `deglex' order (we first order monomials by total degree, and then by lexicographic order with respect to some linear ordering of the indeterminates). I leave the details to later thought.

The last concept of the title is that of associated prime ideal. There are in fact two different notions for this, and in absence of noetherian hypotheses, it is better to consider the one coined as “weakly associated” by N. Bourbaki (Algèbre commutative) or D. Lazard (“Autour de la platitude”, Bulletin de la S. M. F., tome 97 (1969), p. 81-128). This is also the choice I made in my book, (Mostly) commutative algebra, Universitext, 2021. And so let me skip the adverb “weakly”, defining a prime ideal $P$ of $A$ to be an associated prime to an $A$-module $M$ if there exists $m\in M$ such that $P$ is minimal among the set of prime ideals containing the annihilator $\operatorname{ann}_A(m)$ of $m$. (When $A$ is noetherian, more generally when $P$ is finitely generated, one can prove that there exists $m$ such that $P$ equals the annihilator of $m$, and this is the — sometimes — more classic definition of an associated prime ideal.) The set of associated prime ideals of $M$ is denoted by $\operatorname{Ass}_A(M)$ (or even $\operatorname{Ass}(A)$ when $M=A$), where the abbreviation stands for assassin — In mathematics, forcing something to vanish is often, too often, related to the vocabulary of murder…

This looks like it is a strange notion, but it has some algebraic content, as summaried by the following proposition for which proof I refer to Theorem 6.5.8 of my above mentioned book.

Proposition — Let $A$ be a commutative ring and let $M$ be an $A$-module.

1) An element $a\in A$ belongs to some associated prime ideal of $M$ if and only if there exists a nonzero $m\in M$ such that $am=0$.

2) An element $a$ belongs to every associated prime ideal of $M$ if and only if the localized module $M_a$ vanishes.

Associated primes also have some geometric meaning when $M=A/I$, for some ideal $I$ of $A$. Indeed, the minimal prime ideals of $A$ containing $I$ are associated, and they represent the irreducible components of the locus $\mathrm V(I)$ in $\operatorname{Spec}(A)$. When the ideal $I$ is equal to its radical, this is all there is, but in general there are more associated prime ideals, and the corresponding closed subsets of $\mathrm V(I)$ are called “embedded” components.

It is now a natural question to elucidate associate prime ideal in the context of polynomial rings. The answer is given by a theorem of J. W. Brewer and W. J. Heinzer in their paper “Associated primes of principal ideals”, Duke Math. Journal, 1974.

Theorem (Brewer & Heinzer). — Let $A$ be a commutative ring. The associated prime ideals of the polynomial ring $A[T]$ are the ideals of the form $p[T]$, where $p$ is an associated prime ideal of $A$.

This theorem implies the above proposition. Indeed, if $P\in A[T]$ is a zero divisor, there exists an associated prime ideal $q\in A[T]$ such that $P\in q$, and $q$ is of the form $p[T]$ for some associated prime ideal $p$ of $A$. By definition, there exists an element $a\in A$ such that $p$ is minimal among the prime ideals annihilating $a$. Then $ap=0$, which implies that $aP=0$. Since $p$ is prime, one has $a\neq 0$, hence the proposition.

It doesn't look so clear to me how to immediately deduce the theorem from the proposition, although that might well be possible, and even easy. Anyway, let us describe the proof given by Brewer and Heinzer (this is theorem 7 in their paper), adjusting the notation and terminology. In fact, I cannot really prove the theorem without using the proposition, but I might have overlooked some easy argument.

We consider an associated prime ideal $q$ of $A[T]$ and let $p=A \cap q$ be its trace on $A$. Note that $p$ is a prime ideal of $A$.

Lemma. — One has $q=p[T]$.

The inclusion $p[T]\subseteq q$ is obvious; let us show the other one. Let $f\in q$ and let us prove $f\in p[T]$. Localizing at $p$, we recall that $A_p$ is a local ring with maximal ideal $pA_p$: in that case, elements of $pA_p$ are zero divisors (because $pA_p$ is associated), and elements outside of $pA_p$ are units. In particular, elements of $A_p[T]$ outside of $pA_p[T]$ have at least one coefficient which is a unit, hence can't be zero-divisors in $A_p[T]$ (by the proposition). This implies that $qA_p=pA_p[T]$ after localization, hence there exists $a\notin p$ such that $af\in p[T]$. Using that $p$ is prime, we get $f\in p[T]$, as was to be shown.

Let us now show that $q$ is an associated prime ideal of $A$. We still assume that $A$ is local with maximal ideal $p$. Let $f\in A[T]$ be such that $q$ is a minimal prime ideal among those containing $\operatorname{ann}(f)$.

Lemma. — One has $q=\sqrt{\operatorname{ann}(f)}$.

The radical of an ideal is the intersection of the minimal prime ideals that contain it, and $q$ is among this set of prime ideals, so that it suffices to prove that $q$ is the only minimal prime ideal of $A[T]$ that contains $\operatorname{ann}(f)$. Let then $q'$ be such a prime ideal. By definition, it is an associated prime ideal of $A[T]$ so that, by what has already been proved of the theorem, there exists a prime ideal $p'$ of $A$ such that $q'=p'[T]$. Since $A$ is local with maximal ideal $p$, one has $p'\subseteq p$, hence $q'=p'[T]\subseteq p[T]=q$. Since $q$ was assumed to be a minimal prime ideal containing $\operatorname{ann}(f)$, we get $q'=q$, as claimed.

From this lemma, one deduces that $p=\sqrt{\operatorname{ann}(f)\cap A}$.

Let then $a$ be a nonzero coefficient of $f$. By definition, one has $\operatorname{ann}_{A[T]}(f)\cap A \subseteq \operatorname{ann}_A(a)$, so that $p = \sqrt{\operatorname{ann}_{A[T]}(f)\cap A} \subseteq \sqrt{\operatorname{ann}_A(a)}$. Since Since $A$ is local with maximal ideal $p$, this implies that $p=\sqrt{\operatorname{ann}_A(a)}$. Consequently, $p$ is the only prime ideal containing $\operatorname{ann}_A(a)$, which implies that is is an associated prime ideal of $A$, concluding the proof of the theorem of Brewer and Heinzer.

On the other hand, there is a slightly different approach to the theorem of Brewer and Heinzer, and I want to sketch it now. This will build on proposition II/3.2 of Lazard's paper mentioned above.

Proposition (Lazard). — Let $B$ be a flat $A$-algebra and let $M$ be a $B$-module. Then $\operatorname{Ass}_A(M)$ equals the image of $\operatorname{Ass}_B(M)$ under the natural continuous map from $\operatorname{Spec}(B)$ to $\operatorname{Spec}(A)$.

Now specialize that proposition to the case where $B=A[T]$ and $M=B$. This says that the image of $\operatorname{Ass}_B(B)$ (the associated prime ideals of $B$) in $\operatorname{Spec}(A)$ is exactly $\operatorname{Ass}_A(A[T])$. On the other hand, the freeness of $A[T]$ as an $A$-module implies that $\operatorname{Ass}_A(A[T])=\operatorname{Ass}_A(A)$. Indeed, one reduces to the case of finite free modules, and then apply the classic inclusion $$ \operatorname{Ass}_A(N) \subseteq \operatorname{Ass}_A(M) \subseteq \operatorname{Ass}_A(N) \cup \operatorname{Ass}_A(M/N) $$ for every submodule $N$ of $M$, which will show by induction that $\operatorname{Ass}_A(M)=\operatorname{Ass}_A(A)$ when $M$ is free. On the other hand, we have seen in the first (and easiest) part of the proof of the theorem of Brewer and Heinzer that every associated prime ideal of $A[T]$ is of the form $q=p[T]$ for some prime ideal $p$ of $A$. Since $p=q\cap A$, this shows that $p$ is an associated prime of $A$ and gives the alternative proof.

Lazard's proof is very similar to (but predates by 5 years) the arguments given by Brewer and Heinzer. I don't really know why they didn't use it in their paper.

Sunday, November 30, 2025

The determinant of transvections (an update)

In the previous post, I had explained how I could prove a general version of the classic fact that transvections have determinant 1. Recall here that transvections in an $R$-module $M$ are linear maps of the form $x\mapsto x+f(x)v$, where $f$ is a linear form on $M$ and $v\in M$ is a vector such that $f(v)=0$. To be able to talk of determinant, I assumed that $M$ had a finite basis, so that linear maps correspond to matrices and the determinant of the matrix serves as a definition for the definition of the corresponding linear map. (It does not depend on the choice of a basis.) 

That proof had three steps: 

  1.  When $R$ is a field $F$ (and $\dim(M)\geq 2$), one can use linear algebra to get a basis $(e_1,\dots,e_n)$ of $M$ such that $v=e_1$ and $f=e_2^*$. Then the matrix of the transvection is triangular with ones on the diagonal, so its determinant is $1$. 
  2. When $R$ is a domain, one can consider its field of fractions $F$ and the base change to $F$ of the given transvection. By the case of fields, its determinant is $1$, and since $R$ is a subring of $F$, the determinant of the initial transvection is $1$ as well. 
  3. In general, one observes that our transvection is deduced, by base change, from the “universal” transvection, which lives on the ring $R=\mathbf Z[f_1,\dots,f_n,v_1,\dots,v_n]/\langle\sum f_i v_i\rangle$ and prove that this ring is an integral domain when $n\geq 2$. 

But one can do more with less effort! 

Indeed, the linear forms given by an expression $x\mapsto x+f(x)v$ are also interesting when $f(v)=-2$: they give symmetries in the direction given by $v$ with respect to the hyperplane defined by $f$, and, at least over fields, their determinant is $-1$. This suggests the following, more general, result.  

Theorem. — Let $M$ be an $R$-module with a finite basis, let $f\in M^*$ be a linear form and let $v\in M$. The linear map given $u$ by $x\mapsto x + f(x)v$ has determinant $1+f(v)$. 

To prove this result, we will first prove the case where $R$ is a field $F$. Then, we have two subcases, according to $f(v)=0$ or $f(v)\neq 0$. 

  • If $f(v)=0$, then $u$ is a transvection and its determinant is $1=1+f(v)$, as shown in the previous post.
  • Otherwise, $f(v)\neq 0$ and there is a basis $(e_1,\dots,e_n)$ of $M$ such that $(e_1,\dots,e_{n-1})$ is a basis of $\ker(f)$ and $e_n=v$. Then the matrix of $u$ is diagonal, with entries $(1,\dots,1,1+f(v))$, and its determinant is $1+f(v)$, as claimed. 

The case where $R$ is a domain is proved as before, by embedding $R$ into its field of fractions $F$. 

Finally, we reduce to the general case which is simply $R=\mathbf Z[f_1,\dots,f_n,v_1,\dots,v_n]$, without any need to quotient by the ideal $\langle \sum f_i v_i\rangle$. That ring is an integral domain, hence the theorem. The gain is that we don't need anymore to prove that the polynomial $\sum f_i v_i$ is irreducible.

Thursday, November 6, 2025

The determinant of transvections

A transvection in a $K$-vector space $V$ is a linear map $T(f,v)$ of the form $x\mapsto x + f(x) v$, where $f\in V^*$ is a linear form and $v\in V$ is a vector such that $f(v)=0$. It is known that such a linear map is invertible, with inverse given by $f$ and $-v$. More precisely, one has $T(f,0)=\mathrm{id}$ and $T(f,v+w)=T(f,v)\circ T(f,w)$. In finite dimension, these maps have determinant $1$ and it is known that they generate the special linear group $\mathrm{SL}(V)$, the group of linear automorphisms of determinant $1$.

When I started formalizing in Lean the theory of the special linear group, the question raised itself of the appropriate generality for such results. In particular, what happens when one replaces the field $K$ with a ring $R$ and the $K$-vector space $V$ with an $R$-module?

The definition of the transvections still makes sense. If $f\colon M\to R$ is $R$-linear and $v\in M$, then the map $T(f,v)$ defined by $x\mapsto x+f(x) v$ is linear. When $f=0$ or $v=0$, this map is the identity. Moreover, if $v,w\in V$ are such that $f(v)=f(w)=0$, then $$ T(f,v) \circ T(f,w) (x)=T(f,v)(x+f(x)w)=x+f(x)w + f(x+f(x)w)v = x + f(x)(v+w),$$ so that $T(f,v)\circ T(f,w) = T(f, v+w)$. This implies that the map $v\mapsto T(f,v)$ is a morphism from the additive group of $V$ to the multiplicative monoid $\mathrm{End}(M)$ of $R$-endomorphisms of $M$. In particular, it lands into the group $\mathrm{GL}(M)$ of linear automorphisms of $M$.

Now assume that $M$ is a free $R$-module of finite rank, that is, has a finite basis $(b_1,\dots,b_n)$. This allows to define the determinant of an element of $\mathrm{End}(M)$, as the determinant of the associated matrix in the given basis, and one can ask about the determinant of these transvections. The following is not so surprising, but I couldn't find it in the literature.

Theorem. — For every $f\in M^*$ and $v\in M$ such that $f(v)=0$, one has $\det(T(f,v))=1$.

How can one prove such a result? The special case where $R$ is an integral domain is simpler, and is actually a step in the proof.

Proposition. — The theorem holds when $R$ is an integral domain.

Proof. — I can give two proofs of that result. The simplest one consists in considering the field of fractions $K$ of the integral domain $R$ and remarking that the matrix of the transvection $T(f,v)$ is also the matrix of a transvection in the $K$-vector space $V=K\otimes_R M$. In fact, if one identifies $M$ with $R^n$ by way of the matrix $b$, the linear form $f$ is a row vector in $R^n$, the vector $v$ is a column vector in $R^n$, satisfying $\sum f_j v_j=0$, the vector space $V$ is simply $K^n$, so that the matrix of $T(f,v)$ is also the matrix of a transvection in $V$. Its determinant is $1$, because of the case of fields, so that the determinant of $T(f,v)$ is $1$.

To be complete, let us explain the case of fields. The fact is that one choose an appropriate basis $(b_1,\dots,b_n)$ of $V$ such that $b_1=v$, $(b_1,\dots,b_{n-1})$ is a basis of $\ker(f)$ and $b_n$ is chosen such that $f(b_n)=1$. In that basis, the vector $v$ has coordinates $(1,0,\dots,0)$; the linear form $f$ is given by $f(x_1,\dots,x_n)=x_n$ and the linear map $T(f,v)$ is given by $(x_1,\dots,x_n)\mapsto (x_1+x_n,x_2,\dots,x_n)$. Its matrix is lower triangular, with only ones on the diagonal, hence its determinant is $1$.

Here is a second proof, more elaborate, but quite amusing. Since the determinant is multiplicative, the map $v\mapsto \det(T(f,v))$ is a group morphism from the submodule $\ker(f)$ to $R^\times$. To upgrade this result, one may consider an indeterminate $X$ and consider the transvection $T(f, Xv)$ of the $R[X]$-module $R[X]\otimes M$ deduced from $M$ by base change. This replaces the ring $R$ with the ring $R[X]$ and the determinant $D(X)=\det(T(f,Xv))$ is an invertible element of $R[X]$. A classical theorem describes such polynomials: their constant coefficient is invertible, and all other elements have to be nilpotent. Since $R$ is an integral domain, it has no nilpotent element, so that $D(X)$ is constant, invertible. One has $D(0)=\det(T(f,0))=\det(\mathrm{id})=1$, hence $D(X)=1$. Setting $X=1$, one gets $\det(T(f,v))=1$.

However, this second proof does not seem to generalize about the general case. On the other hand, a standard trick in algebra allows us to reduce to this case, namely, by reducing to the generic case. To explain this more easily, let us consider that $M=R^n$, where the linear form $f$ has coordinates $(f_1,\dots,f_n)$ and the vector $v$ has coordinates $(v_1,\dots,v_n)$. The relation $f(v)=0$ means that $\sum_{i=1}^n f_i v_i=0$, leading to the consideration of the ring $S=\mathbf Z[X_1,\dots,X_n,Y_1,\dots,Y_n]/\langle\sum X_i Y_i\rangle$ of polynomials with integer coefficients in $2n$ indeterminates quotiented out by the relation $\sum X_i Y_i=0$.

Proposition. — For $n\geq 2$, the ring $S=\mathbf Z[X_1,\dots,X_n,Y_1,\dots,Y_n]/\langle\sum X_i Y_i\rangle$ is an integral domain.

Proof. — Since $\mathbf Z$ is a unique factorization domain (UFD), a theorem of Gauss asserts that the polynomial ring $\mathbf Z[X_1,\dots,X_n,Y_1,\dots,Y_n]$ is again a UFD. Consequently, we have to prove that the polynomial $\sum_{i=1}^n X_i Y_i$ is irreducible if $n\geq 2$. Let us consider this ring as a ring of polynomials in the variable $Y_n$ with coefficients in the ring $S'=\mathbf Z[X_1,\dots,X_n,Y_1,\dots,Y_{n-1}]$ in $2n-1$ indeterminates. The proof of Gauss's theorem also establishes that the irreducible elemements of $S=S'[Y_n]$ are either the irreducible elements of $S'$, or the elements of $S'[Y_n]$ which are irreducible as polynomials in $K'[Y_n]$ ($K'$ being the field of fractions of $S'$) and such that the gcd of their coefficients is $1$. Our polynomial of interest is $X_n\cdot Y_n + \sum_{i=1}^{n-1} X_i Y_i$. It has degree $1$ in $Y_n$, hence is irreducible as a polynomial in $K'[Y_n]$. The gcd of its coefficients is $\gcd(X_n,\sum_{i=1}^{n-1}X_i Y_i)$. It divides $X_n$, so is either $\pm1$ or $\pm X_n$, and since $X_n$ doesn't divide $\sum_{i=1}^{n-1}X_i Y_i $, the gcd is equal to $1$, as claimed.

We can now conclude the proof of the theorem when $n\geq 2$. Indeed, the case of integral domains implies that the determinant of the generic transvection $T(X,Y)$ in $S^n$ is equal to $1$. Moreover, there is a (unique) ring morphism $\phi\colon \mathbf Z[X_1,\dots,X_n,Y_1,\dots,Y_n]/\langle \sum X_iY_i\rangle$ that maps $X_i$ to $f_i$ and $Y_i$ to $v_i$ for every $i$. Applying $\phi$ to the coefficients of the matrix $T(X,Y)$, one gets the matrix $T(f,v)$, so that $\det(T(f,v))=\phi(\det(T(X,Y)))=\phi(1)=1$.

When $n\leq 1$, the module $M$ is generated by one element $e$, and the condition $f(v)=0$ implies that $f(x)v=0$ for every $x\in M$, so that $T(f,v)=\mathrm{id}$. Consequently, $\det(T(f,v))=1$.

Saturday, September 6, 2025

The two adjunctions of the preimage

Sometimes in mathematics, you are told about very elementary things of which you hadn't even thought.

I was well aware of some “duality” between image and preimage, but I just learned from Anatole Dedecker (who learned it from Patrick Massot) about another “duality” between preimage and some other notion. Moreover, it appears that this new notion can be used for making slightly more natural a proof in general topology!

Here, “duality” is taken in an informal meaning, the correct word is “adjunction”, in the sense of category theory, and I will try to explain that.

1. Image and preimage

So consider a map $f\colon X \to Y$ between two sets. It induces two other maps relating the sets $\mathcal P(X)$ and $\mathcal P(Y)$ of subsets of $X$ and $Y$. Note that the inclusion relation between subsets these two sets $\mathcal P(X)$ and $\mathcal P(Y)$ allows to view them as ordered sets.

First, we have the direct image operation $f_{*}$, that maps a subset $A\subseteq X$ to the subset $f_{*}(A)$ of $Y$, the set of all images $f(a)\in X$, for $a\in A$. The classical notation would be $f(A)$, but it is ambiguous in the case where a subset $A$ of $X$ is also an element of $X$, and introducing a specific notation will help to clarify some statements later on. This map $f_{*}\colon \mathcal P(X) \to \mathcal P(Y)$ is increasing: for $A$ and $A'\in\mathcal P(X)$ such that $A\subseteq A'$, one has $f_{*}(A) \subseteq f_{*}(A')$.

Then we have the preimage operation $f^{*}$, that maps a subset $B\subseteq X$ to the subset $f^{*}(B)$ of $X$ consisting of all preimages of elements of $B$, namely all $a\in A$ such that $f(a) \in B$. The classical notation is rather $f^{-1}(B)$, but it has the same ambiguity as the direct image. Bizarrely, Bourbaki found the need to invent a another notation for that one, and they put the symbol “$-1$” on top of the letter $f$. The notation $f ^{*}$ is chosen by symmetry with the direct image $f_{*}$. Again, the map $f^{*}\colon \mathcal P(Y) \to\mathcal P(X)$ is increasing: for $B$ and $B'\in\mathcal P(Y)$ such that $B\subseteq B'$, one has $f^{*}(B) \subseteq f^{*}(B')$.

Finally, there is a compatibility between these two operations $f_{*}$ and $f ^{*}$: for $A\in\mathcal P(X)$ and $B\in\mathcal P(Y)$, one has $f_{*}(A) \subseteq B$ if and only if $A \subseteq f^{*}(B)$. Indeed, both of these expressions mean that if $f(a) \in B$ for all $a\in A$. We summarize this property by  saying that the operation $f_{*}$ is left adjoint to the operation $f ^{*}$, or that the operation $f^{*}$ is right adjoint to the operation $f_{*}$.

This terminology comes from category theory, in which adjunctions of functors play an important role since the paper of Daniel Kan (1958), Adjoint functors.

In our case, the categories are just the ordered sets $\mathcal P(X)$ and $\mathcal P(Y)$, with the corresponding sets as sets of objects, and where the set of arrows $A$ to $A'\in\mathcal P(X)$ is a singleton when $A\subseteq A'$, and is empty otherwise. The book of Emily Riehl (2016), Category Theory in Context, is a nice introduction to this topic, with illuminating elementary examples. The property that the operations $f_{*}$ and $f^{*}$ are increasing means that they are *functors* between these categories, and the equivalence $f_{*}(A) \subseteq B \Leftrightarrow A \subseteq f^{*}(B)$ induces the category-theoretical adjunction.

In this case, an adjunction pair is also called a Galois connection. There, the terminology comes from  Galois theory, the two ordered sets are the set of subextensions of a Galois extension $K\to L$ and the set of subgroups of the Galois group $\operatorname{Gal}(L/K)$, the maps are decreasing and correspond to mapping a subextension $E$ of $L$ to the subgroup of $\operatorname{Gal}(L/E)$ of $\operatorname{Gal}(L/K)$, and a subgroup $H\subseteq \operatorname{Gal}(L/K)$ to the fixed-field $L^H$. In Galois theory, these two maps are even bijective.

2. The adjoint functor theorem

While, as MacLane wrote, “adjoint functors arise everywhere”, not every functor can be part of an adjunction. Indeed, if a functor $F$ is left adjoint to a functor $G$, then $F$ preserves colimits and $G$ preserves limits.

Category theory considers limits and colimits of arbitrary diagrams, but in the restricted setting of ordered sets, where there can be at most one arrow from one object to another, diagrams boil down to subsets of objects, limits correspond to infimums (greatest lower bound) and colimits to supremums (least upper bound), which may exist, or not, in particular ordered sets.In our even more restricted case of the set $\mathcal P(X)$ of subsets of a given set $X$, infimum corresponds to intersection, supremum to union, and we have $f_{*}(\bigcup A_i) = \bigcup f_{*}(A_i)$ for every family $(A_i)$ of subsets of $X$, and $f^{*}(\bigcap B_i) = \bigcap f^{*}(B_i)$ for every family $(B_i)$ of subsets of $Y$.

There is an abstract theorem in category theory, the “general adjoint functor theorem”, that says that these property are essentially sufficient for a functor $F$ to be a left adjoint to some functor $G$, or for a functor $G$ to be a right adjoint to some functor $G$. One has to be more careful for the actual statement, but this is the idea.

For an increasing map $G\colon T \to S$ between ordered sets $S$ and $T$, the existence of a left adjoint $F$ can be understood from: for $s\in S$ and $t\in T$, one should have $F(s)\leq t$ if and only if $s\leq G(t)$: consequently, it suffices to take for $F$ the infimum, assuming it exists, of all $t$ such that $s\leq G(t)$. Dually,  the right adjoint $G$ to a functor $F$ would map $t$ to the supremum, assuming it exists,  of all $s$ such that $t\leq F(s)$.

In the case of the image $f_{*}\colon \mathcal P(Y)\to \mathcal P(X)$, this rule defines the right adjoint as mapping $B \in\mathcal P(Y)$ to the union of all subsets $A\in\mathcal P(X)$ such that $f _{*}(A) \subseteq B$. This is exactly the preimage of $B$!

Conversely, in the case of the preimage $f^{*}\colon \mathcal P(Y)\to \mathcal P(X)$, this procedure defines the left adjoint as mapping $A \in\mathcal P(X)$ to the intersection of all subsets $B$ such that $A \subseteq f^{*}(B)$. Again, this is just the image $f _{*}(A)$ of $A$, but I find it slightly more difficult to prove without using that we already know this image and the already known adjunction between $f _{*}$ and $f ^{*}$.

3. The other adjunction

We have seen that preimages respect intersections. As a matter of fact, they also respect unions: $f ^{*}(\bigcup B_i)= \bigcup f ^{*}(B_i)$. Given the adjoint functor theorem, this implies that there is an increasing map $f_! \colon \mathcal P(X) \to \mathcal P(Y)$ which is a right adjoint to $f ^{*}$. What is this operation?

The adjoint functor theorem gives a way to compute it: for $A\in\mathcal P(X)$, the set $f_!(A)\in\mathcal P(Y)$ is the union of all subsets $B\in\mathcal P(Y)$ such that $f^{*}(B) \subseteq A$. It suffices to consider such sets $B$ which are singletons $\{b\}$ and we get that a point $b\in Y$ belongs to $f_!(A)$ if and only if all preimages of $b$ belong to $A$.

Here are two more ways to get a grip on this new adjunction.

Note that a point $b\in Y$ belongs to $f_{*}(A)$ if and only if there exists $a\in A$ such that $b = f (a)$, which means that there exists $a\in A$ in the preimage $f^{*}(\{b\})$, relating $f_{*}$ with the existential quantifier. Similarly, a point $b\in Y$ belongs to $f_! (A)$ if and only if for every $a\in f^{*}(\{b\})$, one has $a\in A$, relating $f_!$ with the universal quantifier.

The other way comes by taking complements: a point $b$ does not belong to $f_!(A)$ if it has a preimage that does not belong to $a$. In other words, $f_!(A) = \complement f_{*}(\complement A)$. This leads to considering the complement map from $\mathcal P(X)$ to itself as an order-reversing involution, and similarly on $\mathcal P(Y)$, and observing that they commute with preimage, in the sense that $f^{*}(\complement B) = \complement f^{*}(B)$ for all $B\subseteq Y$. Consequently, this operation transfers the left adjoint $f _{*}$ of $f ^{*}$ to a right adjoint, and conversely, which is exactly what we had observed.

4. An application in general topology

As an application, this adjunction can be used in topology to characterize open or closed maps. By definition, a map $f \colon X\to Y$ between topological spaces is open if it maps an open subset to an open subset, and it is closed if it maps a closed subset to a closed subset.

The definition of $f_!$ using complement, and the fact that a set is closed if and only if its complement is open implies the following lemma:

Lemma. — A map $f\colon X \to Y$ is closed (resp. open) if and only if for every open (resp. closed) subset $U\subseteq X$, the set $f_! (U)$ is closed (resp. open).

It also allows to give a natural proof of the classical characterization of closed maps:

Proposition. — Let  $f\colon X \to Y$ be a map between topological spaces. The following properties are equivalent:

  1. The map $f$ is closed;
  2. For any subset $B$ of $Y$, the filter of neighborhoods of $f^{*}(B)$ is coarser than the preimage of the filter of neighborhoods of $B$;
  3. For any subset $B$ of $Y$ and any neighborhood $U$ of $f^{*}(B)$, there exists a neighborhood $V$ of $B$ such that $f^{*}(V)\subseteq U$;
  4. For any point $b\in Y$, the filter of neighborhoods of $f^{*}(\{b\})$ is coarser than the preimage of the filter of neighborhoods of $b$;
  5. For any point $b\in Y$ and any neighborhood $U$ of $f^{*}(\{b\})$, there exists a neighborhood $V$ of $b$ such that $f^{*}(V) \subseteq U$.


Given the definitions of the preimage of a filter and the comparison relation on filters,
the assertions (2) and (3) are equivalent, as well as the assertions (4) and (5).

Obviously, (3) implies (5).

Let us assume (1), that $f$ is closed, and let us prove (3). Let $B$ be a subset of $Y$ and let $U$ be a neighborhood of $f^{*}B$ in $X$. By definition, there exists an open subset $U'$ of $X$ such that $f^{*}B \subseteq U' \subseteq U$. Taking adjunction, we get $B\subseteq f_! U' \subseteq f_! U$. Since $f$ is closed, the set $f_! U'$ is open, so that $f_! U$ is a neighborhood of $B$. It remains to prove that $f^{*}f_! U\subseteq U$.  To prove this inclusion, we apply the adjunction $(f^{*}, f_!)$ once more, and see that it is equivalent to the obvious inclusion  $f_! U \subseteq f_! U$.

Finally, let us assume (5) and let us prove that $f$ is closed. Let $U$ be an open subset of $X$ and let us prove that $f_! U$ is open in $Y$. It suffices to prove that for every $b\in f_! U$, the set $f_! U$ is a neighborhood of $b$. By the construction of $f_!$, the set $f^{*}(\{b\}) $ is contained in $U$ so that $U$ is a neighborhood of $f^{*}(\{b\})$. Applying (5), we get a neighborhood $V$ of $b$ in $Y$ such that $f^{*}V \subseteq U$. Applying the adjunction $(f^{*}, f_!)$, we get the inclusion $V \subseteq f_! U$. In particular, $f_! U$ is a neighborhood of $b$, as was to be shown.