Lean Graph Search for Formal Theorem Proving

LeanGraphSearch is a graph‑based retrieval method for the Lean 4 theorem prover that builds a dependency graph from Mathlib’s forward dependencies and traverses it to find supporting lemmas via multi‑hop chains. By linking each declaration to its premises, propagating relevance through a graph‑ranking algorithm, and re‑ranking candidates against the original query, it improves recall by up to 12% over LeanSearch v2 on MathlibQR and increases coverage of complete annotated proof routes on MathlibMPR by up to 3.7%. When integrated into an iterative proving loop, LeanGraphSearch raises pass rates at 8, 16, and 32 reflection turns by as much as 40% compared to a vanilla prover and up to 10% compared to LeanSearch v2, demonstrating higher accuracy‑cost efficiency.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

• benchmarks