EconCSLib.StrategicGame.MatrixGame.disp
defimported Lean
The displacement matrix B i j := A i j − [i = j] of a stochastic matrix A. The corresponding matrix game has value 0.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in set_option linter.unusedSectionVars false in variable {I : Type} [Fintype I] [Nonempty I] [DecidableEq I] in def EconCSLib.StrategicGame.MatrixGame.disp (A : I → I → ℝ) : I → I → ℝ
- Defined in
- EconCSLib, `EconCSLib.StrategicGame.MatrixGame.disp`
- 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.MatrixGame.disp← EconCSLib.StrategicGame.MatrixGame.disp (EconCSLib/GameTheory/StrategicGame/ZeroSum/StochasticMatrix.lean:78): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 4
- EconCSLib.StrategicGame.MatrixGame.disp_EjColumn-side payoff under
disp A:Ej x j = (xA)_j − x_j. - EconCSLib.StrategicGame.MatrixGame.disp_Ei_uniformUnder the uniform distribution, the column-side payoff under
disp Ais zero (whenAis stochastic). - 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. - EconCSLib.StrategicGame.MatrixGame.disp_EiRow-side payoff under
disp A:Ei i y = (Ay)_i − y_i.
- EconCSLib.StrategicGame.MatrixGame.disp_EjColumn-side payoff under
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 variable {I : Type} [Fintype I] [Nonempty I] [DecidableEq I] in /-- The displacement matrix `B i j := A i j − [i = j]` of a stochastic matrix `A`. The corresponding matrix game has value `0`. -/ def EconCSLib.StrategicGame.MatrixGame.disp (A : I → I → ℝ) : I → I → ℝ := fun i j => A i j - (if i = j then 1 else 0)