Formalized mathematics that can be read, checked, and built upon.
Lax is an open archive for contemporary mathematics written in Lean. Think of it as an arXiv for formalization: independent, citable submissions that people can read, software can check, and future work can build upon.
What you can do here
Contribute to Lax
Creating your own submission
Contributing is a two-step process.
Set up, once per machine:
npm install -g lax-archive lax doctor # checks your setup and installs whatever is missingHand your coding agent a prompt like:
Run `lax print instructions` and follow the guide it prints to formalize <my result>.
Prefer to work hands-on, or want to know what happens at each step? See Getting started.
Read the archive
Submissions
42 submissions · 445 concepts · 310 statements, 285 proven
Browse by topic
Suggested from submission and concept titles.
Showing all 42 submissions.
- Almost Linear Neighborhood Complexity of Monadically Dependent Graph Classes(2026-08-02) 7 concepts, 3 proofs registered
- Sparsity Lectures: Nowhere Denseness, Quasi-Wideness, and Generalized Coloring Numbers(2026-08-02) 15 concepts, 7 proofs registered
- The Word RAM(2026-08-02) 2 concepts, 0 proofs registered
- Finite Ramsey Theorems for Pairs and Tuples(2026-08-02) 4 concepts, 3 proofs registered
- Constructive Lovász Local Lemma(2026-08-04) 4 concepts, 2 proofs registered
- Twin-Width Can Be Exponential in Treewidth(2026-08-07) 3 concepts, 1 proof registered
- Functional Equivalence of Twin-Width and Mixed Minor Number(2026-08-07) 5 concepts, 3 proofs registered
- First-Order Model Checking on Nowhere Dense Graph Classes in Almost Linear Time(2026-08-02) 12 concepts, 6 proofs draft
- χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs(2026-08-02) 5 concepts, 2 proofs draft
- Graphs without a 3-Connected Subgraph are 4-Colourable(2026-08-02) 4 concepts, 2 proofs draft
- Algorithmic Experiments on a Random Access Machine(2026-08-02) 7 concepts, 2 proofs draft
- Exponent 8 ( Polylogarithmic) Bound for the Grid-Minor Theorem(2026-08-02) 38 concepts, 25 proofs draft
- Szemerédi's Regularity Lemma(2026-08-02) 10 concepts, 5 proofs draft
- Tight Inapproximability of Max Independent Set in Triangle-Free Graphs(2026-08-07) 5 concepts, 1 proof draft
- Computability and polynomial-time equivalence of Turing machines and word RAMs(2026-08-09) 7 concepts, 4 proofs draft
- MSO-automata(2026-08-10) 7 concepts, 4 proofs draft
- MSO and tree automata on finite ranked trees(2026-08-10) 10 concepts, 15 proofs draft
- Erdős–Hajnal for graphs with no 5-hole(2026-08-13) 8 concepts, 7 proofs draft
- Large Finite Point Sets Have 4 Collinear Points or a 6-Clique(2026-08-20) 6 concepts, 4 proofs draft
- Erdős–Hajnal for the five-vertex path(2026-08-20) 10 concepts, 9 proofs draft
- Certified structural representations of finite data(2026-08-31) 12 concepts, 18 proofs draft
- Nagura's Theorem and the Interesting Numbers(2026-08-31) 2 concepts, 2 proofs draft
- A Refinement Framework for the Word RAM(2026-09-02) 0 concepts, 0 proofs draft
- The Word RAM(2026-09-03) 2 concepts, 0 proofs draft
- Planar Graph Classes(2026-09-03) 44 concepts, 16 proofs draft
- Transducers, Part B: Rational Functions(2026-09-07) 42 concepts, 29 proofs draft
- Transducers(2026-09-07) 0 concepts, 0 proofs draft
- Transducers, Part D: Polyregular Functions(2026-09-07) 21 concepts, 15 proofs draft
- Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity(2026-09-08) 6 concepts, 0 proofs draft
- Welzl Orders of Cographs(2026-09-09) 3 concepts, 2 proofs draft
- An Introduction to Lax(2026-09-07) 5 concepts, 3 proofs draft
- Undecidability of the Post Correspondence Problem(2026-09-07) 9 concepts, 6 proofs draft
- Savitch's Theorem(2026-09-09) 16 concepts, 12 proofs draft
- Transducers, Part C: Regular Functions in Terms of Logic(2026-09-07) 26 concepts, 22 proofs draft
- Classical Complexity Classes(2026-09-09) 12 concepts, 10 proofs draft
- Welzl Trees of Cographs(2026-09-09) 3 concepts, 2 proofs draft
- Polynomial Time and Closure under Complement(2026-09-08) 6 concepts, 4 proofs draft
- Fagin’s theorem(2026-09-09) 4 concepts, 4 proofs draft
- Transducers, Part C: Regular Functions in Terms of Combinators(2026-09-07) 4 concepts, 1 proof draft
- Transducers, Part A: Mealy Machines(2026-09-07) 22 concepts, 13 proofs draft
- Transducers, Part C: Regular Functions, Two-Way Transducers and Streaming String Transducers(2026-09-07) 29 concepts, 23 proofs draft
- The Immerman–Vardi theorem(2026-09-08) 8 concepts, 9 proofs draft
- No submissions match.
Contribute a review
Review a concept
Used by 2 other submissions and 9 other concepts
Nowhere dense graph classes
This concept is reused elsewhere in the archive. Review its mathematical correctness, endorse it if correct, or flag a flaw.
Used by 2 other submissions and 7 other concepts
Graph classes
This concept is reused elsewhere in the archive. Review its mathematical correctness, endorse it if correct, or flag a flaw.
Used by 2 other submissions and 5 other concepts
Twin-width
This concept is reused elsewhere in the archive. Review its mathematical correctness, endorse it if correct, or flag a flaw.
Used by 1 other submission and 5 other concepts
Generalized coloring numbers
This concept is reused elsewhere in the archive. Review its mathematical correctness, endorse it if correct, or flag a flaw.
Used by 1 other submission and 4 other concepts
The word RAM
This concept is reused elsewhere in the archive. Review its mathematical correctness, endorse it if correct, or flag a flaw.
Used by 1 other submission and 3 other concepts
Uniform quasi-wideness
This concept is reused elsewhere in the archive. Review its mathematical correctness, endorse it if correct, or flag a flaw.
Used by 1 other submission and 2 other concepts
Neighborhood complexity
This concept is reused elsewhere in the archive. Review its mathematical correctness, endorse it if correct, or flag a flaw.
Used by 1 other submission and 1 other concept
Computing a function within a time bound
This concept is reused elsewhere in the archive. Review its mathematical correctness, endorse it if correct, or flag a flaw.
Contribute a proof
Open proof obligations
Browse every claim that does not yet have a grounded proof, across 3 submissions.
25 proof obligationsBrowse proof obligationsAbout Lax
FAQ
How does Lax relate to projects such as Merely True and Tau Ceti?
In Merely True and Tau Ceti, individual contributions blend into a shared library. Lax keeps each submission as a distinct, citable unit. This is closer to academic publishing culture: a submission can be cited directly or attached — anonymously, if needed — to a conference or journal submission for review.
Like Lean Pool and the Palomar Registry, Lax archives individual submissions. The important difference is that Lax submissions can build on one another. A base submission might define a concept such as treewidth; later submissions can cite and import it instead of asking the community to vet the same definition again.
How can Lax help with conference and journal review?
A paper accompanied by a Lax submission gives reviewers a shorter route to checking that its formal statements are correct. Lax exposes the semantic closure of each statement: the definitions, assumptions, and results on which it depends. Reviewers can therefore focus their limited time on the ideas and techniques, while readers can inspect full proofs whenever those details matter to them.
Can I use Lax for anonymous peer review?
Yes. List the author as Anonymous author and keep the submission in draft mode during review. You can replace the placeholder with the real author name before registering the final, permanent version.
Can I work on two submissions in parallel locally?
Yes. Keep each submission in a separate repository checkout or Git worktree, then run Lax from the corresponding project directory. That keeps each submission's manifest and working tree independent while sharing the installed toolchain.
Which operating systems does Lax support?
Lax is tested on Linux and macOS. On Windows, use the Windows Subsystem for Linux (WSL); native Windows support is not currently tested.
Does my submission need to be hosted on GitHub?
No. Lax accepts submissions hosted on GitHub, GitLab.com, Codeberg, and Bitbucket Cloud. If your preferred Git host is missing, contact the Lax team so support can be considered.
How do dependencies stay compatible as mathlib changes?
Submissions that build on one another need compatible Lean, mathlib, and other dependency versions. Lax therefore plans to use long epochs that freeze those versions across the archive. When a new epoch is needed, the community can carry useful submissions forward based on demand: if you build on something, help bump it. Epoch length will follow how the archive and its community evolve.