Face charges for rational dart transfers
DefinitionFourColor_DischargingNotation: 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.
For any , define
Here is the face-orbit size and is positive for every dart. The definitions alone do not assert a conserved total, a positive face, or validity of any rules. Formalization note: source-derived rational generalization of the concrete integer discharging formula. The separate conservation milestone establishes its total under planar/plain/cubic hypotheses.
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 defining discharging and its unnumbered charge formula; Section 5.5, PDF pp. 44–48. Relevant displays are unnumbered. Pinned executable reference: https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/geometry.v#L617; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/discharge.v#L167; https://github.com/rocq-community/fourcolor/blob/c1d6b1cd5288bea4b067aac13cdde3c18dffe018/theories/proof/discharge.v#L201.
import Definitions.Def_FourColor_Hypermap
import Mathlib.Data.Rat.Cast.Order
import Mathlib.Algebra.BigOperators.Field
/-!
Generic face charges, separating conservation from verification of particular rules.
Gonthier (2005), Section 3, PDF p. 9, unnumbered discharging formula;
pinned Rocq `discharge.v`, lines 167–172 and 201–216. Rational transfers generalize
the integer rule counts; no specific discharging rule or checker is assumed here.
-/
namespace FourColor.Hypermap
open scoped BigOperators
/-- The charge of the face containing `x`, with directed transfers along edge darts. -/
noncomputable def faceCharge {n : ℕ} (H : FourColor.Hypermap n)
(transfer : Fin n → ℚ) (x : Fin n) : ℚ :=
60 - 10 * (H.faceArity x : ℚ) +
∑ y ∈ H.faceDarts x, (transfer (H.edge y) - transfer y)
/-- Summing each face charge once, expressed without choosing orbit representatives. -/
noncomputable def totalFaceCharge {n : ℕ} (H : FourColor.Hypermap n)
(transfer : Fin n → ℚ) : ℚ :=
∑ x : Fin n, H.faceCharge transfer x / (H.faceArity x : ℚ)
end FourColor.Hypermap
Read-back
What the Lean code literally says, in plain math · gpt-6
faceCharge. Let , (empty if ), and let be three permutations of with for every . Write and , using inverse powers for negative . For every function and dart , this rational number is , with converted to a rational number. The values of are unrestricted in sign and size. No planarity equation, involution, connectedness, or node-cycle-size hypothesis is imposed. The set contains ; if there is no argument .
totalFaceCharge. Let , (empty if ), and let be three permutations of with for every . Write and , using inverse powers for negative . For every function , this rational number is , with converted to a rational number. The outer sum runs over darts, and each summand is divided by the size of its face cycle. The transfer values have no sign or size restriction, and no planarity equation, involution, connectedness, or node-cycle-size hypothesis is imposed. Each denominator in an existing term is positive since . If , the sum is empty and equals ; no zero denominator occurs.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.