Math 2.0

statement theorem

Geometric solutions come from roots of the characteristic polynomial

Statement

Let RR be a commutative ring, let EE be a linear recurrence with constant coefficients over RR, and let q∈Rq \in R. Then the sequence (qn)n≥0(q^n)_{n \ge 0} is a solution of EE if and only if qq is a root of the characteristic polynomial χE\chi_E.

Remarks

Proof idea: for the sequence qnq^n the recurrence at index nn reads qnχE(q)=0q^n \chi_E(q) = 0. At n=0n = 0 this is χE(q)=0\chi_E(q) = 0. Over a field, if χE\chi_E has dd distinct roots q1,…,qdq_1, \dots, q_d, every solution is un=a1q1n+⋯+adqdnu_n = a_1 q_1^n + \dots + a_d q_d^n with constants aia_i. Binet's formula is the case of the Fibonacci recurrence.

Explanations

L1 human

Try a solution of the form un=qnu_n = q^n. Put it into the recurrence and divide by qnq^n. What is left is the equation χE(q)=0\chi_E(q) = 0.

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.

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
  4. Solution of a linear recurrence definition
  5. Geometric solutions come from roots of the characteristic polynomial statement

Sources

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