AFTD Auto-Formalizing Theoretical Domains

GameTree.toStrategicGame

defimported Lean

The strategic-form extraction of a finite perfect-information tree.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} in
variable [DecidableEq N] in
noncomputable def GameTree.toStrategicGame (g : GameTree N U) : EconCSLib.StrategicGame N U
Defined in
EconCSLib, `GameTree.toStrategicGame`
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.
What was changed in GameTree.toStrategicGame
--- EconCSLib/GameTheory/ExtensiveGame/GameTreeStrategicForm.lean:48 (GameTree.toStrategicGame)
+++ as compiled here
@@ -1,3 +1,7 @@
-/-- The strategic-form extraction of a finite perfect-information tree. -/
-noncomputable def toStrategicGame (g : GameTree N U) : StrategicGame N U where
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open GameTree in
+variable {N U : Type*} in
+variable [DecidableEq N] in
+noncomputable def GameTree.toStrategicGame (g : GameTree N U) : EconCSLib.StrategicGame N U where
   strategy := fun _ => PlayerStrategy N U
Verified
08 Oct 2026
Axioms
none listed
Built on 12

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} in
variable [DecidableEq N] in
/-- The strategic-form extraction of a finite perfect-information tree. -/
noncomputable def GameTree.toStrategicGame (g : GameTree N U) : EconCSLib.StrategicGame N U where
  strategy := fun _ => PlayerStrategy N U
  payoff σ i := outcome (profileStrategy σ) g i
See it in the graphDiscuss this resultChallenge it