skolem_conjecture
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.
Skolem's conjecture (1937): If a linear recurrence sequence over ℤ has a zero, it is either eventually periodic with period k (so infinitely many zeros) or has finitely many zeros. The problem of deciding which case occurs is the Skolem problem. Decidability is open.
Why this node was retired
The posted statement is
import Mathlib
theorem skolem_conjecture (d : ℕ) (hd : 1 ≤ d)
(a c : Fin d → ℤ) (hc : ∀ i, Nat.Prime ((c i).natAbs))
(u : ℤ → ℤ)
(hrec : ∀ n : ℕ, u (n + d) = ∑ i, a i * u (n + i))
(hzero : ∃ n : ℕ, u n = 0) :
{n : ℕ | u n = 0}.Infinite ∨ {n : ℕ | u n = 0}.Finite := by
sorry
The conclusion is only that the zero set is infinite or finite, with no algorithm or periodicity assertion.
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
For the Skolem decision problem, ask for a total computable procedure deciding whether a given integer linear recurrence has any zero; separately, the Skolem–Mahler–Lech structural theorem asks for a finite union of arithmetic progressions plus a finite set. Select one explicitly.
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
import Mathlib
theorem skolem_conjecture (d : ℕ) (hd : 1 ≤ d)
(a c : Fin d → ℤ) (hc : ∀ i, Nat.Prime ((c i).natAbs))
(u : ℤ → ℤ)
(hrec : ∀ n : ℕ, u (n + d) = ∑ i, a i * u (n + i))
(hzero : ∃ n : ℕ, u n = 0) :
{n : ℕ | u n = 0}.Infinite ∨ {n : ℕ | u n = 0}.Finite := by
sorry