MatrixGame.optimalColumnStrategies_image_isPolytope
theoremverifiedformalizationimported Lean
MatrixGame.optimalColumnStrategies_image_isPolytope
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MatrixGame 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.optimalColumnStrategies_image_isPolytope : Convex ℝ (Subtype.val '' A.optimalColumnStrategies) ∧ IsClosed (Subtype.val '' A.optimalColumnStrategies) ∧ IsCompact (Subtype.val '' A.optimalColumnStrategies) ∧ (Subtype.val '' A.optimalColumnStrategies).Nonempty
- Formalizes
- EconCSLib, `MatrixGame.optimalColumnStrategies_image_isPolytope`
- 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_image_isPolytope← MatrixGame.optimalColumnStrategies_image_isPolytope (EconCSLib/GameTheory/StrategicGame/ZeroSum/OptimalStrategySetPolytope.lean:276): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 13
- MatrixGame.image_optimalColumnStrategies_eqMatrixGame.image_optimalColumnStrategies_eq
- MatrixGame.optimalColumnSet_nonemptyMatrixGame.optimalColumnSet_nonempty
- 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.optimalColumnStrategiesThe set of optimal column strategies: mixed strategies that achieve the minimax value.
- MatrixGame.optimalColumnSetH-representation of the column-optimal strategy set in the ambient space
J → ℝ. - MatrixGame.optimalColumnSet_convexMatrixGame.optimalColumnSet_convex
- MatrixGame.optimalColumnSet_isClosedMatrixGame.optimalColumnSet_isClosed
- MatrixGame.optimalColumnSet_isCompactMatrixGame.optimalColumnSet_isCompact
- MatrixGame.toMixedProfile_zeroMatrixGame.toMixedProfile_zero
- MatrixGame.toMixedProfile_oneMatrixGame.toMixedProfile_one
- MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGameMatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame
- MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGameMatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
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 MatrixGame 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.optimalColumnStrategies_image_isPolytope : Convex ℝ (Subtype.val '' A.optimalColumnStrategies) ∧ IsClosed (Subtype.val '' A.optimalColumnStrategies) ∧ IsCompact (Subtype.val '' A.optimalColumnStrategies) ∧ (Subtype.val '' A.optimalColumnStrategies).Nonempty := by rw [A.image_optimalColumnStrategies_eq] exact ⟨A.optimalColumnSet_convex, A.optimalColumnSet_isClosed, A.optimalColumnSet_isCompact, A.optimalColumnSet_nonempty⟩