Loomis.colOffset_eq_wsum
theoremverifiedformalizationimported Lean
colOffset is a wsum of A i j - λ B i j over i.
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.colOffset_eq_wsum (A B : I → J → ℝ) (lam : ℝ) (x : stdSimplex ℝ I) (j : J) : colOffset A B lam x j = wsum x (fun i => A i j - lam * B i j)
- Formalizes
- EconCSLib, `Loomis.colOffset_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.colOffset_eq_wsum← Loomis.colOffset_eq_wsum (EconCSLib/Math/Minimax/Loomis.lean:379): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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.colOffsetLinearised column constraint:
colOffset A B λ x j = (xA)_j - λ · (xB)_j. Note that… - Loomis.xBRow-vector product
(xB)_j = ∑ᵢ xᵢ Bᵢⱼ. - Loomis.xARow-vector product
(xA)_j = ∑ᵢ xᵢ Aᵢⱼ.
- wsumWeighted sum of
- Used by 1
- Loomis.colOffset_mixConvex combination linearity for
colOffsetin the simplex argument.
- Loomis.colOffset_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/-- `colOffset` is a `wsum` of `A i j - λ B i j` over `i`. -/theorem Loomis.colOffset_eq_wsum (A B : I → J → ℝ) (lam : ℝ) (x : stdSimplex ℝ I) (j : J) : colOffset A B lam x j = wsum x (fun i => A i j - lam * B i j) := by unfold colOffset xA xB change (∑ i, x.val i * A i j) - lam * (∑ i, x.val i * B i j) = ∑ i, x.val i * (A i j - lam * B i j) rw [Finset.mul_sum, ← Finset.sum_sub_distrib] refine Finset.sum_congr rfl ?_ intro i _ ring