How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Constant-coefficient linear recurrences, their starting index and their characteristic polynomial
Definition
Let be a field, let be a sequence in , and let . A constant-coefficient linear recurrence of order starting at is an identity
where and . Its characteristic polynomial and reciprocal denominator are
The recurrence holds from the start when , and it is eventual when such an exists. An order-zero recurrence starting at means for every ; its characteristic polynomial and reciprocal denominator are both . This convention makes finitely supported sequences precisely the sequences of eventual order zero.
For a bi-infinite sequence , the same displayed identity is a recurrence of order when it holds for every . The condition then lets the identity be solved both forward and backward.
Depends on
Used by
- The Fibonacci sequence F₀=0,F₁=1 and Lucas sequence L₀=2,L₁=1 Definition
- The row-shift companion matrix of a linear recurrence Definition
- The repeated pole (1-2x)⁻² produces the sequence (n+1)2ⁿ Example
- The initial-value, recurrence-sequence, numerator and fixed-denominator rational-series spaces all have dimension d Lemma
- Reciprocal-root convention: χ(t)=∏ᵢ(t-λᵢ)^mᵢ corresponds to Q(x)=∏ᵢ(1-λᵢ x)^mᵢ Remark
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 13 results over 7 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- R. P. Stanley, Enumerative Combinatorics, vol. 1, 2nd ed., Sections 4.1-4.2 (standard reference, not scraped)
- B. E. Sagan, Combinatorics: The Art of Counting, Section 3.7 (standard reference, not scraped)
- M. Waldschmidt, Linear Recurrence Sequences VI, slides 5-18 (standard reference, not scraped)