Unit 13, lesson 75

Integral Equations and Picard Iteration

How to write an initial-value problem as an integral equation, build its solution by Picard iteration, prove convergence with the sup norm and a contraction estimate, and tell local from global existence.

  • Video 75
  • Existence by Successive Approximation

Suppose the only tool at hand is integration, and the problem is dy/dt=1+ydy/dt = 1 + y with y(0)=0y(0) = 0. Start from the guess y=0y = 0, 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, tt is the independent variable, y′=dy/dty' = dy/dt, and the general problem is y′=f(t,y)y' = f(t, y) with y(t0)=y0y(t_0) = y_0. 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 ff be continuous on a region DD of the tyty-plane that contains (t0,y0)(t_0, y_0), and let JJ be an interval containing t0t_0. A continuous function yy on JJ whose graph lies in DD satisfies the integral form of the problem if

y(t)=y0+∫t0tf(s,y(s)) dsy(t) = y_0 + \int_{t_0}^{t} f(s, y(s))\,ds

for every tt in JJ. The letter ss is the variable of integration and tt is the upper limit. The integral form is equivalent to the initial-value problem y′=f(t,y)y' = f(t, y), y(t0)=y0y(t_0) = y_0 on JJ, with one-sided derivatives at an endpoint of JJ. If yy is a differentiable solution of the problem, then y′(t)=f(t,y(t))y'(t) = f(t, y(t)) is continuous, and integrating it from t0t_0 to tt gives the integral equation. Conversely, if a continuous yy satisfies the integral equation, the integrand s↦f(s,y(s))s \mapsto f(s, y(s)) is continuous, so by the fundamental theorem of calculus the right side is differentiable with derivative f(t,y(t))f(t, y(t)). Hence y′=f(t,y)y' = f(t, y), and setting t=t0t = t_0 makes the integral vanish and gives y(t0)=y0y(t_0) = y_0.

In plain words The value at time tt 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 y′=1+yy' = 1 + y with y(0)=0y(0) = 0 the integral form is

y(t)=∫0t(1+y(s)) ds.y(t) = \int_0^t \bigl(1 + y(s)\bigr)\,ds.

The function y=et−1y = e^t - 1 satisfies it, since 1+y(s)=es1 + y(s) = e^s and ∫0tes ds=et−1\int_0^t e^s\,ds = e^t - 1. The lower limit must be the initial time. For the data y(1)=3y(1) = 3 the integral form is y(t)=3+∫1t(1+y(s)) dsy(t) = 3 + \int_1^t (1 + y(s))\,ds, and an integral starting at 00 would describe the different problem with y(0)=3y(0) = 3.

Picard iteration

Definition Let ff be continuous near (t0,y0)(t_0, y_0) and let JJ be an interval containing t0t_0. For a continuous function uu on JJ whose graph stays where ff is defined, the Picard operator T\mathcal{T} produces the function

(Tu)(t)=y0+∫t0tf(s,u(s)) ds\begin{aligned} (\mathcal{T}u)(t) &= y_0 \\[0.4em] &\quad + \int_{t_0}^{t} f(s, u(s))\,ds \end{aligned}

on JJ. Picard iteration chooses a continuous starting function φ0\varphi_0 on JJ, often the constant y0y_0, and defines the successive approximations φn+1=Tφn\varphi_{n+1} = \mathcal{T}\varphi_n for n=0,1,2,…n = 0, 1, 2, \dots. Every φn\varphi_n with n≥1n \ge 1 has the correct value φn(t0)=y0\varphi_n(t_0) = y_0. By the integral form, a continuous function yy with graph in the region solves the initial-value problem on JJ exactly when Ty=y\mathcal{T}y = y. The iteration can be carried out only while each new graph stays in the region where ff 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 y′=1+yy' = 1 + y with y(0)=0y(0) = 0, start with φ0=0\varphi_0 = 0. The integrand of the first update is 11, and each later update integrates 1+φn(s)1 + \varphi_n(s) from 00 to tt, which gives

φ1=t,φ2=t+t22,φ3=t+t22+t36.\begin{gathered} \varphi_1 = t, \qquad \varphi_2 = t + \frac{t^2}{2}, \\[0.4em] \varphi_3 = t + \frac{t^2}{2} + \frac{t^3}{6}. \end{gathered}

The third approximation has the right initial value but is not yet a solution, because its residual is

φ3′−(1+φ3)=−t36.\varphi_3' - (1 + \varphi_3) = -\frac{t^3}{6}.

By induction φn(t)=∑k=1ntk/k!\varphi_n(t) = \sum_{k=1}^{n} t^k/k!, the partial sums of the exponential series without the constant term, and these converge to et−1e^t - 1 for every tt. Substitution confirms the limit, since (et−1)′=et=1+(et−1)(e^t - 1)' = e^t = 1 + (e^t - 1) and the value at 00 is 00.

Sup norm

Definition Let JJ be a closed and bounded interval. For a continuous function uu on JJ, the sup norm is

∥u∥∞=max⁡t∈J∣u(t)∣,\lVert u \rVert_\infty = \max_{t \in J} \lvert u(t) \rvert,

which exists by the extreme value theorem. The distance between continuous functions uu and vv is ∥u−v∥∞\lVert u - v \rVert_\infty, the largest gap between their graphs over JJ. A sequence unu_n converges to uu in this norm exactly when it converges to uu uniformly on JJ. The continuous functions on JJ form a complete space under this norm. Every Cauchy sequence, one with ∥un−um∥∞→0\lVert u_n - u_m \rVert_\infty \to 0 as nn and mm grow, converges uniformly to a continuous function on JJ. A set of continuous functions defined by a closed condition, such as ∣u(t)−y0∣≤b\lvert u(t) - y_0 \rvert \le b for every tt in JJ, 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 J=[0,12]J = [0, \tfrac{1}{2}] the first two approximations above are φ0=0\varphi_0 = 0 and φ1=t\varphi_1 = t, so ∥φ1−φ0∥∞=12\lVert \varphi_1 - \varphi_0 \rVert_\infty = \tfrac{1}{2}, attained at t=12t = \tfrac{1}{2}. The gap between φ3\varphi_3 and the solution et−1e^t - 1 is ∑k≥4tk/k!\sum_{k \ge 4} t^k/k!, which increases with tt, so

∥et−1−φ3∥∞=e1/2−7948≈0.00289.\begin{aligned} \lVert e^t - 1 - \varphi_3 \rVert_\infty &= e^{1/2} - \tfrac{79}{48} \\[0.4em] &\approx 0.00289. \end{aligned}

By contrast, the functions tnt^n on [0,1][0, 1] tend to 00 at each t<1t < 1, yet their sup norm is 11 for every nn, so they do not approach the zero function in this norm.

Contraction estimate

Definition Let a>0a > 0 and b>0b > 0, and let ff be continuous on the rectangle QQ of points (t,y)(t, y) with ∣t−t0∣≤a\lvert t - t_0 \rvert \le a and ∣y−y0∣≤b\lvert y - y_0 \rvert \le b. Suppose ∣f∣≤M\lvert f \rvert \le M on QQ and

∣f(t,y1)−f(t,y2)∣≤L∣y1−y2∣\begin{aligned} &\lvert f(t, y_1) - f(t, y_2) \rvert \\[0.4em] &\qquad \le L \lvert y_1 - y_2 \rvert \end{aligned}

for all points (t,y1)(t, y_1) and (t,y2)(t, y_2) of QQ. Take 0<h≤a0 < h \le a, let J=[t0−h,t0+h]J = [t_0 - h, t_0 + h], and let XX be the set of continuous functions uu on JJ with ∣u(t)−y0∣≤b\lvert u(t) - y_0 \rvert \le b for every tt in JJ. If Mh≤bMh \le b, then T\mathcal{T} maps XX into XX, because

∣(Tu)(t)−y0∣≤M∣t−t0∣≤Mh≤b.\begin{aligned} \lvert (\mathcal{T}u)(t) - y_0 \rvert &\le M \lvert t - t_0 \rvert \\[0.4em] &\le Mh \le b. \end{aligned}

For uu and vv in XX the Lipschitz bound gives ∣(Tu)(t)−(Tv)(t)∣≤L∣t−t0∣ ∥u−v∥∞\lvert (\mathcal{T}u)(t) - (\mathcal{T}v)(t) \rvert \le L \lvert t - t_0 \rvert \, \lVert u - v \rVert_\infty, and therefore

∥Tu−Tv∥∞≤Lh ∥u−v∥∞.\begin{aligned} &\lVert \mathcal{T}u - \mathcal{T}v \rVert_\infty \\[0.4em] &\qquad \le Lh \, \lVert u - v \rVert_\infty. \end{aligned}

If also Lh<1Lh < 1, the operator T\mathcal{T} is a contraction on XX with factor q=Lhq = Lh. The same estimates hold on the one-sided interval [t0,t0+h][t_0, t_0 + h].

In plain words Two checks do two different jobs. The bound Mh≤bMh \le b keeps every updated graph inside the rectangle where the constants MM and LL are valid, and the bound Lh<1Lh < 1 makes every update pull two functions closer together by a fixed factor. A short enough interval passes both.

Example For y′=1+yy' = 1 + y with y(0)=0y(0) = 0, use the interval [0,12][0, \tfrac{1}{2}] and the states ∣y∣≤1\lvert y \rvert \le 1, so b=1b = 1. There ∣1+y∣≤2\lvert 1 + y \rvert \le 2, so M=2M = 2, and ∣(1+y1)−(1+y2)∣=∣y1−y2∣\lvert (1 + y_1) - (1 + y_2) \rvert = \lvert y_1 - y_2 \rvert, so L=1L = 1. Both checks pass, since Mh=1≤1Mh = 1 \le 1 and Lh=12<1Lh = \tfrac{1}{2} < 1. Directly, for uu and vv in XX and 0≤t≤120 \le t \le \tfrac{1}{2},

∣(Tu−Tv)(t)∣=∣∫0t(u−v) ds∣≤12∥u−v∥∞,\begin{aligned} &\lvert (\mathcal{T}u - \mathcal{T}v)(t) \rvert \\[0.4em] &\quad = \Bigl\lvert \int_0^t (u - v)\,ds \Bigr\rvert \\[0.4em] &\quad \le \tfrac{1}{2} \lVert u - v \rVert_\infty, \end{aligned}

so each update at least halves the sup distance between two functions of XX.

Fixed point

Definition A fixed point of an operator T\mathcal{T} on a set XX is an element yy of XX with Ty=y\mathcal{T}y = y. The contraction mapping theorem, in the form used here, states the following. Let XX be a nonempty set of continuous functions on a closed and bounded interval that is closed under uniform limits, and let T\mathcal{T} map XX into XX with ∥Tu−Tv∥∞≤q∥u−v∥∞\lVert \mathcal{T}u - \mathcal{T}v \rVert_\infty \le q \lVert u - v \rVert_\infty for all uu and vv in XX, where 0≤q<10 \le q < 1. Then T\mathcal{T} has exactly one fixed point yy in XX, and for every φ0\varphi_0 in XX the iterates φn+1=Tφn\varphi_{n+1} = \mathcal{T}\varphi_n converge uniformly to yy with

∥φn−y∥∞≤qn1−q∥φ1−φ0∥∞.\begin{aligned} &\lVert \varphi_n - y \rVert_\infty \\[0.4em] &\qquad \le \frac{q^n}{1 - q} \lVert \varphi_1 - \varphi_0 \rVert_\infty. \end{aligned}

The reason is that the successive changes obey ∥φk+1−φk∥∞≤qk∥φ1−φ0∥∞\lVert \varphi_{k+1} - \varphi_k \rVert_\infty \le q^k \lVert \varphi_1 - \varphi_0 \rVert_\infty, so all changes after step nn add up to at most the geometric tail above. The sequence is therefore Cauchy, and completeness gives a limit yy in XX. Since ∥Tφn−Ty∥∞≤q∥φn−y∥∞→0\lVert \mathcal{T}\varphi_n - \mathcal{T}y \rVert_\infty \le q \lVert \varphi_n - y \rVert_\infty \to 0, letting n→∞n \to \infty in φn+1=Tφn\varphi_{n+1} = \mathcal{T}\varphi_n gives y=Tyy = \mathcal{T}y. Two fixed points yy and zz would satisfy ∥y−z∥∞≤q∥y−z∥∞\lVert y - z \rVert_\infty \le q \lVert y - z \rVert_\infty, which forces y=zy = z. For the Picard operator under the hypotheses of the contraction estimate, the fixed points in XX are exactly the solutions of the initial-value problem on JJ whose graphs lie in QQ. So the problem has exactly one such solution, and Picard iteration from any φ0\varphi_0 in XX converges to it uniformly on JJ. 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 y′=1+yy' = 1 + y with y(0)=0y(0) = 0 on [0,12][0, \tfrac{1}{2}], the function y=et−1y = e^t - 1 is a fixed point, since (Ty)(t)=∫0tes ds=et−1(\mathcal{T}y)(t) = \int_0^t e^s\,ds = e^t - 1. It lies in XX because its largest value is e1/2−1≈0.649≤1e^{1/2} - 1 \approx 0.649 \le 1. With q=12q = \tfrac{1}{2} and ∥φ1−φ0∥∞=12\lVert \varphi_1 - \varphi_0 \rVert_\infty = \tfrac{1}{2}, the error bound for φ3\varphi_3 is

(1/2)31−1/2⋅12=18.\frac{(1/2)^3}{1 - 1/2} \cdot \frac{1}{2} = \frac{1}{8}.

The actual error 0.002890.00289 is far smaller. The bound is conservative, but it is guaranteed at every time of the interval. Every φn\varphi_n 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 y′=f(t,y)y' = f(t, y), y(t0)=y0y(t_0) = y_0 has local existence if it has a solution on some interval containing t0t_0, however short. It has a global solution on a given interval II containing t0t_0, such as [t0,∞)[t_0, \infty), if one solution is defined on all of II. The contraction estimate proves local existence on ∣t−t0∣≤h\lvert t - t_0 \rvert \le h whenever h≤ah \le a, Mh≤bMh \le b and Lh<1Lh < 1. These conditions are sufficient for that proof, not necessary for convergence. Starting from the constant φ0=y0\varphi_0 = y_0, with h≤ah \le a and Mh≤bMh \le b, induction gives

∣φn(t)−φn−1(t)∣≤MLn−1∣t−t0∣nn!\begin{aligned} &\lvert \varphi_n(t) - \varphi_{n-1}(t) \rvert \\[0.4em] &\qquad \le \frac{M L^{n-1} \lvert t - t_0 \rvert^n}{n!} \end{aligned}

for ∣t−t0∣≤h\lvert t - t_0 \rvert \le h. These bounds have a finite sum whatever the size of LhLh, so the iterates converge on that whole interval. One way to guarantee global existence is a bound that holds for all states. If ff is continuous for tt in an open interval II and all real yy, and on each closed and bounded subinterval of II it satisfies one Lipschitz bound valid for every yy, then for every t0t_0 in II and every y0y_0 the solution exists on all of II. Linear equations y′=p(t)y+g(t)y' = p(t)y + g(t) with pp and gg continuous on II 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 12\tfrac{1}{2} where the contraction was checked.

Example For y′=y2y' = y^2 with y(0)=1y(0) = 1, use the rectangle ∣t∣≤a\lvert t \rvert \le a, ∣y−1∣≤b\lvert y - 1 \rvert \le b. There M=(1+b)2M = (1 + b)^2, and since ∣y12−y22∣=∣y1+y2∣∣y1−y2∣\lvert y_1^2 - y_2^2 \rvert = \lvert y_1 + y_2 \rvert \lvert y_1 - y_2 \rvert, the constant L=2(1+b)L = 2(1 + b) works. With b=1b = 1 and a≥14a \ge \tfrac{1}{4} the checks ask for h≤14h \le \tfrac{1}{4} and h<14h < \tfrac{1}{4}, and no other choice of bb does better, so the proof gives a solution on [−h,h][-h, h] for every h<14h < \tfrac{1}{4}. The solution is y=1/(1−t)y = 1/(1 - t), whose maximal interval is (−∞,1)(-\infty, 1). It exists far beyond the guaranteed interval, but y(t)→∞y(t) \to \infty as t→1−t \to 1^-, so there is no global solution on [0,∞)[0, \infty). The Picard iterates from φ0=1\varphi_0 = 1 begin with φ1=1+t\varphi_1 = 1 + t and φ2=1+t+t2+t3/3\varphi_2 = 1 + t + t^2 + t^3/3. They are polynomials defined for every tt, yet no solution reaches t=1t = 1.

Check yourself

  1. Compute the Picard iterates φ1\varphi_1, φ2\varphi_2 and φ3\varphi_3 for y′=2tyy' = 2ty with y(0)=1y(0) = 1, starting from φ0=1\varphi_0 = 1. Identify the limit and check it by substitution.
Show the answer

The integral form is y(t)=1+∫0t2s y(s) dsy(t) = 1 + \int_0^t 2s\,y(s)\,ds. Each update integrates 2s2s times the previous function, which gives

φ1=1+t2,φ2=1+t2+t42,φ3=1+t2+t42+t66.\begin{gathered} \varphi_1 = 1 + t^2, \\[0.4em] \varphi_2 = 1 + t^2 + \frac{t^4}{2}, \\[0.4em] \varphi_3 = 1 + t^2 + \frac{t^4}{2} + \frac{t^6}{6}. \end{gathered}

These are the partial sums of ∑k≥0(t2)k/k!\sum_{k \ge 0} (t^2)^k/k!, so the limit is y=et2y = e^{t^2}. It solves the problem, since (et2)′=2t et2=2ty(e^{t^2})' = 2t\,e^{t^2} = 2ty and e0=1e^0 = 1.

  1. For y′=1+yy' = 1 + y with y(0)=0y(0) = 0, keep the set XX of continuous functions on [0,h][0, h] with ∣u(t)∣≤1\lvert u(t) \rvert \le 1. For which hh do both checks of the contraction estimate pass? At h=0.8h = 0.8 the contraction factor is still below 11. What goes wrong there, and how can the argument be repaired?
Show the answer

On the states ∣y∣≤1\lvert y \rvert \le 1 the constants are M=2M = 2 and L=1L = 1. The check Mh≤bMh \le b asks for 2h≤12h \le 1, and the check Lh<1Lh < 1 asks for h<1h < 1, so both pass exactly when 0<h≤120 < h \le \tfrac{1}{2}. At h=0.8h = 0.8 the factor Lh=0.8Lh = 0.8 is below 11, but T\mathcal{T} no longer maps XX into XX. The constant function u=1u = 1 lies in XX, and (Tu)(t)=∫0t2 ds=2t(\mathcal{T}u)(t) = \int_0^t 2\,ds = 2t, which equals 1.61.6 at t=0.8t = 0.8. The fixed point theorem then does not apply to XX. The repair is a larger set of states. With ∣y∣≤b\lvert y \rvert \le b the bound is M=1+bM = 1 + b, and (1+b)⋅0.8≤b(1 + b) \cdot 0.8 \le b holds for b≥4b \ge 4. With b=4b = 4 both checks pass, since Mh=4≤4Mh = 4 \le 4 and Lh=0.8<1Lh = 0.8 < 1, so the argument works on [0,0.8][0, 0.8]. The checks depend on the chosen set, not only on the equation.

  1. For y′=1+y2y' = 1 + y^2 with y(0)=0y(0) = 0, use the rectangle ∣t∣≤1\lvert t \rvert \le 1, ∣y∣≤1\lvert y \rvert \le 1 to find the intervals [−h,h][-h, h] on which the contraction argument works, and compute φ1\varphi_1 and φ2\varphi_2 from φ0=0\varphi_0 = 0. The iterates are polynomials defined for every tt. Does the solution exist for every tt?
Show the answer

On the rectangle ∣1+y2∣≤2\lvert 1 + y^2 \rvert \le 2, so M=2M = 2, and ∣y12−y22∣=∣y1+y2∣∣y1−y2∣≤2∣y1−y2∣\lvert y_1^2 - y_2^2 \rvert = \lvert y_1 + y_2 \rvert \lvert y_1 - y_2 \rvert \le 2\lvert y_1 - y_2 \rvert, so L=2L = 2. The checks 2h≤12h \le 1 and 2h<12h < 1 hold for every h<12h < \tfrac{1}{2}. The iterates are φ1=∫0t1 ds=t\varphi_1 = \int_0^t 1\,ds = t and

φ2=∫0t(1+s2) ds=t+t33.\begin{aligned} \varphi_2 &= \int_0^t (1 + s^2)\,ds \\[0.4em] &= t + \frac{t^3}{3}. \end{aligned}

The solution is y=tan⁡ty = \tan t, because (tan⁡t)′=1+tan⁡2t(\tan t)' = 1 + \tan^2 t and tan⁡0=0\tan 0 = 0, and it is the only one, since ∂f/∂y=2y\partial f/\partial y = 2y is continuous. Its maximal interval is (−π/2,π/2)(-\pi/2, \pi/2), and tan⁡t→∞\tan t \to \infty as t→π/2−t \to \pi/2^-, so the solution does not exist for every tt. The iterates cannot converge uniformly on any interval [0,c][0, c] with c≥π/2c \ge \pi/2. A uniform limit of the iterates would satisfy the integral equation there and be a continuous solution on [0,c][0, c], but the only solution is tan⁡t\tan t, which is unbounded on [0,π/2)[0, \pi/2). Polynomial approximations defined everywhere say nothing about how long the solution lives.

How this lesson connects