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 y′′+p(t)y′+q(t)y=g(t)y'' + p(t) y' + q(t) y = g(t) 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.

Key takeaways
  • A second-order linear ODE has the form y′′+p(t)y′+q(t)y=g(t)y'' + p(t)y' + q(t)y = g(t) with p,q,gp, q, g continuous.
  • Homogeneous solutions (g≡0g \equiv 0) form a real vector space; superposition holds because the map y↦y′′+py′+qyy \mapsto y'' + py' + qy 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 my′′+cy′+ky=F(t)m y'' + c y' + k y = F(t) and the series RLC circuit equation are both instances of y′′+py′+qy=gy''+py'+qy=g; 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 (c1,c2)(c_1,c_2). The theorem is also the base case for the general theory of linear nn-th order and linear systems of ODEs, where the same proof (via a first-order system and Picard–Lindelöf) yields an nn-dimensional homogeneous solution space.

:::quiz[Which property of the operator L[y]=y′′+p(t)y′+q(t)yL[y]=y''+p(t)y'+q(t)y is the direct cause of the superposition principle?]

  • LL is invertible
  • LL is linear ✓
  • LL has constant coefficients
  • LL has continuous coefficients

:::quiz[If y1,y2y_1, y_2 solve L[y]=0L[y]=0 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 y1,y2y_1,y_2 are not independent and hence not a basis of VV ✓
  • It applies only for t>0t>0
  • It implies gg must be zero

Ask the tutor: How do we find explicit independent homogeneous solutions when p(t)p(t) and q(t)q(t) are constants, and why does the characteristic equation always produce a valid basis?

DefinitionSecond-order linear ODE and its solution space

Let I⊆RI \subseteq \mathbb{R} be an open interval and let p,q,g:I→Rp, q, g : I \to \mathbb{R} be continuous functions. A second-order linear ordinary differential equation is an equation of the form

y′′(t)+p(t)y′(t)+q(t)y(t)=g(t),t∈I.y''(t) + p(t) y'(t) + q(t) y(t) = g(t), \qquad t \in I.

It is called homogeneous if g≡0g \equiv 0 on II, and nonhomogeneous otherwise. A function y:I→Ry : I \to \mathbb{R} is a solution on II if yy is twice differentiable on II and satisfies the equation at every point of II. An initial value problem (IVP) consists of the equation together with conditions y(t0)=y0y(t_0) = y_0, y′(t0)=y0′y'(t_0) = y_0' at some t0∈It_0 \in I. Define the linear differential operator L:C2(I)→C0(I)L : C^2(I) \to C^0(I) by

L[y]=y′′+p y′+q y.L[y] = y'' + p\,y' + q\,y.

The equation reads L[y]=gL[y] = g, and the homogeneous equation reads L[y]=0L[y] = 0.

Intuition

Think of LL as a machine: feed it a twice-differentiable function, and it outputs another function. The crucial structural fact is that LL 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 p,qp, q multiply y′,yy', y without touching them nonlinearly (no y2y^2, no sin⁡(y)\sin(y), no y⋅y′y \cdot y'). Because LL is linear, the homogeneous solution set {y:L[y]=0}\{y : L[y] = 0\} is the kernel of LL, 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 (y(t0),y′(t0))(y(t_0), y'(t_0)) needed to pin down a unique solution. Once we have any two independent homogeneous solutions y1,y2y_1, y_2, every homogeneous solution is a combination c1y1+c2y2c_1 y_1 + c_2 y_2, and if ypy_p is one particular solution of L[y]=gL[y]=g, then every solution of L[y]=gL[y] = g is yp+c1y1+c2y2y_p + c_1 y_1 + c_2 y_2. 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 L[y]=gL[y]=g is a 2-dimensional plane through ypy_p, parallel to the homogeneous plane through 00] 0 span{y₁, y₂} : L[y]=0 y_p y_p + span{y₁, y₂} : L[y]=g

The central theorem

TheoremStructure Theorem for Second-Order Linear Equations

Let I⊆RI \subseteq \mathbb{R} be an open interval, let p,q,g:I→Rp, q, g : I \to \mathbb{R} be continuous, and let

L[y]=y′′+p(t)y′+q(t)y.L[y] = y'' + p(t) y' + q(t) y.

(1) Existence and uniqueness. For every t0∈It_0 \in I and every pair of numbers y0,y0′∈Ry_0, y_0' \in \mathbb{R}, the initial value problem

L[y]=g,y(t0)=y0,y′(t0)=y0′L[y] = g, \qquad y(t_0) = y_0, \quad y'(t_0) = y_0'

has exactly one solution defined on all of II.

(2) Superposition (linearity). For any twice-differentiable y1,y2y_1, y_2 on II and any constants c1,c2∈Rc_1, c_2 \in \mathbb{R},

L[c1y1+c2y2]=c1L[y1]+c2L[y2].L[c_1 y_1 + c_2 y_2] = c_1 L[y_1] + c_2 L[y_2].

In particular, if y1,y2y_1, y_2 solve the homogeneous equation L[y]=0L[y]=0, then so does every linear combination c1y1+c2y2c_1 y_1 + c_2 y_2.

(3) Dimension of the homogeneous solution space. The set V={y:I→R∣L[y]=0}V = \{ y : I \to \mathbb{R} \mid L[y] = 0\} is a real vector space of dimension exactly 22.

(4) General solution formula. If y1,y2∈Vy_1, y_2 \in V are linearly independent, and ypy_p is any one solution of L[y]=gL[y] = g, then the general solution of L[y]=gL[y]=g on II is

y(t)=yp(t)+c1y1(t)+c2y2(t),c1,c2∈R,y(t) = y_p(t) + c_1 y_1(t) + c_2 y_2(t), \qquad c_1, c_2 \in \mathbb{R},

and every solution of L[y]=gL[y]=g on II arises this way for a unique choice of c1,c2c_1, c_2.

Proof

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 x1=yx_1 = y, x2=y′x_2 = y', and x=(x1,x2)\mathbf{x} = (x_1, x_2). Then L[y]=gL[y]=g with initial data y(t0)=y0,y′(t0)=y0′y(t_0)=y_0, y'(t_0)=y_0' is equivalent to

x′=F(t,x):=(x2,  g(t)−p(t)x2−q(t)x1),x(t0)=(y0,y0′).\mathbf{x}' = F(t, \mathbf{x}) := \big(x_2,\; g(t) - p(t) x_2 - q(t) x_1\big), \qquad \mathbf{x}(t_0) = (y_0, y_0').

The function FF is defined on I×R2I \times \mathbb{R}^2, and since p,q,gp, q, g are continuous, FF is continuous in tt and, for each fixed tt, is an affine (hence globally Lipschitz on bounded sets, and in fact linear-affine so Lipschitz with constant independent of the region) function of x\mathbf{x}: explicitly, for two states x=(x1,x2)\mathbf{x}=(x_1,x_2), x~=(x~1,x~2)\tilde{\mathbf{x}}=(\tilde x_1, \tilde x_2),

∥F(t,x)−F(t,x~)∥≤(1+∣p(t)∣+∣q(t)∣) ∥x−x~∥\|F(t,\mathbf{x}) - F(t,\tilde{\mathbf{x}})\| \le \big(1 + |p(t)| + |q(t)|\big)\,\|\mathbf{x}-\tilde{\mathbf{x}}\|

using the Euclidean or max norm and the triangle inequality on the two coordinates. On any compact subinterval [a,b]⊂I[a,b] \subset I, pp and qq are bounded (continuous functions on a compact set are bounded), so FF is Lipschitz in x\mathbf{x} uniformly in t∈[a,b]t \in [a,b], with a Lipschitz constant that does not blow up as ∥x∥→∞\|\mathbf{x}\| \to \infty — this is exactly the affine structure that rules out finite-time blowup. Picard–Lindelöf (applied on [a,b]×R2[a,b] \times \mathbb{R}^2, 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 x\mathbf{x} on [a,b][a,b]; since [a,b]⊂I[a,b]\subset I was arbitrary, the solution extends uniquely to all of II. Setting y=x1y = x_1 recovers the unique solution of the original scalar IVP on II.

Part (2): superposition. Differentiation is linear: (c1y1+c2y2)′′=c1y1′′+c2y2′′(c_1y_1 + c_2y_2)'' = c_1 y_1'' + c_2 y_2'' and (c1y1+c2y2)′=c1y1′+c2y2′(c_1y_1+c_2y_2)' = c_1y_1' + c_2y_2', by linearity of the derivative operator applied twice. Hence

L[c1y1+c2y2]=(c1y1+c2y2)′′+p(c1y1+c2y2)′+q(c1y1+c2y2)L[c_1y_1+c_2y_2] = (c_1y_1+c_2y_2)'' + p(c_1y_1+c_2y_2)' + q(c_1y_1+c_2y_2)
=c1y1′′+c2y2′′+p(c1y1′+c2y2′)+q(c1y1+c2y2)=c1(y1′′+py1′+qy1)+c2(y2′′+py2′+qy2)= c_1y_1'' + c_2y_2'' + p(c_1y_1'+c_2y_2') + q(c_1y_1+c_2y_2) = c_1(y_1''+py_1'+qy_1) + c_2(y_2''+py_2'+qy_2)
=c1L[y1]+c2L[y2].= c_1 L[y_1] + c_2 L[y_2].

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 p,qp,q beyond being ordinary functions is needed. If L[y1]=L[y2]=0L[y_1]=L[y_2]=0 then L[c1y1+c2y2]=c1⋅0+c2⋅0=0L[c_1y_1+c_2y_2] = c_1\cdot 0 + c_2 \cdot 0 = 0, so VV is closed under linear combinations; it contains the zero function (L[0]=0L[0]=0 trivially), so VV is a real vector subspace of the space of twice-differentiable functions on II.

Part (3): dim⁡V=2\dim V = 2. Fix any t0∈It_0 \in I. Define the map

Φ:V→R2,Φ(y)=(y(t0),y′(t0)).\Phi : V \to \mathbb{R}^2, \qquad \Phi(y) = \big(y(t_0), y'(t_0)\big).

Φ\Phi is linear: Φ(c1y1+c2y2)=((c1y1+c2y2)(t0),(c1y1+c2y2)′(t0))=c1Φ(y1)+c2Φ(y2)\Phi(c_1y_1+c_2y_2) = \big((c_1y_1+c_2y_2)(t_0), (c_1y_1+c_2y_2)'(t_0)\big) = c_1\Phi(y_1)+c_2\Phi(y_2), directly from pointwise evaluation being linear. Φ\Phi is injective: if Φ(y)=(0,0)\Phi(y) = (0,0), then yy solves the homogeneous IVP L[y]=0L[y]=0, y(t0)=0y(t_0)=0, y′(t0)=0y'(t_0)=0. By Part (1) (applied with g≡0g \equiv 0), this IVP has the unique solution y≡0y \equiv 0 on II (the zero function certainly solves it, and uniqueness forbids any other solution). So ker⁡Φ={0}\ker \Phi = \{0\}, i.e. Φ\Phi is injective. Φ\Phi is surjective: given any (a,b)∈R2(a,b) \in \mathbb{R}^2, Part (1) (with g≡0g\equiv 0) guarantees a solution y∈Vy \in V of L[y]=0L[y]=0, y(t0)=ay(t_0)=a, y′(t0)=by'(t_0)=b; then Φ(y)=(a,b)\Phi(y) = (a,b). So Φ\Phi is a linear bijection V→R2V \to \mathbb{R}^2, i.e. a vector space isomorphism. Hence dim⁡V=dim⁡R2=2\dim V = \dim \mathbb{R}^2 = 2.

Part (4): general solution formula. Every such combination solves L[y]=gL[y]=g: by Part (2) (superposition) applied with L[yp]=gL[y_p]=g and L[y1]=L[y2]=0L[y_1]=L[y_2]=0,

L[yp+c1y1+c2y2]=L[yp]+c1L[y1]+c2L[y2]=g+0+0=g.L[y_p + c_1y_1+c_2y_2] = L[y_p] + c_1L[y_1]+c_2L[y_2] = g + 0 + 0 = g.

Every solution has this form, with a unique choice of constants: let yy be any solution of L[y]=gL[y]=g on II. Set w=y−ypw = y - y_p. By superposition, L[w]=L[y]−L[yp]=g−g=0L[w] = L[y]-L[y_p] = g - g = 0, so w∈Vw \in V. Since y1,y2y_1,y_2 are linearly independent elements of the 22-dimensional space VV, they form a basis of VV (a linearly independent set of size dim⁡V\dim V 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 w=c1y1+c2y2w = c_1y_1+c_2y_2 for unique scalars c1,c2c_1,c_2 (uniqueness of coordinates in a basis: if also w=c1′y1+c2′y2w=c_1'y_1+c_2'y_2 then (c1−c1′)y1+(c2−c2′)y2=0(c_1-c_1')y_1+(c_2-c_2')y_2=0, and independence forces c1=c1′,c2=c2′c_1=c_1', c_2=c_2'). Hence y=yp+c1y1+c2y2y = y_p + c_1y_1+c_2y_2 with (c1,c2)(c_1,c_2) unique. ■\blacksquare

∎
CorollaryReduction to two special IVPs

Let t0∈It_0\in I be any point. The unique solutions y1,y2y_1, y_2 of

L[y1]=0, y1(t0)=1, y1′(t0)=0andL[y2]=0, y2(t0)=0, y2′(t0)=1L[y_1]=0,\ y_1(t_0)=1,\ y_1'(t_0)=0 \qquad\text{and}\qquad L[y_2]=0,\ y_2(t_0)=0,\ y_2'(t_0)=1

(which exist and are unique by Part (1) of the Structure Theorem) are automatically linearly independent, and every homogeneous solution is c1y1+c2y2c_1y_1+c_2y_2 with c1=y(t0)c_1 = y(t_0), c2=y′(t0)c_2=y'(t_0).

Proof

In the notation of Part (3), Φ(y1)=(1,0)\Phi(y_1) = (1,0) and Φ(y2)=(0,1)\Phi(y_2)=(0,1), the standard basis of R2\mathbb{R}^2. Since Φ\Phi is a linear isomorphism V→R2V \to \mathbb{R}^2 (proved above), it maps a basis to a basis; the preimage of a basis under an isomorphism is a basis, so {y1,y2}\{y_1,y_2\} is a basis of VV. For any homogeneous solution yy, write y=c1y1+c2y2y = c_1 y_1 + c_2 y_2; applying Φ\Phi gives (y(t0),y′(t0))=c1(1,0)+c2(0,1)=(c1,c2)(y(t_0),y'(t_0)) = c_1(1,0)+c_2(0,1) = (c_1,c_2), identifying the coefficients. ■\blacksquare

∎

Worked examples

Example 1 — Verifying the structure theorem on an equation with variable coefficients. Consider on I=(0,∞)I = (0,\infty) the Euler equation

t2y′′−2ty′+2y=t3,t>0.t^2 y'' - 2t y' + 2y = t^3, \qquad t>0.

Divide by t2t^2 (legitimate since t>0t>0) to put it in standard form:

y′′−2ty′+2t2y=t,p(t)=−2t, q(t)=2t2, g(t)=t.y'' - \frac{2}{t} y' + \frac{2}{t^2} y = t, \qquad p(t) = -\frac{2}{t},\ q(t)=\frac{2}{t^2},\ g(t)=t.

All three are continuous on (0,∞)(0,\infty), so the Structure Theorem applies on this interval (note: t=0t=0 must be excluded because p,qp,q blow up there). Homogeneous solutions. Try y=try=t^r: then y′=rtr−1y'=rt^{r-1}, y′′=r(r−1)tr−2y''=r(r-1)t^{r-2}, and

t2⋅r(r−1)tr−2−2t⋅rtr−1+2tr=[r(r−1)−2r+2]tr=(r2−3r+2)tr=(r−1)(r−2)tr.t^2\cdot r(r-1)t^{r-2} - 2t\cdot rt^{r-1} + 2t^r = \big[r(r-1) - 2r + 2\big]t^r = (r^2-3r+2)t^r = (r-1)(r-2)t^r.

This vanishes for all t>0t>0 iff r=1r=1 or r=2r=2. So y1(t)=ty_1(t)=t and y2(t)=t2y_2(t)=t^2 are homogeneous solutions. Independence check (a preview of the Wronskian test): the Wronskian is

W(t)=y1y2′−y1′y2=t⋅2t−1⋅t2=t2,W(t) = y_1y_2' - y_1'y_2 = t\cdot 2t - 1\cdot t^2 = t^2,

which is nonzero for every t>0t>0; hence y1,y2y_1,y_2 are linearly independent on (0,∞)(0,\infty) and, by the Structure Theorem, form a basis of the 2-dimensional homogeneous solution space. Particular solution. Try yp=At3y_p = At^3. Then yp′=3At2y_p' = 3At^2, yp′′=6Aty_p''=6At, and

t2(6At)−2t(3At2)+2(At3)=6At3−6At3+2At3=2At3.t^2(6At) - 2t(3At^2) + 2(At^3) = 6At^3 - 6At^3 + 2At^3 = 2At^3.

We need this to equal t3t^3, so A=12A = \tfrac12. Thus yp(t)=12t3y_p(t) = \tfrac12 t^3 solves the nonhomogeneous equation. General solution. By Part (4) of the Structure Theorem,

y(t)=12t3+c1t+c2t2,t>0.y(t) = \frac{1}{2}t^3 + c_1 t + c_2 t^2, \qquad t > 0.

Solving an IVP. Impose y(1)=2y(1) = 2, y′(1)=1y'(1) = 1. Compute y′(t)=32t2+c1+2c2ty'(t) = \tfrac32 t^2 + c_1 + 2c_2 t. At t=1t=1:

y(1)=12+c1+c2=2 ⇒ c1+c2=32,y(1) = \tfrac12 + c_1 + c_2 = 2 \ \Rightarrow\ c_1+c_2 = \tfrac32,
y′(1)=32+c1+2c2=1 ⇒ c1+2c2=−12.y'(1) = \tfrac32 + c_1 + 2c_2 = 1 \ \Rightarrow\ c_1 + 2c_2 = -\tfrac12.

Subtracting, c2=−12−32=−2c_2 = -\tfrac12 - \tfrac32 = -2, then c1=32−c2=32+2=72c_1 = \tfrac32 - c_2 = \tfrac32+2 = \tfrac72. So the unique solution of the IVP on (0,∞)(0,\infty) is

y(t)=12t3+72t−2t2.y(t) = \frac{1}{2}t^3 + \frac{7}{2}t - 2t^2.

Uniqueness is guaranteed by Part (1) since p,q,gp,q,g are continuous on (0,∞)∋t0=1(0,\infty) \ni t_0=1.

Example 2 — Superposition with a non-obvious particular solution and a forcing term split in two. Consider the constant-coefficient equation

y′′+y=4cos⁡t+6t,t∈R=I.y'' + y = 4\cos t + 6t, \qquad t \in \mathbb{R} = I.

Here p(t)=0p(t)=0, q(t)=1q(t)=1, g(t)=4cos⁡t+6tg(t) = 4\cos t + 6t, all continuous on all of R\mathbb{R}, so the Structure Theorem applies globally. Homogeneous solutions. y1(t)=cos⁡ty_1(t) = \cos t, y2(t)=sin⁡ty_2(t) = \sin t satisfy yi′′+yi=0y_i'' + y_i = 0 (direct check: (cos⁡t)′′=−cos⁡t(\cos t)''=-\cos t, so −cos⁡t+cos⁡t=0-\cos t + \cos t = 0; similarly for sin⁡t\sin t). Their Wronskian is W=cos⁡t⋅cos⁡t−(−sin⁡t)sin⁡t=cos⁡2t+sin⁡2t=1≠0W = \cos t \cdot \cos t - (-\sin t)\sin t = \cos^2 t + \sin^2 t = 1 \ne 0, so they are independent. Splitting the forcing (superposition as a solving technique, not just a structural fact). Write g=g1+g2g = g_1+g_2 with g1=4cos⁡tg_1 = 4\cos t, g2=6tg_2 = 6t. Solve L[y]=g1L[y]=g_1 and L[y]=g2L[y]=g_2 separately, then add — this works because of linearity (Part 2 of the theorem), and is the mechanism behind the method of undetermined coefficients. For g2=6tg_2 = 6t: try yp2=Aty_{p2} = At (no resonance with the homogeneous solutions, which are trigonometric, not polynomial). Then yp2′′=0y_{p2}''=0, so L[yp2]=0+At=AtL[y_{p2}] = 0 + At = At; we need At=6tAt = 6t, so A=6A=6: yp2(t)=6ty_{p2}(t) = 6t. For g1=4cos⁡tg_1 = 4\cos t: naive guess y=Acos⁡ty=A\cos t fails because cos⁡t\cos t solves the homogeneous equation (resonance) — this is exactly the kind of trap the independence structure warns about. Instead try yp1=t(Acos⁡t+Bsin⁡t)y_{p1} = t(A\cos t + B\sin t). Compute:

yp1′=Acos⁡t+Bsin⁡t+t(−Asin⁡t+Bcos⁡t),y_{p1}' = A\cos t + B\sin t + t(-A\sin t + B\cos t),
yp1′′=−Asin⁡t+Bcos⁡t+(−Asin⁡t+Bcos⁡t)+t(−Acos⁡t−Bsin⁡t)=2(−Asin⁡t+Bcos⁡t)−t(Acos⁡t+Bsin⁡t).y_{p1}'' = -A\sin t + B\cos t + (-A\sin t+B\cos t) + t(-A\cos t - B\sin t) = 2(-A\sin t+B\cos t) - t(A\cos t+B\sin t).

Then

yp1′′+yp1=2(−Asin⁡t+Bcos⁡t)−t(Acos⁡t+Bsin⁡t)+t(Acos⁡t+Bsin⁡t)=−2Asin⁡t+2Bcos⁡t.y_{p1}'' + y_{p1} = 2(-A\sin t + B\cos t) - t(A\cos t+B\sin t) + t(A\cos t+B\sin t) = -2A\sin t + 2B\cos t.

Set this equal to 4cos⁡t4\cos t: matching coefficients, −2A=0⇒A=0-2A = 0 \Rightarrow A=0, and 2B=4⇒B=22B=4 \Rightarrow B=2. So yp1(t)=2tsin⁡ty_{p1}(t) = 2t\sin t. Assemble by superposition. yp=yp1+yp2=2tsin⁡t+6ty_p = y_{p1}+y_{p2} = 2t\sin t + 6t satisfies L[yp]=L[yp1]+L[yp2]=4cos⁡t+6t=gL[y_p] = L[y_{p1}]+L[y_{p2}] = 4\cos t + 6t = g, exactly by Part (2) of the Structure Theorem. By Part (4), the general solution is

y(t)=2tsin⁡t+6t+c1cos⁡t+c2sin⁡t.y(t) = 2t\sin t + 6t + c_1\cos t + c_2 \sin t.

Solving an IVP. Impose y(0)=1y(0)=1, y′(0)=0y'(0)=0. At t=0t=0: y(0)=0+0+c1+0=c1=1y(0) = 0 + 0 + c_1 + 0 = c_1 = 1. Differentiate:

y′(t)=2sin⁡t+2tcos⁡t+6−c1sin⁡t+c2cos⁡t.y'(t) = 2\sin t + 2t\cos t + 6 - c_1\sin t + c_2\cos t.

At t=0t=0: y′(0)=0+0+6−0+c2=6+c2=0⇒c2=−6y'(0) = 0+0+6-0+c_2 = 6+c_2 = 0 \Rightarrow c_2=-6. So

y(t)=2tsin⁡t+6t+cos⁡t−6sin⁡ty(t) = 2t\sin t + 6t + \cos t - 6\sin t

is the unique solution of the IVP, guaranteed by Part (1) since p,q,gp,q,g are continuous on all of R∋t0=0\mathbb{R} \ni t_0=0.

CounterexampleWhy continuity of pp and qq is needed — and why the leading coefficient must not vanish

The Structure Theorem requires p,q,gp, q, g continuous on the whole interval II. Drop this and both existence and the "dimension exactly 2" conclusion can fail. Take the Euler-type equation

t2y′′−2y=0t^2 y'' - 2y = 0

on I=RI = \mathbb{R} (through t=0t=0). In standard form this is y′′−2t2y=0y'' - \tfrac{2}{t^2}y = 0 for t≠0t \ne 0, so q(t)=−2/t2q(t) = -2/t^2 is not continuous at t=0t=0 — 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 t>0t>0 are y1=t2y_1=t^2 and y2=t−1y_2 = t^{-1} (check: for y2=t−1y_2=t^{-1}, y2′′=2t−3y_2''=2t^{-3}, and t2(2t−3)−2t−1=2t−1−2t−1=0t^2(2t^{-3}) - 2t^{-1} = 2t^{-1}-2t^{-1}=0, confirmed). But y2(t)=t−1y_2(t)=t^{-1} is not even defined at t=0t=0, let alone twice differentiable there, so it cannot be extended to a solution on all of R\mathbb{R}. Any solution that is to be defined and twice differentiable at t=0t=0 itself must have very restricted behavior forced by the singular point; in fact, on the whole line R\mathbb{R}, only multiples of t2t^2 extend smoothly across 00 while also solving the equation on both sides consistently and matching values at 00. Attempting to prescribe generic initial data y(0)=y0y(0)=y_0, y′(0)=y0′y'(0)=y_0' with y0′≠0y_0' \ne 0 leads to a contradiction: differentiating t2y′′−2y=0t^2y''-2y=0 forces strong constraints at t=0t=0 that generic data cannot satisfy, so the IVP at t0=0t_0=0 has no solution for most choices of (y0,y0′)(y_0,y_0') — Part (1) of the theorem simply fails at this singular point, exactly because its hypothesis (continuity of qq on all of II) fails there. This also illustrates the more familiar failure mode in Boyce–DiPrima style problems: writing the equation with a leading coefficient a(t)y′′+b(t)y′+c(t)y=g(t)a(t) y'' + b(t) y' + c(t) y = g(t) and dividing by a(t)a(t) to get standard form is only valid where a(t)≠0a(t) \ne 0; at zeros of a(t)a(t), p=b/ap = b/a and q=c/aq=c/a typically blow up, continuity fails, and neither existence nor the two-dimensionality of the solution space can be assumed.

Scope, edge cases & common traps

SituationWhat holdsWhat can fail
p,q,gp,q,g continuous on open interval II, t0∈It_0 \in IUnique solution on all of II; dim⁡V=2\dim V = 2—
Leading coefficient a(t)a(t) vanishes at some t0t_0 (Euler / singular equations)Theorem applies away from zeros of aaExistence/uniqueness at t0t_0 itself can fail; solutions may blow up or fail to extend
p,qp,q continuous but gg merely piecewise continuousExistence/uniqueness theory extends with minor technical care (solutions C1C^1, not C2C^2, at jumps)Formula y=yp+c1y1+c2y2y=y_p+c_1y_1+c_2y_2 still organizes solutions on each smooth piece
Nonlinear equation (e.g. y′′+y2=0y''+y^2=0)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 ≡0\equiv 0They may still both solve the equationThey 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
CÉ
Charles Émile Picard
1856–1941 · French analysis, existence theory for differential equations

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.

History
- 1820s: Cauchy gives the first rigorous existence proofs for differential equations using majorant/dominant-function techniques.
- 1890: Picard introduces the method of successive approximations (Picard iteration) to prove existence and uniqueness constructively.
- 1894: Lindelöf sharpens and generalizes Picard's approach, giving the modern Lipschitz-condition formulation.
- Early 1900s: The vector-space viewpoint on linear ODEs — solution sets as kernels of linear operators — becomes standard, unifying the theory of nn-th order linear equations.
- Mid-20th century: The structure theorem here is absorbed as a special case of general linear operator theory in functional analysis and control theory.
Why does the theorem require the interval II to be where p,q,gp,q,g are simultaneously continuous?

The proof converts the scalar equation into a first-order vector system x′=F(t,x)\mathbf{x}'=F(t,\mathbf{x}) where FF depends on p,q,gp, q, g all at once. Picard–Lindelöf needs FF continuous in tt and Lipschitz in x\mathbf{x} 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, FF 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 y=yp+c1y1+c2y2y=y_p+c_1y_1+c_2y_2 depend on which particular solution ypy_p we pick?

No — the set of solutions described is identical no matter which particular solution is chosen, though the specific values of c1,c2c_1,c_2 needed for a given IVP will change. If ypy_p and y~p\tilde y_p are two different particular solutions, their difference yp−y~py_p - \tilde y_p solves the homogeneous equation (by superposition), hence already lies in span{y1,y2}\mathrm{span}\{y_1,y_2\}. So shifting from ypy_p to y~p\tilde y_p just relabels the constants c1,c2c_1,c_2; the affine plane of solutions in function space stays exactly the same.

Is linear independence of y1,y2y_1,y_2 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 II. Conversely, subtler dependence is impossible for exactly two functions: y1,y2y_1,y_2 are dependent iff one is a scalar multiple of the other. The clean test is the Wronskian: if W(y1,y2)(t0)≠0W(y_1,y_2)(t_0)\ne 0 for some t0∈It_0\in I, 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 y′′+y2=0y'' + y^2 = 0, if y1,y2y_1,y_2 are both solutions, L[y1+y2]=(y1+y2)′′+(y1+y2)2=y1′′+y2′′+y12+2y1y2+y22L[y_1+y_2] = (y_1+y_2)'' + (y_1+y_2)^2 = y_1''+y_2'' + y_1^2+2y_1y_2+y_2^2, which is not L[y1]+L[y2]=y1′′+y12+y2′′+y22L[y_1]+L[y_2] = y_1''+y_1^2+y_2''+y_2^2 unless the cross term 2y1y22y_1y_2 vanishes. The proof of Part (2) used only that multiplication by p(t),q(t)p(t), q(t) is linear in y,y′y,y'; any nonlinear dependence on yy or y′y' 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 p,qp,q. When p,qp,q are constants, the guess y=erty=e^{rt} reduces L[y]=0L[y]=0 to a quadratic (the characteristic equation) in rr, giving an explicit recipe for y1,y2y_1,y_2; 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 gg "looks like" a homogeneous solution, such as cos⁡t\cos t forcing y′′+yy''+y — does not violate the Structure Theorem; it only means the naive undetermined-coefficients guess for ypy_p must be modified (multiplied by tt, as shown in Example 2) to avoid accidentally guessing a homogeneous solution, which would make L[yp]=0≠gL[y_p]=0\ne g. The theorem itself, guaranteeing existence of some particular solution and the two-dimensional homogeneous space, remains fully valid; only the search strategy for ypy_p needs adjustment.

Before this

Where this leads