SocialChoice.FairDivision.Divisible.DubinsSpanierProp
defimported Lean
The inductive predicate for the Dubins–Spanier algorithm: for n agents indexed by Fin n, a complete proportional allocation exists.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in noncomputable def SocialChoice.FairDivision.Divisible.DubinsSpanierProp (n : ℕ) : Prop
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Divisible.DubinsSpanierProp`
- 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.DubinsSpanierProp← SocialChoice.FairDivision.Divisible.DubinsSpanierProp (EconCSLib/SocialChoice/FairDivision/Divisible/DubinsSpanier.lean:222): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 8
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - SocialChoice.FairDivision.Divisible.MeasureValuation.val_emptyThe value of the empty piece is zero.
- SocialChoice.FairDivision.Divisible.MeasureValuationA measure-based cake valuation: each agent's value for a piece is given by their personal measure
μ ion the cakeΩ. - SocialChoice.FairDivision.Divisible.IsAllocationA complete divisible allocation is a measurable partition of the cake.
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - SocialChoice.FairDivision.Divisible.IsProportionalProportional (PROP): each agent values their piece at least
1 / nof the whole cake. Stated asμ_i(Ω) ≤ n * μ_i(A_i)to avoid division. - SocialChoice.FairDivision.utilitarianWelfare_uniqueFor a unique agent, utilitarian welfare is just that agent's utility.
- SocialChoice.FairDivision.Divisible.AllocationA divisible allocation assigns each agent
i : Na piece (a measurable subset) of the cakeΩ.
- TotalPreorderA total preorder: a preorder where
- Used by 1
- SocialChoice.FairDivision.Divisible.ds_oneBase case: 1 agent receives the whole cake. Proportionality holds trivially on the whole unit interval.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in /-- The inductive predicate for the Dubins–Spanier algorithm: for n agents indexed by `Fin n`, a complete proportional allocation exists. -/ noncomputable def SocialChoice.FairDivision.Divisible.DubinsSpanierProp (n : ℕ) : Prop := ∀ (μ : Fin n → Measure I), (∀ i, IsFiniteMeasure (μ i)) → (∀ i, NoAtoms (μ i)) → ∃ A : Allocation (Fin n) I, IsAllocation A ∧ IsProportional n (MeasureValuation μ) A