AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none listed
Built on 1
Used by 3

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)
See it in the graphDiscuss this resultChallenge it