Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 8 — the null set is consistent, unions of consistent sets are consistent, and every set has a unique maximal consistent subset

Proved
FourColourRSST.Ring.consistent_closure

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. Then:

  1. the empty set of edge-colourings of RRR is consistent;
  2. if C1\mathcal C_1C1​ and C2\mathcal C_2C2​ are consistent, so is C1∪C2\mathcal C_1 \cup \mathcal C_2C1​∪C2​;
  3. every set S\mathcal SS of edge-colourings of RRR has a unique maximal consistent subset S′\mathcal S'S′, in the sense that there is exactly one S′⊆S\mathcal S' \subseteq \mathcal SS′⊆S which is consistent and contains every consistent subset of S\mathcal SS:
∃! S′⊆S:S′ consistent and (T⊆S, T consistent  ⟹  T⊆S′).\exists!\, \mathcal S' \subseteq \mathcal S:\quad \mathcal S' \text{ consistent and } \bigl(\mathcal T \subseteq \mathcal S,\ \mathcal T \text{ consistent} \implies \mathcal T \subseteq \mathcal S'\bigr).∃!S′⊆S:S′ consistent and (T⊆S, T consistent⟹T⊆S′).

The maximal consistent subset S′\mathcal S'S′ is the object the reducibility computations of §3 evaluate; the paper notes that for rings of small size it can be computed from S\mathcal SS by machine.

Formalization Note. "Maximal" is rendered as greatest (contains every consistent subset of S\mathcal SS), which is the meaning the paper's "unique maximal" carries given closure under unions. The circuit is cycleGraph k on Fin k, with k≥3k \ge 3k≥3 restricting to the circuits this encoding represents.

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

theorem consistent_closure {k : ℕ} [NeZero k] (hk : 3 ≤ k) :
    Consistent (∅ : Set (EdgeColouring k)) ∧
    (∀ C₁ C₂ : Set (EdgeColouring k), Consistent C₁ → Consistent C₂ → Consistent (C₁ ∪ C₂)) ∧
    (∀ S : Set (EdgeColouring k), ∃! S' : Set (EdgeColouring k),
      S' ⊆ S ∧ Consistent S' ∧ ∀ T ⊆ S, Consistent T → T ⊆ S') := 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. 8, §3, "Since the null set is consistent, and the union of any two consistent sets is consistent, it follows that any set of edge-colourings 𝒮 has a unique maximal consistent subset 𝒮′"
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