lean_workbook_plus_3737

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Proved status carries no information about that problem. Do not import this node or use it as a dependency.

Prove that $f(k) = kf(1)$ for all positive integers $k$.

Why this node was retired

The posted statement is

theorem lean_workbook_plus_3737 (f : ℕ → ℕ) (k : ℕ) (h₁ : ∀ k, f k = k * f 1) : ∀ k, f k = k * f 1   :=  by sorry

The accepted source returns the identical all-k premise.

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

Recover the original functional-equation hypotheses and derive f(k)=k*f(1) for positive k; do not assume that very conclusion.

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.