§6, p. 25 — every consistent set of edge-colourings is a union of equivalence classes
ProvedFourColourRSST.Ring.consistent_union_eqClassLet be a circuit of length and let be a consistent set of edge-colourings of (in the sense of §3: for every and every there is a signed matching that -fits, and contains every edge-colouring that -fits ). Then is a union of equivalence classes: for every and every permutation of , the edge-colouring belongs to , i.e.
where is the equivalence class of .
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 includes all of , so "meets " becomes "includes one of the five classes of ".
Formalization Note. The circuit is cycleGraph k on Fin k with edge . The hypothesis restricts to the circuits this encoding represents; the paper's statement is about any circuit.
import Mathlib import Definitions.Def_FourColourRSST_Ring_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.