The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The lean mathematical library
Open accessAbstract
This paper describes mathlib, a community-driven effort to build a unified library of mathematics formalized in the Lean proof assistant. Among proof assistant libraries, it is distinguished by its dependently typed foundations, focus on classical mathematics, extensive hierarchy of structures, use of large- and small-scale automation, and distributed organization. We explain the architecture and design decisions of the library and the social organization that has led to its development.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On large subsets of $\mathbb{F}_q^n$ with no three-term arithmetic progression
Ellenberg, J., & Gijswijt, D. (2017) · Annals of Mathematics · doi:10.4007/annals.2017.185.1.8 · Cited by 146
Cited by
The Lean 4 Theorem Prover and Programming Language
Moura, L. D., & Ullrich, S. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-79876-5_37 · Cited by 258
StarCoder 2 and The Stack v2: The Next Generation
Lozhkov, A., Li, R., Allal, L. B., Cassano, F., Lamy-Poirier, J., Tazi, N., Tang, A., Pykhtar, D., Liu, J., Wei, Y., et al. (2024) · arXiv · doi:10.48550/arxiv.2402.19173 · Cited by 74
HyperTree Proof Search for Neural Theorem Proving
Lample, G., Lacroix, T., Lachaux, M.-A., Rodriguez, A., Hayat, A., Lavril, T., Ebner, G., & Martinet, X. (2022) · Advances in Neural Information Processing Systems 35 · doi:10.52202/068431-1910 · Cited by 45
HyperTree Proof Search for Neural Theorem Proving
Lample, G., Lachaux, M.-A., Lavril, T., Martinet, X., Hayat, A., Ebner, G., Rodriguez, A., & Lacroix, T. (2022) · arXiv · doi:10.48550/arxiv.2205.11491 · Cited by 45
Maintaining a Library of Formal Mathematics
van Doorn, F., Ebner, G., & Lewis, R. Y. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-53518-6_16 · Cited by 29
MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics
Zheng, K., Han, J. M., & Polu, S. (2021) · arXiv · doi:10.48550/arxiv.2109.00110 · Cited by 26
“4% pass rate on held-out test statements from mathlib , Lean’s mathematical library (mathlib Community, 2020).”
BackgroundProof Artifact Co-training for Theorem Proving with Language Models
Han, J. M., Rute, J., Wu, Y., Ayers, E. W., & Polu, S. (2021) · arXiv · doi:10.48550/arxiv.2102.06203 · Cited by 21
“The primary repository of formalized mathematics in Lean is mathlib (mathlib, 2020).”
BackgroundOlympiad-level formal mathematical reasoning with reinforcement learning
Hubert, T., Mehta, R., Sartran, L., Horváth, M. Z., Žužić, G., Wieser, E., Huang, A., Schrittwieser, J., Schroecker, Y., Masoom, H., et al. (2026) · Nature · doi:10.1038/s41586-025-09833-y · Cited by 19
Lean-STaR: Learning to Interleave Thinking and Proving
Lin, H., Sun, Z., Welleck, S., & Yang, Y. (2024) · arXiv · doi:10.48550/arxiv.2407.10040 · Cited by 14
PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition
Tsoukalas, G., Lee, J., Jennings, J., Xin, J., Ding, M., Jennings, M., Thakur, A., & Chaudhuri, S. (2024) · Advances in Neural Information Processing Systems 37 · doi:10.52202/079017-0368 · Cited by 13
Beyond Attention: Breaking the Limits of Transformer Context Length with Recurrent Memory
Bulatov, A., Kuratov, Y., Kapushev, Y., & Burtsev, M. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i16.29722 · Cited by 12
“For our experiments, we utilized Lean 3 (de Moura et al. 2015) and its library, Mathlib (mathlib Community 2020), which contains a range of formalized theories.”
MethodReliable Reasoning Beyond Natural Language
Borazjanizadeh, N., & Piantadosi, S. T. (2024) · arXiv · doi:10.48550/arxiv.2407.11373 · Cited by 3
“Formalizing of reasoning in a system other than natural language has several descendants, from the General Problem Solver of Newell et al. [22], to logic programming languages like Prolog [12], and formal tools for robust verification like Lean [21].”
VERINA: Benchmarking Verifiable Code Generation
Ye, Z., Yan, Z., He, J., Kasriel, T., Yang, K., & Song, D. (2025) · arXiv · doi:10.48550/arxiv.2505.23135 · Cited by 3
“We format these problems in Lean [19], a general-purpose programming language with a rapidly growing ecosystem and applications in both formal mathematics [20, 21] and verification [22, 23].”
Science should be machine-readable
Booeshaghi, A. S., Luebbert, L., & Pachter, L. (2026) · doi:10.64898/2026.01.30.702911 · Cited by 3
InternLM-Math: Open Math Large Language Models Toward Verifiable Reasoning
Ying, H., Zhang, S., Li, L., Zhou, Z., Shao, Y., Fei, Z., Ma, Y., Hong, J., Liu, K., Wang, Z., et al. (2024) · arXiv · doi:10.48550/arxiv.2402.06332 · Cited by 3
CLEVER: A Curated Benchmark for Formally Verified Code Generation
Thakur, A., Lee, J., Tsoukalas, G., Sistla, M., Zhao, M., Zetzsche, S., Durrett, G., Yue, Y., & Chaudhuri, S. (2025) · arXiv · doi:10.48550/arxiv.2505.13938
Metadata
- Authors
- Community, T. M.
- Venue
- Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs
- Publisher
- ACM
- Published
- 2020-01-20
- Pages
- 367-381
- OpenAlex
- W2981188613
- Cited by
- 161
- References
- 1
- FWCI
- 5.44
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.