GS.stableMeet
defimported Lean
The meet μ ∧ ν: each woman keeps her more-preferred man; each man keeps his less-preferred woman.
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 noncomputable def GS.stableMeet : Matching (Fin n) (Fin n)
- Defined in
- EconCSLib, `GS.stableMeet`
- 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.stableMeet← GS.stableMeet (EconCSLib/MarketDesign/Matching/Lattice.lean:415): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- 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.meetManWoman
i's more-preferred man acrossμandν. - GS.PreferencesList-based preferences:
prefs iis a full permutation ofFin n, ordered from most to least preferred. - GS.meetEquivThe meet man-assignment packaged as an equivalence.
- MatchingMarket.ofEquivDataBuild a
MatchingMarket (Fin n) (Fin n)from list-based preference data.some j ≻ some kiffjappears earlier in the list;noneis…
- Used by 5
- GS.stableMeet_isStableThe meet of two stable matchings is stable.
- GS.stableMeet_matchMGS.stableMeet_matchM
- GS.stableMeet_matchWGS.stableMeet_matchW
- GS.wPartner_stableMeetGS.wPartner_stableMeet
- 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…
Lean source view module on GitHub
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 /-- The **meet** `μ ∧ ν`: each woman keeps her more-preferred man; each man keeps his less-preferred woman. -/ noncomputable def GS.stableMeet : Matching (Fin n) (Fin n) where matchM i := some (meetMan μ ν hμ hν i) matchW j := some ((meetEquiv μ ν hμ hν).symm j) consistent := by intro i j simp only [Option.some.injEq] rw [Equiv.symm_apply_eq] exact eq_comm