GS.initState_NoAchievableRejection
theoremverifiedformalizationimported Lean
The invariant holds vacuously at initState: no man has proposed yet.
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 lemma GS.initState_NoAchievableRejection : NoAchievableRejection w m (initState n)
- Formalizes
- EconCSLib, `GS.initState_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.initState_NoAchievableRejection← GS.initState_NoAchievableRejection (EconCSLib/MarketDesign/Matching/Optimal.lean:100): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 6
- GS.NoAchievableRejectionRun-state invariant for proposer optimality.
NoAchievableRejection w m ssays: at states, for every achievable pair(j, wj), if man… - instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
- GS.initStateInitial state: all women free, all men start at proposal index 0.
- 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…
- GS.NoAchievableRejectionRun-state invariant for proposer optimality.
- Used by 1
- GS.finalState_NoAchievableRejectionThe invariant holds at
finalState.
- GS.finalState_NoAchievableRejectionThe invariant holds at
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen GS invariable {n : ℕ} [NeZero n] invariable (w m : Preferences n) in/-- The invariant holds vacuously at `initState`: no man has proposed yet. -/lemma GS.initState_NoAchievableRejection : NoAchievableRejection w m (initState n) := by intro j wj _ h simp [initState] at h