AFTD Auto-Formalizing Theoretical Domains

rsinv_finalState

theoremverifiedformalizationimported Lean

RSInv at finalState.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
open GS in
variable {n : ℕ} [NeZero n] in
lemma rsinv_finalState (w m : Preferences n) :
    RSInv w m (finalState w m)
Formalizes
EconCSLib, `rsinv_finalState`
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 8
  • rsinv_runRSInv over daRun.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
  • RSInvRSInv (the deferred-acceptance rank invariant — the engine of the stability proof): for every man j and every woman i that j has…
  • GS.finalStatefinalState: run daRun with fuel n*n + 1 from initState.
  • GS.initStateInitial state: all women free, all men start at proposal index 0.
  • rsinv_initrsinv_init
  • jinv_initjinv_init
  • initState_injectiveinitState has trivially injective holding (all none).
Used by 1
  • rsinv_stabilityIf j strictly prefers i over his final partner, i's final partner has rank ≤ j.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] in/-- RSInv at finalState. -/lemma rsinv_finalState (w m : Preferences n) :    RSInv w m (finalState w m) := by  apply rsinv_run w m (n * n + 1) (initState n) (rsinv_init w m)  · simp [initState]  · exact jinv_init m  · exact initState_injective (n := n)
See it in the graphDiscuss this resultChallenge it