wsum_wsum_comm
theoremverifiedformalizationimported Lean
Exchange order of double weighted sums.
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 theorem wsum_wsum_comm {J : Type*} [Fintype J] (x : stdSimplex π I) (y : stdSimplex π J) (A : I β J β π) : wsum x (fun i => wsum y (A i)) = wsum y (fun j => wsum x (fun i => A i j))
- Formalizes
- EconCSLib, `wsum_wsum_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.wsum_wsum_comm← wsum_wsum_comm (EconCSLib/Math/Simplex.lean:295): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot productβ¬α΅₯: definitionally equal,β¦
- wsumWeighted sum of
- Used by 9
- expectedPayoffMatrix_commExpected payoff is commutative in the summation order.
- Loomis.loomis_value_eq_auxLoomis induction:
lamB0 A B = muB0 A Bfor any finite positive-Bmatrix pair with2 †|I| + |J|, by strong induction on the⦠- MatrixGame.support_complementarity_columnSupport complementarity (column). For an optimal pair
(xx, yy), every columnjwith positive probability underyyis a best⦠- Loomis.lamB0_le_muB0Weak duality for the Loomis scalars:
lamB0 β€ muB0. - MatrixGame.image_optimalRowStrategies_eqThe image of the row-optimal subtype set equals the H-representation polytope
A.optimalRowSet. - MinimaxLoomis.lam0_le_mu0Weak duality for the two-player zero-sum matrix game: every maxmin value is bounded by every minmax value.
- MatrixGame.E_eq_wsum_wsum_swapHelper: swap order of the iterated
wsuminA.E. - MatrixGame.mem_optimalRowStrategies_iff_E_geA row strategy is optimal iff against every mixed column it secures the value.
- Loomis.xBy_swapThe bilinear pairing
xByand its symmetric variants.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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 in/-- Exchange order of double weighted sums. -/theorem wsum_wsum_comm {J : Type*} [Fintype J] (x : stdSimplex π I) (y : stdSimplex π J) (A : I β J β π) : wsum x (fun i => wsum y (A i)) = wsum y (fun j => wsum x (fun i => A i j)) := by simp only [wsum, dotProduct, Finset.mul_sum] rw [Finset.sum_comm] congr 1 ext j congr 1 ext i ring