AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Divisible.cutAndChoose_isEnvyFree

theoremverifiedformalizationimported Lean

Both agents are envy-free at any fair cut point. This combines chooser_isEnvyFree (unconditional) and cutter_isEnvyFree_of_fair (requires fair cut) to give the full IsEnvyFree predicate for both agents.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped unitInterval in
theorem SocialChoice.FairDivision.Divisible.cutAndChoose_isEnvyFree (μ : Fin 2 → Measure I) (t : I)
    (hfair : IsFairCutPoint μ t) :
    IsEnvyFree (MeasureValuation μ) (cutAndChooseAlloc μ t)
Formalizes
EconCSLib, `SocialChoice.FairDivision.Divisible.cutAndChoose_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 13

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen MeasureTheory Set inopen scoped unitInterval in/-- **Both agents are envy-free** at any fair cut point. This combines `chooser_isEnvyFree` (unconditional) and `cutter_isEnvyFree_of_fair` (requires fair cut) to give the full `IsEnvyFree` predicate for both agents. -/theorem SocialChoice.FairDivision.Divisible.cutAndChoose_isEnvyFree (μ : Fin 2 → Measure I) (t : I)    (hfair : IsFairCutPoint μ t) :    IsEnvyFree (MeasureValuation μ) (cutAndChooseAlloc μ t) := by  intro i j  fin_cases i <;> fin_cases j  · exact le_refl _  · exact cutter_isEnvyFree_of_fair μ t hfair  · exact chooser_isEnvyFree μ t  · exact le_refl _
See it in the graphDiscuss this resultChallenge it