Suppose the only tool at hand is integration, and the problem is with . Start from the guess , put it into the right side, integrate, and repeat with the result. The guesses improve, but a few improving guesses are not a proof that a solution exists. Throughout, is the independent variable, , and the general problem is with . This lesson rewrites the problem as an integral equation, builds its solution by successive approximation, proves convergence on a short interval with a contraction estimate, and separates that local result from existence for all time.
Key terms
Integral form of an initial-value problem
Definition Let be continuous on a region of the -plane that contains , and let be an interval containing . A continuous function on whose graph lies in satisfies the integral form of the problem if
for every in . The letter is the variable of integration and is the upper limit. The integral form is equivalent to the initial-value problem , on , with one-sided derivatives at an endpoint of . If is a differentiable solution of the problem, then is continuous, and integrating it from to gives the integral equation. Conversely, if a continuous satisfies the integral equation, the integrand is continuous, so by the fundamental theorem of calculus the right side is differentiable with derivative . Hence , and setting makes the integral vanish and gives .
In plain words The value at time is the starting value plus everything the slope has added since the start. One equation now carries both the rate law and the initial condition, and it asks the unknown function only to be continuous, not differentiable.
Example For with the integral form is
The function satisfies it, since and . The lower limit must be the initial time. For the data the integral form is , and an integral starting at would describe the different problem with .
Picard iteration
Definition Let be continuous near and let be an interval containing . For a continuous function on whose graph stays where is defined, the Picard operator produces the function
on . Picard iteration chooses a continuous starting function on , often the constant , and defines the successive approximations for . Every with has the correct value . By the integral form, a continuous function with graph in the region solves the initial-value problem on exactly when . The iteration can be carried out only while each new graph stays in the region where is defined, and a convergence proof has to check that.
In plain words Put the whole current guess into the right side of the equation, integrate from the initial time, and call the result the next guess. Euler’s method steps forward from one mesh point to the next, but each Picard update replaces an entire function on the interval.
Example For with , start with . The integrand of the first update is , and each later update integrates from to , which gives
The third approximation has the right initial value but is not yet a solution, because its residual is
By induction , the partial sums of the exponential series without the constant term, and these converge to for every . Substitution confirms the limit, since and the value at is .
Sup norm
Definition Let be a closed and bounded interval. For a continuous function on , the sup norm is
which exists by the extreme value theorem. The distance between continuous functions and is , the largest gap between their graphs over . A sequence converges to in this norm exactly when it converges to uniformly on . The continuous functions on form a complete space under this norm. Every Cauchy sequence, one with as and grow, converges uniformly to a continuous function on . A set of continuous functions defined by a closed condition, such as for every in , is complete as well, because a uniform limit still satisfies the condition.
In plain words One number records the worst disagreement between two graphs anywhere on the interval. When that number is small, the graphs are close at every time at once, not only at a few sample points.
Example On the first two approximations above are and , so , attained at . The gap between and the solution is , which increases with , so
By contrast, the functions on tend to at each , yet their sup norm is for every , so they do not approach the zero function in this norm.
Contraction estimate
Definition Let and , and let be continuous on the rectangle of points with and . Suppose on and
for all points and of . Take , let , and let be the set of continuous functions on with for every in . If , then maps into , because
For and in the Lipschitz bound gives , and therefore
If also , the operator is a contraction on with factor . The same estimates hold on the one-sided interval .
In plain words Two checks do two different jobs. The bound keeps every updated graph inside the rectangle where the constants and are valid, and the bound makes every update pull two functions closer together by a fixed factor. A short enough interval passes both.
Example For with , use the interval and the states , so . There , so , and , so . Both checks pass, since and . Directly, for and in and ,
so each update at least halves the sup distance between two functions of .
Fixed point
Definition A fixed point of an operator on a set is an element of with . The contraction mapping theorem, in the form used here, states the following. Let be a nonempty set of continuous functions on a closed and bounded interval that is closed under uniform limits, and let map into with for all and in , where . Then has exactly one fixed point in , and for every in the iterates converge uniformly to with
The reason is that the successive changes obey , so all changes after step add up to at most the geometric tail above. The sequence is therefore Cauchy, and completeness gives a limit in . Since , letting in gives . Two fixed points and would satisfy , which forces . For the Picard operator under the hypotheses of the contraction estimate, the fixed points in are exactly the solutions of the initial-value problem on whose graphs lie in . So the problem has exactly one such solution, and Picard iteration from any in converges to it uniformly on . This is a constructive proof of the local part of the existence and uniqueness theorem. The limit is taken in the integral equation, where the Lipschitz bound controls the integrands uniformly, and no derivative of a limit is ever exchanged with a limit of derivatives.
In plain words A fixed point is a function that the update leaves unchanged, and for the Picard operator that is exactly a solution. A contraction cannot have two fixed points, because it would have to shrink the distance between them while leaving both of them where they are.
Example For with on , the function is a fixed point, since . It lies in because its largest value is . With and , the error bound for is
The actual error is far smaller. The bound is conservative, but it is guaranteed at every time of the interval. Every is a polynomial while the limit is not, which shows why completeness matters. Among polynomials alone, this sequence would have nothing to converge to.
Local versus global existence
Definition The problem , has local existence if it has a solution on some interval containing , however short. It has a global solution on a given interval containing , such as , if one solution is defined on all of . The contraction estimate proves local existence on whenever , and . These conditions are sufficient for that proof, not necessary for convergence. Starting from the constant , with and , induction gives
for . These bounds have a finite sum whatever the size of , so the iterates converge on that whole interval. One way to guarantee global existence is a bound that holds for all states. If is continuous for in an open interval and all real , and on each closed and bounded subinterval of it satisfies one Lipschitz bound valid for every , then for every in and every the solution exists on all of . Linear equations with and continuous on are of this kind. Without such a bound, local existence at every point does not prevent a solution from blowing up at a finite time.
In plain words A local theorem promises a solution near the starting time and says nothing about how long it lasts. Global existence is a separate claim with its own reasons, such as linearity or a Lipschitz bound that holds for all states. The polynomial iterates of the first example converge on every bounded interval, far beyond the interval of length where the contraction was checked.
Example For with , use the rectangle , . There , and since , the constant works. With and the checks ask for and , and no other choice of does better, so the proof gives a solution on for every . The solution is , whose maximal interval is . It exists far beyond the guaranteed interval, but as , so there is no global solution on . The Picard iterates from begin with and . They are polynomials defined for every , yet no solution reaches .
Check yourself
- Compute the Picard iterates , and for with , starting from . Identify the limit and check it by substitution.
Show the answer
The integral form is . Each update integrates times the previous function, which gives
These are the partial sums of , so the limit is . It solves the problem, since and .
- For with , keep the set of continuous functions on with . For which do both checks of the contraction estimate pass? At the contraction factor is still below . What goes wrong there, and how can the argument be repaired?
Show the answer
On the states the constants are and . The check asks for , and the check asks for , so both pass exactly when . At the factor is below , but no longer maps into . The constant function lies in , and , which equals at . The fixed point theorem then does not apply to . The repair is a larger set of states. With the bound is , and holds for . With both checks pass, since and , so the argument works on . The checks depend on the chosen set, not only on the equation.
- For with , use the rectangle , to find the intervals on which the contraction argument works, and compute and from . The iterates are polynomials defined for every . Does the solution exist for every ?
Show the answer
On the rectangle , so , and , so . The checks and hold for every . The iterates are and
The solution is , because and , and it is the only one, since is continuous. Its maximal interval is , and as , so the solution does not exist for every . The iterates cannot converge uniformly on any interval with . A uniform limit of the iterates would satisfy the integral equation there and be a continuous solution on , but the only solution is , which is unbounded on . Polynomial approximations defined everywhere say nothing about how long the solution lives.