Advancing Mathematics Research with AI-Driven Formal Proof Search
George Tsoukalas, Anton Kovsharov, Sergey Shirobokov, Anja Surina, Moritz Firsching, Gergely Bérczi et al. · arXiv (Cornell University) · 2026
AI-generated evidence extraction, verified across multiple analytical personas. Not a substitute for the peer-reviewed original.
Methodology & findings
Study design
Systematic evaluation of AI-driven formal proof search agents (four agent variants: basic, basic with AlphaProof, evolutionary, and full-featured) applied to three problem sets: 353 Erdős problems from the Formal Conjectures repository, 492 OEIS conjectures, and application to open research problems in optimization, graph theory, algebraic geometry, additive combinatorics, and quantum optics.
Main result
The full-featured agent autonomously resolved 9 of 353 open Erdős problems at the per-problem cost of a few hundred dollars, proved 44/492 OEIS conjectures, and is being deployed in combinatorics, optimization, graph theory, algebraic geometry, and quantum optics research. "Our most capable agent autonomously resolved 9 of 353 open Erdős problems at the per-problem cost of a few hundred dollars, proved 44/492 OEIS conjectures, and is being deployed in combinatorics, optimization, graph theory, algebraic geometry, and quantum optics research."
Research paradigm
Computational mathematics with empirical validation on open research problems
Author conclusions
"Our results demonstrate the utility of LLM-powered formal proof search as a tool for mathematics research, and point to an ongoing shift from specialized trained systems toward simple agentic loops as LLMs become more capable." The authors further conclude: "We built AlphaProof Nexus with the belief that the future of mathematics lies in human-machine partnership, where interactive AI tools serve to expand a mathematician's creative capacity. Our results support this vision. Our mathematician collaborators found that proof attempts by our agents enhanced their understanding of a problem, even when an agent could not prove the claim at hand."
Risk of bias
Selection bias in problem choice: only formalized problems in repositories were evaluated; Stochastic variance in agent performance; Model bias inherited from underlying LLMs (Gemini 3.1 Pro, Gemini 3.0 Flash); Confirmation bias: problems solved may be inherently more tractable to formal methods; Selection bias: Only 9 out of 353 Erdős problems were solvable; the agent's success is concentrated in specific mathematical domains where Lean libraries are mature; Measurement bias: High variance in per-problem inference costs due to stochastic nature of agents; variance not fully quantified; Model bias: Agents inherit biases of underlying LLMs (Gemini 3.1 Pro, Gemini 3.0 Flash); Hallucination bias: Documented instances where agents claimed lemmas were established results when they were actually hallucinations; Formalization bias: Dependency on correct Lean formalization; misformalizations detected post-hoc (e.g., Erdős #125, #741); Computational resource bias: Cost-based comparisons favor agents with access to more computational budget; Selection bias: choice to run on Erdős problems where Lean formalizations existed; Problem tractability bias: success concentrated in combinatorics, convex optimization, and number theory with mature Lean libraries; LLM inherent biases inherited by the agents; High variance in search outcomes across stochastic agent executions
Limitations
- "At present, our agents' successes are concentrated in areas such as combinatorics, convex optimization, and number theory, where Lean's mathematics library is mature and tasks often decompose into tractable subgoals
- Even most Erdős problems remain out of reach, let alone problems that require extensive new theory
- Additionally, our agents inherit the biases of their underlying LLMs and exhibit high search variance." The failure analysis revealed that agents "frequently offloaded a problem's core difficulty into a single sorry within a helper lemma that reiterated the target statement in a slightly different form" and "for several problems, the top sketches relied on lemmas marked with sorry that the agent claimed were established results in the mathematical literature
- Upon manual inspection, these lemmas proved to be hallucinations."
Open questions raised
- Expanding agent success beyond areas with mature Lean libraries (combinatorics, convex optimization, number theory)
- Extending to problems requiring extensive new theory development
- Characterizing and expanding the boundaries of agent capabilities
- Reducing search variance and improving reproducibility
- Closing the loop between AI-based conjecturing and proof systems
- The authors identify that "[c]haracterizing the agents' boundaries and expanding them is an important direction for future work." They note that even most Erdős problems remain out of reach and that problems requiring extensive new theory are beyond current capabilities. The paper suggests future work in closing the loop between AI-based conjecturing (via Graffiti system) and AI-based proof, and in expanding the applicability of formal proof search beyond domains with mature Lean libraries.
Explore related topics
Related papers
- Autonomous chemical research with large language modelsDaniil A. Boiko · 2023 · 809 citations
- To use or not to use ChatGPT in higher education? A study of students’ acceptance and use of technologyArtur Strzelecki · 2023 · 691 citations
- Comparing scientific abstracts generated by ChatGPT to real abstracts with detectors and blinded human reviewersCatherine A. Gao · 2023 · 657 citations
- Teacher support and student motivation to learn with Artificial Intelligence (AI) based chatbotThomas K. F. Chiu · 2023 · 617 citations
- Do AI chatbots improve students learning outcomes? Evidence from a meta‐analysisRong Wu · 2023 · 469 citations
- Beware of metacognitive laziness: Effects of generative artificial intelligence on learning motivation, processes, and performanceYizhou Fan · 2024 · 419 citations