Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Trimming retains the largest suffix satisfying all reference bounds

Proved
EnvyFreeCake104.Divide.trimAgainst_largest_admissible_suffix__p2m_c4a65f99_9210_4042_b875_f3bc26f0537d_a1

by parclytaxel · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

cake-cuttingenvy-freefair-divisionp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1query-complexity

Assuming the parent's prefix-cut guarantee, trimming any well-formed aligned piece against participating agents with well-formed aligned reference bundles succeeds from every valid state and initial transcript. It extends the recorded points and returns a well-formed aligned suffix satisfying all reference bounds and containing every suffix satisfying those bounds. Every participating valuation respects this containment. The initial removed-piece accumulator is arbitrary.

Preamble
import Definitions.Def_EnvyFreeCake104_Divide_Protocols

open EnvyFreeCake104.Divide
Formal statement
theorem EnvyFreeCake104.Divide.trimAgainst_largest_admissible_suffix__p2m_c4a65f99_9210_4042_b875_f3bc26f0537d_a1
    {ι : Type} [DecidableEq ι] (V : ι → Valuation) (N : Finset ι)
    (hcut : ∀ (i : ι) (hi : i ∈ N) (Q : Piece) (hQ : Q.WF)
    (s : Rec ι) (hs : s.Valid V N) (hQs : s.Aligned Q)
    (w : ℝ) (hw : 0 ≤ w) (hwQ : w ≤ (V i).value Q.toSet)
    (o : ChoiceOracle ι) (tr₀ : List (Event ι)),
    ∃ (p : Pos) (s' : Rec ι) (tr : List (Event ι)),
      Prog.run V o ((prefixCut N i Q w).run s) tr₀ = some ((p, s'), tr) ∧
      s'.Valid V N ∧ s.pts ⊆ s'.pts ∧
      (prefixList Q p).WF ∧ (suffixList Q p).WF ∧
      s'.Aligned (prefixList Q p) ∧ s'.Aligned (suffixList Q p) ∧
      (V i).value (prefixList Q p).toSet = w ∧
      (V i).value (suffixList Q p).toSet = (V i).value Q.toSet - w ∧
      IsSuffix (suffixList Q p).toSet Q ∧
      ∀ S : Set ℝ, IsSuffix S Q →
        (V i).value S ≤ (V i).value Q.toSet - w →
        S ⊆ (suffixList Q p).toSet)
    (Y : ι → Piece) (hY : ∀ i ∈ N, (Y i).WF)
    (earlier : List ι) (hearlier : ∀ i ∈ earlier, i ∈ N)
    (Q removed : Piece) (hQ : Q.WF)
    (s : Rec ι) (hs : s.Valid V N)
    (hYs : ∀ i ∈ N, s.Aligned (Y i)) (hQs : s.Aligned Q)
    (o : ChoiceOracle ι) (tr₀ : List (Event ι)) :
    ∃ (B rem : Piece) (s' : Rec ι) (tr : List (Event ι)),
      Prog.run V o ((trimAgainst N Y earlier Q removed).run s) tr₀ =
        some (((B, rem), s'), tr) ∧
      s'.Valid V N ∧ s.pts ⊆ s'.pts ∧ B.WF ∧ s'.Aligned B ∧
      IsSuffix B.toSet Q ∧
      (∀ i ∈ earlier, (V i).value B.toSet ≤ (V i).value (Y i).toSet) ∧
      ∀ S : Set ℝ, IsSuffix S Q →
        (∀ i ∈ earlier, (V i).value S ≤ (V i).value (Y i).toSet) →
        S ⊆ B.toSet ∧ ∀ i ∈ N, (V i).value S ≤ (V i).value B.toSet := by sorry
Source
Alexandros Psomas, Cutting a Cake For Human Consumption: An Elementary n-agent Cake Cutting Protocol, STOC 2027 submission #104 preprint (arXiv:2610.30370, version not pinned), source.pdf SHA-256 7bef7efb85003ee7fad0a7305c0adb56e7aa074946a39d69e18fd9526572e39f, p.14, Claim 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