Get AI summaries of any video or article — Sign up free
Ordinary Differential Equations 17 | Picard–Lindelöf Theorem (General and Special Version) [dark] thumbnail

Ordinary Differential Equations 17 | Picard–Lindelöf Theorem (General and Special Version) [dark]

5 min read

Based on The Bright Side of Mathematics's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

For nonautonomous ODEs x'(t)=W(t,x), existence and uniqueness follow from a Lipschitz condition in x (the second argument of W), checked locally around (t0,x0).

Briefing

The Picard–Lindelöf theorem’s guarantee of existence and uniqueness for ordinary differential equations extends beyond time-independent (autonomous) systems to time-dependent (nonautonomous) ones—without changing the core proof strategy. For a nonautonomous initial value problem driven by a vector field W(t, x), the key requirement becomes a Lipschitz condition in the state variable x, applied locally in time–space neighborhoods around the initial point (t0, x0). With that adjustment, the same fixed-point machinery yields a unique solution on some time interval, and solutions can be extended to maximal ones.

In the nonautonomous setting, the system is defined on a domain in R^{N+1} (time plus state space), with W mapping into R^N. The discussion emphasizes that the Lipschitz property need not hold globally; it suffices to hold on any compact region inside the domain. Concretely, for points (t, x) and (t, y) that share the same time coordinate, the inequality ||W(t, x) − W(t, y)|| ≤ L_K ||x − y|| must hold throughout a chosen neighborhood (often represented as a generalized rectangle around (t0, x0)). The constant L_K may depend on the neighborhood, but not on the particular x and y within it. Under this locally Lipschitz-in-x condition, the initial value problem has a unique solution defined on an interval around t0.

The proof approach mirrors the earlier autonomous case: it uses the Banach fixed point theorem on a carefully constructed space of candidate functions. The fixed-point map f takes a function α and returns the integral formulation of the differential equation, replacing the autonomous vector field V(x) with the nonautonomous field W(t, x). Specifically, the map builds α(t) from x0 plus the integral from t0 to t of W(s, α(s)) ds. The only substantive change is swapping V for W and invoking the Lipschitz condition tailored to the second argument of W.

A second, more application-friendly “special version” strengthens the Lipschitz requirement to obtain global solutions. Here, W is continuous on the full domain R × R^N, and a global Lipschitz bound holds for all x, y in R^N, uniformly over time slices restricted to any finite interval [−T, T]. The constant may depend on T, but the bound must work for every x and y across the entire state space. This stronger control prevents blow-up over time and yields a unique solution defined for all t ∈ R.

To make the fixed-point argument work on larger time intervals, the proof modifies the metric on the function space. Instead of the plain supremum norm, it introduces an exponentially weighted distance using the Lipschitz constant L_T, scaling points farther from the origin in time so the fixed-point map becomes a contraction. With this weighted metric, the contraction estimate goes through, Banach’s theorem produces a unique fixed point, and because the construction works for arbitrarily large T, the solution extends to the whole real line. The result is a practical criterion for global existence and uniqueness, setting up the next step toward linear differential equations.

Cornell Notes

The Picard–Lindelöf theorem extends from autonomous ODEs to nonautonomous systems by requiring Lipschitz continuity in the state variable x for the vector field W(t, x). Locally, on any neighborhood around (t0, x0), a bound of the form ||W(t, x) − W(t, y)|| ≤ L_K ||x − y|| (for the same t) guarantees a unique solution on some interval around t0; maximal solutions follow by extension. The proof still uses Banach’s fixed point theorem with an integral operator f(α)(t) = x0 + ∫_{t0}^t W(s, α(s)) ds. A special global version assumes W is defined on all R × R^N and satisfies a global Lipschitz condition in x, uniformly over each finite time window [−T, T]. An exponentially weighted metric turns the fixed-point map into a contraction for large T, yielding a unique solution for all real time.

What changes when moving from an autonomous system V(x) to a nonautonomous system W(t, x)?

The state equation becomes x'(t) = W(t, x(t)), so the vector field depends on time as well as the state. The Lipschitz requirement also shifts: instead of needing Lipschitz continuity in x for V(x), the condition becomes Lipschitz in the second argument of W. The inequality is checked for points with the same time coordinate t, comparing W(t, x) and W(t, y).

Why is the Lipschitz condition formulated using vertical lines (same t) in the time–space neighborhood?

Because the theorem needs control over how solutions change with respect to the state variable x, not with respect to time. The condition compares W(t, x) and W(t, y) while keeping t fixed, yielding ||W(t, x) − W(t, y)|| ≤ L_K ||x − y||. This makes the verification easier: one only checks Lipschitz behavior along each time slice inside the chosen rectangle.

How does the fixed-point map f look in the nonautonomous Picard–Lindelöf setting?

The map takes a candidate function α and returns an integral expression: f(α)(t) = x0 + ∫_{t0}^t W(s, α(s)) ds. Fixed points of f correspond to functions α that satisfy the integral (and hence differential) form of the initial value problem.

What extra assumption enables the special global version to guarantee solutions for all t ∈ R?

W must be continuous on the full domain R × R^N, and it must satisfy a global Lipschitz condition in x across all of R^N. For each finite time window [−T, T], there exists a constant L_T such that ||W(t, x) − W(t, y)|| ≤ L_T ||x − y|| holds for every t in [−T, T] and every x, y in R^N.

Why does the proof need a modified metric with an exponential weight in the global version?

The standard supremum-norm metric makes the fixed-point map contractive only for small time intervals. To extend to larger intervals, the metric is weighted by an exponential factor involving L_T and |t|, scaling contributions from times far from 0. This rebalances the contraction estimate so it remains valid even as T grows, while preserving completeness of the metric space.

Review Questions

  1. In the nonautonomous theorem, what exact form of Lipschitz inequality must hold, and in which argument of W is it required?
  2. How does the integral operator f(α)(t) encode the initial value problem, and why do its fixed points correspond to solutions?
  3. In the global version, what role does the exponentially weighted metric play in turning the fixed-point map into a contraction?

Key Points

  1. 1

    For nonautonomous ODEs x'(t)=W(t,x), existence and uniqueness follow from a Lipschitz condition in x (the second argument of W), checked locally around (t0,x0).

  2. 2

    The Lipschitz inequality is verified for pairs (t,x) and (t,y) with the same time t: ||W(t,x)−W(t,y)|| ≤ L_K||x−y||.

  3. 3

    The local Picard–Lindelöf proof uses Banach’s fixed point theorem with the integral map f(α)(t)=x0+∫_{t0}^t W(s,α(s))ds.

  4. 4

    Solutions obtained locally can be extended to maximal solutions, mirroring the autonomous case once uniqueness is secured.

  5. 5

    A global existence/uniqueness result requires W to be defined on all R×R^N and to be globally Lipschitz in x, uniformly over each finite time window [−T,T].

  6. 6

    To make the fixed-point argument work on large time intervals, the metric is modified with an exponential weight depending on L_T and |t| so the integral operator remains a contraction.

  7. 7

    Because the contraction construction works for arbitrarily large T, the unique solution extends to all real time t ∈ R.

Highlights

Local uniqueness for nonautonomous systems comes from Lipschitz control in x along each fixed-time slice: compare W(t,x) and W(t,y) with the same t.
The fixed-point map in the nonautonomous case is the integral formulation f(α)(t)=x0+∫_{t0}^t W(s,α(s))ds.
The global version’s key upgrade is a global-in-x Lipschitz bound on R^N, uniform over time windows [−T,T].
An exponentially weighted metric is the technical trick that keeps the fixed-point map contractive as the time window grows.

Topics

Mentioned

  • ODE
  • ODEs