`BookProof.ChapterEulerNState.euler_sum_one` (θ : ℕ → ℝ) {n : ℕ} (hn : 1 ≤ n) : ∑ k ∈ Finset.range n, bornProb θ n k = 1
ProvedBookProof.ChapterEulerNState.euler_sum_onetheoremstimepiece
Prove the following Lean 4 theorem from ChapterEulerNState.
BookProof.ChapterEulerNState.euler_sum_one (θ : ℕ → ℝ) {n : ℕ} (hn : 1 ≤ n) : ∑ k ∈ Finset.range n, bornProb θ n k = 1
Formalization note: Lean 4 identifier BookProof.ChapterEulerNState.euler_sum_one.
Preamble
-- Generated from ChapterEulerNState.lean — theorem BookProof.ChapterEulerNState.euler_sum_one import Mathlib import Definitions.Def_ChapterEulerNState import Definitions.Def_ChapterDoubleSlit open BookProof.ChapterDoubleSlit open BookProof.ChapterEulerNState open scoped BigOperators
Formal statement
theorem BookProof.ChapterEulerNState.euler_sum_one (θ : ℕ → ℝ) {n : ℕ} (hn : 1 ≤ n) :
∑ k ∈ Finset.range n, bornProb θ n k = 1 := by sorry