Loomis.rowOffset_eq_wsum
theoremverifiedformalizationimported Lean
rowOffset is a wsum of μ B i j - A i j over j.
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.rowOffset_eq_wsum (A B : I → J → ℝ) (mu : ℝ) (y : stdSimplex ℝ J) (i : I) : rowOffset A B mu y i = wsum y (fun j => mu * B i j - A i j)
- Formalizes
- EconCSLib, `Loomis.rowOffset_eq_wsum`
- 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.rowOffset_eq_wsum← Loomis.rowOffset_eq_wsum (EconCSLib/Math/Minimax/Loomis.lean:391): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- Loomis.ByColumn-vector product
(By)_i = ∑ⱼ Bᵢⱼ yⱼ. - Loomis.AyColumn-vector product
(Ay)_i = ∑ⱼ Aᵢⱼ yⱼ. - wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - Loomis.rowOffsetLinearised row constraint:
rowOffset A B μ y i = μ · (By)_i - (Ay)_i. - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.ByColumn-vector product
- Used by 1
- Loomis.rowOffset_mixConvex combination linearity for
rowOffsetin the simplex argument.
- Loomis.rowOffset_mixConvex combination linearity for
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/-- `rowOffset` is a `wsum` of `μ B i j - A i j` over `j`. -/theorem Loomis.rowOffset_eq_wsum (A B : I → J → ℝ) (mu : ℝ) (y : stdSimplex ℝ J) (i : I) : rowOffset A B mu y i = wsum y (fun j => mu * B i j - A i j) := by unfold rowOffset Ay By change mu * (∑ j, y.val j * B i j) - (∑ j, y.val j * A i j) = ∑ j, y.val j * (mu * B i j - A i j) rw [Finset.mul_sum, ← Finset.sum_sub_distrib] refine Finset.sum_congr rfl ?_ intro j _ ring