AFTD Auto-Formalizing Theoretical Domains

expectedPayoffMatrix

defimported Lean

Expected payoff in a matrix game A : I โ†’ J โ†’ ๐•œ under mixed strategies.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable {I : Type*} [Fintype I] in
set_option linter.unusedSectionVars false in
variable {J : Type*} in
open Matrix in
def expectedPayoffMatrix (A : I โ†’ J โ†’ ๐•œ) [Fintype J]
    (x : stdSimplex ๐•œ I) (y : stdSimplex ๐•œ J) : ๐•œ
Defined in
EconCSLib, `expectedPayoffMatrix`
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
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable {I : Type*} [Fintype I] in
set_option linter.unusedSectionVars false in
variable {J : Type*} in
open Matrix in
/-- Expected payoff in a matrix game `A : I โ†’ J โ†’ ๐•œ` under mixed strategies. -/
def expectedPayoffMatrix (A : I โ†’ J โ†’ ๐•œ) [Fintype J]
    (x : stdSimplex ๐•œ I) (y : stdSimplex ๐•œ J) : ๐•œ :=
  x โฌแตฅ fun i => y โฌแตฅ A i
See it in the graphDiscuss this resultChallenge it