AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.mmsValue_nonneg

theoremverifiedformalizationimported Lean

For nonneg valuations with at least one complete allocation, the MMS value is nonneg. hne ensures the iSup is nonempty. [Fintype G] makes the allocation subtype [Finite], enabling Finite.le_ciSup without a separate BddAbove hypothesis.

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.mmsValue_nonneg [Fintype G]
    (v : Valuation N G) (allGoods : Finset G) (i : N)
    (hne : Nonempty {A : Allocation N G // IsAllocation allGoods A})
    (hnonneg : ∀ S : Finset G, 0 ≤ v.val i S) :
    0 ≤ mmsValue v allGoods i
Formalizes
EconCSLib, `SocialChoice.FairDivision.Indivisible.mmsValue_nonneg`
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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset invariable {N G : Type*} invariable [Fintype N] [DecidableEq G] in/-- For nonneg valuations with at least one complete allocation, the MMS value is nonneg. `hne` ensures the `iSup` is nonempty. `[Fintype G]` makes the allocation subtype `[Finite]`, enabling `Finite.le_ciSup` without a separate `BddAbove` hypothesis. -/lemma SocialChoice.FairDivision.Indivisible.mmsValue_nonneg [Fintype G]    (v : Valuation N G) (allGoods : Finset G) (i : N)    (hne : Nonempty {A : Allocation N G // IsAllocation allGoods A})    (hnonneg : ∀ S : Finset G, 0 ≤ v.val i S) :    0 ≤ mmsValue v allGoods i := by  haveI : Nonempty N := ⟨i⟩  haveI : Fintype (Finset G) := Finset.fintype  haveI : DecidableEq N := Classical.typeDecidableEq N  haveI : Fintype (Allocation N G) :=    @Pi.instFintype N (fun _ => Finset G) _ _ (fun _ => inferInstance)  haveI : DecidablePred (fun A' : Allocation N G => IsAllocation allGoods A') :=    Classical.decPred _  haveI : Finite {A : Allocation N G // IsAllocation allGoods A} := inferInstance  obtain ⟨⟨B, hB⟩⟩ := hne  calc 0 ≤ iInf (fun j : N => v.val i (B j)) :=        le_ciInf (fun j => hnonneg (B j))    _ ≤ mmsValue v allGoods i :=        Finite.le_ciSup (fun B' : {A : Allocation N G // IsAllocation allGoods A} =>          iInf fun j : N => v.val i (B'.val j)) ⟨B, hB⟩
See it in the graphDiscuss this resultChallenge it