AFTD Auto-Formalizing Theoretical Domains

is_nel_rule

def

Given types Agent and Object with decidable equality on Object, an allocation rule f : (Agent → LinearOrder Object) → Agent → Finset Object satisfies is_nel_rule if for every preference profile succ : Agent → LinearOrder Object, the allocation f succ satisfies is_nel_pd with respect to the weak preference relations (fun i => (succ i).le).

Statement

def is_nel_rule {Agent Object : Type*} [DecidableEq Object]
    (f : (Agent → LinearOrder Object) → Agent → Finset Object) : Prop
Defined in
arXiv:2611.09685, Section 3.1
Verified
09 Nov 2026
Axioms
none listed
Built on 1
  • is_nel_pdAn allocation A : Agent → Finset Object satisfies NEL under pairwise dominance with respect to item preferences le : Agent → Object →…

Read back from the Lean

A definition is_nel_rule stating that an allocation rule f : (Agent → LinearOrder Object) → Agent → Finset Object satisfies the property if, for every preference profile succ : Agent → LinearOrder Object, the allocation f succ satisfies is_nel_pd with respect to the weak linear orders (succ i).le. Specifically, whenever an agent i receives strictly fewer objects than an agent j, then for every object y in j's bundle, there exists an injective mapping from j's bundle without y into i's bundle such that agent i weakly prefers the matched object to the original object under succ i.

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

/-- An allocation rule satisfies no envy toward larger bundles up to any object (NEL) if at every preference profile its allocation satisfies NEL under pairwise dominance. -/
def is_nel_rule {Agent Object : Type*} [DecidableEq Object]
    (f : (Agent → LinearOrder Object) → Agent → Finset Object) : Prop := ∀ succ : Agent → LinearOrder Object, is_nel_pd (fun i => (succ i).le) (f succ)
See it in the graphDiscuss this resultChallenge it