AFTD Auto-Formalizing Theoretical Domains

MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame

instanceimported Lean

MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame

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
instance MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
    (A : MatrixGame I J 𝕜) [DecidableEq I] [DecidableEq J] (i : Fin 2) :
    DecidableEq (A.toStrategicGame.strategy i)
Defined in
EconCSLib, `MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame`
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
  • MatrixGame.toStrategicGameThe two-player zero-sum strategic game associated with a matrix game. See MatrixGame.toStrategicGame_isZeroSum for the proof that this…
  • 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…
Used by 33

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
instance MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
    (A : MatrixGame I J 𝕜) [DecidableEq I] [DecidableEq J] (i : Fin 2) :
    DecidableEq (A.toStrategicGame.strategy i) := by
  match i with
  | 0 => exact ‹DecidableEq I›
  | 1 => exact ‹DecidableEq J›
See it in the graphDiscuss this resultChallenge it