GS.meetMan
defimported Lean
Woman i's more-preferred man across μ and ν.
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.meetMan (i : Fin n) : Fin n
- Defined in
- EconCSLib, `GS.meetMan`
- 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.meetMan← GS.meetMan (EconCSLib/MarketDesign/Matching/Lattice.lean:331): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 8
- GS.mPartnerThe man partnered to woman
iunder a stable matchingμ. - 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.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.mPartnerThe man partnered to woman
- Used by 14
- GS.meetMan_eq_orGS.meetMan_eq_or
- GS.stableMeet_isStableThe meet of two stable matchings is stable.
- GS.stableMeetThe meet
μ ∧ ν: each woman keeps her more-preferred man; each man keeps his less-preferred woman. - GS.stableMeet_matchMGS.stableMeet_matchM
- GS.stableMeet_ge_leftGS.stableMeet_ge_left
- GS.meetEquiv_symm_eq_orThe meet woman of man
jis one of his two partners (his worse). - GS.meetMan_le_leftGS.meetMan_le_left
- GS.stableMeet_ge_rightGS.stableMeet_ge_right
- GS.meetMan_mem_womenGS.meetMan_mem_women
- GS.meetMan_worse_rightGS.meetMan_worse_right
- GS.meetMan_worse_leftGS.meetMan_worse_left
- GS.meetEquivThe meet man-assignment packaged as an equivalence.
- GS.meetMan_le_rightGS.meetMan_le_right
- GS.meetMan_injectiveGS.meetMan_injective
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 /-- Woman `i`'s more-preferred man across `μ` and `ν`. -/ noncomputable def GS.meetMan (i : Fin n) : Fin n := if (w.prefs i).idxOf (mPartner μ hμ i) ≤ (w.prefs i).idxOf (mPartner ν hν i) then mPartner μ hμ i else mPartner ν hν i