Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Five Colour Theorem (Diestel, Proposition 5.1.2)

Open
DiestelGraphTheory.five_colour_theorem

by tiago duque marques · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryplanar-graphs

Let GGG be a finite simple graph. If GGG is planar, i.e. isomorphic to the abstract graph of a plane graph whose edges are polygonal arcs, then GGG is 555-colourable: there is a map

c:V(G)→{1,2,3,4,5}withc(u)≠c(v) whenever uv∈E(G).c : V(G)\to\{1,2,3,4,5\}\quad\text{with}\quad c(u)\ne c(v) \text{ whenever } uv\in E(G).c:V(G)→{1,2,3,4,5}withc(u)=c(v) whenever uv∈E(G).

This is the strongest colouring bound for planar graphs with a short proof; the Four Colour Theorem improves 555 to 444.

Formalization Note 555-colourability is Mathlib's SimpleGraph.Colorable 5. The vertex type is assumed finite, as are all graphs in Diestel.

Preamble
import Mathlib
import Definitions.Def_DiestelGraphTheory_PolygonalArc
import Definitions.Def_DiestelGraphTheory_PlaneGraph
Formal statement
namespace DiestelGraphTheory
theorem five_colour_theorem {V : Type*} [Finite V] (G : SimpleGraph V) (hG : IsPlanar G) :
    G.Colorable 5 := by sorry
end DiestelGraphTheory
Source
R. Diestel, Graph Theory, 6th ed., Springer GTM 173 (2025), https://diestel-graph-theory.com/basic.html (free preview of Ch. 4-5). Proposition 5.1.2 (Five Colour Theorem), p. 124; k-colourable defined at the start of Ch. 5; planar defined in Section 4.4.
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let WWW be a finite type (in any universe) and GGG a simple graph with vertex set WWW. Assume GGG is planar: there exist a plane graph HHH and a graph isomorphism between GGG and the abstract graph of HHH (a bijection W→V(H)W\to V(H)W→V(H) preserving and reflecting adjacency).

Here a plane graph HHH is a finite set V⊆R2V\subseteq\mathbb{R}^2V⊆R2 and a finite set EEE of subsets of R2\mathbb{R}^2R2 (plane = R×R\mathbb{R}\times\mathbb{R}R×R with product topology) such that

  • each e∈Ee\in Ee∈E is an arc between some x,y∈Vx,y\in Vx,y∈V: a finite union of closed non-degenerate straight segments that is the image of a topological embedding φ:[0,1]→R2\varphi:[0,1]\to\mathbb{R}^2φ:[0,1]→R2 with φ(0)=x\varphi(0)=xφ(0)=x, φ(1)=y\varphi(1)=yφ(1)=y (so x≠yx\ne yx=y);
  • writing ends⁡(e)\operatorname{ends}(e)ends(e) for the set of points zzz such that eee is an arc between zzz and some point or between some point and zzz, distinct edges have distinct ends⁡\operatorname{ends}ends;
  • the interior e˚=e∖ends⁡(e)\mathring e=e\setminus\operatorname{ends}(e)e˚=e∖ends(e) of each edge contains no vertex, and for e≠e′e\ne e'e=e′, e˚∩e′=∅\mathring e\cap e'=\emptysete˚∩e′=∅;

and its abstract graph has vertex set VVV, with distinct x,yx,yx,y adjacent iff some e∈Ee\in Ee∈E is an arc between xxx and yyy (or between yyy and xxx).

Then GGG is 555-colourable: there is a map c:W→{0,1,2,3,4}c:W\to\{0,1,2,3,4\}c:W→{0,1,2,3,4} with c(u)≠c(w)c(u)\ne c(w)c(u)=c(w) whenever uuu and www are adjacent in GGG.

The finiteness assumption on WWW is redundant given planarity (the isomorphism puts WWW in bijection with the finite set VVV). The empty graph (W=∅W=\emptysetW=∅) is included and trivially satisfies the conclusion.

Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tiago duque marques · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me