SocialChoice.FairDivision.Indivisible.bestGood_le
theoremverifiedformalizationimported Lean
Every candidate good has no larger weight than bestGood.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {n : ℕ} {G : Type*} in variable [NeZero n] in omit [NeZero n] in lemma SocialChoice.FairDivision.Indivisible.bestGood_le [DecidableEq G] (I : AdditiveInstance (Fin n) G) (i : Fin n) (s : Finset G) (hs : s.Nonempty) {g : G} (hg : g ∈ s) : I.weight i g ≤ I.weight i (bestGood I i s hs)
- Formalizes
- EconCSLib, `SocialChoice.FairDivision.Indivisible.bestGood_le`
- 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.bestGood_le← SocialChoice.FairDivision.Indivisible.bestGood_le (EconCSLib/SocialChoice/FairDivision/Indivisible/RoundRobin.lean:710): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- SocialChoice.FairDivision.Indivisible.bestGood
bestGood I i s hsis a good insmaximizing agenti's item weight. - SocialChoice.FairDivision.Indivisible.AdditiveInstance.toAdditiveValuationThe raw additive valuation induced by additive per-item weights.
- SocialChoice.FairDivision.Indivisible.rawBestGood_leEvery element of
sis no more valuable (to agenti) thanrawBestGood. - SocialChoice.FairDivision.Indivisible.AdditiveInstanceAn additive indivisible-goods instance, represented by per-item weights.
- SocialChoice.FairDivision.Indivisible.bestGood
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {n : ℕ} {G : Type*} in variable [NeZero n] in omit [NeZero n] in /-- Every candidate good has no larger weight than `bestGood`. -/ lemma SocialChoice.FairDivision.Indivisible.bestGood_le [DecidableEq G] (I : AdditiveInstance (Fin n) G) (i : Fin n) (s : Finset G) (hs : s.Nonempty) {g : G} (hg : g ∈ s) : I.weight i g ≤ I.weight i (bestGood I i s hs) := rawBestGood_le I.toAdditiveValuation i s hs hg