AFTD Auto-Formalizing Theoretical Domains

expectedPayoffMatrix_comm

theoremverifiedformalizationimported Lean

Expected payoff is commutative in the summation order.

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
theorem expectedPayoffMatrix_comm {J : Type*} [Fintype J]
    (A : I โ†’ J โ†’ ๐•œ) (x : stdSimplex ๐•œ I) (y : stdSimplex ๐•œ J) :
    expectedPayoffMatrix A x y =
    y โฌแตฅ fun j => x โฌแตฅ fun i => A i j
Formalizes
EconCSLib, `expectedPayoffMatrix_comm`
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
Classical.choiceQuot.soundpropext
Built on 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators Matrix invariable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] invariable {I : Type*} [Fintype I] inset_option linter.unusedSectionVars false invariable {J : Type*} inopen Matrix in/-- Expected payoff is commutative in the summation order. -/theorem expectedPayoffMatrix_comm {J : Type*} [Fintype J]    (A : I โ†’ J โ†’ ๐•œ) (x : stdSimplex ๐•œ I) (y : stdSimplex ๐•œ J) :    expectedPayoffMatrix A x y =    y โฌแตฅ fun j => x โฌแตฅ fun i => A i j := by  simpa [expectedPayoffMatrix, wsum] using wsum_wsum_comm x y A
See it in the graphDiscuss this resultChallenge it