GS.daStep_nc_held
theoremverifiedformalizationimported Lean
GS.daStep_nc_held
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open List Finset in lemma GS.daStep_nc_held {n : ℕ} {w m : Preferences n} {s : DAState n} {i : Fin n} (hi : isFree s i = false) : (daStep w m s).nextChoice i = s.nextChoice i
- Formalizes
- EconCSLib, `GS.daStep_nc_held`
- 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.daStep_nc_held← GS.daStep_nc_held (EconCSLib/MarketDesign/Matching/GaleShapley.lean:187): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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.propTargetThe woman man
iproposes to at cursor indexk(none if out of bounds). - GS.isFreeMan
iis free insiff no woman holds him. - 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.
- Used by 6
- holdinv_step
HoldInvis preserved by one DA step. Proof structure: case-analyze on the pair(s.holding p, bestNew p)that drivesdaStep's… - nc_sum_increase
∑ nextChoicestrictly increases when free men exist. - jinv_step
JInvis preserved by onedaStep. - GS.daStep_NoAchievableRejectionInductive step (KEY LEMMA).
NoAchievableRejectionis preserved by onedaStep. Also threadsHoldInv(for the old-holder index… - daStep_nc_le_n
nextChoice i ≤ nfordaStep. - rsinv_stepRSInv is preserved by one daStep.
- holdinv_step
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 inlemma GS.daStep_nc_held {n : ℕ} {w m : Preferences n} {s : DAState n} {i : Fin n} (hi : isFree s i = false) : (daStep w m s).nextChoice i = s.nextChoice i := by simp [daStep, hi]