AFTD Auto-Formalizing Theoretical Domains

is_allocation_rule

def

Given types Agent and Object, a rule f : (Agent -> LinearOrder Object) -> Agent -> Finset Object satisfies is_allocation_rule if for every preference profile succ : Agent -> LinearOrder Object and all distinct agents i ≠ j, the finite bundles f succ i and f succ j of type Finset Object are disjoint.

Statement

def is_allocation_rule {Agent Object : Type*}
    (f : (Agent → LinearOrder Object) → Agent → Finset Object) : Prop
Defined in
arXiv:2611.09685 Section 2.3
Verified
09 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given types Agent and Object, and a function f that assigns to each profile of linear orders on Object (one for each agent) and each agent a finite set of objects, is_allocation_rule f asserts that for every preference profile succ : Agent → LinearOrder Object and any two agents i, j : Agent, if i ≠ j, then the sets allocated to them, f succ i and f succ j, are disjoint.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A rule maps preference profiles to allocations if bundles of distinct agents are disjoint. -/
def is_allocation_rule {Agent Object : Type*}
    (f : (Agent → LinearOrder Object) → Agent → Finset Object) : Prop :=
  ∀ succ i j, i ≠ j → Disjoint (f succ i) (f succ j)
See it in the graphDiscuss this resultChallenge it