SocialChoice.FairDivision.Divisible.IsFairCutPoint
defimported Lean
A cut point t is 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 cutter is indifferent between the two halves, so they cannot envy whichever piece the chooser selects.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in noncomputable def SocialChoice.FairDivision.Divisible.IsFairCutPoint (μ : Fin 2 → Measure I) (t : I) : Prop
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Divisible.IsFairCutPoint`
- 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.IsFairCutPoint← SocialChoice.FairDivision.Divisible.IsFairCutPoint (EconCSLib/SocialChoice/FairDivision/Divisible/CutAndChoose.lean:86): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- SocialChoice.FairDivision.utilitarianWelfare_uniqueFor a unique agent, utilitarian welfare is just that agent's utility.
- Used by 2
- 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.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
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped unitInterval in /-- A cut point `t` is **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 cutter is indifferent between the two halves, so they cannot envy whichever piece the chooser selects. -/ noncomputable def SocialChoice.FairDivision.Divisible.IsFairCutPoint (μ : Fin 2 → Measure I) (t : I) : Prop := μ 0 (Iic t) = μ 0 (Ioi t)