mlsanityData to 14 Oct 2026

Definition Grounding in Theory-Level Auto-formalization

arXiv 2610.19223 ↗First posted 13 Oct 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

LLM-based auto-formalization systems can now generate formally verified Lean code at unprecedented rates. However, a formalization advances mathematical research only when further mathematical results can be built on it, especially when its definitions and helper lemmas are general enough to be imported and used idiomatically. We propose definition grounding, where definition formalizations are continuously judged and revised, as a method to ensure formalization quality. We find that agents formalizing definitions from textbook text often produce definitions that later statements cannot use, and only 25%-50% of their definition sets are compatible with all later statements. However, clarifying the informal definitions can improve this rate up to 77.5% averaged over all models. Furthermore, stating a small set of basic properties without proving them can improve model judges' capability to detect definitions with compatibility issues, at only about 11% of the definition formalization cost. These results are verified with ReuseBench, a benchmark we curated for formalizing new mathematical fields and theories.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 73 references that are in the map. First posted on arXiv 13 Oct 2026.

Builds on

20 of 73 references.

References · 20

  1. 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 391
  2. 2023ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematicscited by 192
  3. 2024Herald: A Natural Language Annotated Lean 4 Datasetcited by 59
  4. 2024miniCTX: Neural Theorem Proving with (Long-)Contextscited by 37
  5. 2024Reliable Evaluation and Benchmarks for Statement Autoformalizationcited by 32
  6. 2026SlopCodeBench: Benchmarking How Coding Agents Degrade Over Long-Horizon Iterative Taskscited by 30
  7. 2026SWE-CI: Evaluating Agent Capabilities in Maintaining Codebases via Continuous Integrationcited by 23
  8. 2025Autoformalization in the Wild: Assessing LLMs on Real-World Mathematical Definitionscited by 22
  9. 2025MaintainCoder: Maintainable Code Generation Under Dynamic Requirementscited by 14
  10. 2020Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansioncited by 12
  11. 2026Formalizing Mathematics at Scalecited by 10
  12. 2026EvoCode-Bench: Evaluating Coding Agents in Multi-Turn Iterative Interactionscited by 9
8 more
  1. 2026Automatic Textbook Formalizationcited by 8
  2. 2025APE-Bench: Evaluating Automated Proof Engineering for Formal Math Librariescited by 7
  3. 2026MathAtlas: A Benchmark for Autoformalization in the Wildcited by 4
  4. 2026Sorries Are Not the Hard Part: An Expert-Review Case Study of a Semi-Autonomous Formalizationcited by 4
  5. 2026Theory-Level Autoformalization: From Isolated Statements to Unified Formal Knowledge Basescited by 3
  6. 2026Is Agent Code Less Maintainable Than Human Code?cited by 2
  7. 2023Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabetscited by 1
  8. 2026MathlibPR: Pull Request Merge-Readiness Benchmark for Formal Mathematical Librariescited by 1

Built on by

Not cited yet.