AI, Mathematical Judgment, and
The inverse Galois problem asks whether every finite group occurs as the Galois group of some finite Galois extension of . The program to realize the sporadic finite simple groups as Galois groups over began in 1984. Over the following years, every case except was solved, leaving as the last open case for nearly four decades. Our recent preprint, joint with Xiaoyu Huang, Blake Jackson, Kyu-Hwan Lee, Bjorn Poonen, and Rachel Pries, resolves this final case and completes the program.
Since posting the paper, many people have asked how we used AI and what led us to consider the triple
The following post is adapted from my answer to these questions on Zulip. By sharing what I learned from this fruitful collaboration, I hope to give a clearer picture of how we worked with AI in practice and to help others develop their own ways of AI-collaboration.
How the five cases emerged
We started with four-tuples. Building on earlier work, we extended the existing computations and developed a fairly complete picture of the possible genus-zero braid orbits. Häfner’s Theorem 5.1 led us from these four-tuples to the following five generating triples:
Each of these gives rise to a length-two, genus-zero braid orbit for the corresponding four-tuple.
The case was the easiest to compute because its associated quotient curves have genus 0. We could handle it directly with BelyiDB. In this case, however, the Galois action on the resulting covers was transitive, so there was no fixed point of the kind we needed.
The case was different. Its associated curves are non-hyperelliptic curves of genus 4. BelyiDB gave us the numerical data, but not the exact defining equations, so we had to recover those equations ourselves.
When more precision was the wrong answer
Our first attempt used triangle-group coordinates directly. We tried 40, 60, and then 90 digits of precision. Even at 90 digits, and with height bounds approaching , we could not recognize the coefficients. The AI systems suggested pushing the precision higher. At that point, however, our computational resources were already limited, so we stopped and asked whether the real problem was our choice of coordinates.
We then realized that coordinates defined using the Belyi map are equivariant under the Galois action. This removes the ambiguity coming from the original coordinates. The change was dramatic. With the new coordinates, 40 digits were enough to recognize the quadratic equation , and its coefficients had heights below . This was far below the height bounds approaching that we had already tried. At this point, clearly stood out among the five candidates.
We still had to recover the cubic equation . The reliable digits left after recognizing were not enough to recognize directly. The initial AI suggestion was again to increase the precision. Instead, we developed a separate reduction algorithm and recovered from the same 40-digit data. The equations and define the image of the genus-4 curve under its canonical embedding into .
Some of the most important decisions were clearly mathematical judgments made by the human collaborators. These included deciding what to compute, stopping an increasingly expensive calculation, changing the strategies, interpreting the numerical evidence, and deciding where to direct our limited resources.
What the AI workflows contributed
Our multi-agent AI workflows helped us generate and test code, analyze data, work with existing packages, organize large computations, and monitor and recover from failures. This saved us a great deal of time. But the overall strategy, and the decisions to redirect it when something was not working, came from the human collaborators.
We also tried more autonomous approaches at the beginning of the project. Within our limited AI-usage budget, these attempts did not make meaningful progress and did not give us much guidance about what to try next. The workflow that eventually succeeded was not end-to-end AI autonomy. It was a tightly controlled collaboration in which AI made the computational work much faster, while the human collaborators continued to choose and revise the mathematical direction.
For a sense of the computational scale, the 60-digit computation of orbit 7 took approximately 1.71 CPU-hours. All the computations that followed were completed within one day and used fewer than 12 CPU-hours in total. These included recognizing and analyzing the coefficients of the quadratic equation and the cubic equation , computing the Belyi map, carrying out the descent to , and constructing a polynomial
whose splitting field over has Galois group . We then specialized to a rational value and used the PARI/GP routines and to obtain a lower-height degree-23 polynomial
The final mathematical claims were verified rigorously in Magma and PARI/GP without AI. No text in the manuscript was written by AI, although we did use multiple AI agents for internal checking and proofreading.
What I learned
The main lesson for me is that more computing power alone would not have solved the problem. The best analogy is deep-space observation: AI gave us a powerful and precise telescope, but the team’s mathematical knowledge told us where to point it, when further magnification would not help and how to interpret what came into view. Once we chose the right object and the right coordinates, the relevant structure became visible.
The result grew out of many fruitful mathematical discussions and our exploration of human-AI collaboration. I hope this account inspires others as they develop their own approaches to collaborating with AI. For readers who would like to see what ultimately came into view, the full mathematical details are available here.
Received 14 August 2026.
Add to the discussion