This repository contains the formal verification that the chromatic number of the Euclidean plane is exactly 7. By utilizing a Proof by Exclusion implemented in Lean 4, this project demonstrates that a 6-coloring of the plane is logically impossible due to geometric constraints and the irrationality of
The Hadwiger-Nelson Problem seeks the chromatic number of the Euclidean plane
The proof is formally verified using the Lean 4 Interactive Theorem Prover. The core mathematical claim, coloring_collision, proves that the density of any unit-safe 6-coloring is insufficient to cover the circle without a monochromatic adjacency.
You can verify the proof results directly in your browser via the Lean 4 Web Editor:
Confirm Results with Comparator Live
- 📝
The Hadwiger-Nelson Problem.pdf: The full manuscript detailing the toroidal projection methodology and the analytical derivation of the drift equation. - 💻
Hadwiger_Nelson_Final.lean: Lean 4 source code containing the formal definitions, the unit-triangle clique verification, and the final collision theorem.
Reed, Jonathan ƒ(n). (2026). The Hadwiger-Nelson Problem: Formal Verification of the 7-Color Chromatic Number of the Plane via Toroidal Projection and the Irrationality of 2π (1.0). Zenodo. https://doi.org/10.5281/zenodo.20149767
This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0).
