AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Divisible.chooser_isEnvyFree

theoremverifiedformalizationimported Lean

The chooser (agent 1) never envies the cutter, regardless of the cut point. Since agent 1 selects whichever piece they value more, their own piece is always at least as valuable as the cutter's piece. No fairness condition on the cut is needed. This is the key asymmetry of cut-and-choose: the chooser's guarantee is unconditional; only the cutter's guarantee depends on the cut being fair.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped unitInterval in
theorem SocialChoice.FairDivision.Divisible.chooser_isEnvyFree (μ : Fin 2 → Measure I) (t : I) :
    (MeasureValuation μ).val 1 (cutAndChooseAlloc μ t 0) ≤
    (MeasureValuation μ).val 1 (cutAndChooseAlloc μ t 1)
Formalizes
EconCSLib, `SocialChoice.FairDivision.Divisible.chooser_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 9
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen MeasureTheory Set inopen scoped unitInterval in/-- **The chooser (agent 1) never envies the cutter**, regardless of the cut point. Since agent 1 selects whichever piece they value more, their own piece is always at least as valuable as the cutter's piece. No fairness condition on the cut is needed. This is the key asymmetry of cut-and-choose: the chooser's guarantee is unconditional; only the cutter's guarantee depends on the cut being fair. -/theorem SocialChoice.FairDivision.Divisible.chooser_isEnvyFree (μ : Fin 2 → Measure I) (t : I) :    (MeasureValuation μ).val 1 (cutAndChooseAlloc μ t 0) ≤    (MeasureValuation μ).val 1 (cutAndChooseAlloc μ t 1) := by  -- Reduce to μ 1 (if ...) ≤ μ 1 (if ...) via definitional equality  show μ 1 (if μ 1 (Iic t) ≥ μ 1 (Ioi t) then Ioi t else Iic t) ≤       μ 1 (if μ 1 (Iic t) ≥ μ 1 (Ioi t) then Iic t else Ioi t)  split_ifs with h  · exact h  · push_neg at h; exact le_of_lt h
See it in the graphDiscuss this resultChallenge it