lean_workbook_plus_76494
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.
Let is positive integer such that , prove that:
Why this node was retired
The posted statement is
theorem lean_workbook_plus_76494 (n : ℕ) (hn : 2 ≤ n) : ((n^2 - 1)/(n^2))^(2*n) * ((n + 1)/(n - 1)) < 1 := by sorry
Natural division makes the first factor0, so the bound does not certify the genuine real expression.
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
Cast n intoℝ before every subtraction and quotient, retain n≥2, and prove the displayed strict inequality. Source task: Let is positive integer such that , prove that:
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_76494 (n : ℕ) (hn : 2 ≤ n) : ((n^2 - 1)/(n^2))^(2*n) * ((n + 1)/(n - 1)) < 1 := by sorry