The complete source-ordered 633-configuration catalogue
DefinitionFourColor_CatalogueThe full fixed list contains the explicit maps, boundary rings and contracts of all 633 source entries in source order. Every table has a kernel-checked validity proof. These proofs establish permutation/index validity only, not geometric admissibility, reducibility or coverage. Source programs and hashes are retained by the generation ledger. Formalization note: concrete source-derived data, validated inside Lean; the external decoder and the independent source comparison are diagnostic authoring tools.
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.
The fixed catalogue is the ordered list of all 633 literal configuration maps, boundary rings, and selected contracts, decoded from the pinned source. It is shared by reducibility and coverage; it is not an arbitrary or existentially chosen family. The table checker establishes array sizes, index bounds, and inverse/triangle identities only.
For a configuration , let be its ordered boundary ring, the darts whose faces avoid that ring, and the list containing both darts of every selected contract edge. Geometric admissibility means that the map is planar, bridgeless, plain and connected; is a nonempty node cycle meeting each face at most once; off-ring nodes have arity three; ring faces have arity 3–6; and there is a kernel face having a common adjacent kernel face with every kernel face. Contract validity means that avoids , its darts lie in pairwise distinct node orbits, the contract has 1–4 edges, and a four-edge contract has the source's kernel triad (more than two incident selected-face darts and not every selected face adjacent).
Colors are the Klein-four group , with bitwise XOR as addition. A boundary trace records sums of consecutive face colors around the reversed ring, including the closing pair. Ordinary traces arise from proper face colorings. Contract traces arise from face-constant colorings with equal colors across exactly the edges selected by . A trace set is Kempe-closed if it is closed under all permutations fixing zero and, for each member, contains every trace matching some compatible four-symbol noncrossing-chord word. The stack matcher rejects zero colors and requires an empty final stack. Coclosure of a set consists of traces whose every containing Kempe-closed set meets that set. C-reducibility means contract validity and inclusion of all contract traces in the coclosure of the ordinary traces.
An occurrence of in requires geometric admissibility of and a map of its darts into preserving face steps and exact face arities on . Every kernel face must contain an edge-preserving dart; such darts obey the explicit ring-link path condition in the definition. A total injective map of all permutations is not required. Occurrence up to reflection means occurrence in or in its mirror, whose edge, node and face maps are respectively , and .
The concrete transfer counts, with multiplicity, matches of the 71 symmetrized source patterns at . Their 38 base entries include repeated entries implementing larger transfers. With the face orbit of and , the score is
All intervals are inclusive; a missing upper endpoint means no upper bound. Only the positive hub is eventually restricted to degrees 5–11. Neighboring faces are not silently restricted to those degrees.
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. 9, paragraph on PDF p. 9 identifying the 633 configurations; Section 5.2, PDF pp. 26–32, configuration construction and finite checks. Relevant displays are unnumbered. Pinned executable reference: https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/cfmap.v#L127-L131; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/cfmap.v#L1140-L1141; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/cfcontract.v#L903-L905; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/configurations.v#L2076; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/reducibility.v#L16-L20.
import Definitions.Def_FourColor_CatalogueBatch01
import Definitions.Def_FourColor_CatalogueBatch02
import Definitions.Def_FourColor_CatalogueBatch03
import Definitions.Def_FourColor_CatalogueBatch04
import Definitions.Def_FourColor_CatalogueBatch05
import Definitions.Def_FourColor_CatalogueBatch06
import Definitions.Def_FourColor_CatalogueBatch07
import Definitions.Def_FourColor_CatalogueBatch08
import Definitions.Def_FourColor_CatalogueBatch09
import Definitions.Def_FourColor_CatalogueBatch10
import Definitions.Def_FourColor_CatalogueBatch11
import Definitions.Def_FourColor_CatalogueBatch12
import Definitions.Def_FourColor_CatalogueBatch13
import Definitions.Def_FourColor_CatalogueBatch14
import Definitions.Def_FourColor_CatalogueBatch15
import Definitions.Def_FourColor_CatalogueBatch16
import Definitions.Def_FourColor_CatalogueBatch17
import Definitions.Def_FourColor_CatalogueBatch18
import Definitions.Def_FourColor_CatalogueBatch19
import Definitions.Def_FourColor_CatalogueBatch20
/-!
The full source-ordered catalogue. Each batch validates literal table data by a
proof-producing evaluator checked by the Lean kernel; none asserts reducibility.
Data adapted from the pinned Rocq development, under CeCILL-B; see
missions/four-color-theorem/data/LICENSE.fourcolor and data/catalogue.json.
The batching changes compilation units only, never catalogue contents or order.
Source: Gonthier (2005), Section 3 PDF p. 9; pinned configurations.v, the_configs.
-/
set_option maxRecDepth 8192
namespace FourColor.Catalogue
/-- All 633 validated tables in exact source order. -/
def tables : List {T : ConfigurationTable // T.Valid} :=
tables01 ++ tables02 ++ tables03 ++ tables04 ++ tables05 ++ tables06 ++ tables07 ++ tables08 ++ tables09 ++ tables10 ++ tables11 ++ tables12 ++ tables13 ++ tables14 ++ tables15 ++ tables16 ++ tables17 ++ tables18 ++ tables19 ++ tables20
/-- The actual fixed maps, boundary rings and contraction darts. -/
def configurations : List Configuration :=
tables.map fun entry ↦ entry.val.toConfiguration entry.property
/-- No entry is omitted, filtered, or replaced by a fallback configuration. -/
theorem configurations_length : configurations.length = 633 := by rfl
end FourColor.Catalogue
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.