wsum_pos
theoremverifiedformalizationimported Lean
Weighted sum of strictly-positive values is strictly positive. Some coordinate a of any simplex point is strictly positive (since ∑ x = 1), and the corresponding x_a · f a summand is strictly positive while every other summand is non-negative.
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_pos (x : stdSimplex 𝕜 I) {f : I → 𝕜} (hf : ∀ i, 0 < f i) : 0 < wsum x f
- Formalizes
- EconCSLib, `wsum_pos`
- 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_pos← wsum_pos (EconCSLib/Math/Simplex.lean:113): 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 3
- Loomis.xBy_posPositivity of the bilinear pairing
xBy = ∑ᵢⱼ xᵢ Bᵢⱼ yⱼ. - Loomis.By_posPositivity of the column aggregate when
Bis entrywise positive. - Loomis.xB_posPositivity of the row aggregate when
Bis entrywise positive.
- Loomis.xBy_posPositivity of the bilinear pairing
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 of strictly-positive values is strictly positive. Some coordinate `a` of any simplex point is strictly positive (since `∑ x = 1`), and the corresponding `x_a · f a` summand is strictly positive while every other summand is non-negative. -/theorem wsum_pos (x : stdSimplex 𝕜 I) {f : I → 𝕜} (hf : ∀ i, 0 < f i) : 0 < wsum x f := by classical obtain ⟨a, ha⟩ : ∃ a, 0 < x.val a := by by_contra hAll push_neg at hAll have hzero : ∀ i, x.val i = 0 := fun i => le_antisymm (hAll i) (x.property.1 i) have hsum_zero : (∑ i, x.val i) = 0 := by simp_rw [hzero]; simp exact zero_ne_one (hsum_zero.symm.trans x.property.2) change 0 < ∑ b, x.val b * f b have hle : ∀ b ∈ (Finset.univ : Finset I), (0 : 𝕜) ≤ x.val b * f b := fun b _ => mul_nonneg (x.property.1 b) (hf b).le have hpos : ∃ b ∈ (Finset.univ : Finset I), (0 : 𝕜) < x.val b * f b := ⟨a, Finset.mem_univ _, mul_pos ha (hf a)⟩ calc (0 : 𝕜) = ∑ _ : I, (0 : 𝕜) := by simp _ < ∑ b, x.val b * f b := Finset.sum_lt_sum hle hpos