The Combinatorial Four Color Theorem in Lean 4
Source: github.com/Harry-Tech-Guide/Lean-4-Four-Color-Theorem-Forma…
A self-contained, zero-Mathlib Lean 4 formalization of the Combinatorial Four Color Theorem: every finite, complete, Euler-planar, bridgeless orientable combinatorial map (involutive hypermap, `e^2 = id`, `e ∘ n ∘ f = id`) admits a proper 4-coloring of its faces (`Solution.four_color_theorem`). Follows the published mathematics of Robertson, Sanders, Seymour, and Thomas (1996/1997) and Gonthier's hypermap framework (2008), verifying all 633 unavoidable configurations (249 D-reducible and 384 C-reducible) and all 5 cartwheel discharging trees directly inside the Lean kernel without…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-20-000011
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000011/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000011/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'