Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — eliminating an envy cycle preserves EFX and raises welfare

Proved
LittleCharity.EFX.lemma_2

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 and let i0→i1→⋯→ik−1→i0i_0\to i_1\to\cdots\to i_{k-1}\to i_0i0​→i1​→⋯→ik−1​→i0​ be a cycle of distinct agents in the envy graph GXG_XGX​, i.e. viℓ(Xiℓ)<viℓ(Xiℓ+1)v_{i_\ell}(X_{i_\ell})<v_{i_\ell}(X_{i_{\ell+1}})viℓ​​(Xiℓ​​)<viℓ​​(Xiℓ+1​​) for every ℓ\ellℓ (indices modulo kkk). Let X′X'X′ be the allocation with Xiℓ′=Xiℓ+1X'_{i_\ell}=X_{i_{\ell+1}}Xiℓ​′​=Xiℓ+1​​ for ℓ∈{0,…,k−1}\ell\in\{0,\dots,k-1\}ℓ∈{0,…,k−1} and Xj′=XjX'_j=X_jXj′​=Xj​ for agents jjj off the cycle. Then

  1. X′X'X′ is again an allocation (pairwise disjoint bundles) with the same pool, P(X′)=P(X)P(X')=P(X)P(X′)=P(X);
  2. if XXX is EFX, then X′X'X′ is EFX;
  3. the social welfare strictly increases:
ϕ(X′)>ϕ(X).\phi(X')>\phi(X).ϕ(X′)>ϕ(X).

This decycling step lets the algorithm keep the envy graph acyclic while preserving EFX and making strict progress in welfare.

Formalization Note The cycle is a nonempty duplicate-free list ccc of agents, and the edge condition says each agent of ccc envies her successor under Mathlib's cyclic permutation List.formPerm c; then X′=X∘X'=X\circX′=X∘formPerm c\,cc. Item 1 is the well-formedness Algorithm 1 relies on and is added to the page's statement; it needs the input to be an allocation, which the page presupposes.

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

theorem lemma_2 {n m : ℕ} (v : Fin n → Finset (Fin m) → ℝ)
    (X : Fin n → Finset (Fin m)) (hX : IsPartialAllocation X)
    (c : List (Fin n)) (hc : c.Nodup) (hne : c ≠ [])
    (hcycle : ∀ a ∈ c, Envies v X a (c.formPerm a)) :
    IsPartialAllocation (X ∘ c.formPerm) ∧
    pool (X ∘ c.formPerm) = pool X ∧
    (IsEFX v X → IsEFX v (X ∘ c.formPerm)) ∧
    welfare v X < welfare v (X ∘ c.formPerm) := by sorry
end LittleCharity.EFX
Source
Chaudhury, Kavitha, Mehlhorn & Sgouritsa, A Little Charity Guarantees Almost Envy-Freeness, arXiv:1907.04596v3, p. 8, Lemma 2
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