lean_workbook_plus_44699
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Given a series with as the sum of the series from to , where and for . Prove that .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_44699 (a : ℕ → ℝ) (ha : a 0 = 1 ∧ ∀ n, a (n + 1) = (2 + a n) ^ 2 / (4 + a n)) : ∀ n, a n ≥ 4 / Real.sqrt (9 * n + 7) := by sorry
Define S(n)=∑i=1..n a(i), assume S(1)=1 and the recurrence for S at n≥1, and conclude the source bound for the terms a(n) at n≥1.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Define S(n)=∑i=1..n a(i), assume S(1)=1 and the recurrence for S at n≥1, and conclude the source bound for the terms a(n) at n≥1.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib.Analysis.Complex.Basic
theorem lean_workbook_plus_44699 (a : ℕ → ℝ) (ha : a 0 = 1 ∧ ∀ n, a (n + 1) = (2 + a n) ^ 2 / (4 + a n)) : ∀ n, a n ≥ 4 / Real.sqrt (9 * n + 7) := by sorry