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.GS.NoAchievableRejection← GS.NoAchievableRejection (EconCSLib/MarketDesign/Matching/Optimal.lean:95): verbatim
- 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 iis a full permutation ofFin n, ordered from most to least preferred. - GS.IsAchievable
IsAchievable w m j wjsays womanwjis achievable for manj: some stable matching pairs them. Recall the codebase convention…
- Used by 4
- GS.finalState_NoAchievableRejectionThe invariant holds at
finalState. - GS.daRun_NoAchievableRejection
NoAchievableRejectionis preserved bydaRun(threadingHoldInvand holding-injectivity, both also preserved bydaStep). - GS.daStep_NoAchievableRejectionInductive step (KEY LEMMA).
NoAchievableRejectionis preserved by onedaStep. Also threadsHoldInv(for the old-holder index… - GS.initState_NoAchievableRejectionThe invariant holds vacuously at
initState: no man has proposed yet.
- GS.finalState_NoAchievableRejectionThe invariant holds at
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