Id: palomar/PALOMAR-2026-11-20-000011 Url: https://github.com/Harry-Tech-Guide/Lean-4-Four-Color-Theorem-Formalization/tree/5827daedcf71c0f9992a29fda7ecb4c588d3a6b2 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-20-000011-v1.json Repo: https://github.com/Harry-Tech-Guide/Lean-4-Four-Color-Theorem-Formalization Tags: math.CO, cs.LO, msc:05C15, msc:05C10, msc:68V15 Score: 0 Title: The Combinatorial Four Color Theorem in Lean 4 Trust: high Domain: math.CO Source: palomar Authors: Harry Wang Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-20 Formalized: true Formalizes: title=The four-colour theorem identifier=doi:10.1006/jctb.1997.1750 relationship=formalizes Formalizes: title=A new proof of the four-colour theorem identifier=doi:10.1090/S1079-6762-96-00003-0 relationship=formalizes Formalizes: title=Formal proof — the four-color theorem identifier= relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-20-000011 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…