`BookProof.CarlemanUnboundedHop.Theta_nonneg` (hθ0 : ∀ r, 0 ≤ θ r) (hΘ : ∀ j, HasSum (fun i => θ (i + j + 1)) (Θ j)) (j : ℕ) : 0 ≤ Θ j
ProvedBookProof.CarlemanUnboundedHop.Theta_nonnegtheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanUnboundedHop.
BookProof.CarlemanUnboundedHop.Theta_nonneg (hθ0 : ∀ r, 0 ≤ θ r) (hΘ : ∀ j, HasSum (fun i => θ (i + j + 1)) (Θ j)) (j : ℕ) : 0 ≤ Θ j
Formalization note: Lean 4 identifier BookProof.CarlemanUnboundedHop.Theta_nonneg.
Preamble
-- Generated from ChapterCarlemanUnboundedHop.lean — theorem BookProof.CarlemanUnboundedHop.Theta_nonneg
import Mathlib
import Definitions.Def_ChapterCarlemanUnboundedHop
open BookProof.CarlemanUnboundedHop
open Finset
noncomputable section
variable {a : ℕ → ℕ → ℂ} {u : ℕ → ℂ} {A θ Θ : ℕ → ℝ}Formal statement
theorem BookProof.CarlemanUnboundedHop.Theta_nonneg (hθ0 : ∀ r, 0 ≤ θ r)
(hΘ : ∀ j, HasSum (fun i => θ (i + j + 1)) (Θ j)) (j : ℕ) : 0 ≤ Θ j := by sorry