AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.sum_split_at

theoremverifiedformalizationimported Lean

Sum-splitting lemma: any function on J decomposes as the value at j₀ plus the sum over {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.sum_split_at [DecidableEq J] (j₀ : J) (f : J → ℝ) :
    ∑ j : J, f j = f j₀ + ∑ j' : {j : J // j ≠ j₀}, f j'.val
Formalizes
EconCSLib, `MinimaxLoomis.sum_split_at`
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 1
Used by 2

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/-- Sum-splitting lemma: any function on `J` decomposes as the value at `j₀` plus the sum over `{j // j ≠ j₀}`. -/theorem MinimaxLoomis.sum_split_at [DecidableEq J] (j₀ : J) (f : J → ℝ) :    ∑ j : J, f j = f j₀ + ∑ j' : {j : J // j ≠ j₀}, f j'.val := by  have hbij : ∑ j : J, f j =      ∑ o : Option {j : J // j ≠ j₀}, f ((dropEquiv j₀).symm o) :=    Fintype.sum_equiv (dropEquiv j₀) f (fun o => f ((dropEquiv j₀).symm o))      (fun j => by simp)  rw [hbij, Fintype.sum_option]  rfl
See it in the graphDiscuss this resultChallenge it