EconCSLib.StrategicGame.IsConstantSum.nash_payoff_eq_p1
theoremverifiedformalizationimported Lean
In a constant-sum game, all Nash equilibria yield the same payoff for player 1.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open EconCSLib.StrategicGame in variable {U : Type*} in set_option linter.unusedSectionVars false in variable [Field U] [LinearOrder U] [IsStrictOrderedRing U] in variable {G : EconCSLib.StrategicGame (Fin 2) U} in theorem EconCSLib.StrategicGame.IsConstantSum.nash_payoff_eq_p1 {c : U} (hcs : IsConstantSum G c) {σ τ : G.Profile} (hσ : IsNashEquilibrium G σ) (hτ : IsNashEquilibrium G τ) : G.payoff σ 1 = G.payoff τ 1
- Formalizes
- EconCSLib, `StrategicGame.IsConstantSum.nash_payoff_eq_p1`
- 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.IsConstantSum.nash_payoff_eq_p1← StrategicGame.IsConstantSum.nash_payoff_eq_p1 (EconCSLib/GameTheory/StrategicGame/ZeroSum/Basic.lean:264): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 10
- 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]
- 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.IsConstantSumA two-player game is constant-sum if payoffs sum to
cat every profile. - 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… - IsNashEquilibriumA profile
σis a pure Nash equilibrium of gameGif every player is playing a best response: no player can profitably deviate. - EconCSLib.StrategicGame.IsZeroSumA two-player game is zero-sum if payoffs sum to zero at every profile. [MSZ 4.39]
- EconCSLib.StrategicGame.Profile.deviate_selfDeviating to the same strategy is the identity.
- EconCSLib.StrategicGame.Profile.deviate_sameAt the deviated player, the updated profile returns the new strategy.
- EconCSLib.StrategicGame.Profile.deviate_of_neAt every other player, the updated profile is unchanged.
- EconCSLib.StrategicGame.IsZeroSum.decidableStrategicGame.IsZeroSum.decidable
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 EconCSLib.StrategicGame invariable {U : Type*} inset_option linter.unusedSectionVars false invariable [Field U] [LinearOrder U] [IsStrictOrderedRing U] invariable {G : EconCSLib.StrategicGame (Fin 2) U} in/-- In a constant-sum game, all Nash equilibria yield the same payoff for player 1. -/theorem EconCSLib.StrategicGame.IsConstantSum.nash_payoff_eq_p1 {c : U} (hcs : IsConstantSum G c) {σ τ : G.Profile} (hσ : IsNashEquilibrium G σ) (hτ : IsNashEquilibrium G τ) : G.payoff σ 1 = G.payoff τ 1 := by linarith [hcs σ, hcs τ, hcs.nash_payoff_eq hσ hτ]