ODE existence & uniqueness — Picard-Lindelöf

⚡ Key Takeaways

Picard-Lindelöf Theorem: If $f(t,y)$ is continuous in $t$ and Lipschitz continuous in $y$ near a point $(t_0, y_0)$ , then the initial value problem $y' = f(t,y)$ , $y(t_0)=y_0$ has a unique solution on some interval around $t_0$ . Also called the Cauchy-Lipschitz theorem. It is the foundational guarantee that "nice" differential equations have exactly one solution. Proved via the Banach Fixed-Point Theorem (Picard iteration); due to Émile Picard (1890) and Ernst Lindelöf (1894).

💡 The Core Insight

Solving the ODE is equivalent to solving an integral equation, and that integral equation can be written as a fixed-point problem $y = T(y)$ for an operator $T$ . When $f$ is Lipschitz, $T$ becomes a contraction on a suitable complete metric space of functions. The Banach fixed-point theorem then delivers a unique fixed point — the unique solution — and even tells us how to construct it: iterate $T$ starting from any guess.

DefinitionLipschitz Condition

A function $f(t,y)$ satisfies a Lipschitz condition in $y$ on a region $R$ if there exists a constant $L \ge 0$ (the Lipschitz constant) such that

1

\quad |f(t,y_1) - f(t,y_2)| \le L\,|y_1 - y_2| \qquad \text{for all } (t,y_1),(t,y_2)\in R.

Derivation hint: This is a uniform bound on how fast $f$ can change in the $y$ -direction; it is weaker than differentiability but stronger than mere continuity. A sufficient (and commonly used) condition: if $\partial f/\partial y$ exists and is bounded on a convex region $R$ , then by the mean value theorem $f$ is Lipschitz with $L = \sup_R |\partial f/\partial y|$ .

DefinitionThe Initial Value Problem

We study the initial value problem (IVP)

2

\quad y'(t) = f(t,y(t)), \qquad y(t_0) = y_0,

Derivation hint: $y:\,I\to\mathbb{R}$ (or $\mathbb{R}^n$ ) is the unknown; $f$ is the given vector field; $(t_0,y_0)$ is the prescribed initial condition. The symbols: $t$ is the independent variable (often time); $y$ is the dependent variable (state); $f$ encodes the law of evolution; $t_0$ is the initial time; $y_0$ is the initial state. A solution is a differentiable function satisfying both the equation and the initial condition.

TheoremPicard-Lindelöf

Let $R = \{(t,y): |t-t_0|\le a,\ |y-y_0|\le b\}$ be a closed rectangle. Suppose: 1. $f$ is continuous on $R$ (so $|f|\le M$ for some $M$ ), and 2. $f$ satisfies a Lipschitz condition in $y$ on $R$ with constant $L$ . Then the IVP [2] has a unique solution $y(t)$ on the interval $|t-t_0|\le h$ , where

3

\quad h = \min\!\left(a,\ \frac{b}{M}\right).

Derivation hint: $b/M$ is the time before the solution could escape the rectangle vertically — speed $\le M$ , vertical room $b$ — so we shrink the interval to keep the iterates inside $R$ .

ProofExistence and Uniqueness via Picard Iteration

Step 1 — Reformulate as an integral equation. A continuous function $y$ solves [2] if and only if it satisfies

4

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

Derivation hint: Integrate $y'=f(t,y)$ from $t_0$ to $t$ and apply the Fundamental Theorem of Calculus; the initial condition supplies the constant $y_0$ .

Step 2 — Define the Picard operator. On the space $X = C([t_0-h, t_0+h])$ of continuous functions (with the sup norm), define

5

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

Derivation hint: A solution of [4] is exactly a fixed point $Ty=y$ ; we now show $T$ maps a complete space to itself and is a contraction.

Step 3 — $T$ maps the closed ball into itself. Restrict to functions with $|y(t)-y_0|\le b$ . Then

6

\quad |(Ty)(t) - y_0| = \left|\int_{t_0}^{t} f(s,y(s))\,ds\right| \le M\,|t-t_0| \le M h \le b,

Derivation hint: Use $|f|\le M$ and $h\le b/M$ from [3]; this guarantees iterates never leave the rectangle $R$ .

Step 4 — $T$ is a contraction (Lipschitz key step). For two functions $y_1,y_2$ :

7

\quad |(Ty_1)(t)-(Ty_2)(t)| \le \int_{t_0}^{t} L\,|y_1(s)-y_2(s)|\,ds \le L h\,\|y_1-y_2\|_\infty.

Step 5 — Apply Banach. Since $X$ (the closed ball in $C$ ) is a complete metric space and $T$ is a contraction, the Banach Fixed-Point Theorem yields a unique fixed point $y^*$ , which is the unique solution of [4], hence of [2]. $\blacksquare$

Removing $Lh<1$ : One need not require $Lh<1$ . A sharper estimate by induction shows the $n$ -th iterate satisfies $\|T^n y_1 - T^n y_2\|_\infty \le \frac{(Lh)^n}{n!}\|y_1-y_2\|_\infty$ , and since $(Lh)^n/n!\to 0$ , some power $T^n$ is a contraction. This recovers uniqueness on the full interval $|t-t_0|\le h$ from [3], independent of $L$ .

∎

🧠 Intuition

Think of Picard iteration as successive approximation. Start with the crude guess $y_0(t)\equiv y_0$ (the solution stands still). Feed it into the integral [5] to get a better guess $y_1$ , which incorporates the slope $f$ at the starting point. Feed $y_1$ back in to get $y_2$ , accounting for how the slope changes as $y$ moves, and so on. Each pass corrects the previous approximation. The Lipschitz condition controls how much error can be amplified per pass — the factor $Lh$ — and because integration shrinks errors faster than $L$ grows them (the $1/n!$ ), the corrections shrink to zero and the sequence locks onto the one true solution. The contraction is the mathematical statement that "errors die out."

Figure

Picard iterates converging to the solution of

y'=y

,

y(0)=1

```svg

```

ÉP

Émile Picard

1856–1941

Charles Émile Picard was a towering figure of French mathematics, working across complex analysis, algebraic geometry, and differential equations. His method of successive approximations (1890) made the existence-uniqueness problem constructive: rather than merely asserting a solution exists, Picard built it as the limit of an explicitly computable sequence. He is also famous for Picard's theorem in complex analysis (an entire non-constant function omits at most one value). His iteration scheme directly anticipated the abstract fixed-point methods that Banach later formalized, making Picard a bridge between classical analysis and modern functional analysis. Ernst Leonard Lindelöf (1870–1946), the Finnish mathematician, refined the conditions and sharpened the interval of existence in 1894 — hence the joint name.

ExampleLinear ODE — verifying the hypotheses and iterating

Given: $y' = 2y$ , $y(0)=1$ . Here $f(t,y)=2y$ , $t_0=0$ , $y_0=1$ .

Step 1 — Check Lipschitz. $\partial f/\partial y = 2$ , bounded everywhere, so $f$ is Lipschitz with $L=2$ . Continuity in $t$ is trivial. Hypotheses hold globally.

Step 2 — Picard iterates. Start $y_0(t)=1$ .

8

\quad y_1(t) = 1 + \int_0^t 2\cdot 1\,ds = 1 + 2t.

Derivation hint: Substitute $y_0\equiv 1$ into the operator [5] with $f=2y$ .

9

\quad y_2(t) = 1 + \int_0^t 2(1+2s)\,ds = 1 + 2t + 2t^2.

Derivation hint: Substitute $y_1=1+2s$ and integrate term by term. Continuing, $y_n(t) = \sum_{k=0}^{n} \frac{(2t)^k}{k!}$ , the partial sums of $e^{2t}$ .

Step 3 — Limit.

\boxed{y(t) = e^{2t}}

The Picard iterates literally generate the Taylor series of the exact solution. Existence interval: all of $\mathbb{R}$ .

ExampleNonlinear ODE — finite existence interval

Given: $y' = y^2$ , $y(0)=1$ . Here $f(t,y)=y^2$ .

Step 1 — Local Lipschitz, not global. $\partial f/\partial y = 2y$ , bounded on any rectangle $|y-1|\le b$ by $L=2(1+b)$ . So Picard-Lindelöf applies locally.

Step 2 — Estimate the interval. Take $a=\infty$ , $b=1$ so $|y|\le 2$ , giving $M=\sup y^2 = 4$ . Then

10

\quad h = \min\!\left(a,\frac{b}{M}\right) = \min\!\left(\infty,\frac{1}{4}\right) = \frac14.

Derivation hint: Apply [3] with $b=1$ , $M=4$ ; the theorem guarantees existence at least on $|t|\le \tfrac14$ .

Step 3 — Exact solution. Separating variables, $-1/y = t - 1$ , so

\boxed{y(t) = \frac{1}{1-t}, \quad \text{valid for } t<1.}

The solution blows up at $t=1$ (finite-time blow-up). The theorem's guaranteed interval ( $h=\tfrac14$ ) is conservative but correctly local — no choice of rectangle extends the guarantee past $t=1$ .

⚠️ Common mistake

Continuity alone does NOT give uniqueness. A common error is to assume that if $f$ is continuous, the IVP has a unique solution. Continuity (Peano's theorem) guarantees existence but not uniqueness. The full Lipschitz condition is what forces uniqueness. Conversely, the Lipschitz condition is sufficient, not necessary — some uniqueness can hold without it (e.g., via Osgood's criterion), so failure of Lipschitz does not automatically mean non-uniqueness.

Also: the theorem is local. It guarantees a solution only on a (possibly tiny) interval around $t_0$ . Global existence requires additional structure (e.g., a global Lipschitz/linear-growth bound).

Counterexample

y'=\sqrt{|y|}

— non-uniqueness from a failed Lipschitz condition

Consider $y' = \sqrt{|y|}$ , $y(0)=0$ . Here $f(t,y)=\sqrt{|y|}$ is continuous but not Lipschitz at $y=0$ , since $\partial f/\partial y = \tfrac{1}{2\sqrt{y}} \to \infty$ as $y\to 0^+$ . One solution is the trivial $y(t)\equiv 0$ . But another is

11

\quad y(t) = \begin{cases} \tfrac14 t^2 & t\ge 0 \\ 0 & t<0,\end{cases}

Derivation hint: For $y\ge 0$ , separate variables: $\int y^{-1/2}\,dy = \int dt \Rightarrow 2\sqrt{y}=t \Rightarrow y=t^2/4$ . In fact, for any $c\ge 0$ the function that stays at $0$ until $t=c$ then takes off as $\tfrac14(t-c)^2$ is also a solution — infinitely many solutions through the origin. Peano gives existence; the absent Lipschitz condition destroys uniqueness.

connection

Picard-Lindelöf sits at the crossroads of several areas. Its proof is the showcase application of the Banach Fixed-Point Theorem — the abstract contraction principle from Metric Spaces. The weaker Peano Existence Theorem drops the Lipschitz hypothesis and uses compactness (Arzelà-Ascoli) to get existence without uniqueness. For systems and higher-order ODEs, the same theorem applies verbatim with $y\in\mathbb{R}^n$ and a vector norm, underpinning the whole theory of Linear Systems of ODEs. The dependence of solutions on initial data — continuous and even smooth dependence — extends Picard-Lindelöf and is essential to Dynamical Systems and stability theory. The integral reformulation [4] is the gateway to Volterra Integral Equations.

🔬 Where this appears

⏳ History

- 1768–1820 — Euler, Lagrange, Cauchy develop methods for solving ODEs; Cauchy gives the first rigorous existence proof (the Cauchy-Euler polygon method) in his 1820s lectures.

- 1868 — Rudolf Lipschitz introduces the condition now bearing his name, sharpening Cauchy's existence-uniqueness arguments.

- 1876 — Hermann Amandus Schwarz / Cauchy-Kovalevskaya lineage strengthens analytic-data results for PDEs and ODEs.

- 1890 — Émile Picard publishes the method of successive approximations, making existence constructive and iterative.

- 1894 — Ernst Lindelöf refines Picard's conditions and the interval of existence; the joint name Picard-Lindelöf dates from here.

- 1890 — Giuseppe Peano proves existence under mere continuity (no uniqueness), delineating exactly what Lipschitz buys.

- 1898 — William Osgood gives a uniqueness criterion weaker than Lipschitz (the Osgood condition), mapping the boundary of uniqueness.

- 1922 — Stefan Banach proves the fixed-point theorem, retroactively recasting Picard's iteration as a contraction argument — the modern textbook proof.

- 1920s–30s — Carathéodory extends existence to

f

merely measurable in

t

(Carathéodory conditions), broadening applicability to discontinuous forcing.

open-problem

The Picard-Lindelöf framework is essentially closed as a theorem, but its boundary raises subtle, still-active questions. (1) Sharp uniqueness criteria: exactly which moduli of continuity (between Lipschitz and bare continuity) force uniqueness? Osgood's condition is sufficient but the complete characterization is delicate. (2) Maximal interval of existence: the theorem gives a local interval; determining the exact blow-up time for nonlinear systems is generally undecidable in closed form and connects to deep open problems (e.g., global regularity for the 3D Navier-Stokes equations is the PDE analogue of "does the solution exist for all time?"). (3) Infinite-dimensional generalizations: in Banach spaces, Lipschitz vector fields still give well-posedness, but for the weaker compactness-based existence (Peano) the analogue can fail — Godunov showed Peano's theorem is false in general infinite-dimensional Banach spaces. (4) Numerical realizability: how well Picard iteration (vs. Runge-Kutta) approximates stiff or chaotic systems remains a practical research area in numerical analysis.

ODE existence & uniqueness — Picard-Lindelöf

Formal Statement

Why It Holds / Derivation

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also