SocialChoice.FairDivision.Divisible.Instance.toShareInstance
defimported Lean
View a divisible ordinal instance as a generic no-externality fair-division share instance. The resource is the whole cake Set.univ.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in def SocialChoice.FairDivision.Divisible.Instance.toShareInstance {N Ω : Type*} [MeasurableSpace Ω] [Fintype N] (I : Instance N Ω) : SocialChoice.FairDivision.ShareInstance N (Set Ω) (Set Ω)
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Divisible.Instance.toShareInstance`
- 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.Divisible.Instance.toShareInstance← SocialChoice.FairDivision.Divisible.Instance.toShareInstance (EconCSLib/SocialChoice/FairDivision/Divisible/Instance.lean:45): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- SocialChoice.FairDivision.ShareInstanceA no-externality fair-division instance where each agent ranks only the share they personally receive.
- SocialChoice.FairDivision.Divisible.IsAllocationA complete divisible allocation is a measurable partition of the cake.
- SocialChoice.FairDivision.AllocationA fair-division allocation assigns each agent a share.
- SocialChoice.FairDivision.Divisible.InstanceAn ordinal divisible-goods instance. The cake is represented by the ambient measurable space
Ω, and shares are subsets ofΩ. - SocialChoice.FairDivision.utilitarianWelfare_uniqueFor a unique agent, utilitarian welfare is just that agent's utility.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in /-- View a divisible ordinal instance as a generic no-externality fair-division share instance. The resource is the whole cake `Set.univ`. -/ def SocialChoice.FairDivision.Divisible.Instance.toShareInstance {N Ω : Type*} [MeasurableSpace Ω] [Fintype N] (I : Instance N Ω) : SocialChoice.FairDivision.ShareInstance N (Set Ω) (Set Ω) where resource := Set.univ feasible := fun A => IsAllocation A sharePref := I.sharePref