4.6.21 · D5Ordinary Differential Equations

Question bank — Systems of first-order linear ODEs — matrix method

1,761 words8 min readBack to topic

Before the traps, pin down the notation so nothing sneaks in undefined:

Reminders of the rest of the vocabulary you must use precisely:

  • eigenpair : a number and a nonzero vector with — see Eigenvalues and Eigenvectors.
  • algebraic multiplicity: how many times is a root of .
  • geometric multiplicity: how many independent eigenvectors actually has.
  • defective: geometric algebraic multiplicity (too few eigenvectors) — see Diagonalization.

The next figure is your visual dictionary for the trajectory shapes referenced throughout — keep it in view.

Figure — Systems of first-order linear ODEs — matrix method

True or false — justify

True or false: a system always has exactly eigenvalues, so it always has independent solutions.
False. It has eigenvalues counted with multiplicity, but independent solutions come from independent eigenvectors (plus generalized eigenvectors). A defective matrix has fewer eigenvectors, so you must build the missing modes from generalized eigenvectors solving .
True or false: if every eigenvalue of has negative real part, every solution decays to as .
True. Each mode carries , and ; if every real part is negative, every mode shrinks, so the origin is asymptotically stable — see Phase Portraits and Stability.
True or false: multiplying an eigenvector by gives a different solution of the system.
False in the sense of "new information." is still an eigenvector for the same ; the solution just absorbs the into the constant . It spans the same solution line.
True or false: two distinct eigenvalues always give two linearly independent solutions.
True. Suppose ; apply to get , subtract times the first to get . Since and , , then — so the eigenvectors, and hence the two modes, are independent.
True or false: a real matrix with complex eigenvalues has real eigenvectors.
False. Complex eigenvalues force complex eigenvectors ; the real solutions are then rebuilt from the real part and imaginary part via Euler's Formula.
True or false: the general solution is correct as long as you found the right 's.
False. That expression is a scalar — each term must carry its eigenvector: . Without there is no direction and the answer isn't a vector.
True or false: if is an eigenvalue, that mode contributes a solution that stays put.
True. The mode is , a constant vector. So there is a whole line of equilibria along ; nothing moves along it.
True or false: swapping to instead of changes the eigenvalues.
False. The two polynomials differ only by a factor , so they have identical roots. Just stay consistent so the equation reads cleanly.

Spot the error

A student writes: " has eigenvalue twice, so the solution is with two eigenvectors."
Error: this matrix is defective — it has only one eigenvector . The second mode must use a generalized eigenvector with , giving with a genuine factor.
A student solves complex and keeps four solutions: two from and two from .
Error: double-counting. One conjugate pair yields exactly two independent real solutions (the real and imaginary parts of a single branch). The conjugate branch adds nothing new.
A student concludes: " so trajectories grow, because makes things blow up."
Error: growth/decay is controlled by the real part , here . The imaginary part only sets rotation frequency, so trajectories are closed circles (a center), not blow-up.
A student cancels from but worries it might be zero for some .
No error, and the worry is unfounded: for every real (and complex) , so dividing it out is always legal. That's exactly why the exponential ansatz collapses to the algebraic eigenvalue equation.
A student writes the generalized-eigenvector solution as .
Error: the roles are swapped. The correct form is — the eigenvector multiplies , because it's that annihilates.
A student says "the origin is always a solution, so it's stable."
Error: is always an equilibrium, but stability depends on the eigenvalues. A positive real part makes nearby trajectories fly away — the origin is then unstable.

Why questions

Why do we guess rather than some other function?
Because in a fixed direction the equation must reduce to a scalar equation , whose only solution is an exponential. The exponential is the one function that reproduces itself under differentiation.
Why does a repeated eigenvalue sometimes still give two eigenvectors and not require generalized ones?
Because algebraic multiplicity and geometric multiplicity can be equal — e.g. has twice but a full 2-dimensional eigenspace. Only when eigenvectors run short ( is defective) do you need the trick.
Why does the factor appear in the defective case?
Substituting and using makes both sides of balance. The supplies the extra degree of freedom the missing eigenvector couldn't.
Why does a complex eigenvalue produce spirals rather than straight-line motion?
Because by Euler's Formula: scales radius (grow/decay) while rotates. Straight-line motion needs a real eigenvector, which complex lacks.
Why can any solution be written as a superposition of the eigenvector solutions?
Because the system is linear, so sums of solutions are solutions, and the independent eigenvector modes span an -parameter family — matching the free constants a first-order -dimensional system must have.
Why does the sign of the real part alone decide long-run behaviour, ignoring the eigenvectors?
Eigenvectors only set the directions of the modes; the factor decides whether each mode's amplitude grows or shrinks. So stability is read straight off — see Phase Portraits and Stability.

Edge cases

Refer back to the figure above for each portrait shape named here.

What is the solution when is already diagonal, ?
The variables are already decoupled, so , independently. The standard basis vectors are the eigenvectors — no mixing to undo.
What happens if (the zero matrix)?
Then , so every solution is a constant . Every direction is an eigenvector with ; the whole plane is equilibria.
What if has one eigenvalue and one ?
The mode gives a fixed direction (a line of equilibria) while the mode decays onto it. Trajectories slide toward that line — a degenerate / non-isolated stable case.
What is the phase portrait when with ?
An outward spiral (unstable spiral / focus): each turn is scaled by , so the radius grows while keeps it rotating.
What is the phase portrait when with ?
An inward spiral (stable spiral / focus): each turn is scaled by , so the radius shrinks toward the origin while keeps it rotating — trajectories spiral in.
What if the two real eigenvalues have opposite signs, ?
A saddle: trajectories are pushed out along and pulled in along . Only points starting exactly on the line reach the origin; all others escape.
What if inside a supposedly complex pair — i.e. the discriminant collapses?
Then the eigenvalues are actually real and equal (); there is no rotation. You've hit the repeated-eigenvalue case and must check whether is defective.

Recall One-line summary of the traps

Count eigenvectors not eigenvalues; keep the eigenvector attached to each exponential term; read growth from and rotation from ; and always check the degenerate boundaries (, repeated, defective, ).