`BookProof.ChapterEulerCountableChain.partial_sum` (c : ℕ → ℝ) (N : ℕ) : ∑ n ∈ Finset.range N, stickProb c n = 1 - stickTail c N

Proved

BookProof.ChapterEulerCountableChain.partial_sum

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterEulerCountableChain.

BookProof.ChapterEulerCountableChain.partial_sum (c : ℕ → ℝ) (N : ℕ) : ∑ n ∈ Finset.range N, stickProb c n = 1 - stickTail c N

Formalization note: Lean 4 identifier BookProof.ChapterEulerCountableChain.partial_sum.

Preamble

-- Generated from ChapterEulerCountableChain.lean — theorem BookProof.ChapterEulerCountableChain.partial_sum
import Mathlib
import Definitions.Def_ChapterEulerCountableChain
open BookProof.ChapterEulerCountableChain


open scoped BigOperators
open Filter Topology

Formal statement

theorem BookProof.ChapterEulerCountableChain.partial_sum (c : ℕ → ℝ) (N : ℕ) :
    ∑ n ∈ Finset.range N, stickProb c n = 1 - stickTail c N := by sorry

View graph