This is the Tau Ceti migration fork of PNT+. It uses stock Lean v4.36.0-rc2 and pins Tau Ceti and its matching Mathlib revision in lake-manifest.json. See ROADMAPS.md for approved migration targets, pending roadmap proposals, and scope that still needs human-written specifications.
To build the fork, run lake exe cache get, then
bash .lake/packages/TauCeti/scripts/lake-cache-get.sh .lake/packages/TauCeti, then lake build.
The library target checks every Lean source, including Unused/ experiments.
The library has no unfinished proofs; a separate compiled-declaration audit verifies
that it uses only propext, Classical.choice and Quot.sound.
Fork CI runs the same full source build, restores Tau Ceti artifacts, and checks blueprint metadata.
The objective of this project is to formalize in Lean the Prime Number Theorem (with classical error term), as well as related results such as the Prime Number Theorem in Arithmetic Progressions. A stretch goal would be to obtain the Chebotarev density theorem.
IEANTN (the Integrated Explicit Analytic Number Theory Network) is excluded from this fork and its Tau Ceti migration scope. Its separate project is teorth/IEANTN.
Here is the blueprint for the project.
The project is coordinated via a Lean Zulip channel.
Contributions are welcome! Please read our Contributing Guide for instructions on how to claim issues, submit PRs, and participate in the project.
If you want to quickly contribute to the project without installing your own copy of lean, you can do so using gitpod. Simply visit: https://gitpod.io/new/#https://github.com/AlexKontorovich/PrimeNumberTheoremAnd/, or click the button below:
All the required dependencies will be loaded (this takes a few minutes), after which you will be brought to a web-based vscode window, where you can edit the code, and submit PR's.
This project is licensed under the Apache 2.0 License. See the LICENSE file for details.