wsum_le_wsum
theoremverifiedformalizationimported Lean
Weighted sum is monotone: pointwise ≤ implies wsum ≤.
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_le_wsum (x : stdSimplex 𝕜 I) {f g : I → 𝕜} (h : ∀ i, f i ≤ g i) : wsum x f ≤ wsum x g
- Formalizes
- EconCSLib, `wsum_le_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.wsum_le_wsum← wsum_le_wsum (EconCSLib/Math/Simplex.lean:96): 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
- MinimaxLoomis.mu.aux.bddBelow
mu.aux Ais uniformly bounded below on the simplex. - MinimaxLoomis.lam.aux.bddAbove
lam.aux Ais uniformly bounded above on the simplex. - Lottery.expectedValue_monoExpected value is monotone: if
f ≤ gpointwise, thenE[f] ≤ E[g]. - MatrixGame.isMixedNashEq_of_purePure-strategy guarantees give a mixed Nash equilibrium. If
xxguarantees valuevagainst every pure column andyycaps the row… - le_iff_simplex_le
f ≤ vpointwise iff every simplex weighted sum is≤ v. - Loomis.lamB0_le_muB0Weak duality for the Loomis scalars:
lamB0 ≤ muB0. - wsum_ge_wsumWeighted sum respects
≥. - wsum_nonnegWeighted sum of non-negative values is non-negative.
- ge_iff_simplex_ge
f ≥ vpointwise iff every simplex weighted sum is≥ v.
- MinimaxLoomis.mu.aux.bddBelow
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/-- Weighted sum is monotone: pointwise `≤` implies `wsum ≤`. -/theorem wsum_le_wsum (x : stdSimplex 𝕜 I) {f g : I → 𝕜} (h : ∀ i, f i ≤ g i) : wsum x f ≤ wsum x g := by apply Finset.sum_le_sum intro i _ exact mul_le_mul_of_nonneg_left (h i) (x.property.1 i)