Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Plane graphs as faces of finite planar hypermaps

Open
FourColor.graph_realization

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

four-color-theoremgraph-theory

Let GGG be a simple graph on an arbitrary finite vertex type VVV, with a crossing-free plane drawing by continuous simple arcs. Then

∃n,H:H is planar and plain,∃ρ:D→V,(d∼fd′  ⟺  ρ(d)=ρ(d′)),\exists n,H:\quad H\text{ is planar and plain},\qquad \exists\rho:D\to V,\quad (d\sim_f d'\iff\rho(d)=\rho(d')),∃n,H:H is planar and plain,∃ρ:D→V,(d∼f​d′⟺ρ(d)=ρ(d′)), G(v,w)  ⟺  ∃d∈D,ρ(d)=v ∧ ρ(e(d))=w.G(v,w)\iff\exists d\in D,\quad\rho(d)=v\ \land\ \rho(e(d))=w.G(v,w)⟺∃d∈D,ρ(d)=v ∧ ρ(e(d))=w.

Here d∼fd′d\sim_f d'd∼f​d′ means membership in the same face orbit. Thus faces correspond exactly to nonisolated vertices, and edge steps represent exactly graph adjacency. Isolated vertices have no representing dart; an edgeless graph may use the empty hypermap. No connectedness or nonempty-vertex assumption is imposed.

The representation's structural Lean API proves bridgelessness from looplessness and transports any hypermap kkk-coloring to GGG when k>0k>0k>0, assigning a default color to isolated vertices. These facts are not assumed in the definition.

Formalization note: a paper-derived graph/dual-hypermap realization bridge, not the literal topological-map discretization theorem in Rocq. It is the source-backed bridge into the hypermap coloring child. The proof must construct the incidence representation independently of the graph Four Color Theorem.

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 2, PDF p. 4, paragraph beginning 'Although the statement'; Section 5.6, PDF p. 48, discretization discussion (paragraph on PDF p. 48). Relevant displays are unnumbered. Pinned executable reference: https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/discretize.v#L347; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/coloring.v#L135; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/geometry.v#L95.

Preamble
import Definitions.Def_FourColor_GraphBridge
Formal statement
namespace FourColor
universe u
theorem graph_realization :
  ∀ (V : Type u) [Finite V] (G : SimpleGraph V), IsPlanar G →
    ∃ (n : ℕ) (H : Hypermap n), H.Planar ∧ H.Plain ∧ Nonempty (FaceRepresentation G H) := 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 2, PDF p. 4, paragraph beginning 'Although the statement'; Section 5.6, PDF p. 48, discretization discussion (paragraph on PDF p. 48). Relevant displays are unnumbered. Pinned executable reference: https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/discretize.v#L347; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/coloring.v#L135; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/geometry.v#L95.
Read-back

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

GraphRealization. For an arbitrary universe, every finite type VVV in that universe, and every simple graph GGG on VVV with symmetric irreflexive adjacency ∼G\sim_G∼G​, suppose there is a plane drawing in the following precise sense. There is an injective map p:V→R2p:V\to\mathbb R^2p:V→R2 and, for every ordered adjacent pair v∼Gwv\sim_G wv∼G​w, a continuous injective path avw:[0,1]→R2a_{vw}:[0,1]\to\mathbb R^2avw​:[0,1]→R2 with avw(0)=p(v)a_{vw}(0)=p(v)avw​(0)=p(v) and avw(1)=p(w)a_{vw}(1)=p(w)avw​(1)=p(w). These paths satisfy awv(t)=avw(1−t)a_{wv}(t)=a_{vw}(1-t)awv​(t)=avw​(1−t) for every t∈[0,1]t\in[0,1]t∈[0,1]; for every adjacent v,wv,wv,w, every t∈[0,1]t\in[0,1]t∈[0,1], and every z∈Vz\in Vz∈V, equality avw(t)=p(z)a_{vw}(t)=p(z)avw​(t)=p(z) implies z=vz=vz=v or z=wz=wz=w; and for all ordered adjacent pairs (v,w),(z,q)(v,w),(z,q)(v,w),(z,q) and all s,t∈[0,1]s,t\in[0,1]s,t∈[0,1], equality avw(s)=azq(t)a_{vw}(s)=a_{zq}(t)avw​(s)=azq​(t) implies (v=z ∧ w=q)(v=z\ \wedge\ w=q)(v=z ∧ w=q) or (v=q ∧ w=z)(v=q\ \wedge\ w=z)(v=q ∧ w=z) or ((s=0 ∨ s=1) ∧ (t=0 ∨ t=1))((s=0\ \vee\ s=1)\ \wedge\ (t=0\ \vee\ t=1))((s=0 ∨ s=1) ∧ (t=0 ∨ t=1)). The proposition then asserts that there exist n∈Nn\in\mathbb Nn∈N, Dn={0,…,n−1}D_n=\{0,\ldots,n-1\}Dn​={0,…,n−1}, and permutations e,ν,ϕe,\nu,\phie,ν,ϕ of DnD_nDn​ satisfying ν(ϕ(e(x)))=x\nu(\phi(e(x)))=xν(ϕ(e(x)))=x for every xxx, with the following conjunction of properties. Let E,N,FE,N,FE,N,F count the cycles of e,ν,ϕe,\nu,\phie,ν,ϕ, where x,yx,yx,y share a σ\sigmaσ-cycle exactly when σj(x)=y\sigma^j(x)=yσj(x)=y for some j∈Zj\in\mathbb Zj∈Z, 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)). Then E+N+F=n+2CE+N+F=n+2CE+N+F=n+2C; every xxx satisfies e(e(x))=xe(e(x))=xe(e(x))=x and e(x)≠xe(x)\ne xe(x)=x; and a function r:Dn→Vr:D_n\to Vr:Dn​→V exists with (∃j∈Z, ϕj(x)=y)  ⟺  r(x)=r(y)(\exists j\in\mathbb Z,\ \phi^j(x)=y)\iff r(x)=r(y)(∃j∈Z, ϕj(x)=y)⟺r(x)=r(y) for all darts x,yx,yx,y, and v∼Gw  ⟺  ∃x∈Dn, r(x)=v ∧ r(e(x))=wv\sim_G w\iff\exists x\in D_n,\ r(x)=v\ \wedge\ r(e(x))=wv∼G​w⟺∃x∈Dn​, r(x)=v ∧ r(e(x))=w for all vertices v,wv,wv,w. Negative powers use inverses, and the generated equivalence includes reflexivity, symmetry, and transitivity. The map rrr need not be surjective; vertices outside its image are isolated. No bound on nnn or on node-cycle sizes is asserted. Empty vertex types and edgeless graphs are included. The value n=0n=0n=0 is allowed; its counts are zero and its dart conditions are vacuous.

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