Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lines 9–11 of Dominate: repeated Core calls shrink the cutter's residue

Proved
EnvyFreeCake104.Divide.shrink_progress

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

cake-cuttingenvy-freefair-divisionquery-complexity

The shrinking loop of Dominate. Let NNN be a set of n≥2n\ge2n≥2 agents, i∗∈Ni^\ast\in Ni∗∈N the cutter, α∈R\alpha\in\mathbb Rα∈R, and UUU a well-formed piece. Let W=(Wi)i∈NW=(W_i)_{i\in N}W=(Wi​)i∈N​ be an envy-free partial allocation of pairwise disjoint well-formed pieces and R′R'R′ a well-formed piece disjoint from every WiW_iWi​, all aligned with valid records sss (as is UUU). Suppose that for some K∈NK\in\mathbb NK∈N

Vi∗(R′)(1−1n)K≤α Vi∗(U).V_{i^\ast}(R')\Big(1-\tfrac1n\Big)^K\le \alpha\,V_{i^\ast}(U).Vi∗​(R′)(1−n1​)K≤αVi∗​(U).

Then for every fuel ≥K\ge K≥K and every choice oracle, the loop of Lines 9–11 of Dominate ("while Vi∗(R′)>αVi∗(U)V_{i^\ast}(R')>\alpha V_{i^\ast}(U)Vi∗​(R′)>αVi∗​(U): (F,R′)←Core(i∗,N,R′)(F,R')\leftarrow\mathrm{Core}(i^\ast,N,R')(F,R′)←Core(i∗,N,R′), W←W⊕FW\leftarrow W\oplus FW←W⊕F") terminates successfully with (W′,R′′)(W',R'')(W′,R′′) such that: the records stay valid and only gain points; every Wi′W'_iWi′​ and R′′R''R′′ is well formed and aligned; Wi⊆Wi′⊆Wi∪R′W_i\subseteq W'_i\subseteq W_i\cup R'Wi​⊆Wi′​⊆Wi​∪R′; the Wi′W'_iWi′​ are pairwise disjoint and R′′=R′∖⋃iWi′R''=R'\setminus\bigcup_iW'_iR′′=R′∖⋃i​Wi′​; W′W'W′ is envy-free; no difference Vi(Wi)−Vi(Wj)V_i(W_i)-V_i(W_j)Vi​(Wi​)−Vi​(Wj​) decreases; Vi∗(R′′)≤αVi∗(U)V_{i^\ast}(R'')\le\alpha V_{i^\ast}(U)Vi∗​(R′′)≤αVi∗​(U); and at most K⋅n3(n!)2K\cdot n^3(n!)^2K⋅n3(n!)2 queries are made.

This is the paragraph Repeated Core calls create domination of the proof of Lemma 1: by Lemma 3 the cutter receives exactly 1/n1/n1/n of her value of the current residue, so her value of the remaining residue shrinks by a factor at least 1−1n1-\frac1n1−n1​ per call.

Preamble
import Definitions.Def_EnvyFreeCake104_Divide_Protocols

set_option autoImplicit false
Formal statement
namespace EnvyFreeCake104.Divide

/-- Lines 9-11 of Dominate (p.9): repeated Core calls with cutter `i*` on the residue `R'`.
If `K` calls suffice to bring `V_{i*}(R')` below `α V_{i*}(U)` (each call keeps at most a
`(1 - 1/n)` fraction of the cutter's value of the residue), then with fuel at least `K` the
loop terminates; it keeps the allocation envy-free, only enlarges bundles with parts of `R'`,
does not decrease any difference `V_i(W_i) - V_i(W_j)`, leaves `V_{i*}(R'') ≤ α V_{i*}(U)`, and
makes at most `K` Core calls' worth of queries. -/
theorem shrink_progress {ι : Type} [DecidableEq ι] (V : ι → Valuation) (N : Finset ι)
    (hN : 2 ≤ N.card) (istar : ι) (hi : istar ∈ N) (α : ℝ) (U : Piece) (hU : U.WF) :
    ∀ (K fuel : ℕ), K ≤ fuel → ∀ (W : ι → Piece) (R' : Piece) (s : Rec ι)
      (o : ChoiceOracle ι) (tr₀ : List (Event ι)),
      (∀ i ∈ N, (W i).WF) → R'.WF →
      (∀ i ∈ N, ∀ j ∈ N, i ≠ j → Disjoint (W i).toSet (W j).toSet) →
      (∀ i ∈ N, Disjoint (W i).toSet R'.toSet) →
      EnvyFree V N (fun i => (W i).toSet) →
      s.Valid V N → (∀ i ∈ N, s.Aligned (W i)) → s.Aligned R' → s.Aligned U →
      (V istar).value R'.toSet * (1 - 1 / (N.card : ℝ)) ^ K ≤ α * (V istar).value U.toSet →
      ∃ (W' : ι → Piece) (R'' : Piece) (s' : Rec ι) (tr : List (Event ι)),
        Prog.run V o ((shrink N istar α U fuel W R').run s) tr₀ =
          some (((W', R''), s'), tr) ∧
        s'.Valid V N ∧ s.pts ⊆ s'.pts ∧ (∀ i ∈ N, (W' i).WF ∧ s'.Aligned (W' i)) ∧
        R''.WF ∧ s'.Aligned R'' ∧
        (∀ i ∈ N, (W i).toSet ⊆ (W' i).toSet ∧ (W' i).toSet ⊆ (W i).toSet ∪ R'.toSet) ∧
        (∀ i ∈ N, ∀ j ∈ N, i ≠ j → Disjoint (W' i).toSet (W' j).toSet) ∧
        R''.toSet = R'.toSet \ ⋃ i ∈ N, (W' i).toSet ∧
        EnvyFree V N (fun i => (W' i).toSet) ∧
        (∀ i ∈ N, ∀ j ∈ N, (V i).value (W i).toSet - (V i).value (W j).toSet ≤
          (V i).value (W' i).toSet - (V i).value (W' j).toSet) ∧
        (V istar).value R''.toSet ≤ α * (V istar).value U.toSet ∧
        queryCount tr ≤ queryCount tr₀ + K * (N.card ^ 3 * (N.card.factorial) ^ 2) := by sorry

end EnvyFreeCake104.Divide
Source
Alexandros Psomas, Cutting a Cake For Human Consumption: An Elementary n-agent Cake Cutting Protocol, arXiv:2610.30370v1, proof of Lemma 1, paragraph 'Repeated Core calls create domination' (p.9), Algorithm 2 Lines 9-11

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