jinv_init
theoremverifiedformalizationimported Lean
jinv_init
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List Finset in open GS in variable {n : ℕ} [NeZero n] in lemma jinv_init (m : Preferences n) : JInv m (initState n)
- Formalizes
- EconCSLib, `jinv_init`
- 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.jinv_init← jinv_init (EconCSLib/MarketDesign/Matching/GaleShapley.lean:479): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 4
- GS.initStateInitial state: all women free, all men start at proposal index 0.
- GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
- JInvJInv (Proposed → Held): once man
ihas proposed to womanpin some prior step,pis currently held by *someone* (possiblyi,… - GS.PreferencesList-based preferences:
prefs iis a full permutation ofFin n, ordered from most to least preferred.
- Used by 2
- rsinv_finalStateRSInv at finalState.
- finalState_no_free_menAt termination, every man is held (no free man remains). Proof: if a free man remained,
nc_sum_growswould given*n + 1 ≤ n*n,…
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 List Finset inopen GS invariable {n : ℕ} [NeZero n] inlemma jinv_init (m : Preferences n) : JInv m (initState n) := by intro i p hp; simp [initState] at hp