AFTD Auto-Formalizing Theoretical Domains

MatrixGame.payoffAgainstColumn

defimported Lean

Expected payoff when Player I uses mixed strategy x against pure column j.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable {๐•œ : Type} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable (A : MatrixGame I J ๐•œ) in
noncomputable def MatrixGame.payoffAgainstColumn (x : stdSimplex ๐•œ I) (j : J) : ๐•œ
Defined in
EconCSLib, `MatrixGame.payoffAgainstColumn`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 1
  • MatrixGameA finite two-player zero-sum matrix game. Player I chooses row i : I, Player II chooses column j : J. Payoff to Player I is g i jโ€ฆ
Used by 2
  • MatrixGame.EjExpected payoff when Player I uses x against pure column j.
  • saddle_gap_marginal_payoff_boundsLet n be a positive natural number. For any matrix A : Matrix (Fin n) (Fin n) โ„ with non-negative entries and any optimal row strategy ฯƒโ€ฆ

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable {๐•œ : Type} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable (A : MatrixGame I J ๐•œ) in
/-- Expected payoff when Player I uses mixed strategy `x` against pure column `j`. -/
noncomputable def MatrixGame.payoffAgainstColumn (x : stdSimplex ๐•œ I) (j : J) : ๐•œ :=
  x โฌแตฅ fun i => A.g i j
See it in the graphDiscuss this resultChallenge it