FirsthandTech
arXiv — cs.AI preprintsInternational16 October 2026

IneqAgent: Agentic Inequality Proving in Lean with Symbolic Computation

This is an official announcement record

Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.

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 a
— arXiv — cs.AI preprints

More from arXiv — cs.AI preprints

This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.