AFTD Auto-Formalizing Theoretical Domains

GS.stableJoin_matchW

theoremverifiedformalizationimported Lean

GS.stableJoin_matchW

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
@[simp] lemma GS.stableJoin_matchW (j : Fin n) :
    (stableJoin μ ν hμ hν).matchW j = some (joinWoman μ ν hμ hν j)
Formalizes
EconCSLib, `GS.stableJoin_matchW`
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.
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 M and W. matchM i is the partner of i ∈ M (or none if unmatched). matchW j is the…
  • GS.matchM_mPartnerGS.matchM_mPartner
  • instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
  • GS.matchW_wPartnerGS.matchW_wPartner
  • GS.stableJoinThe join μ ∨ ν: each man keeps his more-preferred of the two partners; each woman keeps her less-preferred man.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
  • MatchingMarket.ofEquivDataBuild a MatchingMarket (Fin n) (Fin n) from list-based preference data. some j ≻ some k iff j appears earlier in the list; none is…
  • GS.joinWomanMan j's more-preferred partner across stable matchings μ and ν.
Used by 6

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
@[simp] lemma GS.stableJoin_matchW (j : Fin n) :
    (stableJoin μ ν hμ hν).matchW j = some (joinWoman μ ν hμ hν j) := rfl
See it in the graphDiscuss this resultChallenge it