7.8 Basic Theorems on Homogeneous Linear Systems
In Sections 7.6 and 7.7 we used several facts without proof: that independent solutions give every solution, that the Wronskian can be checked at a single point, that , and that eigenvectors of distinct eigenvalues are independent. This section proves them. The proofs are short and are written in small steps. They also work for systems whose coefficients depend on , which the eigenvalue method cannot handle, so the results here are more general than anything we have used so far. Section 7.3 did the same for systems; Section 4.6 did it for second-order equations. You will recognize many arguments.
Throughout, is an interval of the real line (open, closed or half-open), and we consider
where is an matrix function and a vector function, all of whose entries are continuous on . A solution on is a differentiable vector function that satisfies the equation at every in .
Existence and uniqueness
Everything rests on one theorem. We state it without proof; one proof applies the method of successive approximations (Section 8.3) to the system, and it works because linear right-hand sides satisfy a Lipschitz condition on every closed bounded subinterval of .
Let the entries of and be continuous on the interval , let be a point of , and let be any constant vector. Then the initial-value problem
has exactly one solution, and this solution is defined on the whole interval .
Two features deserve attention. First, the solution exists on all of , not just near . This is special to linear systems; a nonlinear equation such as can blow up in finite time even though its right side is smooth. Second, for constant and we can take , so every solution of is defined for all .
The following consequence is used in almost every proof below.
If is a solution of (H) on and for one point in , then for all in .
Proof. The zero function is a solution of (H) with value at . So is . By the uniqueness part of Theorem 7.8.1 the two solutions coincide.
Geometrically, for and constant this says what we saw in the phase portraits of Section 7.6: no trajectory other than the equilibrium itself ever reaches the origin. More generally, two different solutions can never take the same value at the same time.
Superposition
If are solutions of (H) on and are constants, then is also a solution of (H) on .
Proof.
- Differentiate term by term: .
- Use that each is a solution: . So .
- Matrix multiplication is distributive and constants can be moved through : .
The theorem fails for (N): the sum of two solutions of (N) has forcing , not . That is why the homogeneous system comes first.
Linear independence and the Wronskian
Recall from Definition 7.5.8 that vector functions are linearly dependent on if some combination with constant coefficients, not all zero, vanishes at every in .
The Wronskian of vector functions , each with components, is the determinant of the matrix having them as columns:
The first result holds for any vector functions, solutions or not.
If for at least one in , then are linearly independent on .
Proof. Suppose for all in . In particular this holds at . In matrix form it says , where and . Since , Theorem 7.5.2 gives . So the only vanishing combination is the trivial one.
The converse is false for general vector functions, as the next example shows. It becomes true for solutions of (H); that is Theorem 7.8.7 below.
Let and . Show that they are independent on every interval, although their Wronskian is identically zero. Conclude that they cannot both be solutions of one system with continuous on an interval.
Solution
- Wronskian. for all .
- Independence. If for all in an interval, the first component gives there. A linear polynomial that vanishes at more than one point is the zero polynomial, so .
- Conclusion. If they were solutions of such a system, Theorem 7.8.7 (proved below) would say: independent solutions have a Wronskian that is never zero. But here . So no continuous can have both as solutions. Figure 7.8.1 shows what goes wrong: at each fixed the two vectors are parallel, although the multiplier between them changes with time.
Liouville's formula
For solutions of (H) the Wronskian satisfies a simple first-order differential equation of its own. To derive it we need a rule for differentiating a determinant.
If the entries of an matrix are differentiable, then is the sum of determinants; the -th of them is with row replaced by its derivative.
Proof. For , by the product rule,
For general the same thing happens: a determinant is a sum of terms , each containing exactly one entry from each row. Differentiating a product of factors by the product rule gives terms, in the -th of which only the factor from row is differentiated. Collecting, for each , the terms in which row was differentiated gives exactly the determinant with row replaced by its derivative.
Let be solutions of (H) on , let be their Wronskian and let be in . Then for all in
Consequently is either identically zero on or never zero on .
Proof.
- Rows of . Let . Since every column solves (H), . Reading this row by row: row of equals .
- One of the determinants. By Theorem 7.8.5, is a sum of determinants; in the -th, row of is replaced by the combination in step 1. A determinant is linear in each row, so this determinant splits into pieces: times the determinant of with row replaced by row . For that matrix has two equal rows, so its determinant is . Only survives, and it gives .
- Add up. Summing over ,
- Solve. This is a first-order linear equation for . Multiplying by the integrating factor shows that has derivative zero, hence equals its value at . This is the formula.
- Zero or never zero. The exponential is never zero. So if , then on ; if , then for every in .
Geometrically, for the Wronskian is the signed area of the parallelogram spanned by and (for , the volume of a parallelepiped). Liouville's formula says that this area changes at the relative rate . In particular it can shrink to zero only in the limit , never at a finite time (Figure 7.8.2).
The equation is equivalent to the system with . For two solutions the Wronskian of the vector solutions , is exactly the Wronskian of Chapter 4, and the trace is . So Liouville's formula reduces to Abel's formula (Theorem 4.6.5).
Verify that and solve on , and check Liouville's formula with .
Solution
- Continuity. The entries and are continuous on (but not at ), so the theorems apply on .
- . and .
- . and .
- Wronskian. , so .
- Liouville. and , so the formula predicts . It agrees. Note that on all of , as Theorem 7.8.6 requires; it vanishes only at , where is not continuous.
Let be solutions of (H) on . The following are equivalent:
- are linearly independent on ;
- for every in ;
- for at least one in .
Proof. Statements 2 and 3 are equivalent by the "zero or never zero" part of Theorem 7.8.6, and 3 implies 1 by Theorem 7.8.4. It remains to show that 1 implies 3. We show the contrapositive: if 3 fails, then 1 fails.
- Suppose at some (hence every) point . The columns of are then dependent (Theorem 7.5.3): there is with .
- Define . By superposition (Theorem 7.8.3) it is a solution of (H), and .
- By Theorem 7.8.2, for all in . That is a vanishing combination with constants not all zero, so the solutions are dependent on .
This is the result we used in Sections 7.6 and 7.7: to show that solutions are independent, it suffices to evaluate their Wronskian at one convenient point, usually .
Fundamental sets and the general solution
A set of linearly independent solutions of (H) on is a fundamental set. The matrix having them as columns is a fundamental matrix. By Theorem 7.8.7 a fundamental matrix satisfies
The system (H) has a fundamental set on .
Proof. Fix in and let be the columns of the identity matrix. By Theorem 7.8.1 there is, for each , a solution on with . Their Wronskian at is , so by Theorem 7.8.7 they are independent.
Let be a fundamental set of (H) on , with fundamental matrix . Then every solution of (H) on can be written as
for exactly one constant vector . In particular, the solution with is .
Proof.
- Choose the constants. Let be any solution and a point of . Since , the linear system has exactly one solution (Theorem 7.5.2).
- Compare. The function is a solution of (H) by superposition, and by the choice of .
- Conclude. By Theorem 7.8.2, , i.e. on all of . Uniqueness of : if , evaluate at and multiply by .
In the language of linear algebra, Theorems 7.8.3, 7.8.8 and 7.8.9 together say that the solutions of (H) form a vector space of dimension exactly , and a fundamental set is a basis of it. This is why the general solution of an system always contains exactly arbitrary constants.
A fundamental matrix is not unique; the next theorem tells us how any two are related, and justifies the formula for used in Section 7.7.
- If is a fundamental matrix and is a constant nonsingular matrix, then is a fundamental matrix.
- If and are fundamental matrices of the same system (H), then for some constant nonsingular matrix .
- If is constant and is any fundamental matrix of , then .
Proof.
- Part 1. , so each column of is a solution; and , so they are independent.
- Part 2. Each column of is a solution, so by Theorem 7.8.9 for a constant vector . Putting these side by side, with . Taking determinants, ; the left side is nonzero, so .
- Part 3. By Part 1 (with ), is a fundamental matrix, and it equals at . In Section 7.7 we saw that the columns of solve and that . So column of each matrix is the solution with initial value at . By uniqueness these columns coincide.
In Part 1 the constant matrix must multiply from the right. is usually not a fundamental matrix, because , which equals only if (see Exercise 5).
For the compartment system of Example 7.6.2, , compute from the fundamental matrix found there, and use it to recover the solution with .
Solution
- Fundamental matrix. , so , with determinant .
- Inverse. .
- Product. Check: at this is .
- Solution. is times the first column of : , as in Example 7.6.2.
Check Liouville's formula for the three solutions found in Example 7.7.2.
Solution
- Value at . At the solutions are , and . Expanding along the first column,
- Prediction. (which also equals the sum of the eigenvalues ). For a constant matrix Liouville's formula reads .
- Direct computation. Factor from the first column and from the other two; expanding the remaining determinant along its first column leaves . So , as predicted.
The nonhomogeneous system
Let be a fundamental matrix of (H) on and let be any one solution of (N) on . Then every solution of (N) on has the form
for a unique constant vector . One particular solution is
which is the solution with .
Proof.
- Differences solve (H). If is any solution of (N), then . By Theorem 7.8.9, for a unique .
- The formula. Put . The integrand is continuous because on and the entries of are quotients of continuous functions by . By the fundamental theorem of calculus, .
- Check. By the product rule, . So solves (N), and gives .
Combining with Theorem 7.8.9, the solution of (N) with is
and for constant (using and , valid because and commute) this becomes , the exact analogue of the scalar formula of Section 2.3.
Eigenvectors of distinct eigenvalues
Finally we prove the general form of Theorem 7.5.4, on which Theorems 7.6.2 and 7.7.1 rest.
Let be eigenvectors of a matrix belonging to eigenvalues that are all different. Then are linearly independent.
Proof.
- Assume the opposite. Suppose some nontrivial combination of the is . Among all such combinations pick one with the fewest nonzero coefficients. After renumbering, it reads with all . Since eigenvectors are nonzero, .
- Apply . Because , we get The term has disappeared.
- Contradiction. The coefficients , , are nonzero because and the eigenvalues are distinct. So this is a nontrivial vanishing combination with only nonzero coefficients, fewer than the minimum we chose. This is impossible, so the eigenvectors are independent.
Exercises
- Show that and are solutions of on . Compute their Wronskian and explain the result with Liouville's formula.
Answer
for all ; constant because . The two solutions form a fundamental set on . - The coefficients of a system satisfy on , and two solutions have Wronskian . Find .
Answer
- Let and . Can they both be solutions of a system with continuous on ? On ? In the second case find .
Answer
vanishes at but not elsewhere, which contradicts Theorem 7.8.6 on : impossible there. On it is possible: . - Use to compute for (Example 7.6.1).
Answer
- Let , and . Show that is a fundamental matrix of but is not.
Answer
: its columns are the same two solutions, swapped. : the column fails . - Prove: if two solutions and of (H) satisfy at one point of , then on all of .
Answer
solves (H) by superposition and vanishes at ; apply Theorem 7.8.2. - Three solutions of with have . Find without solving the system. Are they a fundamental set?
Answer
, so ; it is never zero, so yes. - Solve , , with the formula of Theorem 7.8.11 (compare Example 7.7.8).
Answer
- Prove: if are solutions of (H) and the vectors are linearly dependent for one in , then the functions are linearly dependent on .
Answer
Then (Theorem 7.5.3), and Theorem 7.8.7 gives dependence on . Directly: with , , the solution vanishes at , hence everywhere. - Write ( continuous on ) as a system for and deduce Abel's formula for the Wronskian of two solutions from Liouville's formula.
Answer
, , so .