AFTD Auto-Formalizing Theoretical Domains

GS.gs_partner_isAchievable

theoremverifiedformalizationimported Lean

The GS output itself witnesses that gs.symm j is achievable for j.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GS in
open GS in
variable {n : ℕ} [NeZero n] in
variable (w m : Preferences n) in
lemma GS.gs_partner_isAchievable (j : Fin n) :
    IsAchievable w m j ((Equiv.ofBijective (gs w m) (gs_bijective w m)).symm j)
Formalizes
EconCSLib, `GS.gs_partner_isAchievable`
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 10
  • galeShapley_isStableGale-Shapley stability: the DA output has no blocking pair. The statement is in the *market* frame (IsBlocking … (i : M) (j : W)).…
  • gs_bijectivegs w m is a bijection on Fin n.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
  • GS.IsAchievableIsAchievable w m j wj says woman wj is achievable for man j: some stable matching pairs them. Recall the codebase convention…
  • GS.gsThe Gale-Shapley function: woman j's partner at termination.
  • 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…
  • Matching.IsStableA matching is stable if it has no blocking pair. [MSZ 22.5]
  • 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…
  • Matching.ofGSCoerce a bijective f : Fin n → Fin n into Matching (Fin n) (Fin n).
  • instCoeFunPrefForallForallPropinstCoeFunPrefForallForallProp

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GS in
open GS in
variable {n : ℕ} [NeZero n] in
variable (w m : Preferences n) in
/-- The GS output itself witnesses that `gs.symm j` is achievable for `j`. -/
lemma GS.gs_partner_isAchievable (j : Fin n) :
    IsAchievable w m j ((Equiv.ofBijective (gs w m) (gs_bijective w m)).symm j) :=
  ⟨Matching.ofGS (gs w m) (gs_bijective w m), galeShapley_isStable w m, rfl⟩
See it in the graphDiscuss this resultChallenge it