SocialChoice.FairDivision.Divisible.ds_one
theoremverifiedformalizationimported Lean
Base case: 1 agent receives the whole cake. Proportionality holds trivially on the whole unit interval.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in lemma SocialChoice.FairDivision.Divisible.ds_one : DubinsSpanierProp 1
- Formalizes
- EconCSLib, `SocialChoice.FairDivision.Divisible.ds_one`
- 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.ds_one← SocialChoice.FairDivision.Divisible.ds_one (EconCSLib/SocialChoice/FairDivision/Divisible/DubinsSpanier.lean:231): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 10
- SocialChoice.FairDivision.Divisible.CakeValuationAn abstract cake valuation assigns a value in
Vto each agent-piece pair. - 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.DubinsSpanierPropThe inductive predicate for the Dubins–Spanier algorithm: for n agents indexed by
Fin n, a complete proportional allocation exists. - SocialChoice.FairDivision.Divisible.AllocationA divisible allocation assigns each agent
i : Na piece (a measurable subset) of the cakeΩ.
- SocialChoice.FairDivision.Divisible.CakeValuationAn abstract cake valuation assigns a value in
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen MeasureTheory Set inopen scoped unitInterval in/-- Base case: 1 agent receives the whole cake. Proportionality holds trivially on the whole unit interval. -/lemma SocialChoice.FairDivision.Divisible.ds_one : DubinsSpanierProp 1 := by intro μ _ _ refine ⟨fun _ => Set.univ, ⟨fun i => ?_, fun i j hij => ?_, ?_⟩, fun i => ?_⟩ · -- measurability fin_cases i; exact MeasurableSet.univ · -- disjointness (fin_cases i; fin_cases j; exact absurd rfl hij) · -- cover simp [Set.iUnion_const] · -- proportionality: μ 0 univ ≤ 1 * μ 0 univ fin_cases i; simp [MeasureValuation]