mlsanityData to 7 Oct 2026

MathlibLemma: Folklore Lemma Generation and Benchmark for Formal Mathematics

arXiv 2602.02561 ↗First posted 30 Jan 2026cs.LO cs.AI cs.LGcited by 3

On the map: LLM reasoning → Mathematical reasoning

Abstract (arXiv)

While the ecosystem of Lean and Mathlib has enjoyed celebrated success in formal mathematical reasoning with the help of large language models (LLMs), the absence of many folklore lemmas in Mathlib remains a persistent barrier that limits Lean's usability as an everyday tool for mathematicians like LaTeX or Maple. To address this, we introduce MathlibLemma, a modular LLM-based pipeline for automated folklore-lemma mining: the discovery, formalization, and proving of reusable intermediate facts that mathematicians often take for granted but that are not always present in formal libraries. At its core, MathlibLemma proactively mines the missing connective tissue of mathematics. The pipeline produces a verified library of folklore-style lemmas, including 1,506 Lean-checked proofs that pass a proof-bypass screen; a small curated pilot subset has also been merged into Mathlib, providing external evidence that selected outputs can meet expert library standards. Leveraging this pipeline, we further construct the MathlibLemma benchmark, a suite of 4,028 non-trivial type-checked Lean statements spanning a broad range of mathematical domains. By transforming the role of LLMs from passive consumers to active contributors, this work takes a step toward AI-assisted expansion of formal mathematical libraries.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Mathematical reasoning, one of 17 directions in LLM reasoning. Builds on 24 of its 50 references that are in the map. First posted on arXiv 30 Jan 2026.

Builds on

24 of 50 references.

Closest ancestors · 8

Same direction, newest first

  1. 2025Hilbert: Recursively Building Formal Proofs with Informal Reasoning26 Sep
  2. 2025Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving31 Jul
  3. 2025Solving Formal Math Problems by Decomposition and Iterative Reflection21 Jul
  4. 2025APOLLO: Automated LLM and Lean Collaboration for Advanced Formal Reasoning9 May
  5. 2025FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Models5 May
  6. 2025Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning15 Apr
  7. 2024Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically4 Nov
  8. 2024Herald: A Natural Language Annotated Lean 4 Dataset9 Oct

Other references · 16

  1. 2025Qwen3 Technical Reportcited by 8,195
  2. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  3. 2025OpenAI GPT-5 System Cardcited by 910
  4. 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 380
  5. 2023ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematicscited by 180
  6. 2024PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competitioncited by 153
  7. 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 140
  8. 2019The Lean mathematical librarycited by 127
  9. 2025Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Provingcited by 126
  10. 2023LEGO-Prover: Neural Theorem Proving with Growing Librariescited by 108
  11. 2025Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2cited by 95
  12. 2025Aristotle: IMO-level Automated Theorem Provingcited by 47
4 more
  1. 2025Kimina Lean Server: A High-Performance Lean Server for Large-Scale Verificationcited by 16
  2. 2025ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysiscited by 10
  3. 2025LeanConjecturer: Automatic Generation of Mathematical Conjectures for Theorem Provingcited by 6
  4. 2025Lemmanaid: Neuro-Symbolic Lemma Conjecturingcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023Llemma: An Open Language Model For Mathematics
  2. 2026MA-ProofBench: A Two-Tiered Evaluation of LLMs for Theorem Proving in Mathematical Analysis
  3. 2025Safe: Enhancing Mathematical Reasoning in Large Language Models via Retrospective Step-aware Formal Verification
  4. 2025Reliable Fine-Grained Evaluation of Natural Language Math Proofs
  5. 2025LemmaHead: RAG Assisted Proof Generation Using Large Language Models
  6. 2026Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics
  7. 2026ProofJudge: Tool-Grounded LLM Evaluation of Formal Proof Quality in Mathlib
  8. 2025BrokenMath: A Benchmark for Sycophancy in Theorem Proving with LLMs