AFTD Auto-Formalizing Theoretical Domains

GS.daStep

defimported Lean

One step of standard men-proposing DA. All free men propose; women pick the best of {held, new proposers} by rank; free men advance their cursor by 1.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
noncomputable def GS.daStep {n : ℕ} (w m : Preferences n) (s : DAState n) : DAState n
Defined in
EconCSLib, `GS.daStep`
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 4
  • GS.propTargetThe woman man i proposes to at cursor index k (none if out of bounds).
  • GS.isFreeMan i is free in s iff no woman holds him.
  • GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
Used by 25

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
/-- One step of standard men-proposing DA. All free men propose; women pick the best of {held, new proposers} by rank; free men advance their cursor by 1. -/
noncomputable def GS.daStep {n : ℕ} (w m : Preferences n) (s : DAState n) : DAState n :=
  let newNextChoice : Fin n → ℕ := fun i =>
    if isFree s i then s.nextChoice i + 1 else s.nextChoice i
  let proposerList : Fin n → List (Fin n) := fun j =>
    (Finset.univ.filter (fun i =>
      isFree s i && (propTarget m i (s.nextChoice i) == some j))).val.toList
  let bestNew : Fin n → Option (Fin n) := fun j =>
    (proposerList j).argmin (fun i => (w.prefs j).idxOf i)
  let newHolding : Fin n → Option (Fin n) := fun j =>
    match s.holding j, bestNew j with
    | none,   none   => none
    | some h, none   => some h
    | none,   some p => some p
    | some h, some p =>
        if (w.prefs j).idxOf p < (w.prefs j).idxOf h then some p else some h
  { nextChoice := newNextChoice, holding := newHolding }
See it in the graphDiscuss this resultChallenge it