Formal theorem proving depends on quickly finding the right lemmas from a large library of established mathematics. The new arXiv paper "Lean Graph Search for Formal Theorem Proving" addresses this retrieval problem, which the abstract calls crucial for enabling provers to construct machine-checkable proofs.

The authors note that recent retrieval systems work by matching library declarations to a target theorem. The paper's title indicates a graph-based search strategy, presumably exploiting the relational structure of Lean's library to improve retrieval. However, the abstract provided is truncated, so specific details about the method or experimental results are not available in the source.

This work sits in the broader effort to make automated theorem proving more practical by reducing the search space through better lemma selection. As formal verification grows, such retrieval tools could become a key component of proof automation pipelines.