AFTD Auto-Formalizing Theoretical Domains

GS.NoAchievableRejection

defimported Lean

Run-state invariant for proposer optimality. NoAchievableRejection w m s says: at state s, for every achievable pair (j, wj), if man j has already proposed to wj (i.e. idxOf wj < nextChoice j), then wj is currently holding j. Contrapositively, j has not been *rejected* by wj.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GS in
variable {n : ℕ} [NeZero n] in
variable (w m : Preferences n) in
def GS.NoAchievableRejection (s : DAState n) : Prop
Defined in
EconCSLib, `GS.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
none listed
Built on 4
  • instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
  • 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.
  • GS.IsAchievableIsAchievable w m j wj says woman wj is achievable for man j: some stable matching pairs them. Recall the codebase convention…
Used by 4

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GS in
variable {n : ℕ} [NeZero n] in
variable (w m : Preferences n) in
/-- Run-state invariant for proposer optimality. `NoAchievableRejection w m s` says: at state `s`, for every achievable pair `(j, wj)`, if man `j` has already proposed to `wj` (i.e. `idxOf wj < nextChoice j`), then `wj` is currently holding `j`. Contrapositively, `j` has not been *rejected* by `wj`. -/
def GS.NoAchievableRejection (s : DAState n) : Prop :=
  ∀ j wj : Fin n, IsAchievable w m j wj →
    (m.prefs j).idxOf wj < s.nextChoice j → s.holding wj = some j
See it in the graphDiscuss this resultChallenge it