AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.wsum_extendDropColumn

theoremverifiedformalizationimported Lean

wsum (extendDropColumn j₀ y') f equals the wsum of y' restricted to the corresponding sub-function on {j // j ≠ j₀}.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
theorem MinimaxLoomis.wsum_extendDropColumn [DecidableEq J] (j₀ : J)
    (y' : stdSimplex ℝ {j : J // j ≠ j₀}) (f : J → ℝ) :
    wsum (extendDropColumn j₀ y') f
      = ∑ j' : {j : J // j ≠ j₀}, y'.val j' * f j'.val
Formalizes
EconCSLib, `MinimaxLoomis.wsum_extendDropColumn`
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 4
  • MinimaxLoomis.extendDropColumnExtend a mixed strategy on J' = {j // j ≠ j₀} to a mixed strategy on J by putting zero mass on j₀.
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝ᵥ: definitionally equal,…
  • MinimaxLoomis.sum_split_atSum-splitting lemma: any function on J decomposes as the value at j₀ plus the sum over {j // j ≠ j₀}.
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
Used by 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- `wsum (extendDropColumn j₀ y') f` equals the `wsum` of `y'` restricted to the corresponding sub-function on `{j // j ≠ j₀}`. -/theorem MinimaxLoomis.wsum_extendDropColumn [DecidableEq J] (j₀ : J)    (y' : stdSimplex ℝ {j : J // j ≠ j₀}) (f : J → ℝ) :    wsum (extendDropColumn j₀ y') f      = ∑ j' : {j : J // j ≠ j₀}, y'.val j' * f j'.val := by  change (∑ j, (if h : j = j₀ then (0 : ℝ) else y'.val ⟨j, h⟩) * f j)       = ∑ j' : {j : J // j ≠ j₀}, y'.val j' * f j'.val  rw [sum_split_at j₀]  have h0 : (if h : (j₀ : J) = j₀ then (0 : ℝ) else y'.val ⟨j₀, h⟩) * f j₀ = 0 := by    have : (if h : (j₀ : J) = j₀ then (0 : ℝ) else y'.val ⟨j₀, h⟩) = 0 := by simp    rw [this, zero_mul]  rw [h0, zero_add]  apply Finset.sum_congr rfl  intro j' _  congr 1  simp [j'.property]
See it in the graphDiscuss this resultChallenge it