MatrixGame.IsSaddlePoint
abbrevimported Lean
A pair of mixed strategies is a saddle point when player I's payoff is maximised by the row strategy against the column strategy and minimised by the column strategy against the row strategy. For a matrix game this is synonymous with the mixed Nash equilibrium predicate [MatrixGame.IsMixedNashEq].
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 abbrev MatrixGame.IsSaddlePoint {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) (xx : stdSimplex 𝕜 I) (yy : stdSimplex 𝕜 J) : Prop
- Defined in
- EconCSLib, `MatrixGame.IsSaddlePoint`
- 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.IsSaddlePoint← MatrixGame.IsSaddlePoint (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:74): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- 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… - MatrixGame.IsMixedNashEqSaddle-point form of a mixed Nash equilibrium for a matrix game. For zero-sum two-player games, the standard mixed-strategy Nash…
- MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
- Used by 2
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs ↔ saddle points. A pair of mixed strategies is in the product
X(A) × Y(A)of optimal strategy sets iff it is a saddle… - MatrixGame.isMixedNashEq_iff_isSaddlePointNash equilibrium ↔ saddle point for matrix games. Both sides unfold to the same saddle-point inequality system; the equivalence is…
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs ↔ saddle points. A pair of mixed strategies is in the product
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 /-- A pair of mixed strategies is a **saddle point** when player I's payoff is maximised by the row strategy against the column strategy and minimised by the column strategy against the row strategy. For a matrix game this is synonymous with the mixed Nash equilibrium predicate [`MatrixGame.IsMixedNashEq`]. -/ abbrev MatrixGame.IsSaddlePoint {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) (xx : stdSimplex 𝕜 I) (yy : stdSimplex 𝕜 J) : Prop := A.IsMixedNashEq xx yy