Definition Grounding in Theory-Level Auto-formalization
cs.AI
Submitted: 2026-10-13
Updated: 2026-10-13
Code: https://github.com/teorth/pfr
License: http://creativecommons.org/licenses/by/4.0/
The gist: LLM-based auto-formalization systems can now generate formally verified Lean code at unprecedented rates.
Terminology
Abstract
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.
Sources
- ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics
- SWE-CI: Evaluating Agent Capabilities in Maintaining Codebases via Continuous Integration
- Automatic Textbook Formalization
- An Introduction to Algebraic Combinatorics
- Sorries Are Not the Hard Part: An Expert-Review Case Study of a Semi-Autonomous Formalization
- SlopCodeBench: Benchmarking How Coding Agents Degrade Over Long-Horizon Iterative Tasks
- MathAtlas: A Benchmark for Autoformalization in the Wild
- Is Agent Code Less Maintainable Than Human Code?
- Formalizing Mathematics at Scale
- EvoCode-Bench: Evaluating Coding Agents in Multi-Turn Iterative Interactions
- MathlibPR: Pull Request Merge-Readiness Benchmark for Formal Mathematical Libraries
- Modified log-Sobolev inequalities for strongly log-concave distributions
- Total-variation cutoff in birth-and-death chains
- Characterization of cutoff for reversible Markov chains
- Limit profile for random transpositions
- Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion
- Graph Sparsification by Effective Resistances
- Cover times, blanket times, and majorizing measures
- Cover Times for Brownian Motion and Random Walks in Two Dimensions
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems