Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4(a) — Rule U0 preserves EFX and shrinks the pool

Proved
LittleCharity.EFX.lemma_4_a

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

efxenvy-graphfair-divisionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XXX be an allocation under monotone valuations, let g∈P(X)g\in P(X)g∈P(X) be a pool good and iii an agent such that giving ggg to iii produces an EFX allocation X′X'X′ (Rule U0U_0U0​: Xi′=Xi∪{g}X'_i=X_i\cup\{g\}Xi′​=Xi​∪{g}, Xj′=XjX'_j=X_jXj′​=Xj​ for j≠ij\ne ij=i). Then

X′ is an EFX allocation,ϕ(X′)≥ϕ(X),∣P(X′)∣+1=∣P(X)∣.X'\text{ is an EFX allocation},\qquad \phi(X')\ge\phi(X),\qquad |P(X')|+1=|P(X)|.X′ is an EFX allocation,ϕ(X′)≥ϕ(X),∣P(X′)∣+1=∣P(X)∣.

So an application of U0U_0U0​ never lowers social welfare and shrinks the pool by exactly one good.

Formalization Note "Rule U0U_0U0​ returns an EFX allocation" is the rule's precondition, which the Lean statement takes as a hypothesis and repeats in the conclusion, as the page's proof says ("follows directly from the precondition"). The pool decrease is written ∣P(X′)∣+1=∣P(X)∣|P(X')|+1=|P(X)|∣P(X′)∣+1=∣P(X)∣ to avoid truncated natural-number subtraction.

Preamble
import Mathlib
import Definitions.Def_LittleCharity_EFX_Setting
Formal statement
namespace LittleCharity.EFX

theorem lemma_4_a {n m : ℕ} (v : Fin n → Finset (Fin m) → ℝ)
    (hmono : IsMonotoneVal v) (X : Fin n → Finset (Fin m))
    (hX : IsPartialAllocation X) (g : Fin m) (hg : g ∈ pool X) (i : Fin n)
    (hEFX' : IsEFX v (Function.update X i (insert g (X i)))) :
    let X' := Function.update X i (insert g (X i))
    IsPartialAllocation X' ∧ IsEFX v X' ∧
    welfare v X ≤ welfare v X' ∧
    (pool X').card + 1 = (pool X).card := by sorry
end LittleCharity.EFX
Source
Chaudhury, Kavitha, Mehlhorn & Sgouritsa, A Little Charity Guarantees Almost Envy-Freeness, arXiv:1907.04596v3, pp. 9–10, Algorithm 2 Rule U0 and Lemma 4(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