Second-Order Linear Equations
Suppose a mass on a spring is pushed by an external force while friction slows it down. Can we describe every possible motion using just two building-block solutions? This question is at the heart of the theory of second-order linear equations. Specifically, it asks how the solution set of a linear differential equation is organized. The equation governs an enormous range of physical systems. These range from oscillating circuits to vibrating beams. Its structure is the prototype for all of linear differential equations theory. The big picture is that linearity imposes an algebraic skeleton on the solution set. Solutions to the homogeneous equation form a vector space of dimension two. The general solution to the full equation is that space shifted by a single particular solution. This article builds that structure rigorously from existence and uniqueness. It proves the superposition principle. It also shows exactly how much of the solution set two initial conditions can pin down. It sets the stage for the concrete methods that make this structure computable. These methods are Homogeneous Equations with Constant Coefficients and The Wronskian and Linear Independence.
- A second-order linear ODE has the form with continuous.
- Homogeneous solutions () form a real vector space; superposition holds because the map is linear.
- The general solution of the nonhomogeneous equation is (particular solution) + (general homogeneous solution).
- Existence-uniqueness (from Picard–Lindelöf) forces the homogeneous solution space to be exactly 2-dimensional.
- Two solutions form a basis exactly when their Wronskian is nonzero at one point.
- Key idea: linearity turns solving a differential equation into linear algebra — find a spanning set of two homogeneous solutions and add one particular solution.
Where this lives today
The mass-spring-damper equation and the series RLC circuit equation are both instances of ; the structure theorem is why engineers can solve "find the response to a step plus a sinusoid" by superposing two simpler particular solutions, exactly as in Example 2. In quantum mechanics, the time-independent Schrödinger equation in one dimension is a second-order linear ODE in the spatial variable, and the vector-space structure of its solution set underlies the classification of bound states. In control theory and signal processing, transfer-function methods for linear time-invariant systems rest on the same superposition principle, now packaged via Laplace transforms. In numerical analysis, boundary value problems built on this equation (e.g. shooting methods) exploit the two-dimensional solution space to reduce a BVP to a root-finding problem in two unknowns . The theorem is also the base case for the general theory of linear -th order and linear systems of ODEs, where the same proof (via a first-order system and Picard–Lindelöf) yields an -dimensional homogeneous solution space.
:::quiz[Which property of the operator is the direct cause of the superposition principle?]
- is invertible
- is linear ✓
- has constant coefficients
- has continuous coefficients
:::quiz[If solve but their Wronskian is identically zero, what can we conclude about the general solution formula in Part (4)?]
- It still applies without changes
- It fails to capture all solutions, since are not independent and hence not a basis of ✓
- It applies only for
- It implies must be zero
Ask the tutor: How do we find explicit independent homogeneous solutions when and are constants, and why does the characteristic equation always produce a valid basis?
Let be an open interval and let be continuous functions. A second-order linear ordinary differential equation is an equation of the form
It is called homogeneous if on , and nonhomogeneous otherwise. A function is a solution on if is twice differentiable on and satisfies the equation at every point of . An initial value problem (IVP) consists of the equation together with conditions , at some . Define the linear differential operator by
The equation reads , and the homogeneous equation reads .
Intuition
Think of as a machine: feed it a twice-differentiable function, and it outputs another function. The crucial structural fact is that is linear: it respects addition and scalar multiplication of functions, exactly as a matrix respects addition and scaling of vectors. This is not an approximation or a special property of nice equations — it follows immediately from the fact that differentiation is linear and that multiply without touching them nonlinearly (no , no , no ). Because is linear, the homogeneous solution set is the kernel of , hence automatically a vector space: sums and scalar multiples of homogeneous solutions are again homogeneous solutions. The question the theory must answer is: how big is this kernel? Existence-uniqueness for the associated first-order system answers this precisely — the kernel is exactly two-dimensional, matching the two initial conditions needed to pin down a unique solution. Once we have any two independent homogeneous solutions , every homogeneous solution is a combination , and if is one particular solution of , then every solution of is . This is the superposition principle in its full form, and the picture below shows it as an affine shift of a plane inside the infinite-dimensional space of functions.
:::svg[The solution set of is a 2-dimensional plane through , parallel to the homogeneous plane through ]
The central theorem
Let be an open interval, let be continuous, and let
(1) Existence and uniqueness. For every and every pair of numbers , the initial value problem
has exactly one solution defined on all of .
(2) Superposition (linearity). For any twice-differentiable on and any constants ,
In particular, if solve the homogeneous equation , then so does every linear combination .
(3) Dimension of the homogeneous solution space. The set is a real vector space of dimension exactly .
(4) General solution formula. If are linearly independent, and is any one solution of , then the general solution of on is
and every solution of on arises this way for a unique choice of .
Part (1): existence and uniqueness. This is the point at which the theory rests on machinery built prior to this article, namely Picard–Lindelöf existence and uniqueness for first-order systems. Convert the scalar equation to a first-order vector system: set , , and . Then with initial data is equivalent to
The function is defined on , and since are continuous, is continuous in and, for each fixed , is an affine (hence globally Lipschitz on bounded sets, and in fact linear-affine so Lipschitz with constant independent of the region) function of : explicitly, for two states , ,
using the Euclidean or max norm and the triangle inequality on the two coordinates. On any compact subinterval , and are bounded (continuous functions on a compact set are bounded), so is Lipschitz in uniformly in , with a Lipschitz constant that does not blow up as — this is exactly the affine structure that rules out finite-time blowup. Picard–Lindelöf (applied on , using this uniform Lipschitz bound to extend the local solution step by step across the whole compact interval without leaving a bounded region) gives existence and uniqueness of on ; since was arbitrary, the solution extends uniquely to all of . Setting recovers the unique solution of the original scalar IVP on .
Part (2): superposition. Differentiation is linear: and , by linearity of the derivative operator applied twice. Hence
This used only that ordinary multiplication distributes over addition and that scalars pass through sums, i.e. pointwise algebra of real-valued functions — no property of beyond being ordinary functions is needed. If then , so is closed under linear combinations; it contains the zero function ( trivially), so is a real vector subspace of the space of twice-differentiable functions on .
Part (3): . Fix any . Define the map
is linear: , directly from pointwise evaluation being linear. is injective: if , then solves the homogeneous IVP , , . By Part (1) (applied with ), this IVP has the unique solution on (the zero function certainly solves it, and uniqueness forbids any other solution). So , i.e. is injective. is surjective: given any , Part (1) (with ) guarantees a solution of , , ; then . So is a linear bijection , i.e. a vector space isomorphism. Hence .
Part (4): general solution formula. Every such combination solves : by Part (2) (superposition) applied with and ,
Every solution has this form, with a unique choice of constants: let be any solution of on . Set . By superposition, , so . Since are linearly independent elements of the -dimensional space , they form a basis of (a linearly independent set of size in a finite-dimensional vector space is automatically a basis, since it is already a maximal independent set and hence spans by the standard exchange/extension argument in linear algebra). So for unique scalars (uniqueness of coordinates in a basis: if also then , and independence forces ). Hence with unique.
∎Let be any point. The unique solutions of
(which exist and are unique by Part (1) of the Structure Theorem) are automatically linearly independent, and every homogeneous solution is with , .
In the notation of Part (3), and , the standard basis of . Since is a linear isomorphism (proved above), it maps a basis to a basis; the preimage of a basis under an isomorphism is a basis, so is a basis of . For any homogeneous solution , write ; applying gives , identifying the coefficients.
∎Worked examples
Example 1 — Verifying the structure theorem on an equation with variable coefficients. Consider on the Euler equation
Divide by (legitimate since ) to put it in standard form:
All three are continuous on , so the Structure Theorem applies on this interval (note: must be excluded because blow up there). Homogeneous solutions. Try : then , , and
This vanishes for all iff or . So and are homogeneous solutions. Independence check (a preview of the Wronskian test): the Wronskian is
which is nonzero for every ; hence are linearly independent on and, by the Structure Theorem, form a basis of the 2-dimensional homogeneous solution space. Particular solution. Try . Then , , and
We need this to equal , so . Thus solves the nonhomogeneous equation. General solution. By Part (4) of the Structure Theorem,
Solving an IVP. Impose , . Compute . At :
Subtracting, , then . So the unique solution of the IVP on is
Uniqueness is guaranteed by Part (1) since are continuous on .
Example 2 — Superposition with a non-obvious particular solution and a forcing term split in two. Consider the constant-coefficient equation
Here , , , all continuous on all of , so the Structure Theorem applies globally. Homogeneous solutions. , satisfy (direct check: , so ; similarly for ). Their Wronskian is , so they are independent. Splitting the forcing (superposition as a solving technique, not just a structural fact). Write with , . Solve and separately, then add — this works because of linearity (Part 2 of the theorem), and is the mechanism behind the method of undetermined coefficients. For : try (no resonance with the homogeneous solutions, which are trigonometric, not polynomial). Then , so ; we need , so : . For : naive guess fails because solves the homogeneous equation (resonance) — this is exactly the kind of trap the independence structure warns about. Instead try . Compute:
Then
Set this equal to : matching coefficients, , and . So . Assemble by superposition. satisfies , exactly by Part (2) of the Structure Theorem. By Part (4), the general solution is
Solving an IVP. Impose , . At : . Differentiate:
At : . So
is the unique solution of the IVP, guaranteed by Part (1) since are continuous on all of .
The Structure Theorem requires continuous on the whole interval . Drop this and both existence and the "dimension exactly 2" conclusion can fail. Take the Euler-type equation
on (through ). In standard form this is for , so is not continuous at — it is not even defined there. The hypothesis of the Structure Theorem fails exactly at the point we want to include. Consequences of this failure are visible directly. Two independent solutions on are and (check: for , , and , confirmed). But is not even defined at , let alone twice differentiable there, so it cannot be extended to a solution on all of . Any solution that is to be defined and twice differentiable at itself must have very restricted behavior forced by the singular point; in fact, on the whole line , only multiples of extend smoothly across while also solving the equation on both sides consistently and matching values at . Attempting to prescribe generic initial data , with leads to a contradiction: differentiating forces strong constraints at that generic data cannot satisfy, so the IVP at has no solution for most choices of — Part (1) of the theorem simply fails at this singular point, exactly because its hypothesis (continuity of on all of ) fails there. This also illustrates the more familiar failure mode in Boyce–DiPrima style problems: writing the equation with a leading coefficient and dividing by to get standard form is only valid where ; at zeros of , and typically blow up, continuity fails, and neither existence nor the two-dimensionality of the solution space can be assumed.
Scope, edge cases & common traps
| Situation | What holds | What can fail |
|---|---|---|
| continuous on open interval , | Unique solution on all of ; | — |
| Leading coefficient vanishes at some (Euler / singular equations) | Theorem applies away from zeros of | Existence/uniqueness at itself can fail; solutions may blow up or fail to extend |
| continuous but merely piecewise continuous | Existence/uniqueness theory extends with minor technical care (solutions , not , at jumps) | Formula still organizes solutions on each smooth piece |
| Nonlinear equation (e.g. ) | Local existence–uniqueness may still hold (Picard–Lindelöf) | Superposition fails entirely: solution set is not a vector space or an affine plane |
| Two homogeneous solutions with Wronskian | They may still both solve the equation | They are not a basis; general solution formula in Part (4) is invalid unless independence holds |
The mathematician behind it
Origins · 1 minCharles Émile Picard and how this was discovered
Picard developed the method of successive approximations that underlies the existence-uniqueness theorem this article leans on, working in the broader context of late-19th-century rigorization of analysis. His name is permanently attached, alongside Ernst Lindelöf, to the theorem that guarantees the two-dimensional structure proved here is not an assumption but a consequence of a deeper existence principle.
Why does the theorem require the interval to be where are simultaneously continuous?
The proof converts the scalar equation into a first-order vector system where depends on all at once. Picard–Lindelöf needs continuous in and Lipschitz in on the domain of interest; this requires all three coefficient functions to behave well together on the same interval. If even one of them is discontinuous or undefined at some point, fails to be continuous there, the existence-uniqueness argument breaks down at that point, and neither existence nor the two-dimensionality of the homogeneous solution space is guaranteed to extend across it, as the Euler-equation counterexample shows.
Does the general solution formula depend on which particular solution we pick?
No — the set of solutions described is identical no matter which particular solution is chosen, though the specific values of needed for a given IVP will change. If and are two different particular solutions, their difference solves the homogeneous equation (by superposition), hence already lies in . So shifting from to just relabels the constants ; the affine plane of solutions in function space stays exactly the same.
Is linear independence of the same as them being "different functions"?
No, and this is a frequent source of errors. Two functions can be different (not scalar multiples of each other pointwise-looking) yet still be linearly dependent in the relevant sense only if one actually is a constant multiple of the other everywhere on . Conversely, subtler dependence is impossible for exactly two functions: are dependent iff one is a scalar multiple of the other. The clean test is the Wronskian: if for some , they are independent; a full theorem (covered separately) shows this single-point check suffices for homogeneous solutions, though not for arbitrary functions.
Why can't we just use Part (1) (existence-uniqueness) directly to solve equations, skipping the vector space structure?
Part (1) only tells us a solution to a specific IVP exists and is unique — it does not, by itself, give a formula. The vector space structure in Parts (2)–(4) is what turns this abstract guarantee into a concrete algorithm: find any two independent homogeneous solutions (often by inspired guessing or, for constant coefficients, via characteristic roots), find one particular solution, and combine them. Without the structure theorem, "solving" the ODE would mean re-deriving a Picard iteration for every new IVP, which is not computationally practical.
Does superposition work for nonlinear equations too?
No, and this is exactly why "linear" is in the name. For a nonlinear equation such as , if are both solutions, , which is not unless the cross term vanishes. The proof of Part (2) used only that multiplication by is linear in ; any nonlinear dependence on or destroys this and the entire vector-space picture (Parts 3–4) collapses with it.
How does this article connect to solving equations with constant coefficients?
The Structure Theorem tells us the shape of the answer — two independent homogeneous solutions plus one particular solution — but says nothing about how to find them for a specific . When are constants, the guess reduces to a quadratic (the characteristic equation) in , giving an explicit recipe for ; this is the content of Homogeneous Equations with Constant Coefficients. The independence of the resulting solutions, and why real, repeated, or complex roots each demand different bases, is checked using exactly the Wronskian machinery introduced informally in the worked examples here.
What happens at points where two candidate homogeneous solutions coincide, as with resonance in Example 2?
Resonance — when the forcing function "looks like" a homogeneous solution, such as forcing — does not violate the Structure Theorem; it only means the naive undetermined-coefficients guess for must be modified (multiplied by , as shown in Example 2) to avoid accidentally guessing a homogeneous solution, which would make . The theorem itself, guaranteeing existence of some particular solution and the two-dimensional homogeneous space, remains fully valid; only the search strategy for needs adjustment.