lean_workbook_plus_54683
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.
There exist infinitely many pairs of coprime positive integers for which .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_54683 (A: Set { (x,y): ℕ × ℕ | x^2 - 2*y^2 + 17^2 = 0 ∧ x > 0 ∧ y > 0}) : Set.Infinite A := 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
Prove infinitude of the entire set {(x,y)∈ℕ²:x>0,y>0,gcd(x,y)=1,x²+17²=2y²}; do not quantify over all subsets and avoid truncated natural subtraction.
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_54683 (A: Set { (x,y): ℕ × ℕ | x^2 - 2*y^2 + 17^2 = 0 ∧ x > 0 ∧ y > 0}) : Set.Infinite A := by sorry