Quick reminders you will lean on (all from the parent):
The rectangleR is the closed box around the starting point where we work:
R={(x,y):∣x−x0∣≤a,∣y−y0∣≤b}.
Here a is its half-width in x and b its half-height in y.
M=maxR∣f∣ is the slope bound — how steep the solution can be.
L is the Lipschitz constant in y: ∣f(x,y1)−f(x,y2)∣≤L∣y1−y2∣. On a convex box it equals maxR∣∂yf∣.
The guaranteed interval half-width is h=min(a,Mb).
The Picard operatorT turns a candidate function u(x) into a new function
T[u](x)=y0+∫x0xf(t,u(t))dt.
It acts on the space of continuous functions on ∣x−x0∣≤h with values in the box, measured by the sup-norm∥u∥=max∣x−x0∣≤h∣u(x)∣. A solution of the IVP is exactly a fixed point T[u]=u.
Here f(x,y)=3y+sinx. The starting point is (x0,y0)=(0,2).
∂y∂f=3.
The y-derivative is the constant 3, so ∣f(x,y1)−f(x,y2)∣=∣3y1−3y2∣=3∣y1−y2∣.
That is exactly the Lipschitz inequality with L=3, and it holds for all(x,y). So f is globally Lipschitz in y. (The sinx term depends only on x, so it cancels in the difference — Lipschitz is about y, not x.)
Recall Solution 1.2
f(x,y)=∣y∣=∣y∣1/2 is continuous everywhere, so existence is fine (Peano, Peano existence theorem). But ∂f/∂y=21∣y∣−1/2→∞ as y→0, so f is not Lipschitz in y near y=0. Hence Picard–Lindelöf does not guarantee uniqueness. Existence still holds; uniqueness is the casualty.
The rectangle is R={(x,y):∣x∣≤1,∣y∣≤2} (since x0=y0=0).
M=maxR∣x2+y2∣=12+22=5 (both terms maxed at the corner).
∂yf=2y, so L=maxR∣2y∣=2⋅2=4.
h=min(a,Mb)=min(1,52)=52=0.4.
So a unique solution is guaranteed on ∣x∣≤0.4. (Compare parent example 1 with b=1: enlarging b can shrinkh because M grows faster — see the L2 trap.)
Recall Solution 2.2
The rectangle here is R={(x,y):∣x∣≤10,∣y−1∣≤b}. On ∣y−1∣≤b the largest ∣y∣ is 1+b, so M=(1+b)2. The b/M constraint is
g(b)=(1+b)2b.
Maximise: g′(b)=(1+b)4(1+b)2−b⋅2(1+b)=(1+b)3(1+b)−2b=(1+b)31−b.
Setting g′(b)=0 gives b=1. Why this is a maximum (not a min): the denominator (1+b)3>0 for b≥0, so the sign of g′ is the sign of the numerator 1−b. For 0<b<1 we have 1−b>0 so g′>0 (rising); for b>1 we have 1−b<0 so g′<0 (falling). A sign change +→− at b=1 is exactly a maximum. Then M=(1+1)2=4 and b/M=41. Since a=10≫41, the min is b/M, so
hmax=41=0.25at b=1.
Beauty check: the true solution y=1−x1 blows up at x=1, so no finite rectangle can push h past that. Our h=0.25 is a safe local guarantee, not the maximal interval.
f(t,y)=2ty, y0(x)=1.
y1=1+∫0x2t⋅1dt=1+x2.y2=1+∫0x2t(1+t2)dt=1+∫0x(2t+2t3)dt=1+x2+2x4.y3=1+∫0x2t(1+t2+2t4)dt=1+∫0x(2t+2t3+t5)dt=1+x2+2x4+6x6.
The pattern is the partial sums of k=0∑∞k!(x2)k=ex2. So the iterates converge to the unique solution y=ex2 — exactly what separation of variables gives (lny=x2). This is Picard iteration (method of successive approximations) literally building the Taylor series.
Recall Solution 3.2
y≡0: then y′=0 and y2/3=0; both sides equal 0, and y(0)=0. ✔ (valid for all x.)
y=(x/3)3:y′=3⋅31(3x)2=(3x)2. Now check the right side for each sign of x:
x≥0: then (x/3)3≥0 and y2/3=[(x/3)3]2/3=(x/3)2. Matches y′. ✔
x<0: then (x/3)3<0. Reading y2/3 as ((x/3)3)2/3=∣x/3∣2=(x/3)2 (squaring kills the sign), it still equals y′=(x/3)2. So the same analytic formula solves the IVP on both sides — the cubic curve passes through the origin from below-left to above-right, and y≡0 overlaps it there.
Two distinct solutions through the same point ⟹ uniqueness fails. Cause: ∂y(y2/3)=32y−1/3→∞ as y→0, so no finite L near y=0.
The figure below plots both solution curves. The blue flat line is y≡0; the orange curve is y=(x/3)3 drawn for both x<0 and x>0. They cross at the red dot(0,0) — that single shared point carrying two solutions is precisely the non-uniqueness the theorem forbids when Lipschitz holds. The gray arrow marks where ∂yf blows up (at y=0), the missing ingredient.
General uniqueness. Both solve the integral form, so subtracting,
y(x)−y~(x)=∫x0x[f(t,y)−f(t,y~)]dt.
Let ϕ(x)=∣y(x)−y~(x)∣≥0. Take absolute values and use Lipschitz ∣f(t,y)−f(t,y~)∣≤Lϕ(t):
ϕ(x)≤L∫x0xϕ(t)dt.
Grönwall (with zero constant term) gives ϕ(x)≤0⋅eL(x−x0)=0. Since ϕ≥0, ϕ≡0, so y≡y~. Uniqueness. ✔
Perturbation bound. For f(x,y)=2y+g(x), L=2. Two solutions y,y~ with ∣y(x0)−y~(x0)∣=ε obey the general Grönwall estimate ϕ(x)≤εeL(x−x0). At x=x0+1:
ϕ(x0+1)≤εe2⋅1=εe2≈7.389ε.
(This is sharp: y−y~ satisfies (y−y~)′=2(y−y~), exactly εe2(x−x0).)
Recall Solution 4.2
For linear ODEs the Lipschitz constant is L=∣p∣≤P, a finite constant independent of y — the box height b never forces L up.
Why finite-time blow-up is the only obstruction (the continuation argument). Picard–Lindelöf first gives a local solution on a small interval. You can then restart the theorem at the right endpoint, using the value there as a new initial condition, extending the solution a bit further; repeat. This process either continues forever (covering the whole interval) or halts — and the only way it can halt at some finite x∗ is if the solution runs off to ±∞ as x→x∗ (it escapes every box, so no new box can be built). In symbols: a maximal solution that stops at finite x∗ must have ∣y(x)∣→∞ there (Maximal interval of existence). So if we can bound∣y∣ on every finite interval, blow-up is impossible and continuation never halts.
Grönwall supplies exactly that bound: ∣y(x)∣≤(∣y0∣+∫∣q∣)eP∣x−x0∣, finite for every finite x. With no blow-up available, the continuation runs to the full domain where p,q are defined.
Contrast: y′=y2 is not globally Lipschitz (∂y=2y unbounded); Grönwall gives no such bound, and the solution y=1−x1 from y(0)=1 genuinely satisfies ∣y∣→∞ at x=1 — the continuation halts there. Unbounded ∂yf is what permits finite-time blow-up.
(a) On R, ∣x∣≤1 and ∣y∣≤2, so M=max∣x+y∣=1+2=3. ∂yf=1⇒L=1. Then
h=min(1,31)=31.(b) Recall (from the reminders above) the Picard operator T[u](x)=y0+∫x0xf(t,u(t))dt, acting on continuous functions with the sup-norm ∥u∥=max∣x∣≤h∣u(x)∣. Its contraction constant is Lh: for two candidates u,v,
∥T[u]−T[v]∥≤Lh∥u−v∥.
Here Lh=1⋅31=31<1, so T shrinks distances — it is a genuine contraction in the sup-norm on ∣x∣≤31, and the Banach fixed-point theorem directly gives a unique fixed point (the solution).
(c)y0=1. First iterate:
y1=1+∫0x(t+y0)dt=1+∫0x(t+1)dt=1+x+2x2.
Second iterate: here f(t,y1(t))=t+y1(t)=t+(1+t+2t2). Collecting like terms, the constant is 1, the t-terms t+t=2t, and the quadratic is 2t2, so the integrand is 1+2t+2t2. Hence
y2=1+∫0x(1+2t+2t2)dt=1+x+x2+6x3.(d) Solve the linear ODE y′−y=x. Integrating factor e−x: (ye−x)′=xe−x, so integrating the right side (by parts) ∫xe−xdx=−(x+1)e−x, giving ye−x=−(x+1)e−x+C, i.e. y=Cex−x−1. Apply y(0)=1: at x=0 the term −x−1 equals −(0)−1=−1, so y(0)=C⋅1−1=C−1. Setting C−1=1 gives C=2. Thus
y(x)=2ex−x−1.
At x=h=31: y(31)=2e1/3−31−1=2e1/3−34≈1.4600.
Recall Solution 5.2
The rectangle is R={(x,y):∣x∣≤a,∣y∣≤b} with a large. On ∣y∣≤b, M=max∣1+y2∣=1+b2. Optimise g(b)=1+b2b:
g′(b)=(1+b2)2(1+b2)−b⋅2b=(1+b2)21−b2.
Setting g′(b)=0 gives b2=1, so b=1 (taking b>0). Why a maximum: the denominator (1+b2)2>0, so signg′=sign(1−b2). For 0<b<1, 1−b2>0⇒g′>0 (rising); for b>1, 1−b2<0⇒g′<0 (falling). Sign change +→− at b=1 ⟹ maximum. Then M=1+1=2 and h=Mb=21=0.5.
Since π/2≈1.5708, our best local guarantee h=0.5 is well inside the true blow-up time — safe but conservative, as expected of a local theorem.
The figure below shows this geometrically. The dashed gray box is R (with b=1). The green wedge is the pair of lines of slope ±M from the start — the solution is trapped inside it, and it exits the box's height exactly at x=h=0.5 (blue vertical line). The orange curve is the true solution y=tanx, which keeps climbing and blows up only at the red dotted line x=π/2≈1.57. The gap between the blue and red lines is the difference between what the theorem guarantees and what actually happens.
Recall Self-test checklist (format: prompt
::: answer)
Which quantity bounds slope? ::: M=maxR∣f∣
Which quantity controls convergence and uniqueness? ::: the Lipschitz constant L
Formula for the guaranteed half-interval? ::: h=min(a,b/M)
Continuity alone gives which conclusion? ::: existence only (Peano)
Tool that turns "two solutions" into "one solution"? ::: Grönwall's inequality