This is a guest post by Johannes Carmesin.
About a month ago, on 6 October, when OpenAI made more than 700 mathematical manuscripts available in a single day, I was shocked. I am particularly impressed by the speed at which AI is getting better at mathematics. These manuscripts contain powerful results, including the resolution of Hadwiger’s conjecture. Yet I feel that something often overlooked is that we need more information than these manuscripts alone to assess AI capabilities.
OpenAI itself reported that the initial collection comprised 722 manuscripts, grouped into 372 families of results, arising from an evaluation in which its model was posed approximately 4,000 problems. The full list of attempted problems and their outcomes has not been made public.
One of the results, Problem #185, disproves the packing/covering conjecture formulated by Nathan Bowler and myself. Remarkably, Nash-Williams’ considerably older intersection conjecture, which is a special case, remains open. Early in my mathematical career, more than ten years ago, I worked intensively on this conjecture without being able to prove it. Beyond that personal interest, I think it is particularly timely to discuss it now because it offers an interesting case study of modern AI capabilities. Let me start from the beginning.
The Aharoni–Berger theorem
Menger’s theorem says that in a finite graph, the maximum number of vertex-disjoint paths between vertex sets $A$ and $B$ equals the minimum size of a vertex set separating them. This is an instance of linear-programming duality: one problem packs paths, while the dual covers all $A$–$B$ paths by vertices. Integrality gives actual paths and vertices as optimal solutions. Complementary slackness explains how they fit together: each chosen path meets the separator exactly once, and every separator vertex lies on a chosen path.
This gives the following more structural formulation of Menger’s theorem. Given vertex sets $A$ and $B$, there are pairwise vertex-disjoint $A$–$B$ paths and an $A$–$B$ separator consisting of exactly one vertex from each path; see the figure below.

The formulation makes sense for infinite graphs too, whereas equality of infinite cardinalities loses this information. Aharoni and Berger proved that these compatible witnesses always exist, settling the long-standing Erdõs–Menger conjecture. An example of a simple infinite graph where the Aharoni–Berger theorem is non-trivial is given in the figure below.

From graphs to matroids
Before passing to infinite matroids, let us look at another structural statement in the finite setting. For two matroids on a common ground set $E$, a packing consists of disjoint spanning sets, one for each matroid. A covering consists of independent sets, one in each matroid, whose union is $E$.
For two copies of the cycle matroid of a connected graph, packing asks for two edge-disjoint spanning trees; covering asks for two forests that together contain every edge. Packing becomes possible when there are enough edges, while covering becomes possible when there are few enough.
The finite packing/covering theorem combines these two possibilities. It partitions $E$ into a dense part $P$ and a sparse part $Q$: the matroids restricted to $P$ admit a packing, and the matroids obtained by contracting $P$ admit a covering of $Q$. Thus the dense part supports disjoint spanning sets, and the remaining elements can be covered by independent sets after contraction as shown below.

This theorem is equivalent to Edmonds’ intersection theorem, with one matroid dualised when passing between the formulations. The structural form of Edmonds’ intersection theorem says that two matroids $M$ and $N$ on $E$ have a common independent set $I$ with a partition satisfying
$I=I_M\mathbin{\dot\cup}I_N,
\qquad
\operatorname{cl}_M(I_M)\cup\operatorname{cl}_N(I_N)=E.$
Every element of $E$ is spanned by the $M$-part in $M$ or by the $N$-part in $N$. For finite matroids, this supplies a certificate that $I$ has maximum possible size. As with Menger’s theorem, the structural statement explains why the optimum has been reached.
Now we pass to infinite matroids. It is highly desirable to obtain a fully algebraic proof of the Aharoni–Berger theorem. Nash-Williams had proposed a conjecture for finitary matroids (see this paper by Aharoni and Ziv) which would imply this theorem. The statement of this conjecture is the above statement of Edmonds’ intersection theorem, with the assumption that $M$ and $N$ are finite matroids replaced by the assumption that they are finitary matroids. Here a matroid is finitary if all its circuits are finite, although its ground set may be infinite. Since finite-cycle matroids of graphs are examples of finitary matroids, the standard deduction of Menger’s theorem from matroid intersection extends to infinite matroids, showing that Nash-Williams’ conjecture implies the Aharoni–Berger theorem.
This post can be understood without any particular knowledge of infinite matroids. However, if you would like to learn more about them, Nathan Bowler’s series on infinite matroids is an excellent introduction.
Nathan and I worked on another problem of Nash-Williams concerning the existence of packings in infinite matroids. During our investigation, we discovered the packing/covering statement given above. Interestingly, before our work it did not seem to be part of the literature even for finite matroids. But as classical rank-based approaches to packings are much less powerful for infinite matroids, we were, in a sense, forced to discover it. This is a very attractive aspect of studying infinite graphs and matroids: standard induction arguments often cannot simply be replaced by transfinite induction. Instead, to extend a theorem from the finite to the infinite setting, one is forced to discover a more structural version of it. Menger’s theorem and the packing/covering theorem are excellent examples of this phenomenon.
Nathan and I conjectured that the above packing/covering statement holds not only for finite matroids but for all infinite matroids. We proved that this statement is equivalent to the assertion that every pair of matroids on a common ground set satisfies Edmonds’ intersection statement in the above form, and thus implies Nash-Williams’ conjecture. Here I should note that, for applications in infinite topological graph theory, it would be enough to prove this conjecture for a subclass of all matroids called tame matroids. Of course, we made the conjecture in full generality, as this was the next open problem to consider.
What is Problem #185?
OpenAI found a counterexample on a countable ground set to the packing/covering conjecture formulated by Nathan and myself. Yet the tame case of the conjecture remains open, including Nash-Williams’ conjecture.
Even the correct infinite analogue of a uniform matroid requires care. In the finite case, all subsets of a fixed size are bases. This description cannot simply be transferred to infinite cardinalities: an infinite set and a proper superset can have the same size, whereas one basis cannot be a proper subset of another. The appropriate definition is structural: a matroid is uniform if every subset of its ground set is independent or spanning. We are interested in such matroids of infinite rank and corank, so that every basis and its complement are infinite.
The existence of such a matroid is itself non-trivial. Nathan Bowler and Stefan Geschke constructed examples that are equal to their duals on the same labelled ground set, assuming Martin’s Axiom. An important contribution of OpenAI’s work is to construct such a matroid $U$ in ZFC, resolving the existence question without this additional assumption.
A finite uniform matroid is determined, up to isomorphism, by the size of its ground set and the size of a basis. For infinite rank and corank, these cardinalities no longer determine the matroid. Indeed, rather surprisingly, infinite uniform matroids offer, intuitively speaking, more freedom in their construction than any other matroids known to date. These matroids were therefore the most promising ingredients for a counterexample. Two copies of a self-dual uniform matroid nevertheless admit both a packing and a covering: simply take a basis and its complement.
Nathan and I already regarded direct sums of such matroids as a promising strategy in 2013. We explored the idea briefly, but gave up: we thought that making it work, if it could be made to work at all, would take us years.
OpenAI assembles countably many copies of its specially constructed uniform matroid into two direct sums on the same ground set. The copies are disjoint within each matroid, but the two decompositions overlap. The construction exploits the freedom in choosing the uniform matroid, using set-theoretic machinery to enforce additional properties that make this pair a counterexample. The difficult task is to enforce those properties while still satisfying all infinite-matroid axioms. OpenAI also supplies a Lean formalisation.
Joó versus the machine
In 2021, in a major advance, Attila Joó proved Nash-Williams’ conjecture for finitary matroids on a countable ground set. See the figure below for an overview of the different classes and the remaining open cases of the intersection and packing/covering conjectures.

Given that Nash-Williams’ conjecture is older, better known and mentioned in OpenAI’s manuscript, I suspect the model attempted it too but could not solve it. But that is a guess.
OpenAI’s result is exciting pioneering work and raises far more questions than it answers, which is often an indicator of interesting mathematics. I am therefore a little disappointed that it did not formulate the conjecture for tame matroids, which is the obvious next step. Indeed, if true, this conjecture would imply an extension of the Aharoni–Berger theorem to a large class of topological spaces.
Infinite uniform matroids can, under suitable set-theoretic assumptions, have bases of different cardinalities, which is a very non-combinatorial artefact. From a combinatorial perspective, OpenAI’s counterexample may be interpreted as excluding these non-combinatorial constructions from the natural class of matroids for which Edmonds’ intersection principle holds. This may give some hope that, if packing/covering holds for much wider classes of matroids than those for which it is currently known, a proof might, like that of the Aharoni–Berger theorem, be combinatorial in nature. Aharoni’s 1987 proof of the countable Erdõs–Menger conjecture was followed, nearly two decades later, by Aharoni and Berger’s proof for arbitrary graphs. I see Joó’s theorem as an analogous milestone for Nash-Williams’ conjecture, giving grounds to hope for a similar development: that the club-set techniques used in the Aharoni–Berger theorem can be extended to infinite matroids by combining them with Joó’s ideas.
Hence I regard Joó’s theorem as the most substantial result in the area today.
In infinite matroid intersection, AI currently leads in constructing counterexamples, but a human holds the strongest theorem.
Studying AI capabilities more broadly
To assess AI capabilities, we need to know how often a system solves a specified set of problems under specified conditions. OpenAI’s counts do not answer that question.
There is evidence beyond Problem #185 that current AI systems are stronger at finding counterexamples than at proving theorems. Indeed, in the summer, Vaibhav Bajpai, Nathan Bowler, Utku Okur and I released Ten Challenges in Combinatorics: a selection of ten significant problems in combinatorics, formalised in Lean and hence ready to be tackled by AI. Since then, three of these ten challenges have been resolved – all by counterexamples! Of course, more investigations are needed to underscore the claim that current AI systems are more successful at refuting conjectures than at proving them.
Just this week, we released LPBench, a larger set of slightly more than 100 problems formalised in Lean, to study broader AI capabilities. We are grateful to Anthropic for providing us with the means to test its best currently publicly available models on these problems. They performed strongly in generating Lean proofs for results in the literature, making them reliable tools for formalising human proofs. The second important piece of news for human mathematicians is that, despite some effort, they were unable to resolve any of the 32 open problems in the benchmark.





