`BookProof.CarlemanUnboundedHop.not_summable_inv_one_add_nat` : ¬ Summable (fun n : ℕ => (1 + (n : ℝ))⁻¹)

Proved

BookProof.CarlemanUnboundedHop.not_summable_inv_one_add_nat

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterCarlemanUnboundedHop.

BookProof.CarlemanUnboundedHop.not_summable_inv_one_add_nat : ¬ Summable (fun n : ℕ => (1 + (n : ℝ))⁻¹)

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

Preamble

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



open Finset

noncomputable section

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

Formal statement

theorem BookProof.CarlemanUnboundedHop.not_summable_inv_one_add_nat : ¬ Summable (fun n : ℕ => (1 + (n : ℝ))⁻¹) := by sorry

View graph