AFTD Auto-Formalizing Theoretical Domains

satisfies_objectwise_mm

def

Given types Agent and Object, a rule f : (Agent -> LinearOrder Object) -> Agent -> Finset Object satisfies satisfies_objectwise_mm if for all preference profiles succ and succ' of type Agent -> LinearOrder Object, whenever for every agent i, every object y ∈ f succ i, and every object z : Object, (succ i).lt z y implies (succ' i).lt z y, then f succ' = f succ.

Statement

def satisfies_objectwise_mm {Agent Object : Type*}
    (f : (Agent → LinearOrder Object) → Agent → Finset Object) : Prop
Defined in
arXiv:2611.09685 Section 4.2
Verified
09 Nov 2026
Axioms
none listed

Read back from the Lean

Given types Agent and Object, a choice/allocation rule f : (Agent → LinearOrder Object) → Agent → Finset Object satisfies satisfies_objectwise_mm if and only if for all preference profiles succ and succ' (assigning a linear order on Object to each agent), if for every agent i, every object y ∈ f succ i, and every object z : Object, z being strictly less than y under succ i implies z is strictly less than y under succ' i, then f succ' = f succ (i.e., the allocation rule assigns the exact same bundles to all agents under both profiles).

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 satisfies object-wise Maskin monotonicity if expanding lower contour sets preserves allocations. -/
def satisfies_objectwise_mm {Agent Object : Type*}
    (f : (Agent → LinearOrder Object) → Agent → Finset Object) : Prop :=
  ∀ (succ succ' : Agent → LinearOrder Object),
    (∀ i, ∀ y ∈ f succ i, ∀ z : Object, (succ i).lt z y → (succ' i).lt z y) →
    f succ' = f succ
See it in the graphDiscuss this resultChallenge it