AFTD Auto-Formalizing Theoretical Domains

Minimax.sum_blocks

theoremverifiedformalizationimported Lean

Split a sum over I ⊕ J ⊕ Unit into the three blocks.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
variable {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
  [Nonempty I] [Nonempty J] in
theorem Minimax.sum_blocks (f : (I ⊕ J ⊕ Unit) → 𝕜) :
    ∑ k, f k = (∑ i, f (Sum.inl i)) + (∑ j, f (Sum.inr (Sum.inl j)))
      + f (Sum.inr (Sum.inr ()))
Formalizes
EconCSLib, `Minimax.sum_blocks`
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
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators invariable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] invariable {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]  [Nonempty I] [Nonempty J] in/-- Split a sum over `I ⊕ J ⊕ Unit` into the three blocks. -/theorem Minimax.sum_blocks (f : (I ⊕ J ⊕ Unit) → 𝕜) :    ∑ k, f k = (∑ i, f (Sum.inl i)) + (∑ j, f (Sum.inr (Sum.inl j)))      + f (Sum.inr (Sum.inr ())) := by  have hu : (∑ u : Unit, f (Sum.inr (Sum.inr u))) = f (Sum.inr (Sum.inr ())) := by simp  rw [Fintype.sum_sum_type, Fintype.sum_sum_type, hu, ← add_assoc]
See it in the graphDiscuss this resultChallenge it