AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Divisible.MeasureInstance.feasible

defimported Lean

Feasibility for a measure-based divisible instance. Like the ordinal and cardinal divisible cases, this depends only on the ambient cake: a feasible allocation is a measurable partition of Set.univ.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
def SocialChoice.FairDivision.Divisible.MeasureInstance.feasible {N Ω : Type*} [MeasurableSpace Ω] [Fintype N]
    (_I : MeasureInstance N Ω) (A : Allocation N Ω) : Prop
Defined in
EconCSLib, `SocialChoice.FairDivision.Divisible.MeasureInstance.feasible`
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
none listed
Built on 4

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
/-- Feasibility for a measure-based divisible instance. Like the ordinal and cardinal divisible cases, this depends only on the ambient cake: a feasible allocation is a measurable partition of `Set.univ`. -/
def SocialChoice.FairDivision.Divisible.MeasureInstance.feasible {N Ω : Type*} [MeasurableSpace Ω] [Fintype N]
    (_I : MeasureInstance N Ω) (A : Allocation N Ω) : Prop :=
  IsAllocation A
See it in the graphDiscuss this resultChallenge it