SocialChoice.FairDivision.CardinalInstance.inducedSharePref
defimported Lean
The share preference induced by a cardinal utility, using the convention that higher utility means weakly better.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in def SocialChoice.FairDivision.CardinalInstance.inducedSharePref {N R S : Type*} (I : CardinalInstance N R S) : N → Pref S
- Defined in
- EconCSLib, `SocialChoice.FairDivision.CardinalInstance.inducedSharePref`
- 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.CardinalInstance.inducedSharePref← SocialChoice.FairDivision.CardinalInstance.inducedSharePref (EconCSLib/SocialChoice/FairDivision/Cardinal.lean:37): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- SocialChoice.FairDivision.CardinalInstanceA real-valued cardinal fair-division instance in the standard no-externality model.
- IsPreferenceA weak preference relation is admissible if it is reflexive, transitive, and total.
- instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
- PrefA bundled weak preference relation. Use this interface when several agents may rank the same outcome type differently. Use…
- Used by 1
- SocialChoice.FairDivision.CardinalInstance.toShareInstanceConvert a cardinal instance to the induced ordinal no-externality instance.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- The share preference induced by a cardinal utility, using the convention that higher utility means weakly better. -/ def SocialChoice.FairDivision.CardinalInstance.inducedSharePref {N R S : Type*} (I : CardinalInstance N R S) : N → Pref S := fun i => { rel := fun s t => I.utility i t ≤ I.utility i s prop := { reflexive := fun s => le_rfl transitive := fun _ _ _ hst htu => le_trans htu hst total := fun s t => by rcases le_total (I.utility i s) (I.utility i t) with h | h · exact Or.inr h · exact Or.inl h } }