statement theorem
Geometric solutions come from roots of the characteristic polynomial
Statement
Let be a commutative ring, let be a linear recurrence with constant coefficients over , and let . Then the sequence is a solution of if and only if is a root of the characteristic polynomial .
Remarks
Proof idea: for the sequence the recurrence at index reads . At this is . Over a field, if has distinct roots , every solution is with constants . Binet's formula is the case of the Fibonacci recurrence.
Explanations
L1 human
Try a solution of the form . Put it into the recurrence and divide by . What is left is the equation .
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Recurrence relation definition
- Linear recurrence with constant coefficients definition
- Characteristic polynomial of a linear recurrence definition
- Solution of a linear recurrence definition
- Geometric solutions come from roots of the characteristic polynomial statement
Sources
- Web https://en.wikipedia.org/wiki/Linear_recurrence_with_constant_coefficients, Characteristic polynomial and roots
What links here
No node links to this node yet.