Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 5.1 — No five disjoint bundles of value 153153153

Proved
FairShareAlmostAll.Slack.Supplement.no_five_target_bundles

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

anyprice-sharefair-divisionp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

For the thirteen goods with values (137,135,119,79,77,76,54,50,49,10,9,8,6)(137,135,119,79,77,76,54,50,49,10,9,8,6)(137,135,119,79,77,76,54,50,49,10,9,8,6), there are no five pairwise disjoint bundles B1,…,B5⊆GB_1,\dots,B_5\subseteq GB1​,…,B5​⊆G with

v(Bj)≥153(1≤j≤5).v(B_j)\ge153\qquad(1\le j\le5).v(Bj​)≥153(1≤j≤5).

The bundles are arbitrary subsets of GGG, not only bundles of the table, and need not cover GGG. Together with Observation 5.1 this is the obstruction behind Proposition 5.1.

Differences from the source:

  • encoding: five bundles B1,…,B5B_1,\dots,B_5B1​,…,B5​ over goods 1,…,131,\dots,131,…,13 → a family Fin 5 → Finset (Fin 13) that is pairwise disjoint, conclusion "some bundle has value <153<153<153"; reason: the contrapositive of the source's nonexistence, with relabeled goods
Preamble
import Mathlib
import Definitions.Def_AnyPriceShare_Bidding_Basic
import Definitions.Def_FairShareAlmostAll_Slack_FiniteAllocation
import Definitions.Def_FairShareAlmostAll_Slack_Supplement_ThirteenGoods
Formal statement
namespace FairShareAlmostAll.Slack.Supplement

open FairShareAlmostAll.Slack AnyPriceShare.Bidding

theorem no_five_target_bundles (B : Fin 5 → Finset (Fin 13)) (hB : PartialAllocation B) :
    ∃ j, addVal thirteenValue (B j) < 153 := by sorry

end FairShareAlmostAll.Slack.Supplement
Source
Tomer Ezra, Tamar Garbuz, Fair Share Allocations for Almost All Agents, STOC 2027 submission #480 (October 2026), printed pp. 20–21 (PDF pp. 21–22), Claim 5.1 and proof; source.pdf SHA256 c9f47a54f6a9e1568951e8e3845ff79c34d51d391a68fd697d37d8ba29cc7491

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