Get AI summaries of any video or article — Sign up free
Ordinary Differential Equations 24 | Characteristic Polynomial thumbnail

Ordinary Differential Equations 24 | Characteristic Polynomial

5 min read

Based on The Bright Side of Mathematics's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

Rewrite an nth-order linear homogeneous autonomous ODE as a first-order system ẏ = A y using y1 = x, y2 = ẋ, …, y_n = x^{(n−1)}.

Briefing

For linear, homogeneous, autonomous differential equations of order n, the path to the general solution runs through the characteristic polynomial—because it determines the eigenvalues that control the matrix exponential. Start with the standard first-order system form ẋ = A x, where A is an n×n matrix. When the eigenvalues of A are known, the solution set is spanned by columns of e^{tA}, and in the best case (n distinct real eigenvalues) the matrix exponential becomes straightforward to compute via diagonalization. This matters because it turns a higher-order differential equation problem into an eigenvalue problem with a clean algebraic entry point.

The same eigenvalue logic carries over to an nth-order linear homogeneous autonomous ODE: x^{(n)} + a_{n-1}x^{(n-1)} + … + a_1 ẋ + a_0 x = 0. Converting it to a first-order system uses the usual substitution y1 = x, y2 = ẋ, …, y_n = x^{(n-1)}. Under this change of variables, the system becomes ẏ = A y with a companion-matrix structure: the first n−1 rows shift the derivatives upward (0,1 in the appropriate positions), while the last row encodes the ODE coefficients with entries −a0, −a1, …, −a_{n−1}. Solving ẏ = A y again reduces to computing e^{tA}, so the eigenvalues of A become the decisive quantities.

Those eigenvalues come from the characteristic polynomial of A. The characteristic polynomial is defined as det(A − λI), and for this companion-matrix form it simplifies to a specific pattern: the determinant yields a factor of (−1)^n times a polynomial in λ whose coefficients match the ODE coefficients in reverse order. Concretely, the polynomial takes the form λ^n + a_{n−1}λ^{n−1} + … + a_1 λ + a_0 (up to the overall sign factor). The key takeaway is that the characteristic polynomial of the differential equation is the same object you get from the matrix A, and its zeros are exactly the eigenvalues needed for e^{tA}.

A practical memory aid reinforces this: test an exponential trial solution x(t) = e^{λt}. Plugging it into the ODE makes derivatives pull down powers of λ, reproducing the characteristic polynomial. Then the general solution follows from the roots. If A has n distinct real eigenvalues λ1,…,λn, A is diagonalizable, and the solution space is spanned by n exponential functions e^{λ_i t}. Returning from y to x uses the first component y1 = x, so the original nth-order ODE has a general solution that is a linear combination of those exponentials. When eigenvalues repeat or A is not diagonalizable over the reals, the zeros of the characteristic polynomial still come first—but additional cases must be handled in later discussions.

Cornell Notes

Linear homogeneous autonomous ODEs of order n can be rewritten as a first-order system ẏ = A y using y1 = x, y2 = ẋ, …, y_n = x^{(n−1)}. The companion matrix A encodes the ODE coefficients in its last row (−a0, −a1, …, −a_{n−1}) and shifts derivatives in the upper rows. Solving ẏ = A y reduces to computing e^{tA}, whose behavior is controlled by the eigenvalues of A. Those eigenvalues are the zeros of the characteristic polynomial det(A − λI), which matches the polynomial obtained by substituting x(t)=e^{λt} into the ODE. With n distinct real eigenvalues, the general solution becomes a linear combination of exponentials e^{λ_i t}; repeated roots require more work beyond diagonalization.

How does an nth-order linear homogeneous autonomous ODE turn into a first-order system?

Given x^{(n)} + a_{n−1}x^{(n−1)} + … + a_1 ẋ + a_0 x = 0, define y1 = x, y2 = ẋ, …, y_n = x^{(n−1)}. Then ẏ1 = y2, ẏ2 = y3, …, and ẏ_{n−1} = y_n. The last equation uses the ODE to express x^{(n)} in terms of lower derivatives, producing ẏ_n = −a0 y1 − a1 y2 − … − a_{n−1} y_n. This yields ẏ = A y with a companion matrix A.

What is the companion matrix A for this ODE, and why does it matter?

A has a shift structure in the first n−1 rows and coefficient encoding in the last row. The first row has 0,1,0,…,0 so that ẏ1 = y2; the second row shifts again so ẏ2 = y3; continuing this way, the (n−1)th row shifts so ẏ_{n−1} = y_n. The last row is [−a0, −a1, …, −a_{n−1}], so ẏ_n becomes the linear combination dictated by the original ODE. This matrix form makes the solution depend on e^{tA} and therefore on eigenvalues.

How is the characteristic polynomial of the ODE obtained from det(A − λI)?

For the companion matrix A, det(A − λI) simplifies (up to an overall sign factor (−1)^n) to a degree-n polynomial in λ whose coefficients match the ODE: λ^n + a_{n−1}λ^{n−1} + … + a_1 λ + a_0. The zeros of this polynomial are the eigenvalues of A, which are the exponents appearing in the exponential solutions when diagonalization applies.

Why does substituting x(t)=e^{λt} reproduce the characteristic polynomial?

If x(t)=e^{λt}, then each derivative brings down a factor of λ: ẋ = λe^{λt}, x^{(k)} = λ^k e^{λt}. Substituting into x^{(n)} + a_{n−1}x^{(n−1)} + … + a_0 x = 0 yields e^{λt}(λ^n + a_{n−1}λ^{n−1} + … + a_0)=0. Since e^{λt}≠0, the remaining factor must vanish, giving exactly the characteristic polynomial equation.

When do exponential solutions span the full solution space, and what do they look like?

If A has n distinct real eigenvalues λ1,…,λn, then A is diagonalizable. In that case, e^{tA} produces solutions built from e^{λ_i t}, and the solution space is n-dimensional. The original ODE’s general solution is a linear combination of these exponentials, because x corresponds to the first component y1 in the first-order system.

What changes when A is not diagonalizable over the reals?

The characteristic polynomial step still works: its zeros still determine the eigenvalues. But repeated eigenvalues and non-diagonalizability mean the simple “n distinct exponentials” spanning argument no longer applies. Additional solution forms (handled in later cases) are needed beyond the diagonalizable scenario.

Review Questions

  1. Given x^{(n)} + a_{n−1}x^{(n−1)} + … + a_0 x = 0, write the companion matrix A for the system ẏ = A y.
  2. How do the zeros of det(A − λI) relate to exponential trial solutions x(t)=e^{λt}?
  3. Under what eigenvalue condition does the general solution reduce to a linear combination of n exponentials e^{λ_i t}?

Key Points

  1. 1

    Rewrite an nth-order linear homogeneous autonomous ODE as a first-order system ẏ = A y using y1 = x, y2 = ẋ, …, y_n = x^{(n−1)}.

  2. 2

    Use the companion-matrix structure: the first n−1 rows shift derivatives, and the last row is [−a0, −a1, …, −a_{n−1}].

  3. 3

    Solve ẏ = A y via the matrix exponential e^{tA}, whose key ingredients are the eigenvalues of A.

  4. 4

    Compute eigenvalues by finding the zeros of the characteristic polynomial det(A − λI), which matches the polynomial from substituting x(t)=e^{λt}.

  5. 5

    For n distinct real eigenvalues, A is diagonalizable and the solution space is spanned by exponentials e^{λ_i t}.

  6. 6

    Even when diagonalization fails over the reals, the characteristic polynomial still provides the eigenvalues; extra cases determine the full solution form.

Highlights

The characteristic polynomial of the ODE is the same polynomial obtained from det(A − λI) for the companion matrix built from the ODE coefficients.
Trying x(t)=e^{λt} turns the differential equation into a pure algebraic condition λ^n + a_{n−1}λ^{n−1} + … + a_0 = 0.
When A has n distinct real eigenvalues, the general solution becomes a linear combination of n exponentials e^{λ_i t}.
The companion matrix encodes the ODE directly: its last row is −a0, −a1, …, −a_{n−1}.