MatrixGame.optimalRowSet_convex
theoremverifiedformalizationimported Lean
MatrixGame.optimalRowSet_convex
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_convex : Convex ℝ A.optimalRowSet
- Formalizes
- EconCSLib, `MatrixGame.optimalRowSet_convex`
- 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_convex← MatrixGame.optimalRowSet_convex (EconCSLib/GameTheory/StrategicGame/ZeroSum/OptimalStrategySetPolytope.lean:102): 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 1
- MatrixGame.optimalRowStrategies_image_isPolytopeThe row-optimal strategy set is a nonempty polytope: convex, closed, compact, and nonempty.
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_convex : Convex ℝ A.optimalRowSet := by apply Convex.inter (convex_stdSimplex ℝ I) apply convex_iInter intro j -- Half-space {f | A.value ≤ ∑ i, f i * A.g i j} is convex. intro f hf g hg a b ha hb hab show A.value ≤ ∑ i, (a • f + b • g) i * A.g i j have hf' : A.value ≤ ∑ i, f i * A.g i j := hf have hg' : A.value ≤ ∑ i, g i * A.g i j := hg have hexpand : ∑ i, (a • f + b • g) i * A.g i j = a * (∑ i, f i * A.g i j) + b * (∑ i, g i * A.g i j) := by rw [Finset.mul_sum, Finset.mul_sum, ← Finset.sum_add_distrib] apply Finset.sum_congr rfl intro i _ simp only [Pi.add_apply, Pi.smul_apply, smul_eq_mul] ring rw [hexpand] calc A.value = (a + b) * A.value := by rw [hab]; ring _ = a * A.value + b * A.value := by ring _ ≤ a * (∑ i, f i * A.g i j) + b * (∑ i, g i * A.g i j) := by gcongr