Existence, uniqueness and linear operators
What guarantees a local IVP solution and why linear solutions form an affine translate of a kernel.
This page answers two questions that the solution methods leave open. Does an initial value problem have a solution near the initial point and do the data determine it uniquely? For linear equations, it also explains why every solution is one particular solution plus a homogeneous one.
The existence theorem accounts for the different IVP outcomes in ODE fundamentals and its Lipschitz condition underlies the error estimates for numerical solutions. The operator structure is the one used for second-order constant-coefficient equations.
Existence and uniqueness
Lipschitz condition in the dependent variable
A function satisfies a Lipschitz condition in on a region when there is a constant such that, for each fixed and all with and in the region,
The condition controls how quickly the slope field can change as changes. It is stronger than continuity in and prevents two solution curves through the same initial point from separating while they remain in the region.
Local existence and uniqueness
For the IVP
if is continuous and satisfies a Lipschitz condition in on a rectangle contained in its domain and containing , then the IVP has a unique solution on some interval around . The conclusion is local; a global solution needs the hypotheses to remain valid along the solution.
The Lipschitz condition is sufficient, not necessary: if it fails, uniqueness may still hold.
Reading the hypotheses
The theorem explains the four outcomes from ODE fundamentals:
- For , the function is continuous and independent of , so the IVP , is uniquely determined.
- For (interpreting the real power as ), the Lipschitz condition fails near . This failure alone does not imply nonuniqueness, but here the IVP , has the distinct solutions and , since .
- In , the coefficient of vanishes at , so the equation cannot be put into the usual normal form at the initial point.
- The equation forces , which is incompatible with ; no solution satisfies that data.
[challenge]
Linear differential operators
Linear differential operator
On an interval where its leading coefficient is nonzero, a linear differential operator of order can be divided by that coefficient and written in the normalised form
It satisfies
Linearity follows by distributing derivatives and collecting terms. The constant-coefficient operator is the operator used in second-order constant-coefficient equations and its characteristic equation.
Kernel of an operator
The kernel of a linear differential operator is
The kernel is exactly the set of homogeneous solutions. Adding an element of the kernel to a particular solution leaves the forcing unchanged. This is the differential-equation version of the kernel of a linear map: the kernel contains the inputs the operator sends to zero.
All forced solutions are an affine translate
If and is one particular solution, then
Equivalently, every solution is for some homogeneous solution .
The solution set is generally not a vector space when , because it need not contain the zero function. It is a translate of the homogeneous solution space, as for solution classes of linear systems.
If , then
so every element of is a solution. Conversely, if is any solution of , then
Thus , so for some .
A particular solution translated by the kernel
For
on an interval with , take
The homogeneous equation has solution
A particular solution is , since
Therefore the general solution is
[routine]