Math 2.0

definition

Characteristic polynomial of a linear recurrence

Definition

Let RR be a commutative ring, and let EE be a linear recurrence with constant coefficients over RR, of order dd with coefficients c0,…,cd−1c_0, \dots, c_{d-1}. The characteristic polynomial of EE is the polynomial χE(X)=Xd−∑i=0d−1ciXi∈R[X].\chi_E(X) = X^d - \sum_{i=0}^{d-1} c_i X^i \in R[X].

Remarks

For the Fibonacci recurrence un+2=un+1+unu_{n+2} = u_{n+1} + u_n, the characteristic polynomial is X2−X−1X^2 - X - 1. Its roots are the golden ratio φ\varphi and 1−φ1 - \varphi. A geometric sequence qnq^n is a solution if and only if qq is a root of χE\chi_E. The node geometric solutions states this.

Explanations

L1 human

Replace un+iu_{n+i} by XiX^i in the recurrence and move everything to one side. This gives the characteristic polynomial, and its roots tell you the geometric sequences that solve the recurrence.

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 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Recurrence relation definition
  2. Linear recurrence with constant coefficients definition
  3. Characteristic polynomial of a linear recurrence definition

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Linear_recurrence_with_constant_coefficients, Characteristic polynomial and roots