wsum_pure
theoremverifiedformalizationimported Lean
Weighted sum with point mass at i₀ equals f i₀. Legacy form using the inline anonymous-structure point mass. New code should prefer stdSimplex.pure together with wsum_pure_apply.
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_pure [DecidableEq I] (i₀ : I) (f : I → 𝕜) : wsum ⟨fun i => if i = i₀ then 1 else 0, fun i => by simp only; split_ifs <;> norm_num, by simp [Finset.sum_ite_eq', Finset.mem_univ]⟩ f = f i₀
- Formalizes
- EconCSLib, `wsum_pure`
- 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_pure← wsum_pure (EconCSLib/Math/Simplex.lean:327): 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,… - stdSimplex.purePoint-mass simplex element at
i₀. - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- wsumWeighted sum of
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 with point mass at `i₀` equals `f i₀`. Legacy form using the inline anonymous-structure point mass. New code should prefer `stdSimplex.pure` together with `wsum_pure_apply`. -/theorem wsum_pure [DecidableEq I] (i₀ : I) (f : I → 𝕜) : wsum ⟨fun i => if i = i₀ then 1 else 0, fun i => by simp only; split_ifs <;> norm_num, by simp [Finset.sum_ite_eq', Finset.mem_univ]⟩ f = f i₀ := wsum_pure_apply (𝕜 := 𝕜) i₀ f