Existence and Uniqueness — Picard-Lindelof Theorem

⚡ Key Takeaways

Picard-Lindelöf Theorem guarantees that the initial value problem y′=f(t,y)y' = f(t,y), y(t0)=y0y(t_0)=y_0 has a unique solution on some interval around t0t_0, provided ff is continuous and Lipschitz continuous in yy. The proof constructs the solution as the limit of an iterative sequence (Picard iterates) via the Banach fixed-point theorem. It applies to first-order ODEs and systems; established by Émile Picard (1890) and Ernst Lindelöf (1894).

💡 The Core Insight

The initial value problem is equivalent to an integral equation, and solving that integral equation is the same as finding a fixed point of a certain operator on a space of functions. If that operator is a contraction (which the Lipschitz condition guarantees), the Banach fixed-point theorem hands us existence and uniqueness for free, plus a constructive iteration scheme that converges to the answer.

Formal Statement

DefinitionThe Initial Value Problem

A first-order initial value problem (IVP) consists of a differential equation together with an initial condition:

1
y′(t)=f(t,y(t)),y(t0)=y0.\quad y'(t) = f(t, y(t)), \qquad y(t_0) = y_0.

Derivation hint: This is the standard explicit first-order form; y′y' is isolated and equals a known function ff of the independent variable tt and the unknown yy. Here f:D→Rnf : D \to \mathbb{R}^n is defined on an open set D⊆R×RnD \subseteq \mathbb{R} \times \mathbb{R}^n, the point (t0,y0)∈D(t_0, y_0) \in D, and we seek a differentiable function y:I→Rny : I \to \mathbb{R}^n on an interval I∋t0I \ni t_0 satisfying both relations. For n>1n>1 this is a system of ODEs and yy, ff, y0y_0 are vectors.

DefinitionLipschitz Continuity in yy

A function f(t,y)f(t,y) is said to be Lipschitz continuous in yy (uniformly in tt) on a region RR if there exists a constant L≥0L \geq 0 — the Lipschitz constant — such that

2
∥f(t,y1)−f(t,y2)∥≤L ∥y1−y2∥for all (t,y1),(t,y2)∈R.\quad \| f(t, y_1) - f(t, y_2) \| \leq L\, \| y_1 - y_2 \| \quad \text{for all } (t,y_1), (t,y_2) \in R.

Derivation hint: This bounds how fast ff can change with respect to yy; geometrically the difference quotient in yy is bounded by LL, controlling the "spread" of nearby solution slopes. A convenient sufficient condition: if ∂f/∂y\partial f / \partial y exists and is continuous (hence bounded) on a closed rectangle RR, then ff is Lipschitz in yy there with L=max⁡R∥∂f/∂y∥L = \max_R \|\partial f/\partial y\| by the Mean Value Theorem.

TheoremPicard-Lindelöf

Let R={(t,y):∣t−t0∣≤a, ∥y−y0∥≤b}R = \{(t,y) : |t - t_0| \leq a,\ \|y - y_0\| \leq b\} be a closed rectangle on which ff is continuous and Lipschitz in yy with constant LL. Let

3
M=max⁡(t,y)∈R∥f(t,y)∥,h=min⁡ ⁣(a, bM).\quad M = \max_{(t,y)\in R} \| f(t,y) \|, \qquad h = \min\!\left( a,\ \frac{b}{M} \right).

Derivation hint: MM bounds the slope, so over a time hh the solution moves at most Mh≤bMh \le b vertically, keeping the graph inside RR; this is why hh is capped by b/Mb/M. Then the IVP [1] has a unique solution y(t)y(t) on the interval I=[t0−h, t0+h]I = [t_0 - h,\ t_0 + h], and y∈C1(I)y \in C^1(I).

⚠️ Common mistake

The conclusion is local: the interval [t0−h,t0+h][t_0 - h, t_0 + h] may be much smaller than [t0−a,t0+a][t_0 - a, t_0 + a]. Even with ff globally smooth, solutions can blow up in finite time — e.g. y′=y2y' = y^2, y(0)=1y(0)=1 gives y=1/(1−t)y = 1/(1-t), which escapes to +∞+\infty as t→1−t \to 1^-. The theorem promises only a guaranteed window, not a global one.

Why It Holds / Derivation

ProofExistence and Uniqueness via Picard Iteration

Step 1 — Convert to an integral equation. A continuous function yy solves the IVP [1] if and only if it satisfies

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

Derivation hint: Integrate y′(s)=f(s,y(s))y'(s)=f(s,y(s)) from t0t_0 to tt and apply the Fundamental Theorem of Calculus; conversely differentiating [4] recovers [1] and setting t=t0t=t_0 recovers the initial condition.

Step 2 — Define the Picard operator. On the space XX of continuous functions y:I→Rny : I \to \mathbb{R}^n with ∥y(t)−y0∥≤b\|y(t)-y_0\| \le b, define the operator

5
(Ty)(t)=y0+∫t0tf(s,y(s)) ds.\quad (T y)(t) = y_0 + \int_{t_0}^{t} f\big(s, y(s)\big)\, ds.

Derivation hint: TT takes a candidate function and returns the right-hand side of [4]; a solution is exactly a fixed point Ty=yTy=y.

Step 3 — TT maps XX into itself. For y∈Xy \in X and ∣t−t0∣≤h|t-t_0|\le h,

6
∥(Ty)(t)−y0∥≤∫t0t∥f(s,y(s))∥ ds≤M ∣t−t0∣≤Mh≤b.\quad \| (Ty)(t) - y_0 \| \leq \int_{t_0}^{t} \| f(s, y(s)) \|\, ds \leq M\, |t - t_0| \leq M h \leq b.

Derivation hint: Bound the integral by MM from [3] times the interval length, then use h≤b/Mh \le b/M so the output stays in the ball of radius bb.

Step 4 — Iterated contraction estimate. Define Picard iterates y0(t)≡y0y_0(t)\equiv y_0 and yk+1=Tyky_{k+1} = T y_k. Using the Lipschitz condition [2], one proves by induction

7
∥(Tku)(t)−(Tkv)(t)∥≤(L ∣t−t0∣)kk! sup⁡I∥u−v∥.\quad \| (T^k u)(t) - (T^k v)(t) \| \leq \frac{(L\,|t-t_0|)^k}{k!}\, \sup_I \| u - v \|.

Derivation hint: Base case is the Lipschitz bound; inductive step pulls one more LL inside the integral and integrates ∣s−t0∣k−1/(k−1)!|s-t_0|^{k-1}/(k-1)! to produce ∣t−t0∣k/k!|t-t_0|^k/k!.

Step 5 — Apply the Banach fixed-point theorem. Since (Lh)k/k!→0(Lh)^k/k! \to 0, some iterate TkT^k is a contraction on the complete metric space XX (with the sup norm). Banach's theorem then yields a unique fixed point y∗∈Xy^* \in X, which by Step 1 is the unique solution of the IVP. The iterates converge uniformly to y∗y^*:

8
sup⁡I∥yk−y∗∥≤(Lh)kk! eLh sup⁡I∥y1−y0∥  ⟶  0.\quad \sup_I \| y_k - y^* \| \leq \frac{(Lh)^k}{k!}\, e^{Lh}\, \sup_I \|y_1 - y_0\| \;\longrightarrow\; 0.

Derivation hint: Sum the geometric-like tail of the contraction estimates [7]; the factorial decay dominates, giving uniform (indeed superlinear) convergence regardless of how large LhLh is. This completes the proof: existence (a fixed point exists), uniqueness (it is the only one), and constructivity (Picard iteration converges to it). ■\blacksquare

∎
Figure
Picard iteration converging to the unique solution curve through (t0,y0)(t_0,y_0), confined to the rectangle RR
t y t₀−h t₀+h t₀ y₁ y₂ y*(t) (t₀,y₀) R
mathematician · Émile Picard | 1856–1941

Charles Émile Picard was a towering figure of late-19th-century French mathematics, known for Picard's great and little theorems in complex analysis as much as for the iteration method that bears his name. In an 1890 memoir he introduced successive approximations (méthode des approximations successives) to prove existence and uniqueness for differential equations, turning a vague iterative idea — already glimpsed by Liouville and Cauchy — into a rigorous tool. Ernst Leonard Lindelöf (1870–1946), a Finnish mathematician and founder of the Finnish school of analysis, sharpened and generalized the result in 1894, which is why the theorem carries both names. Picard's iteration anticipated the abstract notion of a contraction mapping that Banach would formalize in 1922.

Building Intuition

🧠 Intuition

Think of f(t,y)f(t,y) as a slope field: at every point of the plane it tells you which direction to head. A solution is a curve that always flows along the arrows. Existence asks whether you can start at (t0,y0)(t_0,y_0) and keep following the arrows for at least a little while — yes, as long as the arrows don't push you off the edge of the region (that's the h≤b/Mh \le b/M cap). Uniqueness asks whether two such curves could ever split apart. The Lipschitz condition says nearby arrows differ by no more than LL times the distance between their tails — the field doesn't change too violently. If two solutions started together and then diverged, the gap between them would have to grow, but the Lipschitz bound forces the gap's growth rate to be proportional to the gap itself (a Grönwall-type estimate), so a zero gap stays zero. The Picard iteration is just literally following the arrows repeatedly: start with the constant guess, integrate the slope field along it to get a better guess, and repeat — each pass corrects the previous one, and the corrections shrink factorially fast.

Worked Examples

ExampleLinear ODE — verifying the interval

Given: y′=2tyy' = 2ty, y(0)=1y(0) = 1, on the rectangle R={∣t∣≤1, ∣y−1∣≤1}R = \{|t|\le 1,\ |y-1|\le 1\}.

Step 1 — Bounds. Here f=2tyf = 2ty. On RR: ∥f∥≤2(1)(2)=4\|f\| \le 2(1)(2) = 4, so M=4M = 4. With a=1a=1, b=1b=1:

h=min⁡(a,b/M)=min⁡(1,1/4)=1/4.h = \min(a, b/M) = \min(1, 1/4) = 1/4.

Step 2 — Lipschitz constant. ∂f/∂y=2t\partial f/\partial y = 2t, so ∣2t∣≤2|2t| \le 2 on RR, giving L=2L = 2.

Step 3 — Picard iterates. Starting from y0≡1y_0 \equiv 1:

y1=1+∫0t2s ds=1+t2,y_1 = 1 + \int_0^t 2s\,ds = 1 + t^2,
y2=1+∫0t2s(1+s2) ds=1+t2+t42.y_2 = 1 + \int_0^t 2s(1+s^2)\,ds = 1 + t^2 + \tfrac{t^4}{2}.

Step 4 — Recognize the limit. The pattern is the partial sums of et2e^{t^2}.

 y(t)=et2,unique on [−14,14] (guaranteed; in fact valid for all t) \boxed{\,y(t) = e^{t^2}, \quad \text{unique on } [-\tfrac14, \tfrac14]\ \text{(guaranteed; in fact valid for all } t)\,}
ExampleNonlinear ODE — estimating hh

Given: y′=t2+y2y' = t^2 + y^2, y(0)=0y(0) = 0, on R={∣t∣≤1, ∣y∣≤1}R = \{|t| \le 1,\ |y| \le 1\}.

Step 1 — Compute MM. ∥f∥=∣t2+y2∣≤1+1=2\|f\| = |t^2 + y^2| \le 1 + 1 = 2, so M=2M = 2.

Step 2 — Guaranteed interval. With a=1a = 1, b=1b = 1:

h=min⁡(1,1/2)=1/2.h = \min(1, 1/2) = 1/2.

Step 3 — Lipschitz constant. ∂f/∂y=2y\partial f/\partial y = 2y, ∣2y∣≤2|2y| \le 2 on RR, so L=2L = 2. The condition Lh=1<∞Lh = 1 < \infty confirms convergence (and even TT itself is a contraction since Lh=1Lh = 1; if not, an iterate TkT^k is).

Step 4 — First iterates.

y1=∫0ts2 ds=t33,y2=∫0t(s2+s69)ds=t33+t763.y_1 = \int_0^t s^2\,ds = \tfrac{t^3}{3}, \qquad y_2 = \int_0^t \left(s^2 + \tfrac{s^6}{9}\right)ds = \tfrac{t^3}{3} + \tfrac{t^7}{63}.

Conclusion: No closed-form elementary solution exists, but Picard-Lindelöf certifies:

 a unique C1 solution exists on [−12,12] \boxed{\,\text{a unique } C^1 \text{ solution exists on } [-\tfrac12, \tfrac12]\,}

Common Misconceptions

⚠️ Common mistake

"Continuity of ff is enough for uniqueness." False. Continuity alone gives only existence (Peano's theorem). Uniqueness genuinely requires the Lipschitz condition (or some weaker substitute like Osgood's condition). Differentiability of ff in yy is a common shortcut that implies Lipschitz, but is not necessary — ff can be Lipschitz without being differentiable (e.g. ∣y∣|y|).

⚠️ Common mistake

"The solution exists for all tt." No — Picard-Lindelöf is local. The guaranteed interval has half-width h=min⁡(a,b/M)h = \min(a, b/M), which shrinks when MM (the max slope) is large. Global existence requires extra hypotheses, e.g. a global Lipschitz condition or linear growth ∥f(t,y)∥≤α(t)∥y∥+β(t)\|f(t,y)\| \le \alpha(t)\|y\| + \beta(t).

CounterexampleNon-Lipschitz ⇒\Rightarrow non-uniqueness

Consider y′=∣y∣y' = \sqrt{|y|}, y(0)=0y(0) = 0. Here f(t,y)=∣y∣f(t,y)=\sqrt{|y|} is continuous everywhere but not Lipschitz at y=0y=0: ∣y−0∣/∣y−0∣=1/y→∞|\sqrt{y}-0|/|y-0| = 1/\sqrt{y} \to \infty as y→0+y \to 0^+. Consequently uniqueness fails. The trivial solution y≡0y \equiv 0 works, and so does

y(t)=14t2 (t≥0), y(t)=0 (t<0),y(t) = \tfrac14 t^2 \ (t \ge 0),\ y(t)=0\ (t<0),

as does the whole family that "rests" at zero until any time c≥0c \ge 0 then takes off as 14(t−c)2\tfrac14(t-c)^2. Infinitely many solutions share the same initial data — exactly the pathology the Lipschitz condition rules out.

Connections

connection

Picard-Lindelöf sits at the crossroads of analysis and differential equations. It is the rigorous engine behind Ordinary Differential Equations theory, providing the well-posedness that makes the subject deterministic. Its proof is the flagship application of the Banach Fixed-Point Theorem (contraction mapping principle), and the convergence of iterates relies on completeness from Metric Spaces and uniform convergence in Uniform Convergence. The key uniqueness estimate is a direct cousin of Grönwall's Inequality, which bounds how fast two solutions can separate. Where the Lipschitz hypothesis is dropped, one falls back to Peano Existence Theorem for existence only. For maximal intervals and blow-up, the theorem feeds into the Continuation of Solutions machinery.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- 1768–1824 — Cauchy's foundations. Augustin-Louis Cauchy gives the first rigorous existence proof for ODEs using a polygonal (Euler-method-like) approximation, establishing what is now the "Cauchy problem."
- 1837 — Liouville's iteration. Joseph Liouville uses successive approximations for specific differential equations, foreshadowing the iterative method.
- 1876 — Lipschitz's condition. Rudolf Lipschitz introduces the continuity condition (named after him) that secures uniqueness, refining Cauchy's existence theory.
- 1890 — Picard's memoir. Émile Picard formalizes the method of successive approximations, proving existence and uniqueness in a clean, general framework.
- 1894 — Lindelöf's refinement. Ernst Lindelöf generalizes and tightens Picard's result, giving the theorem its modern joint name.
- 1886/1890 — Peano's existence theorem. Giuseppe Peano proves existence under continuity alone (no Lipschitz), clarifying exactly what uniqueness costs.
- 1898 — Osgood's condition. William Osgood weakens the Lipschitz hypothesis to a sharper integral criterion still guaranteeing uniqueness.
- 1922 — Banach's fixed-point theorem. Stefan Banach abstracts the contraction-mapping idea, revealing Picard's iteration as a special case and giving the cleanest modern proof.
- 20th century — Carathéodory's extension. Constantin Carathéodory extends existence/uniqueness to ff merely measurable in tt (Carathéodory conditions), enabling discontinuous forcing terms.

Subtleties & Limits

open-problem

The Lipschitz hypothesis is sufficient but not necessary for uniqueness, and the precise boundary between uniqueness and non-uniqueness is subtle. Osgood's condition — uniqueness holds if ∥f(t,y1)−f(t,y2)∥≤ω(∥y1−y2∥)\|f(t,y_1)-f(t,y_2)\| \le \omega(\|y_1-y_2\|) where ∫0ϵdr/ω(r)=∞\int_0^\epsilon d r/\omega(r) = \infty — generalizes Lipschitz, yet a fully sharp characterization is delicate. In partial differential equations the analogue (the Cauchy-Kovalevskaya theorem) requires analyticity and behaves very differently; well-posedness questions there remain deep and active (cf. the Navier-Stokes Millennium Problem). For ODEs with merely continuous ff, the set of solutions through a point forms a connected "funnel" (Kneser's theorem), and characterizing such funnels, plus selecting "physical" solutions in non-unique regimes (e.g. via vanishing-viscosity or Filippov regularization for discontinuous right sides), continues to motivate research in nonsmooth dynamics and control.

See Also

Banach Fixed-Point Theorem · Peano Existence Theorem · Grönwall's Inequality · Ordinary Differential Equations · Cauchy-Kovalevskaya Theorem · Continuation of Solutions · Lipschitz Continuity