Retrieval

Does the retriever find the lemmas a proof needs?

Measured on its own, before any proving. The ground truth for a theorem is the set of indexed Mathlib theorems its reference proof uses. Premises from held-out modules are removed from the index when it is built, so no retriever can return the target or anything downstream of it.

Recall and mean reciprocal rank

164 theorems have at least one reachable ground-truth premise. 95% bootstrap intervals over theorems.

RetrieverTheoremsnMRRR@1R@5R@8R@10R@20R@50
BM25All1640.1172%8%9%10%14%17%
BM25Mathlib held-out1190.1362%7%9%10%12%15%
BM25Authored450.0654%9%9%9%18%20%
Dense (bge-small)All1640.0882%5%7%8%11%16%
Dense (bge-small)Mathlib held-out1190.0941%5%5%7%9%13%
Dense (bge-small)Authored450.0744%7%12%12%17%23%
Hybrid (RRF)All1640.1253%7%10%10%13%19%
Hybrid (RRF)Mathlib held-out1190.1291%6%8%9%12%18%
Hybrid (RRF)Authored450.1169%11%16%16%18%24%

Recall inside the agent runs

Mean share of a theorem's ground-truth premises that appeared in the eight lemmas actually shown to the model.

ConfigurationMean recall@8Verified
Full (plan + retrieval + repair)11%7%
Full − compiler feedback11%6%
Full − memory11%6%
Full − skeleton11%7%
Hybrid retrieval11%2%
Hybrid retrieval + repair11%5%
BM25 retrieval + repair8%7%
Dense retrieval + repair8%5%