AFTD Auto-Formalizing Theoretical Domains

wsum_mix

theoremverifiedformalizationimported Lean

Bilinearity of wsum over stdSimplex.mix: wsum (mix α x y) f = α · wsum x f + (1-α) · wsum y f.

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_mix (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)
    (x y : stdSimplex 𝕜 I) (f : I → 𝕜) :
    wsum (stdSimplex.mix α hα₀ hα₁ x y) f =
      α * wsum x f + (1 - α) * wsum y f
Formalizes
EconCSLib, `wsum_mix`
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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝ᵥ: definitionally equal,…
  • stdSimplex.mixConvex combination of two simplex points: mix α hα₀ hα₁ x y = α·x + (1-α)·y. This is the basic vocabulary for compound lotteries and for…
  • stdSimplex.mix_applystdSimplex.mix_apply
Used by 5

Lean source view module on GitHub

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/-- Bilinearity of `wsum` over `stdSimplex.mix`: `wsum (mix α x y) f = α · wsum x f + (1-α) · wsum y f`. -/theorem wsum_mix (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)    (x y : stdSimplex 𝕜 I) (f : I → 𝕜) :    wsum (stdSimplex.mix α hα₀ hα₁ x y) f =      α * wsum x f + (1 - α) * wsum y f := by  change (∑ i, (α * x.val i + (1 - α) * y.val i) * f i)       = α * (∑ i, x.val i * f i) + (1 - α) * (∑ i, y.val i * f i)  rw [Finset.mul_sum, Finset.mul_sum, ← Finset.sum_add_distrib]  apply Finset.sum_congr rfl; intro i _; ring
See it in the graphDiscuss this resultChallenge it