Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sections 5.2–5.5 — Eliminate minimal counterexamples

Open
FourColor.no_minimal_counterexample

by Minghui · Sep 26, 2026 · Mathlib c5ea003 (Lean v4.30.0)

four-color-theoremgraph-theory

There is no minimal counterexample in the finite planar, bridgeless, plain, precubic comparison class:

∀n ∀H on n darts,¬MinimalCounterexample⁡(H).\forall n\ \forall H\text{ on }n\text{ darts},\quad \neg\operatorname{MinimalCounterexample}(H).∀n ∀H on n darts,¬MinimalCounterexample(H).

There is no hypothesis granting a successful external program run, correctness of a checker, reducibility of a catalogue, or validity of discharge rules.

Formalization note: the combined source-backed reducibility/unavoidability endpoint. The source's conditional unavoidability is used only after proving the genuine reducibility theorem. This remains the substantial finite-case-analysis frontier: formalize configuration/contraction/Kempe semantics, the stronger Birkhoff ring and embedding facts, a concrete source catalogue (633 entries in the reference), sound finite checkers, all required certificate checks, and the discharging case coverage. Structure and conservation alone do not prove it.

Notation: D={0,…,n−1}D=\{0,\ldots,n-1\}D={0,…,n−1} is the dart set, n=∣D∣n = |D|n=∣D∣ its size, and p=νHp = \nu_Hp=νH​ is the node permutation. Write e,fe,fe,f for the edge and face permutations, with p(f(e(d)))=dp(f(e(d)))=dp(f(e(d)))=d. Edge, node and face counts E,N,FE,N,FE,N,F are numbers of permutation orbits, including singleton orbits. The component count CCC uses the equivalence generated by all three permutations. Planarity means the exact Euler equality E+N+F=n+2CE+N+F=n+2CE+N+F=n+2C, and connectedness means C=1C=1C=1.

A plain hypermap has a fixed-point-free involution eee. Cubic means every node orbit has size three; precubic means every node orbit has size at most three. Bridgeless means ddd and e(d)e(d)e(d) never lie in the same face orbit. A kkk-coloring is a map D→{0,…,k−1}D\to\{0,\ldots,k-1\}D→{0,…,k−1} constant on face orbits and different across each edge step. No requirement uses all available colors. The empty dart set has zero components, is planar, and is colorable, but is not connected.

An admissible hypermap is planar, bridgeless, plain and precubic. A minimal counterexample is a non-four-colorable admissible hypermap such that every admissible hypermap with fewer darts is four-colorable. Minimality includes all finite carriers through their enumeration by Fin⁡(m)\operatorname{Fin}(m)Fin(m); cubicity, connectedness and lower face-degree bounds are not assumed.

Source: Georges Gonthier, A Computer-Checked Proof of the Four Colour Theorem (2005), https://www.microsoft.com/en-us/research/wp-content/uploads/2012/10/4colproof.pdf; Section 3, PDF p. 8, paragraph on PDF p. 8 listing reducibility and unavoidability; Section 5.2, PDF pp. 26–32; Section 5.4, PDF pp. 38–44; Section 5.5, PDF pp. 44–48. Relevant displays are unnumbered. Pinned executable reference: https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/reducibility.v#L16; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/unavoidability.v#L20; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/configurations.v#L17.

Preamble
import Definitions.Def_FourColor_Hypermap
Formal statement
namespace FourColor
universe u
theorem no_minimal_counterexample :
  ∀ (n : ℕ) (H : Hypermap n), ¬ H.MinimalCounterexample := by sorry
end FourColor
Source
Georges Gonthier, A Computer-Checked Proof of the Four Colour Theorem (2005), https://www.microsoft.com/en-us/research/wp-content/uploads/2012/10/4colproof.pdf; Section 3, PDF p. 8, paragraph on PDF p. 8 listing reducibility and unavoidability; Section 5.2, PDF pp. 26–32; Section 5.4, PDF pp. 38–44; Section 5.5, PDF pp. 44–48. Relevant displays are unnumbered. Pinned executable reference: https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/reducibility.v#L16; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/unavoidability.v#L20; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/configurations.v#L17.
Read-back

What the Lean code literally says, in plain math · gpt-6

NoMinimalCounterexample. For every d∈Nd\in\mathbb Nd∈N, a triple J=(eJ,νJ,ϕJ)J=(e_J,\nu_J,\phi_J)J=(eJ​,νJ​,ϕJ​) on Dd={0,…,d−1}D_d=\{0,\ldots,d-1\}Dd​={0,…,d−1} means three permutations satisfying νJ(ϕJ(eJ(x)))=x\nu_J(\phi_J(e_J(x)))=xνJ​(ϕJ​(eJ​(x)))=x for every xxx. A σ\sigmaσ-cycle is a class for ∃j∈Z, σj(x)=y\exists j\in\mathbb Z,\ \sigma^j(x)=y∃j∈Z, σj(x)=y, with inverse powers for negative jjj. Let EJ,NJ,FJE_J,N_J,F_JEJ​,NJ​,FJ​ count its edge, node, and face cycles, and let CJC_JCJ​ count the classes of the equivalence relation generated by every edge, node, and face permutation step, including reflexivity, symmetry, and transitivity. Condition AAA means EJ+NJ+FJ=d+2CJE_J+N_J+F_J=d+2C_JEJ​+NJ​+FJ​=d+2CJ​, no xxx shares a ϕJ\phi_JϕJ​-cycle with eJ(x)e_J(x)eJ​(x), eJ(eJ(x))=xe_J(e_J(x))=xeJ​(eJ​(x))=x and eJ(x)≠xe_J(x)\ne xeJ​(x)=x for every xxx, and every νJ\nu_JνJ​-cycle has at most three elements. A coloring means a function c:Dd→{0,1,2,3}c:D_d\to\{0,1,2,3\}c:Dd​→{0,1,2,3} constant on every ϕJ\phi_JϕJ​-cycle and satisfying c(eJ(x))≠c(x)c(e_J(x))\ne c(x)c(eJ​(x))=c(x) for every xxx, without requiring every color to be used. The proposition says that for every n∈Nn\in\mathbb Nn∈N and every such triple HHH on DnD_nDn​, it is not the case that all three of the following hold together: HHH satisfies AAA; HHH has no coloring; and for every natural number m<nm<nm<n and every such triple KKK on DmD_mDm​, if KKK satisfies AAA then KKK has a coloring. There is no hypothesis restricting the universally quantified HHH. If n=0n=0n=0, the smaller-count condition is vacuous but the noncolorability condition is false because the empty coloring exists.

Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Minghui · Sep 27, 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