SocialChoice.FairDivision.Divisible.cutter_isEnvyFree_of_fair
theoremverifiedformalizationimported Lean
The cutter (agent 0) does not envy the chooser at a fair cut. If the cut point t satisfies IsFairCutPoint μ t, then agent 0 values both halves equally. Regardless of which half the chooser takes, the cutter is indifferent.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in theorem SocialChoice.FairDivision.Divisible.cutter_isEnvyFree_of_fair (μ : Fin 2 → Measure I) (t : I) (hfair : IsFairCutPoint μ t) : (MeasureValuation μ).val 0 (cutAndChooseAlloc μ t 1) ≤ (MeasureValuation μ).val 0 (cutAndChooseAlloc μ t 0)
- Formalizes
- EconCSLib, `SocialChoice.FairDivision.Divisible.cutter_isEnvyFree_of_fair`
- 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.cutter_isEnvyFree_of_fair← SocialChoice.FairDivision.Divisible.cutter_isEnvyFree_of_fair (EconCSLib/SocialChoice/FairDivision/Divisible/CutAndChoose.lean:175): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 10
- SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_zeroCutter (agent 0) receives the right piece when the chooser prefers left, and the left piece otherwise.
- 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Ω. - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - SocialChoice.FairDivision.utilitarianWelfare_uniqueFor a unique agent, utilitarian welfare is just that agent's utility.
- SocialChoice.FairDivision.Divisible.IsFairCutPointA cut point
tis fair (for the cutter, agent 0) if agent 0's measure is split equally:μ 0 [0, t] = μ 0 (t, 1]. At a fair cut the… - SocialChoice.FairDivision.Divisible.cutAndChooseAllocThe cut-and-choose allocation at cut point
t ∈ [0,1]. The chooser (agent 1) receives the half they value more: - If… - SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_oneChooser (agent 1) receives the left piece if they prefer it, the right piece otherwise.
- Used by 1
- 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.cutAndChoose_isEnvyFreeBoth agents are envy-free at any fair cut point. This combines
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/-- **The cutter (agent 0) does not envy the chooser** at a fair cut. If the cut point `t` satisfies `IsFairCutPoint μ t`, then agent 0 values both halves equally. Regardless of which half the chooser takes, the cutter is indifferent. -/theorem SocialChoice.FairDivision.Divisible.cutter_isEnvyFree_of_fair (μ : Fin 2 → Measure I) (t : I) (hfair : IsFairCutPoint μ t) : (MeasureValuation μ).val 0 (cutAndChooseAlloc μ t 1) ≤ (MeasureValuation μ).val 0 (cutAndChooseAlloc μ t 0) := by show μ 0 (if μ 1 (Iic t) ≥ μ 1 (Ioi t) then Iic t else Ioi t) ≤ μ 0 (if μ 1 (Iic t) ≥ μ 1 (Ioi t) then Ioi t else Iic t) split_ifs with h · -- chooser gets Iic, cutter gets Ioi; need μ 0 (Iic t) ≤ μ 0 (Ioi t) exact le_of_eq hfair · -- chooser gets Ioi, cutter gets Iic; need μ 0 (Ioi t) ≤ μ 0 (Iic t) exact le_of_eq hfair.symm