SocialChoice.FairDivision.Indivisible.rawBestGood
defimported Lean
rawBestGood w i s hs is a good in s that maximises w.weight i over s. Defined noncomputably via Classical.choose on Finset.exists_max_image. Its key properties are rawBestGood_mem (membership) and rawBestGood_le (maximality).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {n : ℕ} {G : Type*} in noncomputable def SocialChoice.FairDivision.Indivisible.rawBestGood (w : AdditiveValuation (Fin n) G) (i : Fin n) (s : Finset G) (hs : s.Nonempty) : G
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Indivisible.rawBestGood`
- 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.rawBestGood← SocialChoice.FairDivision.Indivisible.rawBestGood (EconCSLib/SocialChoice/FairDivision/Indivisible/RoundRobin.lean:95): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- SocialChoice.FairDivision.Indivisible.AdditiveValuationAn additive valuation is determined by per-item weights.
weight i gis the value agentiassigns to goodgindividually. The bundle…
- SocialChoice.FairDivision.Indivisible.AdditiveValuationAn additive valuation is determined by per-item weights.
- Used by 3
- SocialChoice.FairDivision.Indivisible.rawBestGood_mem
rawBestGoodlies in the candidate sets. - SocialChoice.FairDivision.Indivisible.bestGood
bestGood I i s hsis a good insmaximizing agenti's item weight. - SocialChoice.FairDivision.Indivisible.rawBestGood_leEvery element of
sis no more valuable (to agenti) thanrawBestGood.
- SocialChoice.FairDivision.Indivisible.rawBestGood_mem
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 /-- `rawBestGood w i s hs` is a good in `s` that maximises `w.weight i` over `s`. Defined noncomputably via `Classical.choose` on `Finset.exists_max_image`. Its key properties are `rawBestGood_mem` (membership) and `rawBestGood_le` (maximality). -/ noncomputable def SocialChoice.FairDivision.Indivisible.rawBestGood (w : AdditiveValuation (Fin n) G) (i : Fin n) (s : Finset G) (hs : s.Nonempty) : G := Classical.choose (Finset.exists_max_image s (w.weight i) hs)