SocialChoice.FairDivision.Indivisible.iInf_partition_le_mmsValue
theoremverifiedformalizationimported Lean
The min-bundle value of any complete allocation is at most the MMS value. For any complete allocation B: iInf_{j : N} v_i(B_j) ≤ mmsValue v allGoods i. Requires BddAbove of the range of all per-allocation minimums, which holds when [Fintype G] (finitely many partitions). [Budish 2011]
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N G : Type*} in variable [Fintype N] [DecidableEq G] in lemma SocialChoice.FairDivision.Indivisible.iInf_partition_le_mmsValue (v : Valuation N G) (allGoods : Finset G) (i : N) (B : Allocation N G) (hB : IsAllocation allGoods B) (hbdd : BddAbove (Set.range fun X : {A : Allocation N G // IsAllocation allGoods A} => iInf fun j : N => v.val i (X.val j))) : iInf (fun j : N => v.val i (B j)) ≤ mmsValue v allGoods i
- Formalizes
- EconCSLib, `SocialChoice.FairDivision.Indivisible.iInf_partition_le_mmsValue`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.SocialChoice.FairDivision.Indivisible.iInf_partition_le_mmsValue← SocialChoice.FairDivision.Indivisible.iInf_partition_le_mmsValue (EconCSLib/SocialChoice/FairDivision/Indivisible/MMS.lean:140): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- SocialChoice.FairDivision.Indivisible.AllocationAn allocation assigns each agent
i : Na bundle (a finite subset of goodsG). This is a plain function type alias. The partition… - SocialChoice.FairDivision.Indivisible.IsAllocationA complete allocation partitions all goods among agents. *
disjoint: distinct agents receive disjoint bundles. *complete: every good… - SocialChoice.FairDivision.Indivisible.ValuationAn abstract valuation assigns a real value to each agent-bundle pair.
val i Sis the value agentiassigns to bundleS. Lives in… - SocialChoice.FairDivision.Indivisible.mmsValueThe maximin share (MMS) value of agent
iwith respect to valuationvand good setallGoods.…
- SocialChoice.FairDivision.Indivisible.AllocationAn allocation assigns each agent
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N G : Type*} in variable [Fintype N] [DecidableEq G] in /-- The min-bundle value of any complete allocation is at most the MMS value. For any complete allocation `B`: `iInf_{j : N} v_i(B_j) ≤ mmsValue v allGoods i`. Requires `BddAbove` of the range of all per-allocation minimums, which holds when `[Fintype G]` (finitely many partitions). [Budish 2011] -/ lemma SocialChoice.FairDivision.Indivisible.iInf_partition_le_mmsValue (v : Valuation N G) (allGoods : Finset G) (i : N) (B : Allocation N G) (hB : IsAllocation allGoods B) (hbdd : BddAbove (Set.range fun X : {A : Allocation N G // IsAllocation allGoods A} => iInf fun j : N => v.val i (X.val j))) : iInf (fun j : N => v.val i (B j)) ≤ mmsValue v allGoods i := le_ciSup hbdd ⟨B, hB⟩