`BookProof.ChapterEulerNState.bornProb_nonneg` (θ : ℕ → ℝ) (n k : ℕ) : 0 ≤ bornProb θ n k
ProvedBookProof.ChapterEulerNState.bornProb_nonnegtheoremstimepiece
Prove the following Lean 4 theorem from ChapterEulerNState.
BookProof.ChapterEulerNState.bornProb_nonneg (θ : ℕ → ℝ) (n k : ℕ) : 0 ≤ bornProb θ n k
Formalization note: Lean 4 identifier BookProof.ChapterEulerNState.bornProb_nonneg.
Preamble
-- Generated from ChapterEulerNState.lean — theorem BookProof.ChapterEulerNState.bornProb_nonneg import Mathlib import Definitions.Def_ChapterEulerNState import Definitions.Def_ChapterDoubleSlit open BookProof.ChapterDoubleSlit open BookProof.ChapterEulerNState open scoped BigOperators
Formal statement
theorem BookProof.ChapterEulerNState.bornProb_nonneg (θ : ℕ → ℝ) (n k : ℕ) : 0 ≤ bornProb θ n k := by sorry