MatrixGame.maximin
defimported Lean
The maximin value: the best guarantee Player I can achieve. maximin = sup_x inf_j E(x, j)
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 π] [ConditionallyCompleteLinearOrder π] [IsStrictOrderedRing π] in variable (A : MatrixGame I J π) in noncomputable def MatrixGame.maximin : π
- Defined in
- EconCSLib, `MatrixGame.maximin`
- 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.maximin← MatrixGame.maximin (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGame.lean:168): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- 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.guarantee_IPlayer I's guaranteed payoff using mixed strategy
x: the minimum expected payoff over all of Player II's pure responses. A finiteβ¦
- MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
- Used by 8
- MatrixGame.valueThe value of a matrix game (
sSup-based; needs order completeness). Equal to both maximin and minimax by the minimax theorem⦠- MatrixGame.maximin_le_minimaxMaximin †minimax (always holds, for any matrix game). This is the finite weak-duality inequality.
- MatrixGame.value_eq_maximinMatrixGame.value_eq_maximin
- MatrixGame.common_guarantee_eq_valueCommon guarantee gives the value. If both players guarantee the same scalar
w, thenwequals the game value. - MatrixGame.optimalRowSet_nonemptyMatrixGame.optimalRowSet_nonempty
- MatrixGame.minimax_theoremVon Neumann's Minimax Theorem: For any finite matrix game, maximin = minimax. [MSZ 5.11, von Neumann 1928] Proof: the generalβ¦
- MatrixGame.mem_optimalRowStrategies_iff_E_geA row strategy is optimal iff against every mixed column it secures the value.
- MatrixGame.optimalColumnSet_nonemptyMatrixGame.optimalColumnSet_nonempty
- MatrixGame.valueThe value of a matrix game (
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 π] [ConditionallyCompleteLinearOrder π] [IsStrictOrderedRing π] in variable (A : MatrixGame I J π) in /-- The maximin value: the best guarantee Player I can achieve. `maximin = sup_x inf_j E(x, j)` -/ noncomputable def MatrixGame.maximin : π := iSup (fun x => A.guarantee_I x)