`BookProof.CarlemanUnboundedHop.row_summable` {a : ℕ → ℕ → ℂ} (hk : IsL2Kernel a) (k : ℕ) : Summable fun n : ℕ => ‖a k n‖ ^ 2

Proved

BookProof.CarlemanUnboundedHop.row_summable

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterCarlemanUnboundedHop.

BookProof.CarlemanUnboundedHop.row_summable {a : ℕ → ℕ → ℂ} (hk : IsL2Kernel a) (k : ℕ) : Summable fun n : ℕ => ‖a k n‖ ^ 2

Formalization note: Lean 4 identifier BookProof.CarlemanUnboundedHop.row_summable.

Preamble

-- Generated from ChapterCarlemanUnboundedHop.lean — theorem BookProof.CarlemanUnboundedHop.row_summable
import Mathlib
import Definitions.Def_ChapterCarlemanUnboundedHop
open BookProof.CarlemanUnboundedHop



open Finset

noncomputable section

variable {a : ℕ → ℕ → ℂ} {u : ℕ → ℂ} {A θ Θ : ℕ → ℝ}

Formal statement

theorem BookProof.CarlemanUnboundedHop.row_summable {a : ℕ → ℕ → ℂ} (hk : IsL2Kernel a) (k : ℕ) :
    Summable fun n : ℕ => ‖a k n‖ ^ 2 := by sorry

View graph