Plane graphs as faces of finite planar hypermaps
OpenFourColor.graph_realizationLet be a simple graph on an arbitrary finite vertex type , with a crossing-free plane drawing by continuous simple arcs. Then
Here 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 -coloring to when , 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: is the dart set, its size, and is the node permutation. Write for the edge and face permutations, with . Edge, node and face counts are numbers of permutation orbits, including singleton orbits. The component count uses the equivalence generated by all three permutations. Planarity means the exact Euler equality , and connectedness means .
A plain hypermap has a fixed-point-free involution . Cubic means every node orbit has size three; precubic means every node orbit has size at most three. Bridgeless means and never lie in the same face orbit. A -coloring is a map 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 ; 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.
import Definitions.Def_FourColor_GraphBridge
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
Read-back
What the Lean code literally says, in plain math · gpt-6
GraphRealization. For an arbitrary universe, every finite type in that universe, and every simple graph on with symmetric irreflexive adjacency , suppose there is a plane drawing in the following precise sense. There is an injective map and, for every ordered adjacent pair , a continuous injective path with and . These paths satisfy for every ; for every adjacent , every , and every , equality implies or ; and for all ordered adjacent pairs and all , equality implies or or . The proposition then asserts that there exist , , and permutations of satisfying for every , with the following conjunction of properties. Let count the cycles of , where share a -cycle exactly when for some , and let count the classes of the equivalence relation generated by , , and . Then ; every satisfies and ; and a function exists with for all darts , and for all vertices . Negative powers use inverses, and the generated equivalence includes reflexivity, symmetry, and transitivity. The map need not be surjective; vertices outside its image are isolated. No bound on or on node-cycle sizes is asserted. Empty vertex types and edgeless graphs are included. The value is allowed; its counts are zero and its dart conditions are vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.