arXiv AI
4d ago

KAPPA: Checking the Proofs in Statistics Papers with Lean 4 and Language Model Agents

KAPPA is an open‑source toolkit that uses language‑model agents to translate LaTeX proofs from statistical papers into Lean 4, where each numbered result is verified step by step against the original text. The system assigns one of four verdicts—verified unconditionally, verified conditionally, issue recorded, or unfinished—to every result, and it can run unattended, re‑check only changed sections, and report resource usage. In tests on four example papers and three published statistical papers, KAPPA detected the known errors and additional issues that were later confirmed by hand, while a direct language‑model approach without the kit produced fewer correct verdicts and sometimes over‑claimed proofs.

By Zihua She, Xiao Wang
arXiv AI
5d ago

PaperFormalizer: Author-in-the-Loop Autoformalization of Research Papers in Lean

PaperFormalizer is a Lean-based pipeline that assists authors in identifying and closing gaps in their research papers, converting them into Lean-verified versions. Starting from LaTeX, it transcribes the paper into a dependency graph, audits statements for faithfulness and correctness, and formalizes them in Lean using Mathlib and optional domain libraries. The process is author-in-the-loop, prompting the author whenever multiple interpretations exist and allowing them to accept, decline, or redirect proposed repairs, ultimately producing an annotated paper, a change report, and linked Lean code.

By Jiyuan Tan, Vasilis Syrgkanis, Jose Blanchet
arXiv AI
5d ago

SemantEq: Faithful Bidirectional Equivalence of Formal Statements

SemantEq introduces a principled method for verifying that formal statements faithfully translate natural‑language mathematics by requiring each statement to transform into the other through a chain of allowed logical steps, rather than relying on trivial logical equivalence. The system evaluates proofs using Lean’s proof terms, achieving 100 % precision and 65.6 % recall on the ProofNetVerif test split, outperforming prior methods. A complementary audit tool, SemantEq‑ProofAudit, further improves recall for equivalent pairs while rejecting all non‑equivalent pairs.

By Xinrui Li, Pawan Sasanka Ammanamanchi, Siddharth Bhat, Rianna Jamdar, Yongxi Lin, Stella Biderman