Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 17(a) — each bad good is worth at most one's own bundle

Proved
LittleCharity.GMMS.lemma_17_a

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

efxfair-divisiongmmsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XXX be a partial EFX allocation for nonnegative additive valuations. Suppose every agent values its pool no more than its own bundle, and sss is an unenvied agent. Form YYY by giving the pool to sss. For any observer iii, a bad good ggg lies in a two-good bundle YjY_jYj​ with j≠sj\ne sj=s and j≠ij\ne ij=i. Then

vi({g})≤vi(Yi).v_i(\{g\})\le v_i(Y_i).vi​({g})≤vi​(Yi​).

This bounds the aggregate value of bad goods in the proof of the 4/74/74/7 guarantee.

Formalization Note The page calls the donor “agent 1”; Lean uses a named source sss. A bad good is encoded through its containing bundle, following the classification immediately before Lemma 17.

Preamble
import Mathlib
import Definitions.Def_LittleCharity_GMMS_Setting
Formal statement
namespace LittleCharity.GMMS

/-- Lemma 17(a), p. 16: each bad good is worth at most the observing agent's own bundle. -/
theorem lemma_17_a {n m : ℕ} (v : Fin n → Finset (Fin m) → ℝ) (hadd : LittleCharity.MMS.IsAdditive v)
    (X : Fin n → Finset (Fin m)) (hX : LittleCharity.EFX.IsPartialAllocation X) (hEFX : LittleCharity.MMS.IsEFX v X)
    (hpool : ∀ i, v i (LittleCharity.EFX.pool X) ≤ v i (X i))
    (s : Fin n) (hs : LittleCharity.EFX.IsSource v X s) (i : Fin n) :
    ∀ j, j ≠ s → j ≠ i → (donate X s j).card = 2 →
      ∀ g ∈ donate X s j, v i {g} ≤ v i (donate X s i) := by sorry

end LittleCharity.GMMS
Source
Chaudhury, Kavitha, Mehlhorn & Sgouritsa, A Little Charity Guarantees Almost Envy-Freeness, arXiv:1907.04596v3, p. 16, classification and Lemma 17(a)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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