Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 — three agents with weighted-coverage valuations over eight goods admit no EFX allocation

Proved
EFXCounterex.Submodular.theorem_1_1

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

counterexampleefxfair-divisionp2o-gran-per-chapterp2o-plan-paperp2o-v1weighted-coverage

There is a valuation profile www for three agents and eight goods in which every wiw_iwi​ is a weighted-coverage valuation (finitely many features, nonnegative weights, a bundle worth the total weight of the features its goods cover) and no allocation (pairwise disjoint bundles covering all eight goods) is EFX for www. The paper proves it as the proof of Theorem 1.3 (p. 15) at n=3n=3n=3, m=8m=8m=8: Theorem 3.4, then the strictification of §3.2.2, then Lemma 3.7 (Lemma 3.5 is not needed).

Differences from the source:

  • encoding: an allocation is a tuple of pairwise disjoint bundles whose union is M (empty bundles allowed, no unallocated goods) → X : Fin n → Finset (Fin m) with IsAllocation X := LittleCharity.EFX.IsPartialAllocation X ∧ LittleCharity.EFX.pool X = ∅; reason: pairwise disjoint plus empty pool (no unallocated good) is exactly 'union is M'
  • encoding: "a fair division instance with three agents and eight goods in which all agents have weighted coverage valuations" → w : Fin 3 → Finset (Fin 8) → ℝ with IsWeightedCoverage (w i) for every i (features Fin k); reason: weighted-coverage values are nonnegative sums, so ℝ-valued is the same; any finite feature set is some Fin k
Preamble
import Mathlib
import Definitions.Def_LittleCharity_EFX_Setting
import Definitions.Def_EFXCounterex_Submodular_Setting
Formal statement
namespace EFXCounterex.Submodular

/-- Theorem 1.1 (p. 2). There is a fair-division instance with three agents and eight goods in
which every agent has a weighted-coverage valuation and no (complete) allocation is EFX. -/
theorem theorem_1_1 :
    ∃ w : Fin 3 → Finset (Fin 8) → ℝ,
      (∀ i, IsWeightedCoverage (w i)) ∧
      ∀ X : Fin 3 → Finset (Fin 8), IsAllocation X → ¬ LittleCharity.EFX.IsEFX w X := by sorry

end EFXCounterex.Submodular
Source
Akrami, Mackenzie, Mayorov, Mehlhorn, Srinivas, Suzuki, Weidenbach 2026, Counterexamples to EFX for Submodular and Subadditive Valuations, arXiv:2605.06451 (supplied manuscript, sha256 700243a1…), Theorem 1.1, p. 2 (proof: proof of Theorem 1.3, p. 15)
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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