Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
โ† Formalpedia

Proof of (6.4), claim (2), p. 26 โ€” if ๐’œโ‚โ‚ƒ โІ ๐’ž then ๐’ž includes one of ๐’œโ‚‚โ‚ƒ, ๐’œโ‚ƒโ‚…

Proved
FourColourRSST.Ring.claim_2

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, and for iโ‰ ji \neq ji๎€ =j let Aij\mathcal A_{ij}Aijโ€‹ be the equivalence class of the edge-colouring with ฮบ(ei)=1\kappa(e_i) = 1ฮบ(eiโ€‹)=1, ฮบ(ej)=โˆ’1\kappa(e_j) = -1ฮบ(ejโ€‹)=โˆ’1 and ฮบ=0\kappa = 0ฮบ=0 on the other edges. Let C\mathcal CC be a consistent set of edge-colourings of RRR. If A13โІC\mathcal A_{13} \subseteq \mathcal CA13โ€‹โІC, then

A23โІCorA35โІC.\mathcal A_{23} \subseteq \mathcal C \quad\text{or}\quad \mathcal A_{35} \subseteq \mathcal C.A23โ€‹โІCorA35โ€‹โІC.

This is the second of the two claims in the proof of Birkhoff's lemma (6.4) for rings of length 5.

Formalization Note. Indices are 0-based in Lean: A13\mathcal A_{13}A13โ€‹ = A 0 2, A23\mathcal A_{23}A23โ€‹ = A 1 2, A35\mathcal A_{35}A35โ€‹ = A 2 4. "Includes" is set inclusion.

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

theorem claim_2 (C : Set (EdgeColouring 5)) (hC : Consistent C) (h13 : A 0 2 โІ C) :
    A 1 2 โІ C โˆจ A 2 4 โІ 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. 26, proof of (6.4), claim (2)
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