mlsanityData to 7 Oct 2026

M2F: Automated Formalization of Mathematical Literature at Scale

arXiv 2602.17016 ↗First posted 19 Feb 2026cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

Automated formalization of mathematics enables mechanical verification but remains limited to isolated theorems and short snippets. Scaling to textbooks and research papers is largely unaddressed, as it requires managing cross-file dependencies, resolving imports, and ensuring that entire projects compile end-to-end. We present M2F (Math-to-Formal), the first agentic framework for end-to-end, project-scale autoformalization in Lean. The framework operates in two stages. The statement compilation stage splits the document into atomic blocks, orders them via inferred dependencies, and repairs declaration skeletons until the project compiles, allowing placeholders in proofs. The proof repair stage closes these holes under fixed signatures using goal-conditioned local edits. Throughout both stages, M2F keeps the verifier in the loop, committing edits only when toolchain feedback confirms improvement. In approximately three weeks, M2F converts long-form mathematical sources into a project-scale Lean library of 153,853 lines from 479 pages textbooks on real analysis and convex analysis, fully formalized as Lean declarations with accompanying proofs. This represents textbook-scale formalization at a pace that would typically require months or years of expert effort. On FATE-H, we achieve 96% proof success (vs. 80% for a strong baseline). Together, these results demonstrate that practical, large-scale automated formalization of mathematical literature is within reach. The full generated Lean code from our runs is available at https://github.com/optsuite/ReasBook.git.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 14 of its 25 references that are in the map. First posted on arXiv 19 Feb 2026.

Builds on

14 of 25 references.

References · 14

  1. 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 414
  2. 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 380
  3. 2022Autoformalization with Large Language Modelscited by 252
  4. 2019The Lean mathematical librarycited by 127
  5. 2024Lean Workbook: A large-scale Lean problem set formalized from natural language math problemscited by 115
  6. 2020Graph-based, Self-Supervised Program Repair from Diagnostic Feedbackcited by 93
  7. 2024Herald: A Natural Language Annotated Lean 4 Datasetcited by 54
  8. 2024Code Repair with LLMs gives an Exploration-Exploitation Tradeoffcited by 50
  9. 2024Reliable Evaluation and Benchmarks for Statement Autoformalizationcited by 25
  10. 2025FATE: A Formal Benchmark Series for Frontier Algebra of Multiple Difficulty Levelscited by 23
  11. 2023INTERVENOR: Prompting the Coding Ability of Large Language Models with the Interactive Chain of Repaircited by 18
  12. 2025Aria: An Agent For Retrieval and Iterative Auto-Formalization via Dependency Graphcited by 18
2 more
  1. 2025ProofFlow: A Dependency Graph Approach to Faithful Proof Autoformalizationcited by 18
  2. 2025SITA: A Framework for Structure-to-Instance Theorem Autoformalizationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 12.

12 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Formalizing Mathematics at Scale
  2. 2026LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks
  3. 2026Understanding Tool-Augmented Agents for Lean Formalization: A Factorial Analysis
  4. 2026SorryDB: Can AI Provers Complete Real-World Lean Theorems?
  5. 2025DRIFT: Decompose, Retrieve, Illustrate, then Formalize Theorems
  6. 2026Towards a Bridge Layer Between Bibliographic and Formalized Mathematical Knowledge
  7. 2025APOLLO: Automated LLM and Lean Collaboration for Advanced Formal Reasoning
  8. 2026(Auto)formalization is supposed to be easy: Trellis process semantics for spelling out rigorous proofs