An Introduction to Lax
No public endorsements yet.
Loading review…
Sign in with ORCIDAbstract
An introduction to Lax, written as a Lax submission. Lax is an archive that links natural-language mathematics with Lean formalizations: submissions consist of concepts (a statement in prose paired with a faithful Lean encoding), proofs (Lean code discharging a concept's claim), and optionally the paper itself, annotated with markers that tie its passages to the concepts and proofs. This document walks through all three using the prime numbers as a running example: the definition of a prime, Euclid's theorem that there are infinitely many, the lemma on prime divisors it rests on, and the twin prime conjecture as a concept without a proof.
5 pages · 10 marked passages
Concepts
Concept map
Proofs
Proof networkview on GitHub
Proof list
Lean sources for these proofs: proofs/ on GitHub
Proof code is not displayed; the archive records each proof's checked relationship between claims.
Related submissions
Submission map
Cite this
This is only the formalizers. The authors of the formalized results may be different (see References).
@misc{lax-242665,
author = {Édouard Bonnet and Jan Dreier and Clemens Kuske},
title = {An Introduction to Lax},
year = {2026},
howpublished = {Lax Archive, lax-242665},
url = {https://laxarchive.org/lax-242665/},
}
References
- Radosław Piórkowski. ReflowTeX: reflowable web rendering of sources. https://github.com/radek-p/reflowtex, 2026.
- The mathlib Community. The Lean Mathematical Library. In Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020) 367–381, 2020. doi:10.1145/3372885.3373824
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments