AFTD Auto-Formalizing Theoretical Domains

move_to_bottom

deforiginal

The relation obtained from a binary relation r on α by moving an element bot_elt to the bottom: bot_elt is not preferred to anything, any other element is preferred to bot_elt, and preferences between elements other than bot_elt remain unchanged.

Statement

def move_to_bottom {α : Type*} (r : α → α → Prop) (bot_elt : α) : α → α → Prop
Related work
folklore
Verified
02 Nov 2026
Axioms
none listed
Used by 6
  • woman_cutoff_tanking_is_stable_of_geIn a marriage market where woman w's preferences are transitive, any matching μ stable after t-cutoff tanking by w that assigns w a…
  • man_cutoff_tankingIn a marriage market, the profile obtained by t-cutoff tanking by man m: man m is moved to the bottom of the preference list of every…
  • woman_cutoff_tanking_ge_subsetIn a marriage market, any matching μ stable in market that assigns woman w a partner weakly preferred to t (that is, ¬ market.pref_w w t…
  • move_to_bottom_is_strict_total_orderIf r is a strict total order on α, then moving an element bot_elt to the bottom of r yields a strict total order.
  • woman_cutoff_tankingIn a marriage market, the profile obtained by t-cutoff tanking by woman w: woman w is moved to the bottom of the preference list of every…
  • exact_cutoff_filteringIn a finite marriage market with strict complete preference profile Q, for every agent (woman w with stable partner t in M, or man m with…

Read back from the Lean

Given a type α, a binary relation r : α → α → Prop, and an element bot_elt : α, move_to_bottom r bot_elt is the binary relation on α mapping a pair (a, b) to: - False if a = bot_elt; - True if a ≠ bot_elt and b = bot_elt; - r a b if a ≠ bot_elt and b ≠ bot_elt. Equivalently, it holds if and only if a ≠ bot_elt ∧ (b = bot_elt ∨ r a b).

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

/-- Modifies a binary relation by moving a distinguished element to the bottom. -/
def move_to_bottom {α : Type*} (r : α → α → Prop) (bot_elt : α) : α → α → Prop := open Classical in fun a b => if a = bot_elt then False else if b = bot_elt then True else r a b
See it in the graphDiscuss this resultChallenge it