EconCSLib.StrategicGame.IsZeroSum.decidable
instanceimported Lean
StrategicGame.IsZeroSum.decidable
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {U : Type*} in instance EconCSLib.StrategicGame.IsZeroSum.decidable [Add U] [Zero U] [DecidableEq U] {G : EconCSLib.StrategicGame (Fin 2) U} [∀ i, Fintype (G.strategy i)] : Decidable (IsZeroSum G)
- Defined in
- EconCSLib, `StrategicGame.IsZeroSum.decidable`
- 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.EconCSLib.StrategicGame.IsZeroSum.decidable← StrategicGame.IsZeroSum.decidable (EconCSLib/GameTheory/StrategicGame/ZeroSum/Basic.lean:132): adapted
What was changed in
EconCSLib.StrategicGame.IsZeroSum.decidable--- EconCSLib/GameTheory/StrategicGame/ZeroSum/Basic.lean:132 (StrategicGame.IsZeroSum.decidable) +++ as compiled here @@ -1,3 +1,6 @@ -instance IsZeroSum.decidable [Add U] [Zero U] [DecidableEq U] - {G : StrategicGame (Fin 2) U} +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +variable {U : Type*} in +instance EconCSLib.StrategicGame.IsZeroSum.decidable [Add U] [Zero U] [DecidableEq U] + {G : EconCSLib.StrategicGame (Fin 2) U} [∀ i, Fintype (G.strategy i)] : - Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- EconCSLib.StrategicGame.IsZeroSumA two-player game is zero-sum if payoffs sum to zero at every profile. [MSZ 4.39]
- EconCSLib.StrategicGame.ProfileThe type of strategy profiles for game
G: each player picks a strategy. This is a dependent function∀ i, G.strategy i. The profile… - EconCSLib.StrategicGameA strategic game (normal-form game) with players
Nand utilities inU. The structure records only the bare data: strategy spaces and a…
- Used by 18
- 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.IsZeroSum.nash_payoff_eqIn a zero-sum game, all Nash equilibria yield the same payoff for player 0. [MSZ Theorem 4.44-4.45]
- MatrixGame.exists_strategic_game_nash_equilibriumThe strategic-game embedding of a finite matrix game admits a mixed Nash equilibrium. Combines…
- MatrixGame.toStrategicGame_isZeroSum
A.toStrategicGamesatisfies the abstract zero-sum predicate: by construction player 1's payoff is the negation of player 0's. - 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.IsConstantSum.nash_payoff_eq_p1In a constant-sum game, all Nash equilibria yield the same payoff for player 1.
- EconCSLib.StrategicGame.IsZeroSum.expectedPayoff_negIn a zero-sum game, player 1's expected payoff is the negation of player 0's.
- MatrixGame.toMixedProfile_zeroMatrixGame.toMixedProfile_zero
- EconCSLib.StrategicGame.IsZeroSum.expectedPayoff_add_zeroMixed-strategy version of the zero-sum axiom: expected payoffs sum to
0. - EconCSLib.StrategicGame.IsZeroSum.expectedPayoff_neg'In a zero-sum game, player 0's expected payoff is the negation of player 1's.
- EconCSLib.StrategicGame.IsZeroSum.nash_payoff_eq_p1In a zero-sum game, all Nash equilibria yield the same payoff for player 1.
- MatrixGame.expectedPayoff_toStrategicGame_oneMirror:
expectedPayoff A.toStrategicGame p 1 = -(A.E (p 0) (p 1)). - MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGameMatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
- MatrixGame.toMixedProfileBuild a
MixedProfileoftoStrategicGamefrom a saddle-point pair. - MatrixGame.toMixedProfile_oneMatrixGame.toMixedProfile_one
- EconCSLib.StrategicGame.IsConstantSum.nash_payoff_eqIn a constant-sum game, all Nash equilibria yield the same payoff for player 0. [MSZ Theorem 4.44–4.45]
- MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
- MatrixGame.expectedPayoff_toStrategicGame_zeroBridge lemma:
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {U : Type*} in instance EconCSLib.StrategicGame.IsZeroSum.decidable [Add U] [Zero U] [DecidableEq U] {G : EconCSLib.StrategicGame (Fin 2) U} [∀ i, Fintype (G.strategy i)] : Decidable (IsZeroSum G) := Fintype.decidableForallFintype