lean_workbook_plus_60031
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.
Prove that for all in the naturals using the given recursive relation and initial condition .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_60031 (a : ℕ → ℝ) (a1 : a 0 = 1) (a_rec : ∀ n, a (n + 1) = 1 / (1 + 1 / a n)) : ∀ n, a n = 1 / n := by sorry
The initial value was shifted from index1 to0 without changing the formula.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
With a₀=1 and the posted recurrence prove a_n=1/(n+1). Alternatively use a₁=1, recurrence only for n≥1, and conclude a_n=1/n for 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_60031 (a : ℕ → ℝ) (a1 : a 0 = 1) (a_rec : ∀ n, a (n + 1) = 1 / (1 + 1 / a n)) : ∀ n, a n = 1 / n := by sorry