AFTD Auto-Formalizing Theoretical Domains

MatrixGame.toStrategicGame

defimported Lean

The two-player zero-sum strategic game associated with a matrix game. See MatrixGame.toStrategicGame_isZeroSum for the proof that this game satisfies the abstract StrategicGame.IsZeroSum predicate, so results stated against IsZeroSum (e.g. IsZeroSum.nash_payoff_eq) can be invoked on A.toStrategicGame without re-unfolding the definition.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
universe u in
variable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable (A : MatrixGame I J ℝ) in
noncomputable def MatrixGame.toStrategicGame {𝕜 : Type}
    [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
    (A : MatrixGame I J 𝕜) : EconCSLib.StrategicGame (Fin 2) 𝕜
Defined in
EconCSLib, `MatrixGame.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 MatrixGame.toStrategicGame
--- EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:487 (MatrixGame.toStrategicGame)
+++ as compiled here
@@ -1,10 +1,11 @@
-/-- The two-player zero-sum strategic game associated with a matrix game.
-
-See `MatrixGame.toStrategicGame_isZeroSum` for the proof that this game
-satisfies the abstract `StrategicGame.IsZeroSum` predicate, so results stated
-against `IsZeroSum` (e.g. `IsZeroSum.nash_payoff_eq`) can be invoked on
-`A.toStrategicGame` without re-unfolding the definition. -/
-noncomputable def toStrategicGame {𝕜 : Type}
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Finset BigOperators in
+set_option linter.unusedSectionVars false in
+universe u in
+variable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
+variable (A : MatrixGame I J ℝ) in
+noncomputable def MatrixGame.toStrategicGame {𝕜 : Type}
     [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
-    (A : MatrixGame I J 𝕜) : StrategicGame (Fin 2) 𝕜 where
+    (A : MatrixGame I J 𝕜) : EconCSLib.StrategicGame (Fin 2) 𝕜 where
   strategy
Verified
08 Oct 2026
Axioms
none listed
Built on 4
  • EconCSLib.StrategicGame.IsZeroSum.decidableStrategicGame.IsZeroSum.decidable
  • MatrixGameA finite two-player zero-sum matrix game. Player I chooses row i : I, Player II chooses column j : J. Payoff to Player I is g i j…
  • EconCSLib.StrategicGameA strategic game (normal-form game) with players N and utilities in U. The structure records only the bare data: strategy spaces and a…
  • StrategicGameA strategic-form game with player type Player consists of a family of strategy types Strategy i for each player i : Player, and a…
Used by 21

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
universe u in
variable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable (A : MatrixGame I J ℝ) in
/-- The two-player zero-sum strategic game associated with a matrix game. See `MatrixGame.toStrategicGame_isZeroSum` for the proof that this game satisfies the abstract `StrategicGame.IsZeroSum` predicate, so results stated against `IsZeroSum` (e.g. `IsZeroSum.nash_payoff_eq`) can be invoked on `A.toStrategicGame` without re-unfolding the definition. -/
noncomputable def MatrixGame.toStrategicGame {𝕜 : Type}
    [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
    (A : MatrixGame I J 𝕜) : EconCSLib.StrategicGame (Fin 2) 𝕜 where
  strategy
  | 0 => I
  | 1 => J
  payoff σ
  | 0 => A.g (σ 0) (σ 1)
  | 1 => -(A.g (σ 0) (σ 1))
See it in the graphDiscuss this resultChallenge it