Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 — Rule U1 increases welfare and preserves EFX

Proved
LittleCharity.EFX.lemma_5

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 EFX allocation under monotone valuations, and suppose some agent kkk values the pool above her own bundle, vk(P)>vk(Xk)v_k(P)>v_k(X_k)vk​(P)>vk​(Xk​) (Rule U1U_1U1​'s precondition). Let ZZZ be an inclusion-wise minimal envied subset of P=P(X)P=P(X)P=P(X) and iii an agent with vi(Z)>vi(Xi)v_i(Z)>v_i(X_i)vi​(Z)>vi​(Xi​). Let X′X'X′ be obtained by setting Xi′=ZX'_i=ZXi′​=Z and Xj′=XjX'_j=X_jXj′​=Xj​ for j≠ij\ne ij=i. Then X′X'X′ is an allocation, it is EFX, welfare strictly increases, and the new pool is the one of Algorithm 2, line 8:

ϕ(X′)>ϕ(X),P(X′)=Xi∪(P∖Z).\phi(X')>\phi(X),\qquad P(X')=X_i\cup\bigl(P\setminus Z\bigr).ϕ(X′)>ϕ(X),P(X′)=Xi​∪(P∖Z).

Rule U1U_1U1​ is thus a strict welfare step whenever the pool itself is envied.

Formalization Note The EFX hypothesis on XXX is Algorithm 1's invariant. "The most envious agent of PPP" is encoded by taking any minimal envied subset ZZZ of the pool and any agent who envies it, as Definition 3 and line 6 specify.

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

theorem lemma_5 {n m : ℕ} (v : Fin n → Finset (Fin m) → ℝ)
    (hmono : IsMonotoneVal v) (X : Fin n → Finset (Fin m))
    (hX : IsPartialAllocation X) (hEFX : IsEFX v X)
    (hU1 : ∃ k, v k (X k) < v k (pool X))
    (i : Fin n) (Z : Finset (Fin m))
    (hZ : IsMinimalEnviedSubset v X (pool X) Z)
    (hi : v i (X i) < v i Z) :
    let X' := Function.update X i Z
    IsPartialAllocation X' ∧ IsEFX v X' ∧
    welfare v X < welfare v X' ∧
    pool X' = X i ∪ (pool X \ Z) := by sorry
end LittleCharity.EFX
Source
Chaudhury, Kavitha, Mehlhorn & Sgouritsa, A Little Charity Guarantees Almost Envy-Freeness, arXiv:1907.04596v3, p. 10, Algorithm 2 Rule U1 and Lemma 5
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