AFTD Auto-Formalizing Theoretical Domains

finalState_rank_bound

theoremverifiedformalizationimported Lean

At 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 finalState), woman i's final partner has rank ≤ j 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 finalState_rank_bound (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)
    (hrun : daRun w m fuel (daStep w m s) = finalState w m) :
    (w.prefs i).idxOf (gs w m i) ≤ (w.prefs i).idxOf j
Formalizes
EconCSLib, `finalState_rank_bound`
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
Classical.choiceQuot.soundpropext
Built on 10
  • 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 fuel steps, stopping early if no free men remain.
  • GS.gsThe Gale-Shapley function: woman j's partner at termination.
  • 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.initStateInitial state: all women free, all men start at proposal index 0.
  • GS.finalStatefinalState: run daRun with fuel n*n + 1 from initState.
  • 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.
  • 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.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] in/-- At 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 finalState), woman i's final partner has rank ≤ j in w.prefs i. -/lemma finalState_rank_bound (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)    (hrun : daRun w m fuel (daStep w m s) = finalState w m) :    (w.prefs i).idxOf (gs w m i) ≤ (w.prefs i).idxOf j := by  obtain ⟨h, hh, hrk⟩ := proposal_rank_bound_run w m fuel s j i hfj hpt  rw [hrun] at hh  -- gs w m i = h (woman i holds man h at termination)  have hgs : gs w m i = h := by    simp only [gs, finalState]    rw [show (daRun w m (n * n + 1) (initState n)).holding i = some h from hh]; simp  rw [hgs]; exact hrk
See it in the graphDiscuss this resultChallenge it