Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory
Not on the map. Why?
Abstract (arXiv)
Asymptotic statistical theory is a challenging domain for AI-assisted formalization: its central results mix convergence statements, asymptotic expansions, functional analysis, and regularity conditions that have a large gap from existing infrastructure in Lean 4 formalization. To address these challenges, we propose a hypothesis-disciplined Lean 4 formalization pipeline built from multiple agents: a manager that coordinates seven specialist roles for proof planning, skeleton scaffolding, Mathlib reconnaissance, proof construction, integration, independent review, and audit. The main methodological discipline is the hypothesis-disciplined audit, implemented by the Auditor agent: every main-theorem hypothesis and concept-layer field must be anchored in the source mathematical prose, justified as a Lean encoding adapter, marked as source-implied, or rejected as an unsupported strengthening. Using this workflow, we build a systematic formalization of asymptotic statistical theory, especially the parametric and semi-parametric models' asymptotic distribution and efficiency results. The resulting Lean development is axiom-clean and source-faithful, with Lean-checked and human-audited proofs of core parametric and semi-parametric theorems organized so that theorem-agnostic infrastructure and statistical concept definitions are separated from theorem-specific assembly. The formalization results are available at https://github.com/junwei-lu/Lean-Asymptotic-Statistical-Theory.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 35 references that are in the map. First posted on arXiv 3 Jun 2026.
Builds on
20 of 35 references.
References · 20
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 427
- 2025DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decompositioncited by 287
- 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 154
- 2019The Lean mathematical librarycited by 134
- 2025Hilbert: Recursively Building Formal Proofs with Informal Reasoningcited by 60
- 2024Lean Copilot: Large Language Models as Copilots for Theorem Proving in Leancited by 58
- 2026Numina-Lean-Agent: An Open and General Agentic Reasoning System for Formal Mathematicscited by 50
- 2024Autoformalize Mathematical Statements by Symbolic Equivalence and Semantic Consistencycited by 41
- 2024LeanAgent: Lifelong Learning for Formal Theorem Provingcited by 35
- 2025APOLLO: Automated LLM and Lean Collaboration for Advanced Formal Reasoningcited by 35
- 2025Prover Agent: An Agent-Based Framework for Formal Mathematical Proofscited by 31
- 2025Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physicscited by 31
8 more
- 2025MA-LoT: Model-Collaboration Lean-based Long Chain-of-Thought Reasoning enhances Formal Theorem Provingcited by 24
- 2026Semi-Autonomous Formalization of the Vlasov-Maxwell-Landau Equilibriumcited by 9
- 2026Automatic Textbook Formalizationcited by 8
- 2025MASA: LLM-Driven Multi-Agent Systems for Autoformalizationcited by 6
- 2014A formally verified proof of the Central Limit Theoremcited by 5
- 2026Do LLMs Game Formalization? Evaluating Faithfulness in Logical Reasoningcited by 4
- 2026FormalScience: Scalable Human-in-the-Loop Autoformalisation of Science with Agentic Code Generation in Leancited by 4
- 2025Lean Formalization of Generalization Error Bound by Rademacher Complexity and Dudley's Entropy Integralcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.