Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3 — Four coloring of planar bridgeless hypermaps

Open
FourColor.hypermap_four_color

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

four-color-theoremgraph-theory

Every finite planar bridgeless hypermap admits a proper four-coloring of its faces:

∀n,H,Planar⁡(H)∧Bridgeless⁡(H)⟹FourColorable⁡(H).\forall n,H,\quad \operatorname{Planar}(H)\land\operatorname{Bridgeless}(H) \Longrightarrow\operatorname{FourColorable}(H).∀n,H,Planar(H)∧Bridgeless(H)⟹FourColorable(H).

No plain, cubic, connected, or nonempty hypothesis is imposed.

Formalization note: direct combinatorial source theorem with exact Euler planarity and finite darts indexed by Fin⁡(n)\operatorname{Fin}(n)Fin(n). The conditional Lean assembly in this proposal proves this interface follows from cubic normalization, minimal-counterexample existence, and elimination. The standard graph theorem additionally requires the independent graph representation.

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. 6, paragraph on PDF p. 6 displaying the unnumbered four_color_hypermap theorem. Relevant displays are unnumbered. Pinned executable reference: https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/combinatorial4ct.v#L18.

Preamble
import Definitions.Def_FourColor_Hypermap
Formal statement
namespace FourColor
universe u
theorem hypermap_four_color :
  ∀ (n : ℕ) (H : Hypermap n), H.Planar → H.Bridgeless → H.FourColorable := 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. 6, paragraph on PDF p. 6 displaying the unnumbered `four_color_hypermap` theorem. Relevant displays are unnumbered. Pinned executable reference: https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/combinatorial4ct.v#L18.
Read-back

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

HypermapFourColor. Let n∈Nn\in\mathbb Nn∈N, Dn={0,…,n−1}D_n=\{0,\ldots,n-1\}Dn​={0,…,n−1} (empty if n=0n=0n=0), and let H=(e,ν,ϕ)H=(e,\nu,\phi)H=(e,ν,ϕ) be three permutations of DnD_nDn​ with ν(ϕ(e(x)))=x\nu(\phi(e(x)))=xν(ϕ(e(x)))=x for every x∈Dnx\in D_nx∈Dn​. For a permutation σ\sigmaσ, a cycle is a class for x∼σy  ⟺  ∃j∈Z, σj(x)=yx\sim_\sigma y\iff\exists j\in\mathbb Z,\ \sigma^j(x)=yx∼σ​y⟺∃j∈Z, σj(x)=y, using inverse powers for negative jjj. Let E,N,FE,N,FE,N,F count the cycles of e,ν,ϕe,\nu,\phie,ν,ϕ, and let CCC count the classes of the equivalence relation generated by (x,e(x))(x,e(x))(x,e(x)), (x,ν(x))(x,\nu(x))(x,ν(x)), and (x,ϕ(x))(x,\phi(x))(x,ϕ(x)), allowing reflexivity, symmetry, and transitivity. The proposition says that if E+N+F=n+2CE+N+F=n+2CE+N+F=n+2C and ∀x∈Dn, ¬∃j∈Z, ϕj(x)=e(x)\forall x\in D_n,\ \neg\exists j\in\mathbb Z,\ \phi^j(x)=e(x)∀x∈Dn​, ¬∃j∈Z, ϕj(x)=e(x), then there exists c:Dn→{0,1,2,3}c:D_n\to\{0,1,2,3\}c:Dn​→{0,1,2,3} such that c(x)=c(y)c(x)=c(y)c(x)=c(y) whenever ϕj(x)=y\phi^j(x)=yϕj(x)=y for some j∈Zj\in\mathbb Zj∈Z, and c(e(x))≠c(x)c(e(x))\ne c(x)c(e(x))=c(x) for every x∈Dnx\in D_nx∈Dn​. There is no requirement to use every color. No involution, fixed node-cycle size, upper bound on node-cycle sizes, or single-component hypothesis is imposed. The case n=0n=0n=0 is included: both hypotheses hold, and the empty function is a coloring.

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