Beyond Compilation: Evaluating Faithful Natural-Language-to-Lean Statement Formalization
Not on the map. Why?
Abstract (arXiv)
Lean verifies that a generated declaration is well typed, but not that it states what the user intended. For statement autoformalization without canonical Lean targets, we study two questions: how far an LLM-based semantic criterion can be trusted, and how much compilation overstates faithfulness across systems. Our criterion requires Lean compilation and agreement of GPT-5.2 and Gemini-2.5-Pro. On an independently audited random sample, it agrees with the human majority on 91.5% of cases (Wilson 95% CI: 81.6--96.3%); humans confirm 95.7% of the outputs it accepts and 77--81% of the outputs it rejects, so the criterion is reliable in aggregate and errs on the conservative side. A comparison with LeanScorer, an independent third-family judge, and a BEq formal cross-check support the same picture. Across eight systems evaluated on 227 graduate-level statements, the compile--faithfulness gap varies widely with the system, from 1.3 percentage points for one-shot Gemini-2.5-Pro to 29.5 points for a tool-augmented GPT-5.2 agent, which compiles 87.2% of statements but is faithful on 57.7%. A 23 tool ablation of this agent shows that Lean feedback drives most of its gain in compilation, and nearly half of that gain consists of outputs that fail the semantic criterion.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 13 of its 23 references that are in the map. First posted on arXiv 30 Jun 2026.
Builds on
13 of 23 references.
References · 13
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 414
- 2025DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decompositioncited by 270
- 2023ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematicscited by 180
- 2025Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learningcited by 173
- 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 140
- 2024Lean Workbook: A large-scale Lean problem set formalized from natural language math problemscited by 115
- 2024Herald: A Natural Language Annotated Lean 4 Datasetcited by 54
- 2024Process-Driven Autoformalization in Lean 4cited by 45
- 2024A Semantic Search Engine for Mathlib4cited by 30
- 2024FormalAlign: Automated Alignment Evaluation for Autoformalizationcited by 19
- 2025StepFun-Formalizer: Unlocking the Autoformalization Potential of LLMs through Knowledge-Reasoning Fusioncited by 15
- 2025Mathesis: Towards Formal Theorem Proving from Natural Languagescited by 14
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026ProofLoom: Proof-Obligation-Driven Theory Construction for Autoformalizing Research-Level Stochastic Optimizationcited by 0
- 2026TCSAlgBench: Benchmarking Automated Proving for Research-Level Theoretical Computer Sciencecited by 0
- 2026Sage: Formalization with Semantic Correctioncited by 0
- 2026Fyan: A Human--AI Harness with Semantic Auditing for Document-Level Formalizationcited by 0
- 2026Fyan: A Human--AI Harness with Semantic Auditing for Document-Level Formalization30 Sep 2026
- 2026TCSAlgBench: Benchmarking Automated Proving for Research-Level Theoretical Computer Science28 Sep 2026
- 2026ProofLoom: Proof-Obligation-Driven Theory Construction for Autoformalizing Research-Level Stochastic Optimization28 Sep 2026
- 2026Sage: Formalization with Semantic Correction16 Sep 2026