AFTD Auto-Formalizing Theoretical Domains

GS.StableMatching

defimported Lean

The type of stable matchings of a one-to-one market.

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
def GS.StableMatching (w' m' : Preferences n) : Type
Defined in
EconCSLib, `GS.StableMatching`
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 7
Used by 7

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 type of stable matchings of a one-to-one market. -/
def GS.StableMatching (w' m' : Preferences n) : Type :=
  { μ : Matching (Fin n) (Fin n) // Matching.IsStable (MatchingMarket.ofEquivData w' m') μ }
See it in the graphDiscuss this resultChallenge it