MatrixGame.optimalRowSet
defimported Lean
H-representation of the row-optimal strategy set in the ambient space I → ℝ: the standard simplex intersected with the finitely many half-spaces A.value ≤ ∑ i, f i * A.g i j, one per pure column j.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Set 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.optimalRowSet : Set (I → ℝ)
- Defined in
- EconCSLib, `MatrixGame.optimalRowSet`
- 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.optimalRowSet← MatrixGame.optimalRowSet (EconCSLib/GameTheory/StrategicGame/ZeroSum/OptimalStrategySetPolytope.lean:56): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- MatrixGame.valueThe value of a matrix game (
sSup-based; needs order completeness). Equal to both maximin and minimax by the minimax theorem… - MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGameMatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame
- 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.instNonemptyStrategyFinOfNatNatToStrategicGameMatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
- MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- MatrixGame.valueThe value of a matrix game (
- Used by 6
- MatrixGame.optimalRowSet_isClosedMatrixGame.optimalRowSet_isClosed
- MatrixGame.optimalRowStrategies_image_isPolytopeThe row-optimal strategy set is a nonempty polytope: convex, closed, compact, and nonempty.
- MatrixGame.optimalRowSet_nonemptyMatrixGame.optimalRowSet_nonempty
- MatrixGame.optimalRowSet_convexMatrixGame.optimalRowSet_convex
- MatrixGame.image_optimalRowStrategies_eqThe image of the row-optimal subtype set equals the H-representation polytope
A.optimalRowSet. - MatrixGame.optimalRowSet_isCompactMatrixGame.optimalRowSet_isCompact
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Set 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 /-- H-representation of the row-optimal strategy set in the ambient space `I → ℝ`: the standard simplex intersected with the finitely many half-spaces `A.value ≤ ∑ i, f i * A.g i j`, one per pure column `j`. -/ def MatrixGame.optimalRowSet : Set (I → ℝ) := stdSimplex ℝ I ∩ ⋂ j : J, {f : I → ℝ | A.value ≤ ∑ i, f i * A.g i j}