arXiv AI

A Formalization of the Mean-Field Derivation of the Vlasov Equation

arXiv:2607. 08986v2 Announce Type: replace Abstract: We formalize a research result in the Lean 4 proof assistant by having a mathematician direct an AI system, and frame the activity as a formalization game.

arXiv Machine Learning
Nov 2

h1: A Taste of the Bitter Lesson in Automated Theorem Proving

The paper introduces h1, a simple agentic loop that interfaces a language model with Lean 4, avoiding complex human-designed workflows. h1 achieves state‑of‑the‑art performance on benchmarks such as PutnamBench, FATE‑X, and FormalConjectures100‑Solved, solving eight open problems and matching or surpassing specialized systems like Goedel‑Architect and AlphaProof Nexus. Experiments show that an efficient Lean interface is crucial for cost and success, suggesting that future evaluations should prioritize execution feedback over elaborate workflows.

By Skander Moalla, Ahmad Rammal, Niket Patel, Remi Munos, Julia Kempe
arXiv Machine Learning
Sep 3

The Axiomatic Trader: Latent Regularity, Information Budgets, and the Canonical Form of a Quantitative Investment System

The paper proposes five axioms that formalize the assumptions underlying systematic trading, each expressed through declared quantitative constants. It demonstrates that these axioms necessitate a five‑stage canonical structure for a quantitative investment system and proves that omitting any stage worsens performance under the axioms. Empirical tests on real market data show that the axioms hold, though certain declared constants (e.g., κ = 1 and an exponential decay assumption) are rejected.

By Jiayu Li
arXiv Computation and Language
Aug 27

MathAdv: What Theorem Provers Know, Reason, Formalize, and Generalize

MathAdv is a diagnostic benchmark for formal theorem proving that covers 13 undergraduate- and graduate-level mathematics domains. It includes Lean 4 proofs and up to three auxiliary tasks—multiple-choice questions, fill-in-the-blank problems, and expert-crafted transformations—to probe knowledge, informal reasoning, and robustness to problem presentation. Evaluation of current theorem provers shows formalization is a major bottleneck, performance varies by domain, natural-language guidance can help or hinder models, and equivalent reformulations reveal significant robustness gaps.

By Jiaxin Yuan, Connor Martinez Lockhart, Xiaoyu Liu, Jiaqi Wang, Chenghao Deng, Xiayimei Han, Vlasios Mastrantonis, Dmitrii Gudin, Shaopeng Zhu, Abdirisak Abdullahi Mohamed, Bilal Hamdi Aytekin, Jiewen Lang, Zezheng Song, Furong Huang
Hugging Face Trending Papers
Jul 7

Harnessing Code Agents for Automatic Software Verification

Formal verification offers the strongest guarantee of software correctness, but it does not scale: the proofs demanded by interactive theorem provers such as Coq require enormous expert effort. Large language models (LLMs) promise to generate these proofs automatically, yet existing approaches wire a fixed, human-designed proof strategy into the system and constrain the model to follow it (retrieving premises and predicting tactics one step at a time, or splitting goals by divide-and-conquer), and still prove only a fraction of their target theorems.