paper-with-me

홈 › Papers

Understanding Tool-Augmented Agents for Lean Formalization: A Factorial Analysis

2026-04-16 · Ke Zhang, Patricio Gallardo, Maziar Raissi, Sudhir Murthy arxiv

Automatic translation of natural language mathematics into faithful Lean 4 code is hindered by the fundamental dissonance between informal set-theoretic intuition and strict formal type theory. This gap often causes LLMs to hallucinate non-existent library definitions, resulting in code that fails to compile or lacks semantic fidelity. In this work, we investigate the effectiveness of tool-augmented agents for this task through a systematic factorial analysis of three distinct tool categories: Fine-tuned Model Querying (accessing expert drafts), Knowledge Search (retrieving symbol definitions), and Compiler Feedback (verifying code via a Lean REPL). We first benchmark the agent against one-shot baselines, demonstrating large gains in both compilation success and semantic equivalence. We then use the factorial decomposition to quantify the impact of each category, isolating the marginal contribution of each tool type to overall performance.

📄 PDF Abstract BibTeX arXiv:2604.16538

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

AI4SLT: Empirical Processes in Lean 4 for Formal Statistical Learning Theory

2026-02-02 · Yuanhe Zhang, Jason D. Lee, Fanghui Liu arxiv

We present the first comprehensive Lean 4 formalization of statistical learning theory (SLT) grounded in empirical process theory. Our en-to-end formal infrastructure implement the missing contents in latest Lean library…

Gaussian Processes

Multi-agent Autoformalization of Tensor Network Theory

2026-07-08 · Sirui Lu, Erickson Tjoa, J. Ignacio Cirac arxiv

We build a team of specialized large language-model agents and present an agent-driven workflow for research-level formalization in theoretical physics, with the autoformalization of the fundamental theorem of matrix-pro…

Beyond Compilation: Evaluating Faithful Natural-Language-to-Lean Statement Formalization

2026-06-30 · Ke Zhang, Patricio Gallardo Candela, Sudhir Murthy, Yi Xie 외 arxiv

Theorem-proving benchmarks evaluate proof search against fixed formal statements, but natural-language-to-Lean formalization must generate the formal statement itself. In this setting, compilation is only a validity chec…

(Auto)formalization is supposed to be easy: Trellis process semantics for spelling out rigorous proofs

2026-06-08 · Wesley Pegden arxiv

We present Trellis: an autoformalization system that leverages LLM agents in a deterministically constrained workflow to enforce incremental progress in Lean autoformalization tasks through iterative refinement of natura…

Mathematical Formalized Problem Solving and Theorem Proving in Different Fields in Lean 4

2024-09-09 · Xichen Tang

Formalizing mathematical proofs using computerized verification languages like Lean 4 has the potential to significantly impact the field of mathematics, it offers prominent capabilities for advancing mathematical reason…

Abstract AlgebraAutomated Theorem ProvingMathMathematical Proofs+1