`BookProof.ChapterEulerNState.tailSum_succ` (p : ℕ → ℝ) (n k : ℕ) (h : k < n) : tailSum p n k = p k + tailSum p n (k + 1)

Proved

BookProof.ChapterEulerNState.tailSum_succ

by leonardopedro · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterEulerNState.

BookProof.ChapterEulerNState.tailSum_succ (p : ℕ → ℝ) (n k : ℕ) (h : k < n) : tailSum p n k = p k + tailSum p n (k + 1)

Formalization note: Lean 4 identifier BookProof.ChapterEulerNState.tailSum_succ.

Preamble

-- Generated from ChapterEulerNState.lean — theorem BookProof.ChapterEulerNState.tailSum_succ
import Mathlib
import Definitions.Def_ChapterEulerNState
open BookProof.ChapterEulerNState


open scoped BigOperators

Formal statement

theorem BookProof.ChapterEulerNState.tailSum_succ (p : ℕ → ℝ) (n k : ℕ) (h : k < n) :
    tailSum p n k = p k + tailSum p n (k + 1) := by sorry

View graph