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.GS.daRun← GS.daRun (EconCSLib/MarketDesign/Matching/GaleShapley.lean:230): verbatim
- 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 iis a full permutation ofFin n, ordered from most to least preferred.
- Used by 15
- holding_injective_runOver
daRun, holding remains injective. - nc_le_n_run
nextChoice i ≤ noverdaRun. - GS.daRun_NoAchievableRejection
NoAchievableRejectionis preserved bydaRun(threadingHoldInvand holding-injectivity, both also preserved bydaStep). - holdinv_runholdinv_run
- rsinv_runRSInv over daRun.
- holding_rank_mono_runRank-mono over any
daRun. - nc_sum_le_nn
∑ nextChoice ≤ n * nis preserved overdaRun. - finalState_no_free_menAt termination, every man is held (no free man remains). Proof: if a free man remained,
nc_sum_growswould given*n + 1 ≤ n*n,… - finalState_rank_boundAt termination: if man j proposed to woman i at some round (j was free, i was his nc-th choice at state s, and the rest of the run reaches…
- rsinv_stabilityIf j strictly prefers i over his final partner, i's final partner has rank ≤ j.
- nc_sum_growsAfter
fuelrounds ending with free men,∑ nextChoicegrew by ≥fuel. - jinv_run
JInvoverdaRun. - GS.finalState
finalState: rundaRunwith fueln*n + 1frominitState. - proposal_rank_bound_runOver a daRun, if man j proposed to woman i at the first step, woman i's final partner has rank ≤ j's rank in w.prefs i.
- held_preserved_runOnce held, always held over
daRun.
- holding_injective_runOver
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