MatrixGame.toStrategicGame_isZeroSum
theoremverifiedformalizationimported Lean
A.toStrategicGame satisfies the abstract zero-sum predicate: by construction player 1's payoff is the negation of player 0's.
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 theorem MatrixGame.toStrategicGame_isZeroSum {π : Type} [Field π] [LinearOrder π] [IsStrictOrderedRing π] (A : MatrixGame I J π) : EconCSLib.StrategicGame.IsZeroSum A.toStrategicGame
- Formalizes
- EconCSLib, `MatrixGame.toStrategicGame_isZeroSum`
- 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.toStrategicGame_isZeroSum← MatrixGame.toStrategicGame_isZeroSum (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:499): adapted
What was changed in
MatrixGame.toStrategicGame_isZeroSum--- EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:499 (MatrixGame.toStrategicGame_isZeroSum) +++ as compiled here @@ -1,7 +1,12 @@ -/-- `A.toStrategicGame` satisfies the abstract zero-sum predicate: by -construction player 1's payoff is the negation of player 0's. -/ -theorem toStrategicGame_isZeroSum {π : 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 +theorem MatrixGame.toStrategicGame_isZeroSum {π : Type} [Field π] [LinearOrder π] [IsStrictOrderedRing π] (A : MatrixGame I J π) : - StrategicGame.IsZeroSum A.toStrategicGame := by + EconCSLib.StrategicGame.IsZeroSum A.toStrategicGame := by intro Ο - Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- 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β¦ - MatrixGame.toStrategicGameThe two-player zero-sum strategic game associated with a matrix game. See
MatrixGame.toStrategicGame_isZeroSumfor the proof that this⦠- 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. - EconCSLib.StrategicGameA strategic game (normal-form game) with players
Nand utilities inU. The structure records only the bare data: strategy spaces and aβ¦
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 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/-- `A.toStrategicGame` satisfies the abstract zero-sum predicate: by construction player 1's payoff is the negation of player 0's. -/theorem MatrixGame.toStrategicGame_isZeroSum {π : Type} [Field π] [LinearOrder π] [IsStrictOrderedRing π] (A : MatrixGame I J π) : EconCSLib.StrategicGame.IsZeroSum A.toStrategicGame := by intro Ο show A.g (Ο 0) (Ο 1) + -(A.g (Ο 0) (Ο 1)) = 0 ring