AFTD Auto-Formalizing Theoretical Domains

wsum_ge_wsum

theoremverifiedformalizationimported Lean

Weighted sum respects ≥.

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_ge_wsum (x : stdSimplex 𝕜 I) {f g : I → 𝕜}
    (h : ∀ i, f i ≥ g i) : wsum x f ≥ wsum x g
Formalizes
EconCSLib, `wsum_ge_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝ᵥ: definitionally equal,…
  • wsum_le_wsumWeighted sum is monotone: pointwise ≤ implies wsum ≤.

Lean source view module on GitHub

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
/-- Weighted sum respects `≥`. -/
theorem wsum_ge_wsum (x : stdSimplex 𝕜 I) {f g : I → 𝕜}
    (h : ∀ i, f i ≥ g i) : wsum x f ≥ wsum x g :=
  wsum_le_wsum x h
See it in the graphDiscuss this resultChallenge it