About This Project
This project formalizes results from structural graph theory and discrete mathematics in Lean. All code was written by Claude Code and OpenAI Codex.
A given manuscript is broken down into a list of entries, roughly corresponding to the individual theorems, lemmas or definitions within. Each entry consists of a natural-language statement, together with its corresponding Lean statement and Lean proof. While the compiler ensures correctness of the Lean proof, it requires human review to ensure that the Lean statement faithfully represents the intended natural-language statement. Using my limited Lean experience, I have verified only few entries, and hope for input from the community to extend the database of verified manuscripts.
If you would like to learn more or contribute, please reach out under .
Manuscripts
The following manuscripts are in the process of formalization.
Catalog
Dependency Graph
The following DAG shows the current content of the database. For its full Lean source code see here.