AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.IsAllocation

structureimported Lean

A complete allocation partitions all goods among agents. * disjoint: distinct agents receive disjoint bundles. * complete: every good in allGoods is allocated to some agent. [Fintype N] is required for Finset.univ in the completeness condition. [DecidableEq G] is required for Finset.biUnion and Disjoint. [AGT Ch.11]

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
structure SocialChoice.FairDivision.Indivisible.IsAllocation {N G : Type*} [Fintype N] [DecidableEq G]
    (allGoods : Finset G) (A : Allocation N G) : Prop
Defined in
EconCSLib, `SocialChoice.FairDivision.Indivisible.IsAllocation`
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 1
Used by 13

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
/-- A complete allocation partitions all goods among agents. * `disjoint`: distinct agents receive disjoint bundles. * `complete`: every good in `allGoods` is allocated to some agent. `[Fintype N]` is required for `Finset.univ` in the completeness condition. `[DecidableEq G]` is required for `Finset.biUnion` and `Disjoint`. [AGT Ch.11] -/
structure SocialChoice.FairDivision.Indivisible.IsAllocation {N G : Type*} [Fintype N] [DecidableEq G]
    (allGoods : Finset G) (A : Allocation N G) : Prop where
  /-- Distinct agents receive disjoint bundles. -/
  disjoint : ∀ i j : N, i ≠ j → Disjoint (A i) (A j)
  /-- Every good in `allGoods` is allocated to some agent. -/
  complete  : allGoods = Finset.univ.biUnion A
See it in the graphDiscuss this resultChallenge it