Proof of (6.4), claim (1), p. 26 β if πββ β π then π includes one of πββ, πββ and one of πββ, πββ
ProvedFourColourRSST.Ring.claim_1birkhoffconsistent-setedge-colouringfour-colour-theoremkempe-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a circuit of length 5 with edges in order, and for let be the equivalence class of the edge-colouring with , and on the other edges. Let be a consistent set of edge-colourings of . If , then
This is the first 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: = A 0 1, = A 0 2, = A 0 4, = A 1 2, = A 1 4. "Includes" is set inclusion.
Preamble
import Mathlib import Definitions.Def_FourColourRSST_Ring_Setting
Formal statement
namespace FourColourRSST.Ring
theorem claim_1 (C : Set (EdgeColouring 5)) (hC : Consistent C) (h12 : A 0 1 β C) :
(A 0 2 β C β¨ A 0 4 β C) β§ (A 1 2 β C β¨ A 1 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 (1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.