AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 10
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 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
See it in the graphDiscuss this resultChallenge it