Solving Formal Math Problems by Decomposition and Iterative Reflection

General-purpose Large Language Models (LLMs) have achieved remarkable success in intelligence, performing comparably to human experts on complex reasoning tasks such as coding and mathematical reasoning. However, generating formal proofs in specialized languages like Lean 4 remains a significant challenge for these models, limiting their application in complex theorem proving and automated verification. Current approaches typically require specializing models through fine-tuning on dedicated formal corpora, incurring high costs for data collection and training. In this work, we introduce $\mathbf{\text{Delta}}\mathbf{\text{Prover}}$, an agent-based framework that orchestrates the interaction between a general-purpose LLM and the Lean 4 proof environment. Delta Prover leverages the reflection and reasoning capabilities of general-purpose LLMs to interactively construct formal proofs in Lean 4, circumventing the need for model specialization. At its core, the agent integrates two novel, interdependent components: an algorithmic framework for reflective decomposition and iterative proof repair, and a custom Domain-Specific Language (DSL) built upon Lean 4 for streamlined subproblem management. $\mathbf{\text{Delta}}\mathbf{\text{Prover}}\mathbf{\text{achieves}}\mathbf{\text{a}}\mathbf{\text{state-of-the-art}}\mathbf{\text{95.9\%}}\mathbf{\text{success}}\mathbf{\text{rate}}\mathbf{\text{on}}\mathbf{\text{the}}\mathbf{\text{miniF2F-test}}\mathbf{\text{benchmark,}}\mathbf{\text{surpassing}}\mathbf{\text{all}}\mathbf{\text{existing}}\mathbf{\text{approaches,}}\mathbf{\text{including}}\mathbf{\text{those}}\mathbf{\text{requiring}}\mathbf{\text{model}}\mathbf{\text{specialization.}}$ Furthermore, Delta Prover exhibits a significantly stronger test-time scaling law compared to standard Best-of-N proof strategies. Crucially, our findings demonstrate that general-purpose LLMs, when guided by an effective agentic structure, possess substantial untapped theorem-proving capabilities. This presents a computationally efficient alternative to specialized models for robust automated reasoning in formal environments.