`BookProof.CarlemanSimplex.sum_simplex_split` (d N k : ℕ) (F : (Fin d →₀ ℕ) → ℂ) : ∑ a ∈ simplexF d N, F a = ∑ a ∈ sInn d N k, F a + ∑ a ∈ sBd d N k, F a
ProvedBookProof.CarlemanSimplex.sum_simplex_splittheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanSimplex.
BookProof.CarlemanSimplex.sum_simplex_split (d N k : ℕ) (F : (Fin d →₀ ℕ) → ℂ) : ∑ a ∈ simplexF d N, F a = ∑ a ∈ sInn d N k, F a + ∑ a ∈ sBd d N k, F a
Formalization note: Lean 4 identifier BookProof.CarlemanSimplex.sum_simplex_split.
Preamble
-- Generated from ChapterCarlemanSimplex.lean — theorem BookProof.CarlemanSimplex.sum_simplex_split
import Definitions.Def_ChapterHermiteCarlemanEsaPromoted
import Definitions.Def_ChapterCarlemanTwoStepPromoted
import Mathlib
import Definitions.Def_ChapterCarlemanSimplexPromoted
import Definitions.Def_ChapterGaussCoreQuadBounds
open BookProof.CarlemanSimplex
open Finset
open BookProof.HermiteCarleman BookProof.CarlemanTwoStep
noncomputable section
variable {d : ℕ}Formal statement
theorem BookProof.CarlemanSimplex.sum_simplex_split (d N k : ℕ) (F : (Fin d →₀ ℕ) → ℂ) :
∑ a ∈ simplexF d N, F a = ∑ a ∈ sInn d N k, F a + ∑ a ∈ sBd d N k, F a := by sorry