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