Substituting the trial solution into \mathbf{y}' = \mathbf{A}\mathbf{y} turns the differential equation into the eigenvalue equation . When has independent eigenvectors, the resulting solutions form a fundamental set and the problem is finished.
Quick Reference
| Item | Statement |
|---|---|
| Matrix form | |
| Trial solution | |
| Resulting condition | , so is an eigenvalue and an eigenvector |
| Characteristic equation | |
| Non-defective matrix | has linearly independent eigenvectors |
| General solution | |
| Guaranteed non-defective if | is symmetric, skew-symmetric, or has distinct eigenvalues |
| Complex eigenvalue | Real solutions are and |
| Conjugate pairs | If is an eigenvalue of a real , so is , with eigenvector |
Matrix Form
Consider the system of differential equations
\left\{ \begin{aligned} \frac{dy_1}{dt} &= a_{11}y_1 + a_{12}y_2 + \cdots + a_{1n}y_n \\ \frac{dy_2}{dt} &= a_{21}y_1 + a_{22}y_2 + \cdots + a_{2n}y_n \\ &\ \ \vdots \\ \frac{dy_n}{dt} &= a_{n1}y_1 + a_{n2}y_2 + \cdots + a_{nn}y_n \end{aligned} \right.where the are constants. We want to find satisfying these equations simultaneously.
The system can be written as
where
Differentiating a vector means differentiating each component, so is defined entrywise.
Why Eigenvectors Appear
We try a solution in which every component is the same exponential times a constant:
where and are constants to be determined. In vector form,
Differentiating both sides,
\underbrace{\begin{bmatrix} y_1'(t) \\ \vdots \\ y_n'(t) \end{bmatrix}}_{d\mathbf{y}/dt} = \lambda e^{\lambda t}\mathbf{v}and substituting into \mathbf{y}' = \mathbf{A}\mathbf{y},
\begin{aligned} \lambda e^{\lambda t}\mathbf{v} &= \mathbf{A}\left(e^{\lambda t}\mathbf{v}\right) \\ &= e^{\lambda t}\mathbf{A}\mathbf{v} \end{aligned}where the scalar was moved past the matrix, which is legitimate since scalars commute with matrices. Because , we may cancel it from both sides:
This means is an eigenvector and an eigenvalue of . So is a nontrivial solution of the system if and only if is an eigenvalue and is a corresponding eigenvector.
For a system of linear differential equations, two cases must be distinguished:
- has linearly independent eigenvectors. Such a matrix is called non-defective.
- does not have linearly independent eigenvectors. Such a matrix is called defective, and is treated in Section 5.2.
Non-defective Coefficient Matrix
Assume has linearly independent eigenvectors corresponding to eigenvalues .
This assumption holds in most applications, and in particular whenever
- is symmetric, that is, ;
- is skew-symmetric, that is, , in which case all diagonal entries must be zero;
- has distinct eigenvalues.
In this case, corresponding solutions are
Computing the Wronskian of these solutions shows that they are linearly independent, so the general solution of \mathbf{y}' = \mathbf{A}\mathbf{y} is
Find the general solution of
\left\{ \begin{aligned} \frac{dy_1}{dt} &= 3y_1 - 2y_2 \\[1ex] \frac{dy_2}{dt} &= -y_1 + 2y_2 \end{aligned} \right.Solution
Rewrite the system as
Step 1: eigenvalues.
\begin{aligned} p(\lambda) &= \det\left(\mathbf{A} - \lambda\mathbf{I}\right) \\ &= \begin{vmatrix} 3-\lambda & -2 \\ -1 & 2-\lambda \end{vmatrix} \\ &= (3-\lambda)(2-\lambda) - 2 \\ &= \lambda^{2} - 5\lambda + 4 = (\lambda-1)(\lambda-4) = 0 \end{aligned}Therefore the eigenvalues are and .
Step 2: eigenvectors. Because has two distinct eigenvalues, we know it has two linearly independent eigenvectors. For , solve :
\begin{bmatrix} 2 & -2 \\ -1 & 1 \end{bmatrix} \begin{bmatrix} v_1^{(1)} \\ v_2^{(1)} \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} \quad \Longrightarrow \quad \left\{ \begin{aligned} 2v_1^{(1)} - 2v_2^{(1)} &= 0 \\ -v_1^{(1)} + v_2^{(1)} &= 0 \end{aligned} \right.The two equations reduce to the single equation . The rows becoming dependent is exactly what must happen, since was chosen to make the determinant vanish. Thus and we may take
Similarly, for ,
so we may take
Step 3: assemble. Two linearly independent solutions are
and the general solution is
or, componentwise,
Complex-Valued Eigenvalues
Consider a system of linear homogeneous equations with constant coefficients
When the elements of are real, if is an eigenvalue of , then its complex conjugate is also an eigenvalue. Two linearly independent real solutions of (i) corresponding to these two eigenvalues are
where is an eigenvector corresponding to , and and denote the real and imaginary parts of the vector.
Why the conjugate is automatic, and why the real and imaginary parts work
If the components of are real, its characteristic equation is a polynomial with real coefficients. Therefore any complex roots occur in conjugate pairs: if is an eigenvalue, so is .
Suppose is an eigenvector corresponding to , so
Taking the complex conjugate of both sides,
\begin{aligned} \overline{\left(\mathbf{A} - \lambda_1\mathbf{I}\right)\mathbf{v}^{(1)}} &= \overline{\mathbf{0}} \\ \left(\mathbf{A} - \overline{\lambda_1}\mathbf{I}\right)\overline{\mathbf{v}^{(1)}} &= \mathbf{0} \end{aligned}using since is real, along with and . This shows is an eigenvector corresponding to , so the second eigenvector requires no computation.
Two solutions of \mathbf{y}' = \mathbf{A}\mathbf{y} corresponding to these eigenvalues are
which are complex conjugates of each other. Since the system is linear with real coefficients, any combination of solutions is a solution, so we obtain two real-valued ones by taking
and
These are the familiar identities and , applied componentwise.
Practical consequence. Compute the eigenvector for only one member of a conjugate pair, expand using Euler's formula, and read off the real and imaginary parts. The conjugate eigenvalue contributes nothing new.
Solve the initial-value problem
\mathbf{y}' = \begin{bmatrix} 1 & -1 \\ 1 & 1 \end{bmatrix}\mathbf{y}, \qquad \mathbf{y}(0) = \begin{bmatrix} 1 \\ 2 \end{bmatrix} .Solution
Step 1: eigenvalues.
\begin{aligned} \det\left(\mathbf{A} - \lambda\mathbf{I}\right) &= \begin{vmatrix} 1-\lambda & -1 \\ 1 & 1-\lambda \end{vmatrix} \\ &= (1-\lambda)^{2} + 1 \\ &= \lambda^{2} - 2\lambda + 2 = 0 . \end{aligned}The eigenvalues are and .
Step 2: one eigenvector. From ,
The first row gives , so . Choosing ,
Without further calculation, the eigenvector corresponding to is the conjugate,
Step 3: expand and take real and imaginary parts. Two complex solutions are
Expanding the first with , and noting that ,
Therefore a set of real-valued solutions is
Step 4: general solution.
Step 5: apply the initial condition. At , and , so
Therefore the solution of the initial-value problem is
or
The trajectory is a spiral: the factor grows while the trigonometric factors rotate, so the solution spirals outward from the origin.
Exercises
Solve \mathbf{y}' = \begin{bmatrix} 1 & 2 \\ 2 & 1 \end{bmatrix}\mathbf{y}.
Solution
For : gives .
For : gives .
Note that is symmetric here, which guaranteed in advance that it would be non-defective.
Solve \mathbf{y}' = \begin{bmatrix} 0 & -4 \\ 1 & 0 \end{bmatrix}\mathbf{y} and describe the trajectories.
Solution
For : . The second row gives , so with , .
Then
Therefore
Since , there is no growth or decay: the trajectories are closed ellipses traversed with period . This is the phase portrait of an undamped oscillator.
Solve the initial value problem \mathbf{y}' = \begin{bmatrix} 2 & 3 \\ 0 & -1 \end{bmatrix}\mathbf{y}, .
Solution
The matrix is triangular, so the eigenvalues are the diagonal entries and .
For : gives , so .
For : gives , so .
At : and , so and . Therefore
Frequently Asked Questions
Why does the trial solution force to be an eigenvector?
Substituting gives . Cancelling the nonzero scalar leaves , which is the definition of an eigenpair. Geometrically, the trial solution asks for a direction that the flow leaves unchanged apart from stretching, and that is exactly what an eigenvector is.
How do I know if a matrix is non-defective?
Three sufficient conditions cover most cases: distinct eigenvalues, symmetry, or skew-symmetry. Beyond those, you have to compute. Defectiveness can only occur when an eigenvalue repeats, so if the characteristic polynomial has no repeated roots, you are safe.
Does the choice of eigenvector matter?
Only up to a nonzero scalar multiple, which is absorbed into the arbitrary constant . Taking or gives the same family of solutions. Choose whichever avoids fractions.
Why do the eigenvector equations always turn out to be redundant?
Because was chosen precisely so that , which means the rows of are linearly dependent. If both equations of a system give genuinely different information, you have made an arithmetic error in the eigenvalue.
Must I compute both eigenvectors of a complex pair?
No. If is an eigenvector for , then is one for , and the two complex solutions are conjugates. Taking real and imaginary parts of just one of them produces both real solutions. Computing the second eigenvector is wasted effort.
How do the eigenvalues describe the picture in the plane?
The sign of the real part governs growth: negative means solutions decay toward the origin, positive means they grow away from it. The imaginary part governs rotation: nonzero makes trajectories spiral or, when , trace closed ellipses. Two real eigenvalues of opposite sign make the origin a saddle point, with solutions approaching along one eigendirection and leaving along the other.