AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Divisible.DubinsSpanierProp

defimported Lean

The inductive predicate for the Dubins–Spanier algorithm: for n agents indexed by Fin n, a complete proportional allocation exists.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped unitInterval in
noncomputable def SocialChoice.FairDivision.Divisible.DubinsSpanierProp (n : ℕ) : Prop
Defined in
EconCSLib, `SocialChoice.FairDivision.Divisible.DubinsSpanierProp`
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 8
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open MeasureTheory Set in
open scoped unitInterval in
/-- The inductive predicate for the Dubins–Spanier algorithm: for n agents indexed by `Fin n`, a complete proportional allocation exists. -/
noncomputable def SocialChoice.FairDivision.Divisible.DubinsSpanierProp (n : ℕ) : Prop :=
  ∀ (μ : Fin n → Measure I),
    (∀ i, IsFiniteMeasure (μ i)) →
    (∀ i, NoAtoms (μ i)) →
    ∃ A : Allocation (Fin n) I,
      IsAllocation A ∧ IsProportional n (MeasureValuation μ) A
See it in the graphDiscuss this resultChallenge it