`BookProof.CarlemanTwoStep.not_summable_inv_natCast_succ` : ¬ Summable (fun N : ℕ => ((N : ℝ) + 1)⁻¹)
ProvedBookProof.CarlemanTwoStep.not_summable_inv_natCast_succtheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanTwoStep.
BookProof.CarlemanTwoStep.not_summable_inv_natCast_succ : ¬ Summable (fun N : ℕ => ((N : ℝ) + 1)⁻¹)
Formalization note: Lean 4 identifier BookProof.CarlemanTwoStep.not_summable_inv_natCast_succ.
Preamble
-- Generated from ChapterCarlemanTwoStep.lean — theorem BookProof.CarlemanTwoStep.not_summable_inv_natCast_succ
import Definitions.Def_ChapterHermiteCarlemanEsaPromoted
import Mathlib
import Definitions.Def_ChapterCarlemanTwoStepPromoted
import Definitions.Def_ChapterGaussCoreQuadBounds
open BookProof.CarlemanTwoStep
open Finset
open BookProof.HermiteCarleman
noncomputable section
variable {d : ℕ}
variable {u : (Fin d →₀ ℕ) → ℂ}
variable {lam : (Fin d →₀ ℕ) → ℝ} {w1 w2 : Fin d → ℂ} {z : ℂ}Formal statement
theorem BookProof.CarlemanTwoStep.not_summable_inv_natCast_succ : ¬ Summable (fun N : ℕ => ((N : ℝ) + 1)⁻¹) := by sorry