GS.joinWoman_eq_or
theoremverifiedformalizationimported Lean
GS.joinWoman_eq_or
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GS in variable {n : ℕ} (w m : Preferences n) in variable {w m} in variable (μ ν : Matching (Fin n) (Fin n)) (hμ : Matching.IsStable (MatchingMarket.ofEquivData w m) μ) (hν : Matching.IsStable (MatchingMarket.ofEquivData w m) ν) in lemma GS.joinWoman_eq_or (j : Fin n) : joinWoman μ ν hμ hν j = wPartner μ hμ j ∨ joinWoman μ ν hμ hν j = wPartner ν hν j
- Formalizes
- EconCSLib, `GS.joinWoman_eq_or`
- 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.joinWoman_eq_or← GS.joinWoman_eq_or (EconCSLib/MarketDesign/Matching/Lattice.lean:128): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- Matching.IsStableA matching is stable if it has no blocking pair. [MSZ 22.5]
- MatchingA matching is a partial bijection between
MandW.matchM iis the partner ofi ∈ M(ornoneif unmatched).matchW jis the… - GS.matchM_mPartnerGS.matchM_mPartner
- instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
- GS.matchW_wPartnerGS.matchW_wPartner
- GS.wPartnerThe woman partnered to man
junder a stable matchingμ(total, since a stable matching of the balanced market is perfect). - GS.PreferencesList-based preferences:
prefs iis a full permutation ofFin n, ordered from most to least preferred. - MatchingMarket.ofEquivDataBuild a
MatchingMarket (Fin n) (Fin n)from list-based preference data.some j ≻ some kiffjappears earlier in the list;noneis… - GS.joinWomanMan
j's more-preferred partner across stable matchingsμandν.
- Used by 2
- GS.joinWoman_mem_menIf
iis manj's join-partner thenjis one ofi's two men. - GS.StableMatching.instLatticeConway–Knuth lattice. The stable matchings of a one-to-one market form a lattice under the men-preference order: the join gives every…
- GS.joinWoman_mem_menIf
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 : ℕ} (w m : Preferences n) invariable {w m} invariable (μ ν : Matching (Fin n) (Fin n)) (hμ : Matching.IsStable (MatchingMarket.ofEquivData w m) μ) (hν : Matching.IsStable (MatchingMarket.ofEquivData w m) ν) inlemma GS.joinWoman_eq_or (j : Fin n) : joinWoman μ ν hμ hν j = wPartner μ hμ j ∨ joinWoman μ ν hμ hν j = wPartner ν hν j := by unfold joinWoman; split_ifs with h · exact Or.inl rfl · exact Or.inr rfl