SocialChoice.FairDivision.Divisible.IsAllocation
structureimported Lean
A complete divisible allocation is a measurable partition of the cake.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in structure SocialChoice.FairDivision.Divisible.IsAllocation {N Ω : Type*} [MeasurableSpace Ω] [Fintype N] (A : Allocation N Ω) : Prop
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Divisible.IsAllocation`
- 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.IsAllocation← SocialChoice.FairDivision.Divisible.IsAllocation (EconCSLib/SocialChoice/FairDivision/Divisible/Allocation.lean:30): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- SocialChoice.FairDivision.Divisible.AllocationA divisible allocation assigns each agent
i : Na piece (a measurable subset) of the cakeΩ.
- SocialChoice.FairDivision.Divisible.AllocationA divisible allocation assigns each agent
- Used by 10
- SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_isAllocationFor any cut point
t, the cut-and-choose allocation is a complete measurable partition of[0,1]into two pieces. This holds regardless… - SocialChoice.FairDivision.Divisible.CardinalInstance.toGenericCardinalInstanceView a divisible cardinal instance as a generic real-valued cardinal fair-division instance. The resource is the whole cake
Set.univ. - SocialChoice.FairDivision.Divisible.Instance.feasibleFeasibility for a divisible instance: an allocation is a measurable partition of the cake.
- SocialChoice.FairDivision.Divisible.CardinalInstance.feasibleFeasibility for a cardinal divisible instance.
- SocialChoice.FairDivision.Divisible.MeasureInstance.IsEnvyFree.isProportionalEnvy-freeness implies proportionality for complete measure-based divisible allocations.
- SocialChoice.FairDivision.Divisible.ds_oneBase case: 1 agent receives the whole cake. Proportionality holds trivially on the whole unit interval.
- SocialChoice.FairDivision.Divisible.MeasureInstance.feasibleFeasibility for a measure-based divisible instance. Like the ordinal and cardinal divisible cases, this depends only on the ambient cake:…
- SocialChoice.FairDivision.Divisible.DubinsSpanierPropThe inductive predicate for the Dubins–Spanier algorithm: for n agents indexed by
Fin n, a complete proportional allocation exists. - SocialChoice.FairDivision.Divisible.IsEnvyFree.isProportionalEF implies proportional for
MeasureValuationpartitions. - SocialChoice.FairDivision.Divisible.Instance.toShareInstanceView a divisible ordinal instance as a generic no-externality fair-division share instance. The resource is the whole cake
Set.univ.
- SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_isAllocationFor any cut point
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in /-- A complete divisible allocation is a measurable partition of the cake. -/ structure SocialChoice.FairDivision.Divisible.IsAllocation {N Ω : Type*} [MeasurableSpace Ω] [Fintype N] (A : Allocation N Ω) : Prop where /-- Each piece is a measurable set. -/ measurable : ∀ i : N, MeasurableSet (A i) /-- Distinct agents receive disjoint pieces. -/ disjoint : ∀ i j : N, i ≠ j → Disjoint (A i) (A j) /-- Every point of the cake belongs to some agent's piece. -/ cover : ⋃ i : N, A i = Set.univ