Loomis.wsum_const_mul
theoremverifiedformalizationimported Lean
Weight a constant multiple under wsum: wsum z (c · f) = c · wsum z f. A direct unfold of wsum_smul, restated here so chained rewrites match the shape used in the weak-duality proof.
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.wsum_const_mul {K : Type*} [Fintype K] (z : stdSimplex ℝ K) (c : ℝ) (f : K → ℝ) : wsum z (fun a => c * f a) = c * wsum z f
- Formalizes
- EconCSLib, `Loomis.wsum_const_mul`
- 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.wsum_const_mul← Loomis.wsum_const_mul (EconCSLib/Math/Minimax/Loomis.lean:254): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- 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.
- wsum_smulWeighted sum commutes with scalar multiplication.
- wsumWeighted sum of
- 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/-- Weight a constant multiple under `wsum`: `wsum z (c · f) = c · wsum z f`. A direct unfold of `wsum_smul`, restated here so chained rewrites match the shape used in the weak-duality proof. -/theorem Loomis.wsum_const_mul {K : Type*} [Fintype K] (z : stdSimplex ℝ K) (c : ℝ) (f : K → ℝ) : wsum z (fun a => c * f a) = c * wsum z f := by change (∑ a, z.val a * (c * f a)) = c * (∑ a, z.val a * f a) rw [Finset.mul_sum] refine Finset.sum_congr rfl ?_ intro a _ ring