MatrixGame.image_optimalRowStrategies_eq
theoremverifiedformalizationimported Lean
The image of the row-optimal subtype set equals the H-representation polytope A.optimalRowSet.
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.image_optimalRowStrategies_eq : (Subtype.val '' A.optimalRowStrategies) = A.optimalRowSet
- Formalizes
- EconCSLib, `MatrixGame.image_optimalRowStrategies_eq`
- 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.image_optimalRowStrategies_eq← MatrixGame.image_optimalRowStrategies_eq (EconCSLib/GameTheory/StrategicGame/ZeroSum/OptimalStrategySetPolytope.lean:66): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 15
- MatrixGame.optimalRowStrategiesThe set of optimal row strategies: mixed strategies that achieve the maximin value.
- 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
- wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - stdSimplex.purePoint-mass simplex element at
i₀. - MatrixGame.EExpected payoff when Player I uses mixed strategy
xand Player II usesy. - 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… - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- wsum_wsum_commExchange order of double weighted sums.
- stdSimplex.pure_applystdSimplex.pure_apply
- 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.mem_optimalRowStrategies_iff_E_geA row strategy is optimal iff against every mixed column it secures the value.
- MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- ge_iff_simplex_ge
f ≥ vpointwise iff every simplex weighted sum is≥ v.
- 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 ℝ) in/-- The image of the row-optimal subtype set equals the H-representation polytope `A.optimalRowSet`. -/theorem MatrixGame.image_optimalRowStrategies_eq : (Subtype.val '' A.optimalRowStrategies) = A.optimalRowSet := by classical ext f constructor · rintro ⟨xx, hxx, rfl⟩ refine ⟨xx.property, ?_⟩ rw [mem_iInter] intro j have hpair := (A.mem_optimalRowStrategies_iff_E_ge xx).mp hxx (stdSimplex.pure j) have heq : A.E xx (stdSimplex.pure j) = ∑ i, xx.val i * A.g i j := by show wsum xx (fun i => wsum (stdSimplex.pure j) (A.g i)) = ∑ i, xx.val i * A.g i j apply Finset.sum_congr rfl intro i _ show xx.val i * wsum (stdSimplex.pure j) (A.g i) = xx.val i * A.g i j rw [wsum_pure_apply] show A.value ≤ ∑ i, xx.val i * A.g i j rw [← heq]; exact hpair · rintro ⟨hf, hineq⟩ refine ⟨⟨f, hf⟩, ?_, rfl⟩ rw [mem_iInter] at hineq rw [A.mem_optimalRowStrategies_iff_E_ge ⟨f, hf⟩] intro y' have hEeq : A.E ⟨f, hf⟩ y' = wsum y' (fun j => ∑ i, f i * A.g i j) := by show wsum ⟨f, hf⟩ (fun i => wsum y' (A.g i)) = wsum y' (fun j => ∑ i, f i * A.g i j) have hcomm : wsum ⟨f, hf⟩ (fun i => wsum y' (A.g i)) = wsum y' (fun j => wsum ⟨f, hf⟩ (fun i => A.g i j)) := wsum_wsum_comm ⟨f, hf⟩ y' A.g rw [hcomm] rfl rw [hEeq] have hbound : ∀ j, A.value ≤ ∑ i, f i * A.g i j := hineq exact (ge_iff_simplex_ge.mp hbound) y'