AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.IsMaxminShare.isAlphaMMS

theoremverifiedformalizationimported Lean

IsMaxminShare implies α-MMS for α ≤ 1 and nonneg MMS values.

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
theorem SocialChoice.FairDivision.Indivisible.IsMaxminShare.isAlphaMMS
    [Nonempty N] [Fintype G]
    (v : Valuation N G) (allGoods : Finset G) (A : Allocation N G)
    (hne : Nonempty {A' : Allocation N G // IsAllocation allGoods A'})
    (hMMS : IsMaxminShare v allGoods A)
    (α : ℝ) (hα_le : α ≤ 1)
    (hmms_nn : ∀ i, 0 ≤ mmsValue v allGoods i) :
    IsAlphaMMS α v allGoods A
Formalizes
EconCSLib, `SocialChoice.FairDivision.Indivisible.IsMaxminShare.isAlphaMMS`
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 8

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
/-- **`IsMaxminShare` implies α-MMS** for `α ≤ 1` and nonneg MMS values. -/
theorem SocialChoice.FairDivision.Indivisible.IsMaxminShare.isAlphaMMS
    [Nonempty N] [Fintype G]
    (v : Valuation N G) (allGoods : Finset G) (A : Allocation N G)
    (hne : Nonempty {A' : Allocation N G // IsAllocation allGoods A'})
    (hMMS : IsMaxminShare v allGoods A)
    (α : ℝ) (hα_le : α ≤ 1)
    (hmms_nn : ∀ i, 0 ≤ mmsValue v allGoods i) :
    IsAlphaMMS α v allGoods A :=
  isAlphaMMS_mono_alpha v allGoods A 1 α hα_le hmms_nn
    ((isMaxminShare_iff_isAlphaMMS_one v allGoods A hne).mp hMMS)
See it in the graphDiscuss this resultChallenge it