Harry Wang formalizes the Four Color Theorem in Lean 4 without Mathlib
The self-contained proof follows Georges Gonthier's hypermap framework and the published mathematics of Neil Robertson, Daniel P. Sanders, Paul Seymour, and Robin Thomas. It verifies all 633 unavoidable configurations (249 D-reducible, 384 C-reducible) and all 5 cartwheel discharging trees directly inside the Lean kernel without native_decide.
Checked against: palomar-registry.orgHarry-Tech-Guide/Lean-4-Four-Color-Theorem-Formalization