AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_zero

theoremverifiedformalizationimported Lean

Cutter (agent 0) receives the right piece when the chooser prefers left, and the left 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_zero (μ : Fin 2 → Measure I) (t : I) :
    cutAndChooseAlloc μ t 0 = if μ 1 (Iic t) ≥ μ 1 (Ioi t) then Ioi t else Iic t
Formalizes
EconCSLib, `SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_zero`
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 2
Used by 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped unitInterval in
/-- Cutter (agent 0) receives the right piece when the chooser prefers left, and the left piece otherwise. -/
@[simp]
lemma SocialChoice.FairDivision.Divisible.cutAndChooseAlloc_zero (μ : Fin 2 → Measure I) (t : I) :
    cutAndChooseAlloc μ t 0 = if μ 1 (Iic t) ≥ μ 1 (Ioi t) then Ioi t else Iic t := rfl
See it in the graphDiscuss this resultChallenge it