lean_workbook_plus_18283
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.
Actually, it is quite easy to prove that the minimal solution of the Pell Equation must have even, odd by a similar trick, but we can proceed directly, so that we don't need to double the argument: \nWe start with the minimal solution of . So . So one of the following four cases must occur: \n1. . So . \n2. . So . \n3. . So . \n4. . So . \nNote that and are not quadratic residues , so cases 2. and 4. cannot occur. \nMoreover, case 3. would contradict the minimality of . \nSo case 1. must occur and is a solution of the equation .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_18283 (p : ℕ)
(a b : ℕ)
(h₀ : Nat.Prime p)
(h₁ : a^2 - p * b^2 = 1)
(h₂ : ∀ x y : ℕ, x^2 - p * y^2 = 1 → a ≤ x ∧ b ≤ y) :
Even a ∧ Odd b := by sorry
Minimality includes the trivial Pell solution(1,0), and natural subtraction can truncate; the source nonresidue assumptions on p are missing.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Use integer Pell arithmetic, minimize among x,y>0 solving x²−py²=1, and recover the source restriction that−1 and−2 are nonresidues modulo p. A parity conclusion is not valid for arbitrary prime p.
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_18283 (p : ℕ) (a b : ℕ) (h₀ : Nat.Prime p) (h₁ : a^2 - p * b^2 = 1) (h₂ : ∀ x y : ℕ, x^2 - p * y^2 = 1 → a ≤ x ∧ b ≤ y) : Even a ∧ Odd b := by sorry