返回首页
arXiv AI··论文与技术

IneqAgent: Agentic Inequality Proving in Lean with Symbolic Computation

中文摘要

IneqAgent 是结合 LLM 与符号计算的 Lean4 不等式证明智能体框架,利用蒙特卡洛树搜索协调引理构建、目标重构与符号后端选择。

English Summary

IneqAgent is an agentic framework for Lean4 inequality proving, combining LLM reasoning with symbolic computation via Monte Carlo Tree Search to coordinate lemma construction and goal reformulation.

原文节选

arXiv:2610.20681v1 Announce Type: new Abstract: Formal inequality proving requires mathematical reasoning and exact computation, often connected through intermediate lemmas and goal reformulations. We introduce IneqAgent, an agentic framework combining LLM reasoning with symbolic computation for inequality proving in Lean4. Lemma-level Monte Carlo Tree Search coordinates lemma construction, goal reformulation, and symbolic backend selection. Complementary sum-of-squares, Bernstein, and successive difference-substitution backends produce exact certificates for local Lean proof generation. The agent integrates these proofs with LLM-generated steps and uses Lean feedback to construct complete proofs checked against the original theorem statements. On four benchmarks, IneqAgent with DeepSeek-V4-Flash solves 175 of 186 problems (94.09%), achieving the highest overall success rate among the evaluated methods. Across four backbones, it achieves higher success rates at low LLM inference cost thresholds than Direct Agent using the same backbone, with lower mean inference costs over each method's successful runs. We also obtain Lean-verified strengthenings of Dittert's conjecture in dimensio…