lean_workbook_plus_51574
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.
Find all functions such that\ni) \nii) \nfor all
Why this node was retired
The posted statement is
theorem lean_workbook_plus_51574 (f : ℚ → ℚ) (hf : ∀ x > 0, f x + f (1/x) = 1) (hf2 : ∀ x > 0, f (2*x) = 2 * f (f x)) : ∀ x > 0, f x = 1 / (x + 1) := by sorry
The formal statement changes or incorrectly supplies part of the source problem; the accepted note identifies a concrete witness or definitional mechanism.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Find all functions f:ℚ_{>0}→ℚ_{>0} satisfying the two equations. The family must include f(x)=x/(x+1); remove the unsupported reciprocal classification and prove uniqueness before claiming a sole solution.
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_51574 (f : ℚ → ℚ) (hf : ∀ x > 0, f x + f (1/x) = 1) (hf2 : ∀ x > 0, f (2*x) = 2 * f (f x)) : ∀ x > 0, f x = 1 / (x + 1) := by sorry