SocialChoice.FairDivision.Divisible.IsEnvyFree
defimported Lean
Envy-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 with non-atomic measures, EF allocations always exist. This is the key difference from the indivisible setting where EF need not exist.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in def SocialChoice.FairDivision.Divisible.IsEnvyFree {N Ω V : Type*} [Preorder V] (μ : CakeValuation N Ω V) (A : Allocation N Ω) : Prop
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Divisible.IsEnvyFree`
- 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← SocialChoice.FairDivision.Divisible.IsEnvyFree (EconCSLib/SocialChoice/FairDivision/Divisible/Basic.lean:68): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- SocialChoice.FairDivision.Divisible.CakeValuationAn abstract cake valuation assigns a value in
Vto each agent-piece pair. - 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
- Used by 3
- SocialChoice.FairDivision.Divisible.cutAndChoose_isEnvyFreeBoth agents are envy-free at any fair cut point. This combines
chooser_isEnvyFree(unconditional) andcutter_isEnvyFree_of_fair… - SocialChoice.FairDivision.Divisible.IsEnvyFree.isProportionalEF implies proportional for
MeasureValuationpartitions. - SocialChoice.FairDivision.Divisible.MeasureInstance.IsEnvyFreeEnvy-freeness for a measure-based divisible instance, stated in
ENNReal.
- SocialChoice.FairDivision.Divisible.cutAndChoose_isEnvyFreeBoth agents are envy-free at any fair cut point. This combines
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in /-- Envy-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 with non-atomic measures, EF allocations always exist. This is the key difference from the indivisible setting where EF need not exist. -/ def SocialChoice.FairDivision.Divisible.IsEnvyFree {N Ω V : Type*} [Preorder V] (μ : CakeValuation N Ω V) (A : Allocation N Ω) : Prop := ∀ i j : N, μ.val i (A j) ≤ μ.val i (A i)