MatrixGame.value
defimported Lean
The value of a matrix game (sSup-based; needs order completeness). Equal to both maximin and minimax by the minimax theorem ([MatrixGame.minimax_theorem]); the maximin = minimax equality is the ℝ-bound piece (Loomis). Field-generic existence of a value (without sSup) is the IsValue predicate in Minimax.lean.
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.value {𝕜 : Type} [Field 𝕜] [ConditionallyCompleteLinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) : 𝕜
- Defined in
- EconCSLib, `MatrixGame.value`
- 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.value← MatrixGame.value (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:92): 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.maximinThe maximin value: the best guarantee Player I can achieve.
maximin = sup_x inf_j E(x, j)
- MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
- Used by 28
- 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.optimalColumnSet_isCompactMatrixGame.optimalColumnSet_isCompact
- MatrixGame.optimalRowStrategiesThe set of optimal row strategies: mixed strategies that achieve the maximin value.
- MatrixGame.image_optimalColumnStrategies_eqMatrixGame.image_optimalColumnStrategies_eq
- MatrixGame.optimalRowSet_isClosedMatrixGame.optimalRowSet_isClosed
- MatrixGame.optimalColumnStrategiesThe set of optimal column strategies: mixed strategies that achieve the minimax value.
- MatrixGame.value_eq_minimaxMatrixGame.value_eq_minimax
- MatrixGame.support_complementarity_columnSupport complementarity (column). For an optimal pair
(xx, yy), every columnjwith positive probability underyyis a best… - MatrixGame.optimalColumnSet_isClosedMatrixGame.optimalColumnSet_isClosed
- MatrixGame.IsEpsilonOptimalColumnAn ε-optimal column strategy caps player I's payoff at
value + ε. - MatrixGame.value_eq_maximinMatrixGame.value_eq_maximin
- MatrixGame.optimalColumnSetH-representation of the column-optimal strategy set in the ambient space
J → ℝ. - MatrixGame.IsValue
vis the value ofA(saddle-point form): there exist a row mixed strategyxand column mixed strategyysuch thatx… - 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.mem_optimalColumnStrategies_iff_E_leA column strategy is optimal iff against every mixed row it caps payoff at the value.
- MatrixGame.optimalRowSet_convexMatrixGame.optimalRowSet_convex
- MatrixGame.image_optimalRowStrategies_eqThe image of the row-optimal subtype set equals the H-representation polytope
A.optimalRowSet. - MatrixGame.IsEpsilonOptimalRowAn ε-optimal row strategy guarantees at least
value - ε. - MatrixGame.optimalRowSetH-representation of the row-optimal strategy set in the ambient space
I → ℝ: the standard simplex intersected with the finitely many… - MatrixGame.optimalRowSet_isCompactMatrixGame.optimalRowSet_isCompact
- MatrixGame.mem_optimalRowStrategies_iff_E_geA row strategy is optimal iff against every mixed column it secures 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.optimalColumnSet_convexMatrixGame.optimalColumnSet_convex
- saddle_gap_marginal_payoff_boundsLet n be a positive natural number. For any matrix A : Matrix (Fin n) (Fin n) ℝ with non-negative entries and any optimal row strategy σ…
- MatrixGame.optimalColumnSet_nonemptyMatrixGame.optimalColumnSet_nonempty
- 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 **value** of a matrix game (`sSup`-based; needs order completeness). Equal to both maximin and minimax by the minimax theorem ([`MatrixGame.minimax_theorem`]); the maximin = minimax equality is the ℝ-bound piece (Loomis). Field-generic existence of a value (without `sSup`) is the `IsValue` predicate in `Minimax.lean`. -/ noncomputable def MatrixGame.value {𝕜 : Type} [Field 𝕜] [ConditionallyCompleteLinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) : 𝕜 := A.maximin