Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6.4), p. 25 β€” every non-empty consistent set of edge-colourings of a 5-ring that meets β„° includes one of π’žβ‚,…,π’žβ‚…, π’Ÿβ‚,…,π’Ÿβ‚…, β„°

Proved
FourColourRSST.Ring.birkhoff_ring5

by mikedeng1 Β· Oct 6, 2026 Β· Mathlib 0df444a (Lean v4.33.1)

birkhoffconsistent-setedge-colouringfour-colour-theoremkempe-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let RRR be a circuit of length 5 with edges e1,…,e5e_1, \dots, e_5e1​,…,e5​ in order. For 1≀iβ‰ j≀51 \le i \ne j \le 51≀iξ€ =j≀5 let Aij\mathcal A_{ij}Aij​ be the equivalence class of the edge-colouring ΞΊ\kappaΞΊ with ΞΊ(ei)=1\kappa(e_i) = 1ΞΊ(ei​)=1, ΞΊ(ej)=βˆ’1\kappa(e_j) = -1ΞΊ(ej​)=βˆ’1 and ΞΊ(ek)=0\kappa(e_k) = 0ΞΊ(ek​)=0 for kβ‰ i,jk \ne i, jkξ€ =i,j. For 1≀i≀51 \le i \le 51≀i≀5 let

Ci=AijβˆͺAikβˆͺAjk,\mathcal C_i = \mathcal A_{ij} \cup \mathcal A_{ik} \cup \mathcal A_{jk},Ci​=Aij​βˆͺAik​βˆͺAjk​,

where ej,ekβ‰ eie_j, e_k \ne e_iej​,ek​=ei​ are the two edges with a common end with eie_iei​; and let

Di=AacβˆͺAadβˆͺAbcβˆͺAbd,\mathcal D_i = \mathcal A_{ac} \cup \mathcal A_{ad} \cup \mathcal A_{bc} \cup \mathcal A_{bd},Di​=Aac​βˆͺAad​βˆͺAbc​βˆͺAbd​,

where ea,eb,ec,ede_a, e_b, e_c, e_dea​,eb​,ec​,ed​ are the edges different from eie_iei​, in order. Finally let E=A12βˆͺA23βˆͺA34βˆͺA45βˆͺA15\mathcal E = \mathcal A_{12} \cup \mathcal A_{23} \cup \mathcal A_{34} \cup \mathcal A_{45} \cup \mathcal A_{15}E=A12​βˆͺA23​βˆͺA34​βˆͺA45​βˆͺA15​.

Theorem (Birkhoff). Every non-empty consistent set C\mathcal CC of edge-colourings of RRR with C∩Eβ‰ βˆ…\mathcal C \cap \mathcal E \neq \emptysetC∩Eξ€ =βˆ… satisfies

CiβŠ†CΒ forΒ someΒ i,orDiβŠ†CΒ forΒ someΒ i,orEβŠ†C.\mathcal C_i \subseteq \mathcal C \text{ for some } i, \quad\text{or}\quad \mathcal D_i \subseteq \mathcal C \text{ for some } i, \quad\text{or}\quad \mathcal E \subseteq \mathcal C.Ciβ€‹βŠ†CΒ forΒ someΒ i,orDiβ€‹βŠ†CΒ forΒ someΒ i,orEβŠ†C.

This is Birkhoff's lemma for rings of length 5. In the RSST quadratic colouring algorithm (6.5) it is what allows a 4-colouring to be carried across a separating 5-circuit in the short-circuit subroutine. It is one ingredient of the proof of the Four-Colour Theorem, not the theorem itself.

Formalization Note. The circuit is cycleGraph 5 on Fin 5; the paper's eie_iei​ is edge iβˆ’1i - 1iβˆ’1 (0-based). Thus Aij\mathcal A_{ij}Aij​ is A (i-1) (j-1), E\mathcal EE = A 0 1 βˆͺ A 1 2 βˆͺ A 2 3 βˆͺ A 3 4 βˆͺ A 0 4, the paper's Ci\mathcal C_iCi​ is C5 (i-1) (built from edges iβˆ’2i-2iβˆ’2, iii modulo 5, the two neighbours of edge iβˆ’1i-1iβˆ’1), and the paper's Di\mathcal D_iDi​ is D5 (i-1) with (a,b,c,d)(a,b,c,d)(a,b,c,d) the four other edges read along the path Rβˆ’eiR - e_iRβˆ’ei​ starting next to eie_iei​. "Includes" is set inclusion and "meets" is non-empty intersection. The hypothesis that C\mathcal CC is non-empty is implied by meeting E\mathcal EE; it is kept because the statement says it.

Preamble
import Mathlib
import Definitions.Def_FourColourRSST_Ring_Setting
Formal statement
namespace FourColourRSST.Ring

theorem birkhoff_ring5 (C : Set (EdgeColouring 5)) (hC : Consistent C)
    (hne : C.Nonempty) (hmeet : (C ∩ E5).Nonempty) :
    (βˆƒ i, C5 i βŠ† C) ∨ (βˆƒ i, D5 i βŠ† C) ∨ E5 βŠ† C := by sorry

end FourColourRSST.Ring
Source
Robertson, Sanders, Seymour and Thomas, The Four-Colour Theorem, J. Combin. Theory Ser. B 70 (1997), author's manuscript (rev. 16 January 1997), p. 25, (6.4)
Human review
  • Endorsed by Shuze Chen Β· Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 Β· Oct 6, 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