TheoremGraph: Bridging Formal and Informal Mathematics
Not on the map. Why?
Abstract (arXiv)
Mathematical knowledge is organized around statements and their dependencies, but this structure is exposed unevenly: informal papers cite mostly at the document level, while formal libraries record fine-grained dependencies over a much smaller body of mathematics. We introduce TheoremGraph, a unified statement-level dependency graph spanning both informal and formal mathematics. On the informal side, we parse 11.7M theorem-like environments from mathematics arXiv and recover 18.3M candidate directed dependencies, each labeled by the extractor that proposed it so downstream users can trade coverage for precision. On the formal side, we release LeanGraph, a Lean 4 elaborator-level extractor producing 388,105 declaration nodes and 11.3M typed edges across 25 Lean projects. We bridge the two graphs by embedding generated natural-language slogans into a shared semantic space, linking related statements across papers and across the informal/formal divide; an LLM judge affirms 47,952 such matches above a 0.8 cosine floor, with the judge-acceptance rate rising from 48% across the floor to 87% in the >=0.9 tier. On formal concept retrieval, our name-and-signature representation with graph expansion comes within 0.5pp of LeanSearch v2's reranked Recall@10 (0.775 vs. 0.780) without an LM reranker. We release the dataset, extractors, HTTP API, and MCP interface as infrastructure for mathematical search, attribution, and retrieval-augmented reasoning, available at theoremsearch.com and huggingface.co/datasets/uw-math-ai/theorem-matching.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 24 Jun 2026.
Builds on
21 of 47 references.
References · 21
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,261
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 427
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 391
- 2020Generative Language Modeling for Automated Theorem Provingcited by 388
- 2023Nougat: Neural Optical Understanding for Academic Documentscited by 245
- 2024PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competitioncited by 165
- 2021NaturalProofs: Mathematical Theorem Proving in Natural Languagecited by 81
- 2026Numina-Lean-Agent: An Open and General Agentic Reasoning System for Formal Mathematicscited by 50
- 2024A Semantic Search Engine for Mathlib4cited by 31
- 2025A Comprehensive Survey on Reinforcement Learning-based Agentic Search: Foundations, Roles, Optimizations, Evaluations, and Applicationscited by 22
9 more
- 2025miniF2F-Lean Revisited: Reviewing Limitations and Charting a Path Forwardcited by 14
- 2023MLFMF: Data Sets for Machine Learning for Mathematical Formalizationcited by 10
- 2026LeanSearch v2: Global Premise Retrieval for Lean 4 Theorem Provingcited by 10
- 2024WithdrarXiv: A Large-Scale Dataset for Retraction Studycited by 9
- 2026Semantic Search over 9 Million Mathematical Theoremscited by 8
- 2025AutoMathKG: The automated mathematical knowledge graph based on LLM and vector databasecited by 6
- 2015The Tangent Search Engine: Improved Similarity Metrics and Scalability for Math Formula Searchcited by 3
- 2025Generalizable LLM Learning of Graph Synthetic Data with Post-training Alignmentcited by 3
- 2026Lean Atlas: An Integrated Proof Environment for Scalable Human-AI Collaborative Formalizationcited by 1
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Lean Pool: An AI-Maintained Archive of Formalized Mathematicscited by 1
- 2026PriorProof: A Point-in-Time Measure of Technique Novelty for Formal Proofscited by 0
- 2026Beyond Correctness: Toward Automated Novelty Verification with Lean 4cited by 0
- 2026When Does Structured Knowledge Help Neural Theorem Proving?cited by 0
- 2026TCSAlgBench: Benchmarking Automated Proving for Research-Level Theoretical Computer Sciencecited by 0
- 2026TCSAlgBench: Benchmarking Automated Proving for Research-Level Theoretical Computer Science28 Sep 2026
- 2026When Does Structured Knowledge Help Neural Theorem Proving?28 Sep 2026
- 2026Lean Pool: An AI-Maintained Archive of Formalized Mathematics21 Sep 2026
- 2026Beyond Correctness: Toward Automated Novelty Verification with Lean 42 Aug 2026
- 2026PriorProof: A Point-in-Time Measure of Technique Novelty for Formal Proofs18 Jul 2026
Similar, not cited
Close in wording, no citation either way
- 2025DRIFT: Decompose, Retrieve, Illustrate, then Formalize Theorems
- 2026Re2Math: Benchmarking Theorem Retrieval in Research-Level Mathematics
- 2026Towards a Bridge Layer Between Bibliographic and Formalized Mathematical Knowledge
- 2025Automated Formalization via Conceptual Retrieval-Augmented LLMs
- 2025RealMath: A Continuous Benchmark for Evaluating Language Models on Research-Level Mathematics
- 2025Translating Informal Proofs into Formal Proofs Using a Chain of States
- 2025KisMATH: Do LLMs Have Knowledge of Implicit Structures in Mathematical Reasoning?
- 2026CrowdMath: A Dataset of Crowdsourced Mathematical Research Discussions