AFTD Auto-Formalizing Theoretical Domains

MatrixGame.E_eq_wsum_wsum_swap

theoremverifiedformalizationimported Lean

Helper: swap order of the iterated wsum in A.E.

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
theorem MatrixGame.E_eq_wsum_wsum_swap
    {π•œ : Type} [Field π•œ] [LinearOrder π•œ] [IsStrictOrderedRing π•œ]
    (A : MatrixGame I J π•œ) (x : stdSimplex π•œ I) (y : stdSimplex π•œ J) :
    A.E x y = wsum y (fun j => wsum x (fun i => A.g i j))
Formalizes
EconCSLib, `MatrixGame.E_eq_wsum_wsum_swap`
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 6
  • MatrixGame.E_eq_wsum_wsumHelper: writing A.E as an iterated wsum exposes the structure that the saddle-point bounds rely on.
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝α΅₯: definitionally equal,…
  • MatrixGame.EExpected payoff when Player I uses mixed strategy x and Player II uses y.
  • 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…
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • wsum_wsum_commExchange order of double weighted sums.
Used by 1
  • MatrixGame.isMixedNashEq_of_purePure-strategy guarantees give a mixed Nash equilibrium. If xx guarantees value v against every pure column and yy caps the row…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false inuniverse u invariable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] invariable (A : MatrixGame I J ℝ) in/-- Helper: swap order of the iterated `wsum` in `A.E`. -/theorem MatrixGame.E_eq_wsum_wsum_swap    {π•œ : Type} [Field π•œ] [LinearOrder π•œ] [IsStrictOrderedRing π•œ]    (A : MatrixGame I J π•œ) (x : stdSimplex π•œ I) (y : stdSimplex π•œ J) :    A.E x y = wsum y (fun j => wsum x (fun i => A.g i j)) := by  rw [E_eq_wsum_wsum, wsum_wsum_comm]
See it in the graphDiscuss this resultChallenge it