`BookProof.CarlemanTwoStep.sum_cube_splitK` (d N : ℕ) (i : Fin d) (k : ℕ) (F : (Fin d →₀ ℕ) → ℂ) : ∑ a ∈ cube d N, F a = ∑ a ∈ innK d N i k, F a + ∑ a ∈ faceK d N i k, F a
ProvedBookProof.CarlemanTwoStep.sum_cube_splitKtheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanTwoStep.
BookProof.CarlemanTwoStep.sum_cube_splitK (d N : ℕ) (i : Fin d) (k : ℕ) (F : (Fin d →₀ ℕ) → ℂ) : ∑ a ∈ cube d N, F a = ∑ a ∈ innK d N i k, F a + ∑ a ∈ faceK d N i k, F a
Formalization note: Lean 4 identifier BookProof.CarlemanTwoStep.sum_cube_splitK.
Preamble
-- Generated from ChapterCarlemanTwoStep.lean — theorem BookProof.CarlemanTwoStep.sum_cube_splitK
import Mathlib
import Definitions.Def_ChapterCarlemanTwoStepPromoted
import Definitions.Def_ChapterHermiteCarlemanEsaPromoted
open BookProof.HermiteCarleman
open BookProof.CarlemanTwoStep
open Finset
open BookProof.HermiteCarleman
noncomputable section
variable {d : ℕ}Formal statement
theorem BookProof.CarlemanTwoStep.sum_cube_splitK (d N : ℕ) (i : Fin d) (k : ℕ) (F : (Fin d →₀ ℕ) → ℂ) :
∑ a ∈ cube d N, F a = ∑ a ∈ innK d N i k, F a + ∑ a ∈ faceK d N i k, F a := by sorry