SocialChoice.FairDivision.Indivisible.rawBestGood_le
theoremverifiedformalizationimported Lean
Every element of s is no more valuable (to agent i) than rawBestGood.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {n : ℕ} {G : Type*} in lemma SocialChoice.FairDivision.Indivisible.rawBestGood_le (w : AdditiveValuation (Fin n) G) (i : Fin n) (s : Finset G) (hs : s.Nonempty) {g : G} (hg : g ∈ s) : w.weight i g ≤ w.weight i (rawBestGood w i s hs)
- Formalizes
- EconCSLib, `SocialChoice.FairDivision.Indivisible.rawBestGood_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.rawBestGood_le← SocialChoice.FairDivision.Indivisible.rawBestGood_le (EconCSLib/SocialChoice/FairDivision/Indivisible/RoundRobin.lean:108): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- 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.rawBestGood
rawBestGood w i s hsis a good insthat maximisesw.weight iovers. Defined noncomputably viaClassical.chooseon…
- SocialChoice.FairDivision.Indivisible.AdditiveValuationAn additive valuation is determined by per-item weights.
- Used by 1
- SocialChoice.FairDivision.Indivisible.bestGood_leEvery candidate good has no larger weight than
bestGood.
- SocialChoice.FairDivision.Indivisible.bestGood_leEvery candidate good has no larger weight than
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 /-- Every element of `s` is no more valuable (to agent `i`) than `rawBestGood`. -/ lemma SocialChoice.FairDivision.Indivisible.rawBestGood_le (w : AdditiveValuation (Fin n) G) (i : Fin n) (s : Finset G) (hs : s.Nonempty) {g : G} (hg : g ∈ s) : w.weight i g ≤ w.weight i (rawBestGood w i s hs) := (Classical.choose_spec (Finset.exists_max_image s (w.weight i) hs)).2 g hg