Section 3 — Four coloring of planar bridgeless hypermaps
OpenFourColor.hypermap_four_colorEvery finite planar bridgeless hypermap admits a proper four-coloring of its faces:
No plain, cubic, connected, or nonempty hypothesis is imposed.
Formalization note: direct combinatorial source theorem with exact Euler planarity and finite darts indexed by . 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: 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 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.
import Definitions.Def_FourColor_Hypermap
namespace FourColor universe u theorem hypermap_four_color : ∀ (n : ℕ) (H : Hypermap n), H.Planar → H.Bridgeless → H.FourColorable := by sorry end FourColor
Read-back
What the Lean code literally says, in plain math · gpt-6
HypermapFourColor. Let , (empty if ), and let be three permutations of with for every . For a permutation , a cycle is a class for , using inverse powers for negative . Let count the cycles of , and let count the classes of the equivalence relation generated by , , and , allowing reflexivity, symmetry, and transitivity. The proposition says that if and , then there exists such that whenever for some , and for every . 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 is included: both hypotheses hold, and the empty function is a coloring.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.