AFTD Auto-Formalizing Theoretical Domains

GS.wPartner

defimported Lean

The woman partnered to man j under a stable matching μ (total, since a stable matching of the balanced market is perfect).

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
noncomputable def GS.wPartner (μ : Matching (Fin n) (Fin n))
    (hμ : Matching.IsStable (MatchingMarket.ofEquivData w m) μ) (j : Fin n) : Fin n
Defined in
EconCSLib, `GS.wPartner`
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
none listed
Built on 6
  • 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…
  • instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp
  • 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.stable_matching_perfectIn the balanced full-preference one-to-one market, every stable matching is perfect: every woman and every man is matched. This is the…
Used by 22

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
/-- The woman partnered to man `j` under a stable matching `μ` (total, since a stable matching of the balanced market is perfect). -/
noncomputable def GS.wPartner (μ : Matching (Fin n) (Fin n))
    (hμ : Matching.IsStable (MatchingMarket.ofEquivData w m) μ) (j : Fin n) : Fin n :=
  (μ.matchW j).get ((stable_matching_perfect w m μ hμ).2 j)
See it in the graphDiscuss this resultChallenge it