MatrixGame.optimalRowSet_isClosed
theoremverifiedformalizationimported Lean
MatrixGame.optimalRowSet_isClosed
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 theorem MatrixGame.optimalRowSet_isClosed : IsClosed A.optimalRowSet
- Formalizes
- EconCSLib, `MatrixGame.optimalRowSet_isClosed`
- 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_isClosed← MatrixGame.optimalRowSet_isClosed (EconCSLib/GameTheory/StrategicGame/ZeroSum/OptimalStrategySetPolytope.lean:124): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- 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.optimalRowSetH-representation of the row-optimal strategy set in the ambient space
I → ℝ: the standard simplex intersected with the finitely many… - MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- MatrixGame.valueThe value of a matrix game (
- Used by 2
- MatrixGame.optimalRowStrategies_image_isPolytopeThe row-optimal strategy set is a nonempty polytope: convex, closed, compact, and nonempty.
- MatrixGame.optimalRowSet_isCompactMatrixGame.optimalRowSet_isCompact
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators Set inset_option linter.unusedSectionVars false inuniverse u invariable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] invariable (A : MatrixGame I J ℝ) intheorem MatrixGame.optimalRowSet_isClosed : IsClosed A.optimalRowSet := by have hsimplex : IsClosed (stdSimplex ℝ I) := isClosed_stdSimplex ℝ I apply IsClosed.inter hsimplex apply isClosed_iInter intro j -- {f | A.value ≤ ∑ i, f i * A.g i j} is closed: preimage of [A.value, ∞) -- under the continuous functional f ↦ ∑ i, f i * A.g i j. refine IsClosed.preimage ?_ isClosed_Ici exact continuous_finset_sum _ (fun i _ => (continuous_apply i).mul continuous_const)