Greedy suffix profiles admit arbitrarily envy-free extensions
ProvedEF104ApproximateEnvelopes__p2m_e30dcdf5_697c_4dac_9565_d07a1e730ebe_a1This is the finite-cell construction in the supplied source’s proof of Lemma 6. For positive δ, subdivide each ordered piece into finitely many consecutive cells worth at most δ to every participating agent, using integrability without normalization. Start with labeled empty suffixes, rotate strict envy cycles, and otherwise enlarge an unenvied non-whole suffix by its preceding cell. Enlargements are finite; between enlargements rotations strictly increase own-value sum among finitely many assignments. The process preserves δ-envy-freeness. At termination, topological ordering and suffix comparability show that the corresponding greedy profile is contained in the terminal allocation. This removes the discrete approximation argument from the parent. Empty and zero-valued pieces cause no obstruction; no claim is made for δ ≤ 0.
import Definitions.Def_EnvyFreeCake104_Divide_Protocols import Definitions.Def_EF104GreedyProfile__p2m_e30dcdf5_697c_4dac_9565_d07a1e730ebe_a1 open EnvyFreeCake104.Divide
theorem EF104ApproximateEnvelopes__p2m_e30dcdf5_697c_4dac_9565_d07a1e730ebe_a1
{ι : Type} [DecidableEq ι] (V : ι → Valuation) (N : Finset ι)
(hN : N.Nonempty) (P : ι → Piece) (hP : ∀ i ∈ N, (P i).WF)
(hPdisj : ∀ i ∈ N, ∀ j ∈ N, i ≠ j → Disjoint (P i).toSet (P j).toSet)
(C : (List ι × List ι) → ι → Set ℝ)
(hC : ∀ g ∈ guesses N, EF104GreedyProfile__p2m_e30dcdf5_697c_4dac_9565_d07a1e730ebe_a1 V P g.1 g.2 (C g)) :
∀ δ : ℝ, 0 < δ →
∃ g ∈ guesses N, ∃ X : ι → Set ℝ,
(∀ p ∈ g.1.zip g.2, IsSuffix (X p.1) (P p.2)) ∧
(∀ i ∈ N, C g i ⊆ X i) ∧
(∀ i ∈ N, ∀ j ∈ N, (V i).value (X j) ≤ (V i).value (X i) + δ) := by sorry