AFTD Auto-Formalizing Theoretical Domains

wsum_mix_lt_of_le_lt

theoremverifiedformalizationimported Lean

wsum version of linear_comb_lt_of_le_lt.

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_lt_of_le_lt {I : Type*} [Fintype I]
    (f : I β†’ π•œ) (x y : stdSimplex π•œ I) (c : π•œ)
    (H1 : wsum x f ≀ c) (H2 : wsum y f < c)
    {t : π•œ} (htβ‚€ : 0 ≀ t) (ht₁ : t ≀ 1) (Ht : t < 1) :
    wsum (stdSimplex.mix t htβ‚€ ht₁ x y) f < c
Formalizes
EconCSLib, `wsum_mix_lt_of_le_lt`
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 5
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝α΅₯: definitionally equal,…
  • wsum_mixBilinearity of wsum over stdSimplex.mix: wsum (mix Ξ± x y) f = Ξ± Β· wsum x f + (1-Ξ±) Β· wsum y f.
  • 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
  • linear_comb_lt_of_le_ltConvex combination of "≀ c" and "< c" stays "< c" (provided Ξ± β‰₯ 0 and Ξ± < 1).

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/-- `wsum` version of `linear_comb_lt_of_le_lt`. -/theorem wsum_mix_lt_of_le_lt {I : Type*} [Fintype I]    (f : I β†’ π•œ) (x y : stdSimplex π•œ I) (c : π•œ)    (H1 : wsum x f ≀ c) (H2 : wsum y f < c)    {t : π•œ} (htβ‚€ : 0 ≀ t) (ht₁ : t ≀ 1) (Ht : t < 1) :    wsum (stdSimplex.mix t htβ‚€ ht₁ x y) f < c := by  rw [wsum_mix]  exact linear_comb_lt_of_le_lt _ _ c H1 H2 htβ‚€ Ht
See it in the graphDiscuss this resultChallenge it