SocialChoice.FairDivision.Divisible.IsEnvyFree.isProportional
theoremverifiedformalizationimported Lean
EF implies proportional for MeasureValuation partitions.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in theorem SocialChoice.FairDivision.Divisible.IsEnvyFree.isProportional {N Ω : Type*} [MeasurableSpace Ω] [Fintype N] (μ : N → Measure Ω) (A : Allocation N Ω) (ha : IsAllocation A) (hef : IsEnvyFree (MeasureValuation μ) A) : IsProportional (Fintype.card N) (MeasureValuation μ) A
- Formalizes
- EconCSLib, `SocialChoice.FairDivision.Divisible.IsEnvyFree.isProportional`
- 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.IsEnvyFree.isProportional← SocialChoice.FairDivision.Divisible.IsEnvyFree.isProportional (EconCSLib/SocialChoice/FairDivision/Divisible/Basic.lean:87): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- 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.IsEnvyFreeEnvy-free (EF): every agent weakly prefers their own piece over any other agent's piece.
∀ i j, μ_i(A_j) ≤ μ_i(A_i). For divisible goods… - 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.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.MeasureInstance.IsEnvyFree.isProportionalEnvy-freeness implies proportionality for complete measure-based divisible allocations.
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 in/-- **EF implies proportional** for `MeasureValuation` partitions. -/theorem SocialChoice.FairDivision.Divisible.IsEnvyFree.isProportional {N Ω : Type*} [MeasurableSpace Ω] [Fintype N] (μ : N → Measure Ω) (A : Allocation N Ω) (ha : IsAllocation A) (hef : IsEnvyFree (MeasureValuation μ) A) : IsProportional (Fintype.card N) (MeasureValuation μ) A := by intro i calc μ i Set.univ = μ i (⋃ j, A j) := by rw [ha.cover] _ = ∑' j, μ i (A j) := measure_iUnion (fun ⦃j k⦄ hjk => ha.disjoint j k hjk) ha.measurable _ = ∑ j : N, μ i (A j) := tsum_fintype _ _ ≤ ∑ j : N, μ i (A i) := Finset.sum_le_sum fun j _ => hef i j _ = Fintype.card N * μ i (A i) := by simp [Finset.sum_const, Finset.card_univ, nsmul_eq_mul]