plrs_seq_zero
For any list of natural numbers c : List ℕ, plrs_seq c 0 = 0.
Statement
theorem plrs_seq_zero (c : List ℕ) : plrs_seq c 0 = 0- Source
- arXiv:2611.10200, Section 1
- Verified
- 11 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- plrs_seqFor a list of natural numbers c : List ℕ, the standard positive linear recurrence sequence plrs_seq c : ℕ → ℤ is defined recursively by…
Read back from the Lean
For every list of natural numbers c, plrs_seq c 0 = 0.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem follows directly from the definition of plrs_seq. By definition, the sequence evaluates to 0 at index 0, which is captured by the defining equation lemma plrs_seq.eq_1.
plrs_seq c 0 = 0
The sequence plrs_seq is defined by pattern matching on the natural number index, with its first equation stipulating that plrs_seq c 0 = 0. The proof directly applies this defining equation (plrs_seq.eq_1) to the list c.
uses
plrs_seq.eq_1theorem plrs_seq_zero (c : List ℕ) : plrs_seq c 0 = 0 := plrs_seq.eq_1 c
plrs_seq.eq_1- For any list c of natural numbers, plrs_seq c 0 = 0, representing the base case at index 0 in the definition of plrs_seq.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- The base value of plrs_seq at index 0 is 0. -/theorem plrs_seq_zero (c : List ℕ) : plrs_seq c 0 = 0 := plrs_seq.eq_1 c