MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
instanceimported Lean
MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators 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 instance MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) (i : Fin 2) : Nonempty (A.toStrategicGame.strategy i)
- Defined in
- EconCSLib, `MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame`
- 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.instNonemptyStrategyFinOfNatNatToStrategicGame← @EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:523 (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:523): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 6
- MatrixGame.toStrategicGameThe two-player zero-sum strategic game associated with a matrix game. See
MatrixGame.toStrategicGame_isZeroSumfor the proof that this… - MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGameMatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame
- EconCSLib.StrategicGame.IsZeroSum.decidableStrategicGame.IsZeroSum.decidable
- 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… - EconCSLib.StrategicGameA strategic game (normal-form game) with players
Nand utilities inU. The structure records only the bare data: strategy spaces and a… - MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- MatrixGame.toStrategicGameThe two-player zero-sum strategic game associated with a matrix game. See
- Used by 32
- MatrixGame.expectedPayoff_toStrategicGame_zeroBridge lemma:
expectedPayoff A.toStrategicGame p 0 = A.E (p 0) (p 1). Reduces both sides to the canonical double sum… - EconCSLib.StrategicGame.MatrixGame.disp_EjColumn-side payoff under
disp A:Ej x j = (xA)_j − x_j. - MatrixGame.optimalColumnStrategies_image_isPolytopeMatrixGame.optimalColumnStrategies_image_isPolytope
- MatrixGame.AdmissibleSequence.muCumulative duality gap
μ(t) := max_i β^i(t) - min_j α^j(t). - MatrixGame.exists_strategic_game_nash_equilibriumThe strategic-game embedding of a finite matrix game admits a mixed Nash equilibrium. Combines…
- MatrixGame.optimalColumnSet_isCompactMatrixGame.optimalColumnSet_isCompact
- MatrixGame.image_optimalColumnStrategies_eqMatrixGame.image_optimalColumnStrategies_eq
- MatrixGame.AdmissibleSequence.IsRowUsefulInWindowA pure row
iis useful in the window[s, s + t*]if there is a step inside the window at whichiis among the row player's… - MatrixGame.optimalRowSet_isClosedMatrixGame.optimalRowSet_isClosed
- MatrixGame.AdmissibleSequenceAn admissible sequence on a matrix game
A(Robinson 1951 setup). Records cumulative counterfactual payoff vectorsα(t) : J → ℝ… - EconCSLib.StrategicGame.MatrixGame.disp_Ei_uniformUnder the uniform distribution, the column-side payoff under
disp Ais zero (whenAis stochastic). - MatrixGame.toMixedProfile_zeroMatrixGame.toMixedProfile_zero
- MatrixGame.optimalColumnSet_isClosedMatrixGame.optimalColumnSet_isClosed
- MatrixGame.optimalRowStrategies_image_isPolytopeThe row-optimal strategy set is a nonempty polytope: convex, closed, compact, and nonempty.
- MSSMCharges.charges_eq_toSpecies_eqMSSMCharges.charges_eq_toSpecies_eq
- MatrixGame.optimalColumnSetH-representation of the column-optimal strategy set in the ambient space
J → ℝ. - MatrixGame.IsFictitiousPlayFictitious play realisation on a matrix game
A. At every stepn + 1, the row player picks a pure row best-responding to the column… - MatrixGame.optimalRowSet_nonemptyMatrixGame.optimalRowSet_nonempty
- EconCSLib.StrategicGame.MatrixGame.disp_Ei_argmin_nonnegFor any column-player strategy
y, picking the index whereyis minimal gives a non-negative row payoff underdisp A. - MatrixGame.expectedPayoff_toStrategicGame_oneMirror:
expectedPayoff A.toStrategicGame p 1 = -(A.E (p 0) (p 1)). - MatrixGame.AdmissibleSequence.IsColUsefulInWindowA pure column
jis useful in the window[s, s + t*]analogously. - MatrixGame.realisedCumPayoffRealised cumulative payoff along a play sequence on
A. - MatrixGame.optimalRowSet_convexMatrixGame.optimalRowSet_convex
- MatrixGame.image_optimalRowStrategies_eqThe image of the row-optimal subtype set equals the H-representation polytope
A.optimalRowSet. - EconCSLib.StrategicGame.MatrixGame.disp_EiRow-side payoff under
disp A:Ei i y = (Ay)_i − y_i. - MatrixGame.toMixedProfileBuild a
MixedProfileoftoStrategicGamefrom a saddle-point pair. - MatrixGame.optimalRowSetH-representation of the row-optimal strategy set in the ambient space
I → ℝ: the standard simplex intersected with the finitely many… - MatrixGame.optimalRowSet_isCompactMatrixGame.optimalRowSet_isCompact
- MatrixGame.normMax
‖A‖ := max_{i,j} |A_{i,j}|, the entrywise sup norm of the payoff matrix. Field-generic in the abstract, but the Robinson analysis is… - MatrixGame.toMixedProfile_oneMatrixGame.toMixedProfile_one
- MatrixGame.optimalColumnSet_convexMatrixGame.optimalColumnSet_convex
- MatrixGame.optimalColumnSet_nonemptyMatrixGame.optimalColumnSet_nonempty
- MatrixGame.expectedPayoff_toStrategicGame_zeroBridge lemma:
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators 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 instance MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) (i : Fin 2) : Nonempty (A.toStrategicGame.strategy i) := by match i with | 0 => exact ‹Nonempty I› | 1 => exact ‹Nonempty J›