AFTD Auto-Formalizing Theoretical Domains

GS.daRun

defimported Lean

Run DA for at most fuel steps, stopping early if no free men remain.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
noncomputable def GS.daRun {n : ℕ} (w m : Preferences n) : ℕ → DAState n → DAState n
Defined in
EconCSLib, `GS.daRun`
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.daStepOne step of standard men-proposing DA. All free men propose; women pick the best of {held, new proposers} by rank; free men advance their…
  • GS.freeMenSetThe finset of all free men in s.
  • 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 15

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
/-- Run DA for at most `fuel` steps, stopping early if no free men remain. -/
noncomputable def GS.daRun {n : ℕ} (w m : Preferences n) : ℕ → DAState n → DAState n
  | 0,        s => s
  | fuel + 1, s => if (freeMenSet s).Nonempty then daRun w m fuel (daStep w m s) else s
See it in the graphDiscuss this resultChallenge it