MatrixGame.IsMinimax
defimported Lean
v is a minimax value of A: some column strategy caps player I's payoff at v (existence), and no strictly smaller cap is achievable (minimality).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in variable {๐ : Type} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] in variable (A : MatrixGame I J ๐) in def MatrixGame.IsMinimax (A : MatrixGame I J ๐) (v : ๐) : Prop
- Defined in
- EconCSLib, `MatrixGame.IsMinimax`
- 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.MatrixGame.IsMinimax← MatrixGame.IsMinimax (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGame.lean:134): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- MatrixGame.EiExpected payoff when pure row
ifaces Player II's mixed strategyy. - MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
i : I, Player II chooses columnj : J. Payoff to Player I isg i jโฆ
- MatrixGame.EiExpected payoff when pure row
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in variable {๐ : Type} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] in variable (A : MatrixGame I J ๐) in /-- `v` is a **minimax value** of `A`: some column strategy caps player I's payoff at `v` (existence), and no strictly smaller cap is achievable (minimality). -/ def MatrixGame.IsMinimax (A : MatrixGame I J ๐) (v : ๐) : Prop := (โ y : stdSimplex ๐ J, โ i, A.Ei i y โค v) โง (โ w, (โ y : stdSimplex ๐ J, โ i, A.Ei i y โค w) โ v โค w)