MatrixGame.toMixedProfile
defimported Lean
Build a MixedProfile of toStrategicGame from a saddle-point pair.
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 variable [DecidableEq I] [DecidableEq J] in noncomputable def MatrixGame.toMixedProfile {π : Type} [Field π] [LinearOrder π] [IsStrictOrderedRing π] (A : MatrixGame I J π) (xx : stdSimplex π I) (yy : stdSimplex π J) : EconCSLib.StrategicGame.MixedProfile A.toStrategicGame
- Defined in
- EconCSLib, `MatrixGame.toMixedProfile`
- 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.toMixedProfile← MatrixGame.toMixedProfile (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:533): adapted
What was changed in
MatrixGame.toMixedProfile--- EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:533 (MatrixGame.toMixedProfile) +++ as compiled here @@ -1,7 +1,13 @@ -/-- Build a `MixedProfile` of `toStrategicGame` from a saddle-point pair. -/ -noncomputable def toMixedProfile {π : Type} +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 +variable [DecidableEq I] [DecidableEq J] in +noncomputable def MatrixGame.toMixedProfile {π : Type} [Field π] [LinearOrder π] [IsStrictOrderedRing π] (A : MatrixGame I J π) (xx : stdSimplex π I) (yy : stdSimplex π J) : - StrategicGame.MixedProfile A.toStrategicGame - | 0 => xx + EconCSLib.StrategicGame.MixedProfile A.toStrategicGame | 0 => xx | 1 => yy - Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 10
- EconCSLib.StrategicGame.MixedStrategyA mixed strategy for player
i: a probability distribution over pure strategies. Requires[Fintype (G.strategy i)]but NOT[Fintype N]. - 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.StrategicGame.IsZeroSum.expectedPayoff_add_zeroMixed-strategy version of the zero-sum axiom: expected payoffs sum to
0. - MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGameMatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
- EconCSLib.StrategicGameA strategic game (normal-form game) with players
Nand utilities inU. The structure records only the bare data: strategy spaces and a⦠- EconCSLib.StrategicGame.MixedProfileA mixed profile: each player has a mixed strategy. No finiteness constraint on
N(player set can be arbitrary). - MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- EconCSLib.StrategicGame.MixedStrategyA mixed strategy for player
- Used by 3
- MatrixGame.exists_strategic_game_nash_equilibriumThe strategic-game embedding of a finite matrix game admits a mixed Nash equilibrium. Combinesβ¦
- MatrixGame.toMixedProfile_zeroMatrixGame.toMixedProfile_zero
- MatrixGame.toMixedProfile_oneMatrixGame.toMixedProfile_one
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 variable [DecidableEq I] [DecidableEq J] in /-- Build a `MixedProfile` of `toStrategicGame` from a saddle-point pair. -/ noncomputable def MatrixGame.toMixedProfile {π : Type} [Field π] [LinearOrder π] [IsStrictOrderedRing π] (A : MatrixGame I J π) (xx : stdSimplex π I) (yy : stdSimplex π J) : EconCSLib.StrategicGame.MixedProfile A.toStrategicGame | 0 => xx | 1 => yy