AFTD Auto-Formalizing Theoretical Domains

GS.finalState_NoAchievableRejection

theoremverifiedformalizationimported Lean

The invariant holds at finalState.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GS in
open GS in
variable {n : ℕ} [NeZero n] in
variable (w m : Preferences n) in
lemma GS.finalState_NoAchievableRejection :
    NoAchievableRejection w m (finalState w m)
Formalizes
EconCSLib, `GS.finalState_NoAchievableRejection`
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 9
Used by 1
  • GS.galeShapley_isProposingOptimalMen-optimal stable matching (Gale–Shapley 1962, [MSZ 22.10]): in the men-proposing DA, every man's GS partner is at least as preferred…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GS in
open GS in
variable {n : ℕ} [NeZero n] in
variable (w m : Preferences n) in
/-- The invariant holds at `finalState`. -/
lemma GS.finalState_NoAchievableRejection :
    NoAchievableRejection w m (finalState w m) :=
  daRun_NoAchievableRejection w m (n * n + 1) (initState n)
    (holdinv_init m) (initState_injective (n := n))
    (initState_NoAchievableRejection w m)
See it in the graphDiscuss this resultChallenge it