# Difference between revisions of "Characteristic polynomial"

The characteristic polynomial of a linear operator refers to the polynomial whose roots are the eigenvalues of the operator. It carries much information about the operator.

## Definition

Suppose $A$ is a $n \times n$ matrix (over a field $K$). Then the characteristic polynomial of $A$ is defined as $P_A(t) = \Det(tI - A)$ (Error compiling LaTeX. ! Undefined control sequence.), which is a $n$th degree polynomial in $t$. Here, $I$ refers to the $n\times n$ identity matrix.

Written out, the characteristic polynomial is the determinant

$$P_A(t) = \begin{vmatrix}t-a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & t-a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{n1} & a_{n2} & \cdots & t-a_{nn}\end{vmatrix}$$

## Properties

An eigenvector $\bold{v} \in K^n$ is a non-zero vector that satisfies the relation $A\bold{v} = \lambda\bold{v}$, for some scalar $\lambda \in K$. In other words, applying a linear operator to an eigenvector causes the eigenvector to dilate. The associated number $\lambda$ is called the eigenvalue.

There are at most $n$ distinct eigenvalues, whose values are exactly the roots of the characteristic polynomial of the square matrix. To prove this, we use the fact that the determinant of a matrix is $0$ iff the column vectors of the matrix are linearly dependent. Observe that if $\lambda$ satisfies $\det(\lambda I-A) = 0$, then the column vectors of $\lambda I - A$ are linearly dependent. Hence, there exists a non-zero vector $\bold{v} \in K^n$ such that $(\lambda I - A) \bold{v} = \bold{O}$. Distributing and re-arranging, $A\bold{v} = \lambda\bold{v}$, as desired. In the other direction, if $A \bold{v} = \lambda \bold{v}$, then $\lambda I \bold{v} - A \bold{v} = \bold{O}$. But then, the column vectors of $\lambda I - A$ are linearly dependent, so it follows that $\det(\lambda I - A) = 0$.

By the Hamilton-Cayley Theorem, the character polynomial of a square matrix applied to the square matrix itself is zero.

## Linear recurrences

Consider a monic homogenous linear recurrence of the form

$$x_{n} = c_1x_{n-1} + c_2x_{n-2} + \cdots + c_kx_{n-k}, \quad (*)$$

where $x_n$ is a sequence of real numbers, and $c_1, \ldots, c_k$ are real constants. The characteristic polynomial of this recurrence is the polynomial

$$P(x) = x^k - c_1x^{k-1} - c_2x^{k-2} - \cdots -c_{k-1}x - c_k.$$

For example, let $F_n$ be the $n$th Fibonacci number defined by $F_1 = F_2 = 1$, and

$$F_n = F_{n-1} + F_{n-2} \Longleftrightarrow F_n - F_{n-1} - F_{n-2} = 0.$$

Then, its characteristic polynomial is $x^2 - x - 1$.

The roots of the polynomial can be used to write a closed form for the recurrence. If the roots of this polynomial $P$ are distinct, then suppose the roots are $r_1,r_2, \cdots, r_k$. Then, there exists real constants $a_1, a_2, \cdots, a_k$ such that

$$x_n = a_1 \cdot r_1^n + a_2 \cdot r_2^n + \cdots + a_k \cdot r_k^n$$

If we evaluate $k$ different values of $x_i$ (typically $x_0, x_1, \cdots, x_{k-1}$), we can find a linear system in the $a_i$s that can be solved for each constant. Refer to the introductory problems below to see an example of how to do this. In particular, for the Fibonacci numbers, this yields Binet's formula.

If there are roots with multiplicity greater than $1$, suppose $r_1 = r_2 = \cdots = r_{k_1}$. Then we would replace the term $a_1 \cdot r^n + a_2 \cdot r_2^n + \cdots + a_{k_1} \cdot r_{k_1}^n$ with the expression $(a_1 \cdot n^{k_1-1} + a_2 \cdot n^{k_1 - 2} + \cdots + a_{k_1-1} \cdot n + a_{k_1}) \cdot r^n$.

For example, consider the recurrence relation $x_n = -2x_{n-1} -x_{n-2} \Longleftrightarrow x_n + 2x_{n-1} + x_{n-2} = 0$. It’s characteristic polynomial, $x^2 + 2x + 1$, has a $-1$ double root. Then, its closed form solution is of the type $x_n = (-1)^n(an + b)$.

### Proof

Note: The ideas expressed in this section can be transferred to the next section about differential equations.

The following proof is from linear algebra, by the spectral theorem. Let $\bold{y}_{n-1} = \begin{pmatrix} x_{n-1} \\ x_{n-2} \\ \vdots \\ x_{n-k} \end{pmatrix}$. Then, we can express our linear recurrence as the matrix

$$A = \begin{pmatrix}a_1 & a_2 & a_3 & \cdots & a_{k-1} & a_{k} \\ 1 & 0 & 0 & \cdots &0 & 0 \\ 0 & 1 & 0 & \cdots & 0 & 0 \\ \vdots & \vdots & \vdots & \ddots & \ddots & \vdots \\ 0 & 0 & 0 & \cdots & 1 & 0 \end{pmatrix},$$

so that $\bold{y}_n = A\bold{y}_{n-1}$ (try to verify this). The characteristic polynomial of $A$ is precisely $P_A(t) = \det (tI - A) = a_1 \cdot t^{k-1} + a_2 \cdot t^{k-2} \cdots + a_k = 0$ (again, try to verify this). If the roots of $P_A$ are distinct, then there exists a basis (of $\mathbb{R}^{k-1}$) consisting of eigenvectors of $A$. That is, we can write

$$A = U^{-1} D U$$

for an unitary matrix $U$ and a diagonal matrix $D$. Then, $A^2 = U^{-1} D U U^{-1} D U = U^{-1} D^2 U$, and in general, $A^n = U^{-1} D^n U$. Thus, $\bold{y}_{n} = A^{n}\bold{y}_0 = U^{-1}D^{n+k}U\bold{y}_0$. Here, $U^{-1}, U,$ and $\bold{y}_0$ are fixed (note that to find the values of $\bold{y}_0$, we may need to trace the recurrence backwards. We only take the $0$th index for simplicity). It follows that $y_{n}$ is a linear combination of the diagonal elements of $D$, namely $r_1^n, r_2^n, \ldots, r_k^n$.

There are a couple of other ways to prove this. One is by induction, though the proof is not very revealing; we can explicitly check that a sequence $\{a_1 \cdot r_1^n + a_2 \cdot r_2^n + \cdots + a_k \cdot r_k^n\}$, for real numbers $a_1, a_2, \ldots, a_k$, satisfies the linear recurrence relation $(*)$. If the two sequences are the same for the first $k$ values of the sequence, it follows by induction that the two sequences must be exactly the same.

In particular, for $k=2$, we can check this by using the identity

$$ax^{n+1} + by^{n+1} = (x+y)(ax^n + by^n) - xy(ax^{n-1} + by^{n-1}).$$

A second method is to use partial fractions. Consider the generating function given by

$$F(x) = \frac{}{}$$

See these blogposts for further ideas.

## Differential equations

Given a monic linear homogenous differential equation of the form $D^ny +c_{n-1}D^{n-1}y + \cdots + c_1Dy + c_0y = 0$, then the characteristic polynomial of the equation is the polynomial

$$P(t) = t^n + c_{n-1}t^{n-1} + c_{n-2}t^{n-2} + \cdots + c_0.$$

Here, $D = \frac{d}{dx}$ is short-hand for the differential operator.

If the roots of the polynomial are distinct, say $r_1, r_2, \cdots, r_n$, then the solutions of this differential equation are precisely the linear combinations $y(x) = a_1e^{r_1x} + a_2e^{r_2x} + \cdots + a_ne^{r_nx}$. Similarly, if there is a set of roots with multiplicity greater than $1$, say $r_1, r_2, \cdots, r_k$, then we would replace the term $a_1e^{r_1x} + \cdots + a_ke^{r_kx}$ with the expression $(a_1x^{k-1} + a_2x^{k-2} + \cdots + a_{k-1}x + a_k)e^{r_1x}$.

In general, given a linear differential equation of the form $Ly = f$, where $L = c_nD^n + c_{n-1}D^{n-1} + \cdots + c_0$ is a linear differential operator, then the set of solutions is given by the sum of any solution to the homogenous equation $Ly = 0$ and a specific solution to $Ly = f$.

### Proof

We can apply an induction technique similar to the section on linear recurrences above.

From linear algebra, we can use the following theorem.

## Problems

• Prove Binet's formula. Find a similar closed form equation for the Lucas sequence, defined the starting terms $L_1 = 2, L_2 = 1$, and $L_n = L_{n-1} + L_{n-2}$.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 2, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 93, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}