MatrixGame.image_optimalColumnStrategies_eq
theoremverifiedformalizationimported Lean
MatrixGame.image_optimalColumnStrategies_eq
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.image_optimalColumnStrategies_eq : (Subtype.val '' A.optimalColumnStrategies) = A.optimalColumnSet
- Formalizes
- EconCSLib, `MatrixGame.image_optimalColumnStrategies_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_optimalColumnStrategies_eq← MatrixGame.image_optimalColumnStrategies_eq (EconCSLib/GameTheory/StrategicGame/ZeroSum/OptimalStrategySetPolytope.lean:184): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 16
- MatrixGame.mem_optimalColumnStrategies_iff_E_leA column strategy is optimal iff against every mixed row it caps payoff at the value.
- 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.valueThe value of a matrix game (
sSup-based; needs order completeness). Equal to both maximin and minimax by the minimax theorem… - MatrixGame.EExpected payoff when Player I uses mixed strategy
xand Player II usesy. - stdSimplex.purePoint-mass simplex element at
i₀. - wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- le_iff_simplex_le
f ≤ vpointwise iff every simplex weighted sum is≤ v. - stdSimplex.pure_applystdSimplex.pure_apply
- MatrixGame.toMixedProfile_zeroMatrixGame.toMixedProfile_zero
- MatrixGame.toMixedProfile_oneMatrixGame.toMixedProfile_one
- MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGameMatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame
- MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGameMatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
- Used by 1
- MatrixGame.optimalColumnStrategies_image_isPolytopeMatrixGame.optimalColumnStrategies_image_isPolytope
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.image_optimalColumnStrategies_eq : (Subtype.val '' A.optimalColumnStrategies) = A.optimalColumnSet := by classical ext g constructor · rintro ⟨yy, hyy, rfl⟩ refine ⟨yy.property, ?_⟩ rw [mem_iInter] intro i have hpair := (A.mem_optimalColumnStrategies_iff_E_le yy).mp hyy (stdSimplex.pure i) have heq : A.E (stdSimplex.pure i) yy = ∑ j, yy.val j * A.g i j := by show wsum (stdSimplex.pure i) (fun i' => wsum yy (A.g i')) = ∑ j, yy.val j * A.g i j rw [wsum_pure_apply] rfl show ∑ j, yy.val j * A.g i j ≤ A.value rw [← heq]; exact hpair · rintro ⟨hg, hineq⟩ refine ⟨⟨g, hg⟩, ?_, rfl⟩ rw [mem_iInter] at hineq rw [A.mem_optimalColumnStrategies_iff_E_le ⟨g, hg⟩] intro x' have hEeq : A.E x' ⟨g, hg⟩ = wsum x' (fun i => ∑ j, g j * A.g i j) := rfl rw [hEeq] have hbound : ∀ i, ∑ j, g j * A.g i j ≤ A.value := hineq exact (le_iff_simplex_le.mp hbound) x'