DifferentialEquations
Chapter 4 · Section 4.1

4.1 Basic Theory of Linear Differential Equations

So far we have solved first-order equations one type at a time. From now on the main characters are equations of order two and higher, and almost all of them will be linear. Linear equations are worth a whole theory of their own for two reasons. First, they appear everywhere in engineering: a mass on a spring, the charge in an RLC circuit, the deflection of a beam and the temperature in a cooling fin are all described by linear equations. Second, linear equations have a beautifully simple structure. Once you understand that structure, the solving methods of the next sections become almost obvious.

This section contains very little "solving". Its job is to answer three questions. When does a linear initial-value problem have exactly one solution? How many solutions do we need to build every solution? And how do we check that the solutions we found are really different from each other? The answers involve continuity, superposition and a determinant called the Wronskian.

The nth-order linear equation

Definition 4.1.1 (Linear equation of order n)

A linear differential equation of order in the unknown is an equation that can be written as

where the coefficients and the right-hand side depend on only, and is not identically zero. If the equation is called homogeneous; otherwise it is nonhomogeneous.

"Linear" means that and its derivatives appear only to the first power, are never multiplied by each other, and never sit inside a function such as or . The coefficients, however, may be any functions of . For example,

are linear, while and are not.

A familiar engineering example is the series RLC circuit. If is the charge on the capacitor, the inductance, the resistance, the capacitance and the applied voltage, then

a second-order linear equation with constant coefficients. We will meet it again in Chapter 5.

Normalized form

On any interval where we may divide the whole equation by . The result has leading coefficient :

We call this the normalized form. Several formulas in this chapter (reduction of order below, variation of parameters in Section 4.4) are written for the normalized form, so always divide by the leading coefficient before using them. Points where are called singular points of the equation; something unusual may happen there, and we will keep away from them for now.

Operator notation

Writing long equations again and again is tiring, so we introduce a shorthand. Let stand for "differentiate with respect to ":

Then the left-hand side of the linear equation is the result of applying the operator

to , and the equation is simply . For instance, can be written . The most important property of is that it is linear: for any (sufficiently differentiable) functions and constants ,

This follows because the derivative of a sum is the sum of the derivatives and constants can be pulled out of a derivative. Almost every result in this section is a consequence of this one line. You will see the -notation again in Section 4.2 and in Chapter 7 for systems.

Existence and uniqueness

An th-order equation needs pieces of initial information. Think of a mass on a spring: to predict the motion you must know where the mass starts and how fast it is moving. For order we prescribe the value of and of its first derivatives at one point .

Theorem 4.1.1 (Existence and uniqueness for linear IVPs)

Consider

Suppose that on an interval

  1. the functions and are continuous, and
  2. for every in .

Let be any point of and let be any real numbers. Then there is exactly one solution of the equation that satisfies

and this solution is defined on the whole interval .

What is special here

For nonlinear first-order equations (Chapter 1) the existence theorem only promised a solution on some small interval around , and the solution could blow up nearby. For linear equations the guarantee is much stronger: the solution lives on the entire interval on which the coefficients are continuous and does not vanish. To find that interval, list the points where some coefficient fails to be continuous or where , and take the largest open interval that contains and avoids all of them.

Example 4.1.1

Find the largest interval on which Theorem 4.1.1 guarantees a unique solution of

What changes if the initial conditions are given at instead?

Solution
  1. Coefficients. Here , , and .
  2. Where are they continuous? and are continuous everywhere. is continuous except at . is defined and continuous only for . So all four are continuous on .
  3. Where is ? gives or . Inside we must remove .
  4. Candidate intervals. The hypotheses hold on and on .
  5. Pick the one containing . Since lies in , the theorem guarantees exactly one solution on .
  6. Other starting point. If , the relevant interval is .

Note that the theorem gives a guarantee on . It does not claim that the solution must misbehave at ; it simply says nothing there.

A special case of the theorem is used so often that it deserves its own name.

Theorem 4.1.2 (Only the zero solution starts at rest)

Let the hypotheses of Theorem 4.1.1 hold for the homogeneous equation on , and let . If is a solution with

then for every in .

Why: the function obviously solves the homogeneous equation and has all these zero initial values. By uniqueness, it is the only such solution. Physically: a spring that starts at its rest position with zero velocity and is not pushed by any force simply stays at rest.

The superposition principle

For homogeneous linear equations, solutions can be added and scaled, and the result is again a solution.

Theorem 4.1.3 (Superposition for homogeneous equations)

If are solutions of the homogeneous linear equation on an interval , then every linear combination

is also a solution on .

Proof. By linearity of ,

Common mistake

Superposition in this form works only for homogeneous linear equations. If and both solve with , then , so is not a solution of the same equation. And for a nonlinear equation such as the sum of two solutions is in general not a solution at all.

Superposition tells us that solutions form a "space" closed under addition and scaling. The natural next question is: how many solutions do we need so that their combinations give all solutions? To answer it we need the idea of independence.

Linear dependence and independence

Definition 4.1.2 (Linear dependence and independence)

Functions are linearly dependent on an interval if there exist constants , not all zero, such that

If the only constants that make this true for every are , the functions are linearly independent on .

Dependent means "at least one of the functions is redundant": it can be written as a combination of the others, so it adds nothing new. For two functions the test is especially simple: are dependent on exactly when one of them is a constant multiple of the other there. For instance, and are dependent (the first is twice the second), while and are independent (their ratio is not constant).

Figure 4.1.1. Left: is exactly twice , so their ratio is the constant and the two functions are dependent. Right: the ratio of to is , which changes with . No constant multiple of one function gives the other, so they are independent.
Example 4.1.2

Show that , and are linearly dependent on .

Solution
  1. Set up the condition. We look for constants, not all zero, with for all .
  2. Collect powers of . A polynomial is zero for every only if all its coefficients are zero.
  3. Solve. From the term, . From the term, . The constant term then gives , which holds for every .
  4. Choose a nonzero solution. Taking gives , . Check: Since not all constants are zero, the functions are dependent. Equivalently, .

The Wronskian

Checking independence directly from the definition can be tedious. A determinant built from the functions and their derivatives often does the job in one line.

Definition 4.1.3 (Wronskian)

Let each have at least derivatives on . Their Wronskian is the function

For two functions this is simply .

Why a determinant? Suppose on . Differentiating gives a second equation, . At each this is a linear system for :

If the determinant of this matrix is nonzero at even one point , the only solution at that point is . So the functions must be independent. The same reasoning works for functions (differentiate times). This proves the first test.

Theorem 4.1.4 (Wronskian test for arbitrary functions)

Let have derivatives on . If for at least one point , then are linearly independent on .

The converse is false for arbitrary functions

If the Wronskian of some arbitrary functions is identically zero, you may not conclude that they are dependent. Example 4.1.4 below shows two independent functions whose Wronskian is zero everywhere. The converse does hold, however, when the functions are solutions of the same homogeneous linear equation; that is Theorem 4.1.5.

Example 4.1.3

Compute and decide whether the three functions are independent on .

Solution
  1. Write the determinant. Each row is the derivative of the row above:
  2. Factor the exponentials out of the columns. Column 1 has a common factor , column 2 has , column 3 has . Their product is :
  3. Evaluate the numerical determinant by expanding along the first row:
  4. Conclusion. , which is never zero. By Theorem 4.1.4 the functions are linearly independent on .

Use the calculator below to compute Wronskians of your own sets of two or three functions. Try, for example, adding a function that is a combination of the others and watch the Wronskian collapse to zero.

Example 4.1.4 (A zero Wronskian does not imply dependence)

Let and on . Show that for every , yet and are linearly independent on .

Solution
  1. Understand . For , ; for , .
  2. Derivative of . For , ; for , . Both can be written as . At the difference quotient is , so as well. Thus on all of .
  3. Wronskian.
  4. Independence. Suppose for all . At : . At : . Adding and subtracting gives . So and are independent.
  5. No contradiction. On alone the two functions are equal, and on alone one is the negative of the other. Over the whole interval, however, no single constant ratio works. Theorem 4.1.5 below cannot be applied because and are not solutions of a common equation with continuous on . (Indeed, both satisfy , so by Theorem 4.1.2 such solutions would have to be identically zero.)
Figure 4.1.2. The functions of Example 4.1.4. On the two graphs coincide; on one is the mirror image of the other in the -axis. On each half the ratio is constant, which is why the Wronskian vanishes everywhere, but no single constant works on the whole interval .

For solutions of a linear homogeneous equation the situation is much cleaner.

Theorem 4.1.5 (Wronskian of solutions)

Let be solutions of the homogeneous equation of order on an interval , where are continuous and on . Then:

  1. Either for every , or for every . There is no middle ground.
  2. are linearly independent on if and only if at some (and hence every) point .
Why the converse now holds (sketch for n = 2)

Suppose . Then the system , has a solution with not both zero. The function solves the homogeneous equation (superposition) and has . By Theorem 4.1.2, on . So are dependent. The uniqueness theorem is what makes the converse true, and it is exactly what is missing in Example 4.1.4.

In practice this means: to check that solutions are independent, compute their Wronskian at one convenient point (often or ).

Fundamental sets and the general solution

Definition 4.1.4 (Fundamental set)

A set of linearly independent solutions of an th-order homogeneous linear equation on is called a fundamental set of solutions on .

Theorem 4.1.6 (General solution of the homogeneous equation)

Under the hypotheses of Theorem 4.1.1 (with ):

  1. the homogeneous equation of order always has a fundamental set of solutions on ;
  2. if is any fundamental set, then every solution on can be written as for suitable constants . This expression is called the general solution.

Why every solution is covered. Let be any solution and pick . We want constants with having the same initial data as at . Writing this out gives linear equations:

The determinant of this system is precisely , which is nonzero because the are independent. So the system has a solution . The combination and then solve the same initial-value problem, so by uniqueness they are the same function. This argument is also exactly how we solve initial-value problems in practice: find the general solution, then solve a linear system for the constants.

The message is important enough to repeat: an th-order linear homogeneous equation has exactly "building blocks". Find independent solutions and you have them all.

Example 4.1.5

Consider on .

  1. Verify that and are solutions.
  2. Show that they form a fundamental set on and write the general solution.
  3. Solve the initial-value problem with , .
Solution
  1. Hypotheses. In normalized form the equation is , whose coefficients are continuous on . So Theorems 4.1.1–4.1.6 apply on .
  2. Check . , . Then
  3. Check . , . Then
  4. Wronskian. This is nonzero for every , so is a fundamental set on and the general solution is .
  5. Initial conditions. . At : Adding the equations gives , so and then .
  6. Answer. on .
Figure 4.1.3. The fundamental set of Example 4.1.5 and the solution of the initial-value problem, . It is the only solution that passes through with slope (short segment).

Reduction of order

Suppose we have managed to find one nonzero solution of a second-order homogeneous equation, perhaps by a lucky guess. Theorem 4.1.6 says we need a second, independent one. There is a neat trick that produces it: look for the second solution in the form , where is an unknown function. (If were a constant we would only get multiples of , so must genuinely vary.) The method is called reduction of order because it turns a second-order equation into a first-order one.

Start from the normalized equation

and assume is a known solution with on .

  1. Substitute . By the product rule,
  2. Plug into the equation and group the terms by , and :
  3. Use that is a solution. The bracket multiplying is exactly . The term disappears:
  4. Reduce the order. Put . Then , a first-order equation for .
  5. Separate variables. Divide by :
  6. Integrate. We need only one , so we drop the constant (take it zero) and exponentiate:
  7. Integrate once more to get , and multiply by .
Theorem 4.1.7 (Reduction of order formula)

If is a solution of that does not vanish on (and , are continuous on ), then

is a second solution, and is a fundamental set on .

Why independent? With we get , an exponential, which is never zero.

Method in a nutshell: reduction of order
  1. Write the equation in normalized form and read off .
  2. Compute (no constant needed) and then .
  3. Divide by and integrate (again no constant needed): this is .
  4. Set and drop any constant factor. The general solution is .
Common mistake

Forgetting to normalize. In the coefficient is the coefficient of after dividing by . Using the coefficient from the original equation gives a wrong . You can always catch this error by substituting your back into the equation.

Example 4.1.6

Verify that solves for , and find the general solution.

Solution
  1. Check . All derivatives of equal , so the left side is .
  2. Normalize. Dividing by :
  3. Integrate . (we are on ).
  4. Exponentiate. .
  5. Divide by . .
  6. Integrate. .
  7. Second solution. . Dropping the factor , we take .
  8. General solution. for .

Check. and . Then . ✓

Nonhomogeneous equations: y = yc + yp

Now let . The homogeneous equation obtained by replacing with zero is called the associated homogeneous equation (or complementary equation). Its general solution is called the complementary function and denoted . Any single solution of the full equation, with no arbitrary constants, is called a particular solution .

Theorem 4.1.8 (Structure of the general solution)

Assume the hypotheses of Theorem 4.1.1 on . Let be any particular solution of on , and let be the general solution of on . Then every solution of on has the form

Why. If is any solution, then . So solves the homogeneous equation, and by Theorem 4.1.6 it equals some .

Theorem 4.1.8 splits every nonhomogeneous problem into two independent jobs: (1) solve the homogeneous equation to get ; (2) find one particular solution , by any method at all, even guessing. The next one is a very handy tool for job (2).

Theorem 4.1.9 (Superposition for the right-hand side)

If solves and solves , then for any constants the function solves

The proof is again one line of linearity: . In engineering language: the response to a sum of inputs is the sum of the responses. This is why we can treat each term of a complicated forcing function separately.

Common mistake

When solving an initial-value problem for a nonhomogeneous equation, apply the initial conditions to the complete solution , never to alone. The particular solution contributes to and too.

Example 4.1.7

Let on . Compute and , and use them to find the general solution of

Solution
  1. Compute . With : , , so .
  2. Compute . With : , , so .
  3. Match each piece of the right-hand side. Since , we have . Since , we have .
  4. Superpose. By Theorem 4.1.9, satisfies .
  5. Complementary function. From Example 4.1.5, .
  6. General solution. By Theorem 4.1.8,

Summary

  • For a linear equation with continuous coefficients and on , every initial-value problem has exactly one solution, defined on all of .
  • Linear combinations of solutions of a homogeneous linear equation are solutions.
  • An th-order homogeneous linear equation has independent solutions, and their combinations give every solution.
  • For solutions, independence is checked by evaluating the Wronskian at one point. For arbitrary functions, a nonzero Wronskian proves independence, but a zero Wronskian proves nothing.
  • One known solution of a second-order equation gives a second one by reduction of order.
  • Nonhomogeneous: , and right-hand sides can be split into pieces.

Exercises

  1. Find the largest interval on which Theorem 4.1.1 guarantees a unique solution of , , .
    Answer
  2. Consider with , . On which interval does Theorem 4.1.1 apply, and what is the solution there?
    Answer The interval is ; by Theorem 4.1.2 the solution is on .
  3. Show that , and are linearly dependent on by finding a nontrivial relation.
    Answer .
  4. Compute . Are the functions independent?
    Answer ; independent on .
  5. Compute .
    Answer
  6. Compute and explain why are independent on every interval, even one containing .
    Answer . Every interval contains a point where , so Theorem 4.1.4 gives independence.
  7. Show that and form a fundamental set of on , and solve the IVP , .
    Answer on ; .
  8. Given that solves for , use reduction of order to find the general solution.
    Answer
  9. Given that solves for , find a second, independent solution. (Hint: .)
    Answer (reduction of order gives , so ); general solution .
  10. Let on . Compute and , and then find the general solution of . (Use Exercise 7.)
    Answer , ; .
  11. Explain why cannot be a solution of any equation with and continuous on an interval containing .
    Answer has and . By Theorem 4.1.2 such a solution must be identically zero on the interval, but is not.
  12. True or false: "If for every in , then and are linearly dependent on ." Explain, and state an extra hypothesis that makes the statement true.
    Answer False in general (Example 4.1.4: and on ). It becomes true if and are solutions of the same equation with continuous on (Theorem 4.1.5).