SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_one
theoremverifiedformalizationimported Lean
Chooser (agent 1) receives the left piece if they prefer it, the right piece otherwise.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in @[simp] lemma SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_one (μ : Fin 2 → Measure I) (t : I) : cutAndChooseAlloc μ t 1 = if μ 1 (Iic t) ≥ μ 1 (Ioi t) then Iic t else Ioi t
- Formalizes
- EconCSLib, `SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_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.cutAndChooseAlloc_one← SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_one (EconCSLib/SocialChoice/FairDivision/Divisible/CutAndChoose.lean:99): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_zeroCutter (agent 0) receives the right piece when the chooser prefers left, and the left piece otherwise.
- SocialChoice.FairDivision.utilitarianWelfare_uniqueFor a unique agent, utilitarian welfare is just that agent's utility.
- 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…
- Used by 4
- SocialChoice.FairDivision.Divisible.cutter_isEnvyFree_of_fairThe cutter (agent 0) does not envy the chooser at a fair cut. If the cut point
tsatisfiesIsFairCutPoint μ t, then agent 0 values… - 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.cutAndChooseAlloc_isAllocationFor any cut point
t, the cut-and-choose allocation is a complete measurable partition of[0,1]into two pieces. This holds regardless… - SocialChoice.FairDivision.Divisible.chooser_isEnvyFreeThe chooser (agent 1) never envies the cutter, regardless of the cut point. Since agent 1 selects whichever piece they value more,…
- SocialChoice.FairDivision.Divisible.cutter_isEnvyFree_of_fairThe cutter (agent 0) does not envy the chooser at a fair cut. If the cut point
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/-- Chooser (agent 1) receives the left piece if they prefer it, the right piece otherwise. -/@[simp]lemma SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_one (μ : Fin 2 → Measure I) (t : I) : cutAndChooseAlloc μ t 1 = if μ 1 (Iic t) ≥ μ 1 (Ioi t) then Iic t else Ioi t := by simp [cutAndChooseAlloc]