lean_workbook_plus_32580
Proved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Provedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Lemma 2.
Why this node was retired
The posted statement is
theorem lean_workbook_plus_32580 (y : ℕ → ℕ) (h : ∀ i, y i = y (i - 1) + 1) : ∀ i, y i ^ 2 ≥ y (i - 1) ^ 2 + 6 := by sorry
Recurrence quantified at natural index zero with truncated subtraction.
A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.
Proposed corrected statement
Restrict the predecessor recurrence to i≥1. Reconstruct the missing conditions on y before asserting a square increment of at least 6: the supplied recurrence alone does not imply that increment.
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_32580 (y : ℕ → ℕ) (h : ∀ i, y i = y (i - 1) + 1) : ∀ i, y i ^ 2 ≥ y (i - 1) ^ 2 + 6 := by sorry