AFTD Auto-Formalizing Theoretical Domains

GS.joinEquiv

defimported Lean

The join woman-assignment packaged as an equivalence (injective on the finite Fin n, hence bijective).

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.joinEquiv : Fin n ≃ Fin n
Defined in
EconCSLib, `GS.joinEquiv`
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 9
Used by 3

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 join woman-assignment packaged as an equivalence (injective on the finite `Fin n`, hence bijective). -/
noncomputable def GS.joinEquiv : Fin n ≃ Fin n :=
  Equiv.ofBijective (joinWoman μ ν hμ hν)
    (Finite.injective_iff_bijective.mp (joinWoman_injective μ ν hμ hν))
See it in the graphDiscuss this resultChallenge it