proposal_rank_bound_run
theoremverifiedformalizationimported Lean
Over 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.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List Finset in open GS in variable {n : ℕ} [NeZero n] in lemma proposal_rank_bound_run (w m : Preferences n) (fuel : ℕ) (s : DAState n) (j i : Fin n) (hfj : isFree s j = true) (hpt : propTarget m j (s.nextChoice j) = some i) : ∃ h : Fin n, (daRun w m fuel (daStep w m s)).holding i = some h ∧ (w.prefs i).idxOf h ≤ (w.prefs i).idxOf j
- Formalizes
- EconCSLib, `proposal_rank_bound_run`
- 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.proposal_rank_bound_run← proposal_rank_bound_run (EconCSLib/MarketDesign/Matching/GaleShapley.lean:689): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- proposal_rank_boundWhen free man
jproposes to womaniindaStep, the resulting hold has rank ≤ j. - 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.daRunRun DA for at most
fuelsteps, stopping early if no free men remain. - holding_rank_mono_runRank-mono over any
daRun. - GS.propTargetThe woman man
iproposes to at cursor indexk(none if out of bounds). - GS.isFreeMan
iis free insiff no woman holds him. - 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.
- proposal_rank_boundWhen free man
- Used by 1
- 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…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] in/-- Over 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. -/lemma proposal_rank_bound_run (w m : Preferences n) (fuel : ℕ) (s : DAState n) (j i : Fin n) (hfj : isFree s j = true) (hpt : propTarget m j (s.nextChoice j) = some i) : ∃ h : Fin n, (daRun w m fuel (daStep w m s)).holding i = some h ∧ (w.prefs i).idxOf h ≤ (w.prefs i).idxOf j := by obtain ⟨h0, hh0, hrk0⟩ := proposal_rank_bound w m s j i hfj hpt obtain ⟨h1, hh1, hrk1⟩ := holding_rank_mono_run w m fuel (daStep w m s) i hh0 exact ⟨h1, hh1, Nat.le_trans hrk1 hrk0⟩