daStep_nc_le_n
theoremverifiedformalizationimported Lean
nextChoice i ≤ n for daStep.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List Finset in open GS in variable {n : ℕ} [NeZero n] in lemma daStep_nc_le_n (w m : Preferences n) (s : DAState n) (hnc0 : ∀ i : Fin n, s.nextChoice i ≤ n) (hj : JInv m s) (hinj : ∀ j1 j2 k : Fin n, s.holding j1 = some k → s.holding j2 = some k → j1 = j2) (i : Fin n) : (daStep w m s).nextChoice i ≤ n
- Formalizes
- EconCSLib, `daStep_nc_le_n`
- 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.daStep_nc_le_n← daStep_nc_le_n (EconCSLib/MarketDesign/Matching/GaleShapley.lean:570): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- GS.daStepOne step of standard men-proposing DA. All free men propose; women pick the best of {held, new proposers} by rank; free men advance their…
- GS.daStep_nc_heldGS.daStep_nc_held
- not_free_of_nc_ge
nextChoice i ≥ n+ injectivity +JInv→ maniis not free. - GS.daStep_nc_freeGS.daStep_nc_free
- GS.isFreeMan
iis free insiff no woman holds him. - 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 4
- nc_le_n_run
nextChoice i ≤ noverdaRun. - rsinv_runRSInv over daRun.
- nc_sum_le_nn
∑ nextChoice ≤ n * nis preserved overdaRun. - nc_sum_growsAfter
fuelrounds ending with free men,∑ nextChoicegrew by ≥fuel.
- nc_le_n_run
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] in/-- `nextChoice i ≤ n` for `daStep`. -/lemma daStep_nc_le_n (w m : Preferences n) (s : DAState n) (hnc0 : ∀ i : Fin n, s.nextChoice i ≤ n) (hj : JInv m s) (hinj : ∀ j1 j2 k : Fin n, s.holding j1 = some k → s.holding j2 = some k → j1 = j2) (i : Fin n) : (daStep w m s).nextChoice i ≤ n := by by_cases hfi : isFree s i = true · rw [daStep_nc_free hfi] by_contra h_gt; push_neg at h_gt exact absurd (not_free_of_nc_ge m s i hj hinj (by omega)) (by simp [hfi]) · rw [daStep_nc_held (by simpa using hfi)]; exact hnc0 i