MatrixGame.dualityGap
defimported Lean
Point-wise duality gap at a strategy pair: the column player's realised loss-cap minus the row player's realised guarantee. Always nonnegative, zero exactly at optimal pairs. Field-generic: just the difference of two L2 guarantees, no sup/inf.
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 noncomputable def MatrixGame.dualityGap {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) (xx : stdSimplex 𝕜 I) (yy : stdSimplex 𝕜 J) : 𝕜
- Defined in
- EconCSLib, `MatrixGame.dualityGap`
- 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.dualityGap← MatrixGame.dualityGap (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGameNash.lean:107): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- MatrixGame.guarantee_IIPlayer II's guaranteed loss using mixed strategy
y: the maximum expected payoff (for Player I) over all of Player I's pure responses. - 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.guarantee_IPlayer I's guaranteed payoff using mixed strategy
x: the minimum expected payoff over all of Player II's pure responses. A finite…
- MatrixGame.guarantee_IIPlayer II's guaranteed loss using mixed strategy
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 /-- **Point-wise duality gap** at a strategy pair: the column player's realised loss-cap minus the row player's realised guarantee. Always nonnegative, zero exactly at optimal pairs. Field-generic: just the difference of two L2 guarantees, no sup/inf. -/ noncomputable def MatrixGame.dualityGap {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] (A : MatrixGame I J 𝕜) (xx : stdSimplex 𝕜 I) (yy : stdSimplex 𝕜 J) : 𝕜 := A.guarantee_II yy - A.guarantee_I xx