TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Five colour theorem: every planar graph has chromatic number at most five

Statement

Every planar graph has chromatic number at most five in the sense of Proper vertex colourings and chromatic number. The induction uses vertex deletion from Vertex and edge deletion, edge contraction, graph minors, subdivisions and topological minors, Kempe chains from Kempe chains as connected components induced by two colour classes, and The principle of mathematical induction.

Facts & Assumptions

Given: A finite simple planar graph $G$ with a fixed plane embedding.

[L1]

Every nonnull simple planar graph has a vertex of degree at most five (Every nonnull simple planar graph has a vertex of degree at most five).

[L2]

Swapping the two colours on one Kempe component preserves a proper colouring (Swapping the two colours on one Kempe component preserves a proper colouring).

[L3]

Alternating Kempe paths between the first and third and between the second and fourth cyclic neighbours cannot both occur (For five cyclically ordered neighbours of a plane vertex, alternating Kempe paths between the first and third and between the second and fourth cannot both occur).

Proof

technique · induction

1.1

The null graph is five-colourable. For a nonnull graph choose by [L1] a vertex $v$ of degree at most five; by the induction hypothesis, $G-v$ has a proper colouring with colours $1,\ldots,5$ .

baseihL1

2.1

If fewer than five colours occur on the neighbours of $v$ , give $v$ a missing colour. Otherwise $v$ has degree exactly five, its five neighbours are distinct and use all five colours; list them $v_1,\ldots,v_5$ in their cyclic plane order and relabel so $v_i$ has colour $i$ .

step 1.1

3.1

By [L3], either $v_1,v_3$ lie in different $1$ - $3$ Kempe components or $v_2,v_4$ lie in different $2$ - $4$ components.

step 2.1L3

4.1

In the first case, swap colours $1$ and $3$ on the component containing $v_1$ ; in the second, swap $2$ and $4$ on the component containing $v_2$ . By [L2] the colouring remains proper, and respectively colour $1$ or colour $2$ is now absent from the neighbours of $v$ .

step 3.1L2L3

5.1

Give $v$ the freed colour. Together with the immediate case in step 2.1 this extends a five-colouring at every induction stage, proving the theorem.

step 1.1step 4.1discharge-induction∎

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 53 results over 21 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources

R. Diestel, Graph Theory, 6th ed., Proposition 5.1.2 (standard reference, not scraped)
R. Grassl and O. Levin, Exploring Combinatorial Mathematics, Activity 307 (standard reference, not scraped)