MatrixGame.optimalColumnSet_isClosed
theoremverifiedformalizationimported Lean
MatrixGame.optimalColumnSet_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.optimalColumnSet_isClosed : IsClosed A.optimalColumnSet
- Formalizes
- EconCSLib, `MatrixGame.optimalColumnSet_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.optimalColumnSet_isClosed← MatrixGame.optimalColumnSet_isClosed (EconCSLib/GameTheory/StrategicGame/ZeroSum/OptimalStrategySetPolytope.lean:231): 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.optimalColumnSetH-representation of the column-optimal strategy set in the ambient space
J → ℝ. - MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGameMatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
- MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- MatrixGame.valueThe value of a matrix game (
- Used by 2
- MatrixGame.optimalColumnStrategies_image_isPolytopeMatrixGame.optimalColumnStrategies_image_isPolytope
- MatrixGame.optimalColumnSet_isCompactMatrixGame.optimalColumnSet_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.optimalColumnSet_isClosed : IsClosed A.optimalColumnSet := by have hsimplex : IsClosed (stdSimplex ℝ J) := isClosed_stdSimplex ℝ J apply IsClosed.inter hsimplex apply isClosed_iInter intro i exact IsClosed.preimage (continuous_finset_sum _ (fun j _ => (continuous_apply j).mul continuous_const)) isClosed_Iic