Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, p. 25 — every consistent set of edge-colourings is a union of equivalence classes

Proved
FourColourRSST.Ring.consistent_union_eqClass

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

consistent-setedge-colouringfour-colour-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let RRR be a circuit of length k≥3k \ge 3k≥3 and let C\mathcal CC be a consistent set of edge-colourings of RRR (in the sense of §3: for every κ∈C\kappa \in \mathcal Cκ∈C and every θ∈{−1,0,1}\theta \in \{-1,0,1\}θ∈{−1,0,1} there is a signed matching MMM that κ\kappaκ θ\thetaθ-fits, and C\mathcal CC contains every edge-colouring that θ\thetaθ-fits MMM). Then C\mathcal CC is a union of equivalence classes: for every κ∈C\kappa \in \mathcal Cκ∈C and every permutation λ\lambdaλ of {−1,0,1}\{-1,0,1\}{−1,0,1}, the edge-colouring λ∘κ\lambda \circ \kappaλ∘κ belongs to C\mathcal CC, i.e.

κ∈C  ⟹  [κ]⊆C,\kappa \in \mathcal C \implies [\kappa] \subseteq \mathcal C,κ∈C⟹[κ]⊆C,

where [κ][\kappa][κ] is the equivalence class of κ\kappaκ.

This is the fact that lets the proofs of (6.3) and (6.4) reason class by class: a consistent set that contains one colouring of Aij\mathcal A_{ij}Aij​ includes all of Aij\mathcal A_{ij}Aij​, so "meets E\mathcal EE" becomes "includes one of the five classes of E\mathcal EE".

Formalization Note. The circuit is cycleGraph k on Fin k with edge i={i,i+1}i = \{i, i+1\}i={i,i+1}. The hypothesis k≥3k \ge 3k≥3 restricts to the circuits this encoding represents; the paper's statement is about any circuit.

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

theorem consistent_union_eqClass {k : ℕ} [NeZero k] (hk : 3 ≤ k)
    (C : Set (EdgeColouring k)) (hC : Consistent C) :
    ∀ κ ∈ C, eqClass κ ⊆ 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, "every consistent set is a union of equivalence classes"
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