perfect_sequence_conjecture
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.
Perfect sequence conjecture: A sequence of distinct positive integers where no partial sum exceeds the corresponding triangular number n(n+1)/2 and the total sum equals it is essentially 1,2,3,...,n. Open: characterization of all such sequences.
Why this node was retired
The posted statement is
import Mathlib
theorem perfect_sequence_conjecture :
∀ k : ℕ, 2 ≤ k →
¬ ∃ (f : ℕ → ℕ) (hf : Function.Injective f),
∀ n : ℕ, (Finset.range n).sum f = (Finset.range n).sum (fun k => k) := by
sorry
The conclusion denies existence of the identity sequence, while the prose describes a characterization of that sequence.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
A faithful elementary statement is: if ∀n, ∑i<n f(i)=∑i<n i, then ∀n,f(n)=n. For positive indexing use ∑i=1..n f(i)=n(n+1)/2.
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 perfect_sequence_conjecture :
∀ k : ℕ, 2 ≤ k →
¬ ∃ (f : ℕ → ℕ) (hf : Function.Injective f),
∀ n : ℕ, (Finset.range n).sum f = (Finset.range n).sum (fun k => k) := by
sorry