Loomis.xBy_swap
theoremverifiedformalizationimported Lean
The bilinear pairing xBy and its symmetric variants.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in set_option linter.unusedSectionVars false in variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in theorem Loomis.xBy_swap (B : I → J → ℝ) (x : stdSimplex ℝ I) (y : stdSimplex ℝ J) : wsum x (fun i => By B y i) = wsum y (fun j => xB B x j)
- Formalizes
- EconCSLib, `Loomis.xBy_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.Loomis.xBy_swap← Loomis.xBy_swap (EconCSLib/Math/Minimax/Loomis.lean:245): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- Loomis.ByColumn-vector product
(By)_i = ∑ⱼ Bᵢⱼ yⱼ. - wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.xBRow-vector product
(xB)_j = ∑ᵢ xᵢ Bᵢⱼ. - wsum_wsum_commExchange order of double weighted sums.
- Loomis.ByColumn-vector product
- Used by 2
- 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… - Loomis.lamB0_le_muB0Weak duality for the Loomis scalars:
lamB0 ≤ muB0.
- Loomis.loomis_value_eq_auxLoomis induction:
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 inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- The bilinear pairing `xBy` and its symmetric variants. -/theorem Loomis.xBy_swap (B : I → J → ℝ) (x : stdSimplex ℝ I) (y : stdSimplex ℝ J) : wsum x (fun i => By B y i) = wsum y (fun j => xB B x j) := by unfold xB By exact wsum_wsum_comm x y B