Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dominate keeps the records valid and returns a well-formed aligned residue

Proved
EnvyFreeCake104.Divide.dominate_invariants

by Shuze Chen · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

cake-cuttingenvy-freefair-divisionquery-complexity

Run invariant of Dominate. Let NNN be a set of n≥3n\ge3n≥3 agents, CCC a well-formed piece (a finite list of pairwise disjoint intervals of [0,1][0,1][0,1]), and sss a record state that is valid for NNN (§1.3: 0,10,10,1 are recorded points and every recorded cell value of every agent of NNN is her true value) and in which every endpoint of CCC is a recorded point.

Then every successful run of Dominate(N,C)\mathrm{Dominate}(N,C)Dominate(N,C) (Algorithm 2, any fuel, any choice oracle, any prior transcript) ends in records s′s's′ that are again valid for NNN, and the residue RRR it returns is a well-formed piece all of whose endpoints are recorded in s′s's′.

This is the standing convention of §1.3 ("every piece our protocols handle is a union of intervals in the partition determined by 0, 1, and all previously returned Cut points ... subroutine and recursive calls inherit these records"), stated for the residue that Divide (Algorithm 1, Line 8) passes to its recursive call Divide(E,R)\mathrm{Divide}(E,R)Divide(E,R).

Preamble
import Definitions.Def_EnvyFreeCake104_Divide_Protocols

set_option autoImplicit false
Formal statement
namespace EnvyFreeCake104.Divide

/-- Run invariant of Dominate (Algorithm 2) used by the recursion of Divide (p.5): from valid
records in which the cake is aligned, every successful run of `Dominate(N, C)` leaves valid
records, and the returned residue `R` is a well-formed piece aligned with the final records. -/
theorem dominate_invariants {ι : Type} [DecidableEq ι] (V : ι → Valuation) (N : Finset ι)
    (hN : 3 ≤ N.card) (C : Piece) (hC : C.WF) (s : Rec ι) (hs : s.Valid V N)
    (hCs : s.Aligned C) (fuel : ℕ) (o : ChoiceOracle ι) (tr₀ : List (Event ι))
    (X : ι → Piece) (R : Piece) (E : Finset ι) (s' : Rec ι) (tr : List (Event ι))
    (hrun : Prog.run V o ((dominate fuel N C).run s) tr₀ = some (((X, R, E), s'), tr)) :
    s'.Valid V N ∧ R.WF ∧ s'.Aligned R := by sorry

end EnvyFreeCake104.Divide
Source
Alexandros Psomas, Cutting a Cake For Human Consumption: An Elementary n-agent Cake Cutting Protocol, arXiv:2610.30370v1, §1.3 (Recorded values, p.4) and Algorithm 1 Line 8 / Algorithm 2 (pp.5-7)

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