MatrixGame.optimalColumnStrategies
defimported Lean
The set of optimal column strategies: mixed strategies that achieve the minimax value.
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 def MatrixGame.optimalColumnStrategies {𝕜 : Type} [Field 𝕜] [ConditionallyCompleteLinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) : Set (stdSimplex 𝕜 J)
- Defined in
- EconCSLib, `MatrixGame.optimalColumnStrategies`
- 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.optimalColumnStrategies← MatrixGame.optimalColumnStrategies (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:120): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- MatrixGame.valueThe value of a matrix game (
sSup-based; needs order completeness). Equal to both maximin and minimax by the minimax theorem… - MatrixGame.guarantee_IIPlayer II's guaranteed loss using mixed strategy
y: the maximum expected payoff (for Player I) over all of Player I's pure responses. - 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.valueThe value of a matrix game (
- Used by 8
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs ↔ saddle points. A pair of mixed strategies is in the product
X(A) × Y(A)of optimal strategy sets iff it is a saddle… - saddle_gap_low_value_symmetric_approx_nashLet n be a positive natural number with
[NeZero n]. Let A : Matrix (Fin n) (Fin n) ℝ be an n-by-n real matrix with entries in [0, 1]… - MatrixGame.optimalColumnStrategies_image_isPolytopeMatrixGame.optimalColumnStrategies_image_isPolytope
- MatrixGame.image_optimalColumnStrategies_eqMatrixGame.image_optimalColumnStrategies_eq
- MatrixGame.support_complementarity_columnSupport complementarity (column). For an optimal pair
(xx, yy), every columnjwith positive probability underyyis a best… - MatrixGame.mem_optimalColumnStrategies_iff_E_leA column strategy is optimal iff against every mixed row it caps payoff at the value.
- MatrixGame.support_complementarity_rowSupport complementarity (row). For an optimal pair
(xx, yy), every rowiwith positive probability underxxis a best response… - saddle_gap_guarantee_II_le_of_mem_optimalColumnStrategiesFor a positive natural number n, an n-by-n real matrix A, and a strategy x in
stdSimplex ℝ (Fin n), if x is an optimal column strategy…
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs ↔ saddle points. A pair of mixed strategies is in the product
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 set of **optimal column strategies**: mixed strategies that achieve the minimax value. -/ def MatrixGame.optimalColumnStrategies {𝕜 : Type} [Field 𝕜] [ConditionallyCompleteLinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) : Set (stdSimplex 𝕜 J) := { yy | A.guarantee_II yy = A.value }