AFTD Auto-Formalizing Theoretical Domains

GS.finalState

defimported Lean

finalState: run daRun with fuel n*n + 1 from initState.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
noncomputable def GS.finalState {n : ℕ} (w m : Preferences n) : DAState n
Defined in
EconCSLib, `GS.finalState`
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 4
  • GS.daRunRun DA for at most fuel steps, stopping early if no free men remain.
  • GS.initStateInitial state: all women free, all men start at proposal index 0.
  • GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
Used by 13

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
/-- `finalState`: run `daRun` with fuel `n*n + 1` from `initState`. -/
noncomputable def GS.finalState {n : ℕ} (w m : Preferences n) : DAState n :=
  daRun w m (n * n + 1) (initState n)
See it in the graphDiscuss this resultChallenge it