Book 6C

© 2026 NeckPinch · www.neckpinch.com · All rights reserved.

Course 6Book 6C: Nonlinear PDE: Variational and Geometric MethodsChapter 9

Hamilton–Jacobi Equations and Viscosity Solutions

Hopf–Lax, viscosity solutions, comparison by doubling variables, and optimal control.

59 min read · Updated Oct 23, 2026

Read with Evans, Partial Differential Equations, section 3.3 (the Hamilton–Jacobi equation: calculus of variations, Hamilton's equations, the Legendre transform and the Hopf–Lax formula) and chapter 10 (viscosity solutions: definitions, consistency, uniqueness by doubling variables, and the connection with optimal control). Crandall, Ishii and Lions, "User's guide to viscosity solutions of second order partial differential equations" (Bull. Amer. Math. Soc. 27, 1992), and Bardi and Capuzzo-Dolcetta, Optimal Control and Viscosity Solutions of Hamilton–Jacobi–Bellman Equations, are the standard references. This chapter proves the Hopf–Lax formula and its properties, consistency and stability of viscosity solutions, the comparison principle (for Hamiltonians independent of xx) and that the Hopf–Lax formula gives the viscosity solution, and derives the HJB equation from dynamic programming.

In this chapter · 9 sections
  1. 9.1Shortest arrival times
  2. 9.2The Hopf–Lax formula
  3. 9.3Almost-everywhere solutions are not unique
  4. 9.4Viscosity solutions
  5. 9.5Uniqueness: doubling the variables
  6. 9.6Optimal control and the HJB equation
  7. 9.7Second-order equations
  8. 9.8History
  9. 9.9Exercises
  10. ↗Free resources

6C.8 Monotonicity, ε-Regularity and Tangent Cones studied singularities of smooth variational problems by rescaling and monotonicity. This chapter turns to singularities of a different kind, the corners that first-order equations develop, where comparison rather than monotonicity is the tool. The Hamilton–Jacobi equation

ut+H(∇u,x)=0u_t + H(\nabla u, x) = 0

is the first-order PDE of mechanics, optics and optimal control. In 6B.1 First-Order Equations and Characteristics it was solved by characteristics, which are the trajectories of Hamilton's ODE, and the solution broke down where characteristics cross. That breakdown is not a technical nuisance: it is generic, it happens in finite time from smooth data, and it corresponds to something real (a wavefront developing a corner, a shortest path ceasing to be unique). After that time there is no smooth solution, and the PDE must be understood in a weak sense.

The obvious weak sense, "Lipschitz and satisfying the equation almost everywhere", fails badly: it allows infinitely many solutions. The right notion was found by Michael Crandall and Pierre-Louis Lions in 1983: viscosity solutions, defined by testing the solution against smooth functions that touch it from above or below, which turns the maximum principle into a definition. Viscosity solutions exist, are unique, are stable under limits, and are what one gets from the vanishing viscosity limit εΔu→0\varepsilon\Delta u \to 0 (hence the name). Above all, the value function of an optimal control problem is the viscosity solution of the associated Hamilton–Jacobi–Bellman equation, which is why the theory runs economics, robotics and mathematical finance.

By the end of this chapter you will be able to:

  • derive the Hopf–Lax formula from the calculus of variations, and prove the semigroup property, the Lipschitz bounds and that it solves the equation almost everywhere;
  • show that Lipschitz almost-everywhere solutions are not unique;
  • define viscosity solutions, prove they are consistent with classical solutions and stable under uniform limits;
  • prove the comparison principle by doubling the variables, and that the Hopf–Lax formula gives the unique viscosity solution;
  • derive the Hamilton–Jacobi–Bellman equation from the dynamic programming principle, and state the second-order theory.

Shortest arrival times

In the world In use Fronts, travel times and dynamic programming

A front, a forest fire, a seismic wave, the boundary of a tumour seen in a medical image, moves outward at speed c(x)>0c(x) > 0 depending on position. The arrival time T(x)T(x), the first time the front reaches xx, satisfies the eikonal equation

∣∇T(x)∣ c(x)=1,|\nabla T(x)|\,c(x) = 1,

with T=0T = 0 on the initial front. The equation fails to have a smooth solution wherever two parts of the front meet (behind an obstacle, at the far side of a lens), and the arrival time has a kink there: it is the minimum of the times along competing paths. The correct solution is the viscosity solution, and it can be computed fast: John Tsitsiklis (1995) and James Sethian (1996) found Dijkstra-like algorithms, of which Sethian's fast marching method is the best known, that compute it in O(Nlog⁡N)O(N\log N) operations on a grid of NN points. They are used in seismic imaging, image segmentation and robot path planning.

The same structure, "the value now is the best over the first step of the value afterwards", is Richard Bellman's principle of optimality, formulated at the RAND Corporation in the 1950s, and in continuous time it gives the Hamilton–Jacobi–Bellman equation of this chapter. In finance, the optimal investment problems of 6D.8 Stochastic Control and the HJB Equation are solved by the same equation, and the theory of this chapter is what makes their value functions well defined when they are not smooth.

The Hopf–Lax formula

Consider the initial value problem

ut+H(∇u)=0  in Rn×(0,∞),u=g  on Rn×{t=0},(HJ)u_t + H(\nabla u) = 0 \ \text{ in } \mathbb{R}^n\times(0, \infty), \qquad u = g \ \text{ on } \mathbb{R}^n\times\{t = 0\}, \tag{HJ}

with H:Rn→RH : \mathbb{R}^n \to \mathbb{R} convex and superlinear (H(p)/∣p∣→∞H(p)/|p| \to \infty as ∣p∣→∞|p| \to \infty), and gg Lipschitz. Let L=H∗L = H^* be the Legendre transform, L(q)=sup⁡p(p⋅q−H(p))L(q) = \sup_p\big(p\cdot q - H(p)\big), which is again convex and superlinear, with H=L∗H = L^* (6A.11 Calculus of Variations and Gradient Flows). In mechanics LL is the Lagrangian, and Hamilton's principle suggests that u(x,t)u(x, t) should be the least action needed to reach xx at time tt from a starting point yy, plus the initial cost g(y)g(y):

u(x,t)=inf⁡{∫0tL(w˙(s)) ds+g(w(0)):w∈C1([0,t];Rn), w(t)=x}.u(x, t) = \inf\Big\{\int_0^tL(\dot w(s))\,ds + g(w(0)) : w \in C^1([0, t]; \mathbb{R}^n),\ w(t) = x\Big\}.
Theorem 9.1 The Hopf–Lax formula

The infimum above equals

u(x,t)=min⁡y∈Rn{tL(x−yt)+g(y)},u(x, t) = \min_{y\in\mathbb{R}^n}\Big\{tL\Big(\frac{x - y}{t}\Big) + g(y)\Big\},

and the minimum is attained.

Proof. Straight lines are optimal. For a C1C^1 path ww from yy to xx, Jensen's inequality for the convex function LL and the probability measure ds/tds/t on [0,t][0, t] gives

1t∫0tL(w˙(s)) ds≥L(1t∫0tw˙(s) ds)=L(x−yt),\frac1t\int_0^tL(\dot w(s))\,ds \geq L\Big(\frac1t\int_0^t\dot w(s)\,ds\Big) = L\Big(\frac{x - y}{t}\Big),

with equality for the straight line w(s)=y+st(x−y)w(s) = y + \frac st(x - y). So the infimum over paths starting at yy is tL(x−yt)+g(y)tL(\frac{x - y}{t}) + g(y), and the infimum over all paths is the infimum over yy of this.

The minimum is attained. With Lip⁡(g)=Λ\operatorname{Lip}(g) = \Lambda, tL(x−yt)+g(y)≥tL(x−yt)+g(x)−Λ∣x−y∣tL(\frac{x - y}{t}) + g(y) \geq tL(\frac{x - y}{t}) + g(x) - \Lambda|x - y|. By superlinearity, L(q)≥(Λ+1)∣q∣−CL(q) \geq (\Lambda + 1)|q| - C, so the expression is at least g(x)+∣x−y∣−Ctg(x) + |x - y| - Ct, which tends to infinity as ∣y∣→∞|y| \to \infty. A continuous function tending to infinity attains its minimum.

Lemma 9.2 The semigroup property

For 0≤s<t0 \leq s < t, u(x,t)=min⁡y{(t−s)L(x−yt−s)+u(y,s)}u(x, t) = \min_y\big\{(t - s)L\big(\frac{x - y}{t - s}\big) + u(y, s)\big\}.

Proof. ≤\leq. Fix yy, and choose zz attaining the minimum in the formula for u(y,s)u(y, s): u(y,s)=sL(y−zs)+g(z)u(y, s) = sL(\frac{y - z}{s}) + g(z). Since

x−zt=(1−st)x−yt−s+st y−zs,\frac{x - z}{t} = \Big(1 - \frac st\Big)\frac{x - y}{t - s} + \frac st\,\frac{y - z}{s},

convexity gives tL(x−zt)≤(t−s)L(x−yt−s)+sL(y−zs)tL(\frac{x - z}{t}) \leq (t - s)L(\frac{x - y}{t - s}) + sL(\frac{y - z}{s}), so u(x,t)≤tL(x−zt)+g(z)≤(t−s)L(x−yt−s)+u(y,s)u(x, t) \leq tL(\frac{x - z}{t}) + g(z) \leq (t - s)L(\frac{x - y}{t - s}) + u(y, s).

≥\geq. Choose ww with u(x,t)=tL(x−wt)+g(w)u(x, t) = tL(\frac{x - w}{t}) + g(w) and set y=stx+(1−st)wy = \frac stx + (1 - \frac st)w, the point at time ss on the straight line from ww to xx. Then x−yt−s=y−ws=x−wt\frac{x - y}{t - s} = \frac{y - w}{s} = \frac{x - w}{t}, and

(t−s)L(x−yt−s)+u(y,s)≤(t−s)L(x−wt)+sL(x−wt)+g(w)=u(x,t).(t - s)L\Big(\frac{x - y}{t - s}\Big) + u(y, s) \leq (t - s)L\Big(\frac{x - w}{t}\Big) + sL\Big(\frac{x - w}{t}\Big) + g(w) = u(x, t).

The semigroup property says the solution operator of (HJ) is a semigroup, as for the heat equation (6B.13 Semigroups and Evolution Equations); but here it is a nonlinear one, in which the integral against a kernel is replaced by a minimum, and the Gaussian kernel by tL(x−yt)tL(\frac{x - y}{t}). This is the "min-plus" or tropical analogue of a convolution, and the analogy is exact: Exercise 9.17 shows that the Hopf–Lax formula is the ε→0\varepsilon \to 0 limit of the heat semigroup in logarithmic coordinates.

Proposition 9.3 Lipschitz bounds

The function uu is Lipschitz on Rn×[0,∞)\mathbb{R}^n\times[0, \infty), with ∣u(x,t)−u(x^,t)∣≤Lip⁡(g)∣x−x^∣|u(x, t) - u(\hat x, t)| \leq \operatorname{Lip}(g)|x - \hat x|, and ∣u(x,t)−u(x,t^)∣≤C∣t−t^∣|u(x, t) - u(x, \hat t)| \leq C|t - \hat t| for a constant CC depending on HH and Lip⁡(g)\operatorname{Lip}(g).

Proof. In xx. Choose yy attaining the minimum for u(x^,t)u(\hat x, t). Using z=x−x^+yz = x - \hat x + y as a competitor for u(x,t)u(x, t) (so that x−z=x^−yx - z = \hat x - y),

u(x,t)−u(x^,t)≤(tL(x−zt)+g(z))−(tL(x^−yt)+g(y))=g(z)−g(y)≤Lip⁡(g)∣x−x^∣.u(x, t) - u(\hat x, t) \leq \Big(tL\Big(\frac{x - z}{t}\Big) + g(z)\Big) - \Big(tL\Big(\frac{\hat x - y}{t}\Big) + g(y)\Big) = g(z) - g(y) \leq \operatorname{Lip}(g)|x - \hat x|.

Exchange xx and x^\hat x. In tt. By Exercise 9.14, ∣u(x,t)−g(x)∣≤Ct|u(x, t) - g(x)| \leq Ct for all xx and tt; applying this to the semigroup started at time t^\hat t (whose initial data u(⋅,t^)u(\cdot, \hat t) has the same Lipschitz constant) gives ∣u(x,t)−u(x,t^)∣≤C∣t−t^∣|u(x, t) - u(x, \hat t)| \leq C|t - \hat t|.

Theorem 9.4 The Hopf–Lax formula solves (HJ) almost everywhere

By Rademacher's theorem (a Lipschitz function is differentiable almost everywhere; Evans and Gariepy, section 3.1), uu is differentiable at almost every (x,t)(x, t), t>0t > 0. At every such point, ut(x,t)+H(∇u(x,t))=0u_t(x, t) + H(\nabla u(x, t)) = 0. And u(x,0)=g(x)u(x, 0) = g(x).

Proof. Let uu be differentiable at (x,t)(x, t).

≤0\leq 0. For q∈Rnq \in \mathbb{R}^n and h>0h > 0, Lemma 9.2 at time t+ht + h with s=ts = t and the competitor y=xy = x gives u(x+hq,t+h)≤hL(q)+u(x,t)u(x + hq, t + h) \leq hL(q) + u(x, t). Subtract u(x,t)u(x, t), divide by hh and let h→0h \to 0: q⋅∇u+ut≤L(q)q\cdot\nabla u + u_t \leq L(q). Hence ut+sup⁡q(q⋅∇u−L(q))=ut+H(∇u)≤0u_t + \sup_q\big(q\cdot\nabla u - L(q)\big) = u_t + H(\nabla u) \leq 0.

≥0\geq 0. Choose zz with u(x,t)=tL(x−zt)+g(z)u(x, t) = tL(\frac{x - z}{t}) + g(z), put q=x−ztq = \frac{x - z}{t}, and for 0<h<t0 < h < t let s=t−hs = t - h and y=x−hqy = x - hq (the point at time ss on the line from zz to xx). Then y−zs=q\frac{y - z}{s} = q, so u(y,s)≤sL(q)+g(z)u(y, s) \leq sL(q) + g(z), and

u(x,t)−u(x−hq,t−h)≥tL(q)−sL(q)=hL(q).u(x, t) - u(x - hq, t - h) \geq tL(q) - sL(q) = hL(q).

Divide by hh and let h→0h \to 0: ut+q⋅∇u≥L(q)u_t + q\cdot\nabla u \geq L(q), so ut+H(∇u)≥ut+q⋅∇u−L(q)≥0u_t + H(\nabla u) \geq u_t + q\cdot\nabla u - L(q) \geq 0.

Initial data. Taking y=xy = x gives u(x,t)≤tL(0)+g(x)u(x, t) \leq tL(0) + g(x), and Exercise 9.14 gives the lower bound, so u(x,t)→g(x)u(x, t) \to g(x) as t→0t \to 0.

Example 9.5 The quadratic Hamiltonian

For H(p)=12∣p∣2H(p) = \frac12|p|^2, L(q)=12∣q∣2L(q) = \frac12|q|^2 and

u(x,t)=min⁡y{∣x−y∣22t+g(y)},u(x, t) = \min_y\Big\{\frac{|x - y|^2}{2t} + g(y)\Big\},

the Moreau envelope (or inf-convolution) of gg with a quadratic, central in convex optimisation. In one dimension with g(y)=−∣y∣g(y) = -|y|, as xx increases through 00 the minimiser jumps from y=x−ty = x - t to y=x+ty = x + t, and u(x,t)=−∣x∣−t2u(x, t) = -|x| - \frac t2: the initial corner persists. With g(y)=∣y∣g(y) = |y| instead, u(x,t)=x22tu(x, t) = \frac{x^2}{2t} for ∣x∣≤t|x| \leq t and ∣x∣−t2|x| - \frac t2 for ∣x∣>t|x| > t: the convex corner is immediately smoothed into a parabola (Exercise 9.13). The asymmetry is the signature of the equation: convex Hamiltonians smooth out convex corners ∨\vee and preserve concave corners ∧\wedge. In general, the Hopf–Lax solution is semiconcave in xx for t>0t > 0 (Evans, section 3.3.3): u(x+z,t)−2u(x,t)+u(x−z,t)≤Ct∣z∣2u(x + z, t) - 2u(x, t) + u(x - z, t) \leq \frac Ct|z|^2 when HH is uniformly convex. Concave corners (∧\wedge, like −∣x∣-|x|) are allowed; convex corners (∨\vee, like ∣x∣|x|) are not.

Almost-everywhere solutions are not unique

Example 9.6 Two Lipschitz solutions with the same data

For ut+∣ux∣2=0u_t + |u_x|^2 = 0 in one dimension with u(x,0)=0u(x, 0) = 0, both u1≡0u_1 \equiv 0 and

u2(x,t)={0∣x∣≥t,∣x∣−t∣x∣<tu_2(x, t) = \begin{cases}0 & |x| \geq t,\\ |x| - t & |x| < t\end{cases}

are Lipschitz, have the right initial values, and satisfy the equation wherever they are differentiable (Exercise 9.15). In fact there are infinitely many: any number of such "V-shaped dents" can be added. The Hopf–Lax formula gives u1=0u_1 = 0. The function u2u_2 has a convex corner ∨\vee along x=0x = 0, exactly the kind of corner that, by semiconcavity, the true solution cannot have.

This is the same phenomenon as the non-uniqueness of weak solutions of conservation laws in 6B.2 Conservation Laws and Shocks (indeed w=uxw = u_x is a weak solution of a conservation law), and the cure is analogous: an extra condition that singles out the physical solution. For conservation laws it was the entropy condition. For Hamilton–Jacobi equations it is the viscosity condition.

Viscosity solutions

Consider the general equation ut+H(∇u,x)=0u_t + H(\nabla u, x) = 0 in Rn×(0,T)\mathbb{R}^n\times(0, T), with HH continuous.

Definition 9.7 Viscosity solutions

A bounded, uniformly continuous function uu on Rn×[0,T]\mathbb{R}^n\times[0, T] is a viscosity subsolution if for every v∈C1(Rn×(0,T))v \in C^1(\mathbb{R}^n\times(0, T)),

if u−v has a local maximum at (x0,t0), then vt(x0,t0)+H(∇v(x0,t0),x0)≤0;\text{if } u - v \text{ has a local maximum at } (x_0, t_0), \text{ then } v_t(x_0, t_0) + H(\nabla v(x_0, t_0), x_0) \leq 0;

a viscosity supersolution if

if u−v has a local minimum at (x0,t0), then vt(x0,t0)+H(∇v(x0,t0),x0)≥0;\text{if } u - v \text{ has a local minimum at } (x_0, t_0), \text{ then } v_t(x_0, t_0) + H(\nabla v(x_0, t_0), x_0) \geq 0;

and a viscosity solution if it is both, and u(⋅,0)=gu(\cdot, 0) = g.

The motivation is the maximum principle. If uu were smooth and u−vu - v had a local maximum at (x0,t0)(x_0, t_0), then ∇u=∇v\nabla u = \nabla v and ut=vtu_t = v_t there, so the equation for uu would become an inequality-free statement about vv. The definition keeps the conclusion and drops the smoothness of uu: the derivatives of the solution are replaced by those of every smooth function touching it from above (for the subsolution test) or below (for the supersolution test). At a point where no smooth function touches from above, the subsolution condition is vacuous. At a convex corner ∨\vee no C1C^1 function touches from above, so only the supersolution test applies there; at a concave corner ∧\wedge only the subsolution test applies. These one-sided conditions at corners are exactly what selects the right solution (Exercise 9.15). (Using C∞C^\infty test functions instead of C1C^1 gives the same notion; Evans, section 10.1.)

The name comes from the way the notion was found: as the limit of the viscous approximations utε+H(∇uε,x)=εΔuεu^\varepsilon_t + H(\nabla u^\varepsilon, x) = \varepsilon\Delta u^\varepsilon, which have smooth solutions.

Theorem 9.8 Consistency and stability

(a) A C1C^1 solution of ut+H(∇u,x)=0u_t + H(\nabla u, x) = 0 is a viscosity solution. (b) If a viscosity solution uu is differentiable at (x0,t0)(x_0, t_0), then ut+H(∇u,x0)=0u_t + H(\nabla u, x_0) = 0 there. (c) If uεu^\varepsilon are smooth solutions of utε+H(∇uε,x)=εΔuεu^\varepsilon_t + H(\nabla u^\varepsilon, x) = \varepsilon\Delta u^\varepsilon and uε→uu^\varepsilon \to u locally uniformly as ε→0\varepsilon \to 0, then uu is a viscosity solution of ut+H(∇u,x)=0u_t + H(\nabla u, x) = 0.

Proof. (a) If u−vu - v has a local maximum or minimum at (x0,t0)(x_0, t_0) and both are C1C^1, then ∇u=∇v\nabla u = \nabla v and ut=vtu_t = v_t there, so vt+H(∇v,x0)=ut+H(∇u,x0)=0v_t + H(\nabla v, x_0) = u_t + H(\nabla u, x_0) = 0.

(b) We need a C1C^1 function vv with u−vu - v having a local maximum at (x0,t0)(x_0, t_0) and the same derivatives as uu there; then the subsolution test gives ≤0\leq 0, and the analogous construction from below gives ≥0\geq 0. Write z=(x,t)z = (x, t) and subtract an affine function, so that z0=0z_0 = 0, u(0)=0u(0) = 0 and uu has derivative 00 at 00. Then u(z)=∣z∣ρ1(z)u(z) = |z|\rho_1(z) with ρ1\rho_1 continuous, ρ1(0)=0\rho_1(0) = 0. Let ρ2(r)=max⁡∣z∣≤r∣ρ1(z)∣\rho_2(r) = \max_{|z|\leq r}|\rho_1(z)|, continuous, non-decreasing, ρ2(0)=0\rho_2(0) = 0, and

v(z)=∫∣z∣2∣z∣ρ2(r) dr+∣z∣2.v(z) = \int_{|z|}^{2|z|}\rho_2(r)\,dr + |z|^2.

Then ∣v(z)∣≤∣z∣ρ2(2∣z∣)+∣z∣2=o(∣z∣)|v(z)| \leq |z|\rho_2(2|z|) + |z|^2 = o(|z|), so v(0)=0v(0) = 0 and vv is differentiable at 00 with derivative 00; for z≠0z \neq 0, ∇v(z)=(2ρ2(2∣z∣)−ρ2(∣z∣))z∣z∣+2z\nabla v(z) = \big(2\rho_2(2|z|) - \rho_2(|z|)\big)\frac{z}{|z|} + 2z, which is continuous and tends to 00, so v∈C1v \in C^1. Finally, since ρ2\rho_2 is non-decreasing, ∫∣z∣2∣z∣ρ2≥∣z∣ρ2(∣z∣)\int_{|z|}^{2|z|}\rho_2 \geq |z|\rho_2(|z|), so for z≠0z \neq 0

u(z)−v(z)≤∣z∣ρ2(∣z∣)−∣z∣ρ2(∣z∣)−∣z∣2<0=u(0)−v(0):u(z) - v(z) \leq |z|\rho_2(|z|) - |z|\rho_2(|z|) - |z|^2 < 0 = u(0) - v(0):

u−vu - v has a strict maximum at 00.

(c) Let v∈C∞v \in C^\infty with u−vu - v having a local maximum at (x0,t0)(x_0, t_0); replacing vv by v+∣x−x0∣4+(t−t0)4v + |x - x_0|^4 + (t - t_0)^4, the maximum is strict. Then uε−vu^\varepsilon - v has a maximum over a small closed ball around (x0,t0)(x_0, t_0) at points (xε,tε)(x_\varepsilon, t_\varepsilon) which, by uniform convergence and strictness, tend to (x0,t0)(x_0, t_0) as ε→0\varepsilon \to 0 (along a sequence). At an interior maximum of the smooth function uε−vu^\varepsilon - v: ∇uε=∇v\nabla u^\varepsilon = \nabla v, utε=vtu^\varepsilon_t = v_t, and Δuε≤Δv\Delta u^\varepsilon \leq \Delta v. So

vt+H(∇v,xε)=utε+H(∇uε,xε)=εΔuε≤εΔvat (xε,tε).v_t + H(\nabla v, x_\varepsilon) = u^\varepsilon_t + H(\nabla u^\varepsilon, x_\varepsilon) = \varepsilon\Delta u^\varepsilon \leq \varepsilon\Delta v \quad\text{at } (x_\varepsilon, t_\varepsilon).

Let ε→0\varepsilon \to 0: vt+H(∇v,x0)≤0v_t + H(\nabla v, x_0) \leq 0. The supersolution test is the same with minima. (Test functions in C∞C^\infty suffice, by the remark after the definition.)

Part (c) is the decisive property. A notion of weak solution is useful only if it is closed under the limits one actually takes, and viscosity solutions are closed under locally uniform limits with no derivative bounds at all. The proof used only that the second-order term has the right sign at a maximum, which is why the same definition works for second-order degenerate elliptic equations below.

Proposition 9.9 The Hopf–Lax formula gives a viscosity solution

Under the assumptions of (HJ), the Hopf–Lax function uu is a viscosity solution.

Proof. Subsolution. Let u−vu - v have a local maximum at (x0,t0)(x_0, t_0). For q∈Rnq \in \mathbb{R}^n and small h>0h > 0, Lemma 9.2 (with the competitor y=x0−hqy = x_0 - hq at time t0−ht_0 - h) gives u(x0,t0)≤hL(q)+u(x0−hq,t0−h)u(x_0, t_0) \leq hL(q) + u(x_0 - hq, t_0 - h). Since u−vu - v is maximal at (x0,t0)(x_0, t_0), u(x0−hq,t0−h)−u(x0,t0)≤v(x0−hq,t0−h)−v(x0,t0)u(x_0 - hq, t_0 - h) - u(x_0, t_0) \leq v(x_0 - hq, t_0 - h) - v(x_0, t_0). Combining, v(x0,t0)−v(x0−hq,t0−h)≤hL(q)v(x_0, t_0) - v(x_0 - hq, t_0 - h) \leq hL(q). Divide by hh and let h→0h \to 0: vt+q⋅∇v≤L(q)v_t + q\cdot\nabla v \leq L(q) for every qq, so vt+H(∇v)≤0v_t + H(\nabla v) \leq 0.

Supersolution. Let u−vu - v have a local minimum at (x0,t0)(x_0, t_0). With zz, q=x0−zt0q = \frac{x_0 - z}{t_0} as in the proof of Theorem 9.4, u(x0,t0)−u(x0−hq,t0−h)≥hL(q)u(x_0, t_0) - u(x_0 - hq, t_0 - h) \geq hL(q). By minimality, v(x0,t0)−v(x0−hq,t0−h)≥u(x0,t0)−u(x0−hq,t0−h)≥hL(q)v(x_0, t_0) - v(x_0 - hq, t_0 - h) \geq u(x_0, t_0) - u(x_0 - hq, t_0 - h) \geq hL(q). So vt+q⋅∇v≥L(q)v_t + q\cdot\nabla v \geq L(q) and vt+H(∇v)≥vt+q⋅∇v−L(q)≥0v_t + H(\nabla v) \geq v_t + q\cdot\nabla v - L(q) \geq 0.

The proof is the proof of Theorem 9.4 with uu replaced by the test function where it is touched. That is typical: viscosity arguments move derivatives onto smooth test functions, much as distributions move derivatives onto test functions by integration by parts, but using order instead of integration.

Uniqueness: doubling the variables

Theorem 9.10 The comparison principle

Let H:Rn→RH : \mathbb{R}^n \to \mathbb{R} be continuous. Let uu be a viscosity subsolution and vv a viscosity supersolution of ut+H(∇u)=0u_t + H(\nabla u) = 0 on Rn×(0,T]\mathbb{R}^n\times(0, T], both bounded and uniformly continuous on Rn×[0,T]\mathbb{R}^n\times[0, T], with uu Lipschitz in xx. If u(⋅,0)≤v(⋅,0)u(\cdot, 0) \leq v(\cdot, 0), then u≤vu \leq v on Rn×[0,T]\mathbb{R}^n\times[0, T]. In particular the viscosity solution of (HJ) is unique among bounded Lipschitz functions, and it is given by the Hopf–Lax formula.

(For HH depending on xx, the same proof works under a condition like ∣H(p,x)−H(p,y)∣≤C∣x−y∣(1+∣p∣)|H(p, x) - H(p, y)| \leq C|x - y|(1 + |p|); Evans, section 10.2. For simplicity of the time endpoint, we assume the sub- and supersolution tests hold up to t=Tt = T; this can always be arranged by working on [0,T′][0, T'] for T′<TT' < T.)

Proof. Suppose σ=sup⁡(u−v)>0\sigma = \sup(u - v) > 0. The difficulty is that uu and vv are not differentiable, so we cannot compare their equations at a maximum point of u−vu - v. The trick, due to Kruzhkov in a related setting and to Crandall and Lions here, is to double the variables: maximise a function of two independent points, penalising their distance, so that uu and vv are each touched by a smooth function at its own point.

The auxiliary function. For small ε>0\varepsilon > 0 and λ=σ8T\lambda = \frac{\sigma}{8T}, let

Φ(x,y,t,s)=u(x,t)−v(y,s)−λ(t+s)−∣x−y∣2+(t−s)2ε2−ε(∣x∣2+∣y∣2)\Phi(x, y, t, s) = u(x, t) - v(y, s) - \lambda(t + s) - \frac{|x - y|^2 + (t - s)^2}{\varepsilon^2} - \varepsilon\big(|x|^2 + |y|^2\big)

on (Rn×[0,T])2(\mathbb{R}^n\times[0, T])^2. It is continuous and tends to −∞-\infty at infinity (as uu and vv are bounded), so it has a maximum at some (x0,y0,t0,s0)(x_0, y_0, t_0, s_0). Choose (xˉ,tˉ)(\bar x, \bar t) with u(xˉ,tˉ)−v(xˉ,tˉ)≥3σ4u(\bar x, \bar t) - v(\bar x, \bar t) \geq \frac{3\sigma}{4}. Then for ε\varepsilon small,

Φ(x0,y0,t0,s0)≥Φ(xˉ,xˉ,tˉ,tˉ)≥3σ4−2λT−2ε∣xˉ∣2≥σ2.(1)\Phi(x_0, y_0, t_0, s_0) \geq \Phi(\bar x, \bar x, \bar t, \bar t) \geq \frac{3\sigma}{4} - 2\lambda T - 2\varepsilon|\bar x|^2 \geq \frac{\sigma}{2}. \tag{1}

The two points are close. From Φ(x0,y0,t0,s0)≥Φ(0,0,0,0)\Phi(x_0, y_0, t_0, s_0) \geq \Phi(0, 0, 0, 0) and the boundedness of uu, vv: ε(∣x0∣2+∣y0∣2)≤C\varepsilon(|x_0|^2 + |y_0|^2) \leq C, so ε∣x0∣,ε∣y0∣≤Cε\varepsilon|x_0|, \varepsilon|y_0| \leq C\sqrt\varepsilon; and ∣x0−y0∣2+(t0−s0)2≤Cε2|x_0 - y_0|^2 + (t_0 - s_0)^2 \leq C\varepsilon^2. Better, comparing with Φ(x0,x0,t0,t0)\Phi(x_0, x_0, t_0, t_0):

∣x0−y0∣2+(t0−s0)2ε2≤v(x0,t0)−v(y0,s0)+λ(t0−s0)+ε(∣x0∣2−∣y0∣2),\frac{|x_0 - y_0|^2 + (t_0 - s_0)^2}{\varepsilon^2} \leq v(x_0, t_0) - v(y_0, s_0) + \lambda(t_0 - s_0) + \varepsilon\big(|x_0|^2 - |y_0|^2\big),

and the right side tends to 00 as ε→0\varepsilon \to 0, because vv is uniformly continuous, ∣x0−y0∣,∣t0−s0∣≤Cε|x_0 - y_0|, |t_0 - s_0| \leq C\varepsilon, and ε∣∣x0∣2−∣y0∣2∣≤ε∣x0−y0∣(∣x0∣+∣y0∣)≤Cε\varepsilon\big||x_0|^2 - |y_0|^2\big| \leq \varepsilon|x_0 - y_0|(|x_0| + |y_0|) \leq C\sqrt\varepsilon.

Neither point is at time zero. If t0=0t_0 = 0, then, writing ω\omega for a modulus of continuity of uu and vv,

σ2≤u(x0,0)−v(y0,s0)≤(u(x0,0)−v(x0,0))+ω(∣x0−y0∣+s0)≤ω(Cε),\frac\sigma2 \leq u(x_0, 0) - v(y_0, s_0) \leq \big(u(x_0, 0) - v(x_0, 0)\big) + \omega\big(|x_0 - y_0| + s_0\big) \leq \omega(C\varepsilon),

since s0=∣t0−s0∣≤Cεs_0 = |t_0 - s_0| \leq C\varepsilon. This is impossible for small ε\varepsilon. The same holds if s0=0s_0 = 0. So t0,s0>0t_0, s_0 > 0 for small ε\varepsilon.

Testing the subsolution. The function (x,t)↦Φ(x,y0,t,s0)(x, t) \mapsto \Phi(x, y_0, t, s_0) has a maximum at (x0,t0)(x_0, t_0); that is, u−ϕu - \phi has a maximum there, with

ϕ(x,t)=v(y0,s0)+λ(t+s0)+∣x−y0∣2+(t−s0)2ε2+ε(∣x∣2+∣y0∣2),\phi(x, t) = v(y_0, s_0) + \lambda(t + s_0) + \frac{|x - y_0|^2 + (t - s_0)^2}{\varepsilon^2} + \varepsilon(|x|^2 + |y_0|^2),

a smooth function. The subsolution test gives

λ+2(t0−s0)ε2+H(2(x0−y0)ε2+2εx0)≤0.(2)\lambda + \frac{2(t_0 - s_0)}{\varepsilon^2} + H\Big(\frac{2(x_0 - y_0)}{\varepsilon^2} + 2\varepsilon x_0\Big) \leq 0. \tag{2}

Testing the supersolution. The function (y,s)↦−Φ(x0,y,t0,s)(y, s) \mapsto -\Phi(x_0, y, t_0, s) has a minimum at (y0,s0)(y_0, s_0); that is, v−ψv - \psi has a minimum there, with ψ(y,s)=u(x0,t0)−λ(t0+s)−∣x0−y∣2+(t0−s)2ε2−ε(∣x0∣2+∣y∣2)\psi(y, s) = u(x_0, t_0) - \lambda(t_0 + s) - \frac{|x_0 - y|^2 + (t_0 - s)^2}{\varepsilon^2} - \varepsilon(|x_0|^2 + |y|^2). Since ψs=−λ+2(t0−s0)ε2\psi_s = -\lambda + \frac{2(t_0 - s_0)}{\varepsilon^2} and ∇ψ=2(x0−y0)ε2−2εy0\nabla\psi = \frac{2(x_0 - y_0)}{\varepsilon^2} - 2\varepsilon y_0 there,

−λ+2(t0−s0)ε2+H(2(x0−y0)ε2−2εy0)≥0.(3)-\lambda + \frac{2(t_0 - s_0)}{\varepsilon^2} + H\Big(\frac{2(x_0 - y_0)}{\varepsilon^2} - 2\varepsilon y_0\Big) \geq 0. \tag{3}

The contradiction. Subtract (3) from (2): with p=2(x0−y0)ε2p = \frac{2(x_0 - y_0)}{\varepsilon^2},

2λ≤H(p−2εy0)−H(p+2εx0).2\lambda \leq H(p - 2\varepsilon y_0) - H(p + 2\varepsilon x_0).

Now u−ϕu - \phi has a maximum at (x0,t0)(x_0, t_0) and uu is Lipschitz in xx with constant Λ\Lambda, so ∣∇xϕ(x0,t0)∣=∣p+2εx0∣≤Λ|\nabla_x\phi(x_0, t_0)| = |p + 2\varepsilon x_0| \leq \Lambda (a C1C^1 function touching a Λ\Lambda-Lipschitz function from above has gradient at most Λ\Lambda at the contact point). So ∣p∣≤Λ+Cε|p| \leq \Lambda + C\sqrt\varepsilon, and both arguments of HH lie in a fixed ball, on which HH is uniformly continuous; and they differ by 2ε(∣x0∣+∣y0∣)≤Cε2\varepsilon(|x_0| + |y_0|) \leq C\sqrt\varepsilon. So the right side tends to 00 as ε→0\varepsilon \to 0, while 2λ=σ4T>02\lambda = \frac{\sigma}{4T} > 0. Contradiction.

Uniqueness. Two bounded Lipschitz viscosity solutions with the same initial data are each a subsolution and a supersolution, so comparison in both directions gives equality. The Hopf–Lax function is Lipschitz and a viscosity solution (Proposition 9.9); it is bounded when gg is bounded (and the boundedness assumption can be removed with more care).

The penalisation ∣x−y∣2ε2\frac{|x - y|^2}{\varepsilon^2} forces the two points together as ε→0\varepsilon \to 0 while keeping them independent, so that uu is tested at x0x_0 and vv at y0y_0, each by a smooth function. The two test functions have the same gradient pp up to O(ε)O(\sqrt\varepsilon), which is what lets the two inequalities be compared. The term λ(t+s)\lambda(t + s) makes the subsolution strict, and the term ε(∣x∣2+∣y∣2)\varepsilon(|x|^2 + |y|^2) only ensures the maximum exists on an unbounded domain.

Optimal control and the HJB equation

A system has state x(s)∈Rnx(s) \in \mathbb{R}^n evolving by

x˙(s)=f(x(s),α(s)),t≤s≤T,x(t)=x,\dot x(s) = f(x(s), \alpha(s)), \qquad t \leq s \leq T, \qquad x(t) = x,

where the control α(⋅)\alpha(\cdot) is a measurable function with values in a compact set AA, chosen by us. We pay a running cost r(x(s),α(s))r(x(s), \alpha(s)) and a terminal cost g(x(T))g(x(T)), and want to minimise

Cx,t[α]=∫tTr(x(s),α(s)) ds+g(x(T)).C_{x,t}[\alpha] = \int_t^Tr(x(s), \alpha(s))\,ds + g(x(T)).

The value function is u(x,t)=inf⁡αCx,t[α]u(x, t) = \inf_\alpha C_{x,t}[\alpha]. (Assume ff, rr, gg bounded and Lipschitz, so the ODE has unique solutions and uu is bounded and Lipschitz; Evans, section 10.3.)

Proposition 9.11 The dynamic programming principle

For t<t+h≤Tt < t + h \leq T,

u(x,t)=inf⁡α{∫tt+hr(x(s),α(s)) ds+u(x(t+h),t+h)}.u(x, t) = \inf_\alpha\Big\{\int_t^{t+h}r(x(s), \alpha(s))\,ds + u(x(t + h), t + h)\Big\}.

Proof. (≤\leq) Fix α\alpha on [t,t+h][t, t + h], reaching x1=x(t+h)x_1 = x(t + h). For δ>0\delta > 0 choose a control β\beta on [t+h,T][t + h, T] with Cx1,t+h[β]≤u(x1,t+h)+δC_{x_1,t+h}[\beta] \leq u(x_1, t + h) + \delta. The concatenation of α\alpha and β\beta is a control from (x,t)(x, t), so u(x,t)≤∫tt+hr ds+u(x1,t+h)+δu(x, t) \leq \int_t^{t+h}r\,ds + u(x_1, t + h) + \delta. (≥\geq) For any control α\alpha on [t,T][t, T], its restriction to [t+h,T][t + h, T] is a control from (x(t+h),t+h)(x(t + h), t + h), so Cx,t[α]≥∫tt+hr ds+u(x(t+h),t+h)C_{x,t}[\alpha] \geq \int_t^{t+h}r\,ds + u(x(t + h), t + h). Take the infimum over α\alpha.

If uu were smooth, take a constant control aa on [t,t+h][t, t + h] in the "≤\leq" direction: u(x,t)≤hr(x,a)+u(x+hf(x,a),t+h)+o(h)u(x, t) \leq hr(x, a) + u(x + hf(x, a), t + h) + o(h), so 0≤ut+f(x,a)⋅∇u+r(x,a)0 \leq u_t + f(x, a)\cdot\nabla u + r(x, a) for every aa. And for a nearly optimal control the reverse inequality holds in the limit. This gives the Hamilton–Jacobi–Bellman equation

ut+min⁡a∈A{f(x,a)⋅∇u+r(x,a)}=0  in Rn×(0,T),u(x,T)=g(x),(HJB)u_t + \min_{a\in A}\big\{f(x, a)\cdot\nabla u + r(x, a)\big\} = 0 \ \text{ in } \mathbb{R}^n\times(0, T), \qquad u(x, T) = g(x), \tag{HJB}

a terminal value problem (time runs backwards from the deadline). With H(p,x)=−min⁡a{f(x,a)⋅p+r(x,a)}H(p, x) = -\min_a\{f(x, a)\cdot p + r(x, a)\} and u~(x,t)=u(x,T−t)\tilde u(x, t) = u(x, T - t), it is a Hamilton–Jacobi equation u~t+H(∇u~,x)=0\tilde u_t + H(\nabla\tilde u, x) = 0 of the type above, with HH convex in pp (a maximum of affine functions).

Theorem 9.12 The value function is the viscosity solution (statement)

Under the assumptions above, the value function uu is the unique bounded, uniformly continuous viscosity solution of (HJB). Conversely, if uu is a C1C^1 solution of (HJB) and α∗(s)\alpha^*(s) attains the minimum in (HJB) along the trajectory it generates, then α∗\alpha^* is an optimal control (the verification theorem).

The proof (Evans, section 10.3.3) runs the dynamic programming argument above with test functions in place of uu, exactly as Proposition 9.9 did with the semigroup property, which is the dynamic programming principle for the problem with f(x,a)=af(x, a) = a, r=L(a)r = L(a). The verification theorem is the practical tool: guess a solution of (HJB), check it, and read off the optimal feedback a=α∗(x,t)a = \alpha^*(x, t). For stochastic systems the HJB equation acquires a second-order term, and that is the version used for optimal investment in 6D.8 Stochastic Control and the HJB Equation.

Second-order equations

The definition extends verbatim to equations F(D2u,∇u,u,x)=0F(D^2u, \nabla u, u, x) = 0 that are degenerate elliptic: F(X,p,z,x)≤F(Y,p,z,x)F(X, p, z, x) \leq F(Y, p, z, x) whenever X≥YX \geq Y (in the sign convention where −Δu=0-\Delta u = 0 is F=−tr⁡XF = -\operatorname{tr}X), and proper (FF non-decreasing in zz). A viscosity subsolution satisfies F(D2v,∇v,u,x0)≤0F(D^2v, \nabla v, u, x_0) \leq 0 whenever u−vu - v has a local maximum at x0x_0 with v∈C2v \in C^2, and similarly for supersolutions. Ellipticity is exactly what makes a classical solution a viscosity solution (at a maximum of u−vu - v, D2u≤D2vD^2u \leq D^2v).

Uniqueness for second-order equations is much harder, because doubling the variables now needs information about second derivatives at the maximum, which uu and vv do not have. The tool is the theorem on sums, or Crandall–Ishii lemma (statement): at a maximum of u(x)−v(y)−∣x−y∣22εu(x) - v(y) - \frac{|x - y|^2}{2\varepsilon}, there are symmetric matrices XX, YY with X≤YX \leq Y (more precisely, a two-by-two block inequality bounding (X00−Y)\begin{pmatrix}X & 0\\ 0 & -Y\end{pmatrix}) that act as generalised second derivatives of uu and vv at the two points. Robert Jensen proved the first uniqueness theorem for second-order equations in 1988, and Hitoshi Ishii and Lions extended it in 1989–90; the "User's guide" of Crandall, Ishii and Lions (1992) is the standard exposition.

Second-order viscosity solutions handle equations with no divergence structure at all: the fully nonlinear equations of 6C.10 Fully Nonlinear Equations and Monge–Ampère, the HJB equations of stochastic control (6D.8 Stochastic Control and the HJB Equation), and the level-set formulation of mean curvature flow,

ut=∣∇u∣div⁡(∇u∣∇u∣),u_t = |\nabla u|\operatorname{div}\Big(\frac{\nabla u}{|\nabla u|}\Big),

in which every level set of uu moves by mean curvature. Lawrence Evans and Joel Spruck, and independently Yun Gang Chen, Yoshikazu Giga and Shun'ichi Goto, proved in 1991 that this degenerate equation has unique viscosity solutions, which defines mean curvature flow through singularities.

Where this goes Hamilton–Jacobi equations in Perelman's work

Perelman's reduced distance ℓ(q,τ)\ell(q, \tau) (12A.5 Reduced Distance and Reduced Volume) is the value function of a variational problem: the infimum of the L\mathcal L-length ∫0τs(R+∣γ˙∣2) ds\int_0^\tau\sqrt s\big(R + |\dot\gamma|^2\big)\,ds over space-time paths. Like every value function, it satisfies a Hamilton–Jacobi equation where it is smooth, and in general only in a weak sense (Perelman works with it in the barrier sense, closely related to the viscosity sense: the inequalities are tested by smooth functions touching from one side). The monotonicity of the reduced volume comes from differential inequalities for ℓ\ell that are exactly the viscosity inequalities of this chapter (Exercise 9.19). The same structure appears in Li and Yau's estimate (6A.12 Entropy, Information and Diffusion), where the optimal path is a straight line and the value function is the Gaussian exponent ∣x−y∣24t\frac{|x - y|^2}{4t}.

History

William Rowan Hamilton (1830s) and Carl Jacobi (1840s) developed the equation as a reformulation of mechanics. Eberhard Hopf (1965) and Peter Lax (1957, for the related conservation laws) found the formula. Stanislav Kruzhkov studied generalised solutions of first-order equations in the 1960s, using a doubling of variables for conservation laws (1970). Richard Bellman developed dynamic programming in the 1950s. Michael Crandall and Pierre-Louis Lions introduced viscosity solutions in 1983, and Crandall, Evans and Lions simplified the definition to the one used here in 1984; Lions received the Fields Medal in 1994, in part for this work. Jensen (1988) and Ishii (1989) extended uniqueness to second-order equations.

Recall Where we stand

For convex, superlinear HH with Legendre transform LL, the Hopf–Lax formula u(x,t)=min⁡y{tL(x−yt)+g(y)}u(x, t) = \min_y\{tL(\frac{x - y}{t}) + g(y)\} is the least action, satisfies the semigroup (dynamic programming) property, is Lipschitz, and solves (HJ) almost everywhere; but almost-everywhere solutions are not unique. Viscosity solutions are defined by testing with C1C^1 functions touching from above (subsolution, ≤0\leq 0) or below (supersolution, ≥0\geq 0); they agree with classical solutions where differentiable, are stable under uniform limits (including vanishing viscosity), and satisfy a comparison principle proved by doubling variables. So the Hopf–Lax function is the unique viscosity solution. In optimal control, the dynamic programming principle makes the value function the viscosity solution of the HJB equation. For second-order degenerate elliptic equations the definition is the same and uniqueness needs the Crandall–Ishii lemma. 6C.10 Fully Nonlinear Equations and Monge–Ampère studies the fully nonlinear elliptic equations that viscosity solutions were built for, culminating in Monge–Ampère and the Kähler–Ricci flow.

Exercises

Exercise 9.13 The Moreau envelope of ∣y∣|y|

For ut+12ux2=0u_t + \frac12u_x^2 = 0 with g(y)=∣y∣g(y) = |y|, compute the Hopf–Lax solution and check that it is C1C^1 in xx for t>0t > 0 and satisfies the equation everywhere for t>0t > 0.

Solution

Minimise (x−y)22t+∣y∣\frac{(x - y)^2}{2t} + |y|. For y>0y > 0 the derivative in yy is y−xt+1\frac{y - x}{t} + 1, zero at y=x−ty = x - t, which is positive iff x>tx > t, giving t2+x−t=x−t2\frac{t}{2} + x - t = x - \frac t2. Symmetrically for x<−tx < -t. For ∣x∣≤t|x| \leq t the minimum is at y=0y = 0, giving x22t\frac{x^2}{2t}. So u=x22tu = \frac{x^2}{2t} for ∣x∣≤t|x| \leq t and ∣x∣−t2|x| - \frac t2 for ∣x∣>t|x| > t. At x=tx = t: both pieces equal t2\frac t2, and their xx-derivatives are xt=1\frac xt = 1 and 11, so uu is C1C^1 in xx. The equation: for ∣x∣<t|x| < t, ut=−x22t2u_t = -\frac{x^2}{2t^2} and 12ux2=x22t2\frac12u_x^2 = \frac{x^2}{2t^2}; for ∣x∣>t|x| > t, ut=−12u_t = -\frac12 and 12ux2=12\frac12u_x^2 = \frac12. On ∣x∣=t|x| = t both one-sided time derivatives equal −12-\frac12.

Exercise 9.14 Lipschitz in time

With Λ=Lip⁡(g)\Lambda = \operatorname{Lip}(g), show that the Hopf–Lax function satisfies g(x)−tmax⁡∣p∣≤ΛH(p)≤u(x,t)≤g(x)+tL(0)g(x) - t\max_{|p|\leq\Lambda}H(p) \leq u(x, t) \leq g(x) + tL(0).

Solution

The upper bound takes y=xy = x. For the lower bound, tL(x−yt)+g(y)≥g(x)+t(L(q)−Λ∣q∣)tL(\frac{x - y}{t}) + g(y) \geq g(x) + t\big(L(q) - \Lambda|q|\big) with q=x−ytq = \frac{x - y}{t}, and inf⁡q(L(q)−Λ∣q∣)=−sup⁡qmax⁡∣p∣≤Λ(p⋅q−L(q))=−max⁡∣p∣≤ΛH(p)\inf_q\big(L(q) - \Lambda|q|\big) = -\sup_q\max_{|p|\leq\Lambda}\big(p\cdot q - L(q)\big) = -\max_{|p|\leq\Lambda}H(p), using Λ∣q∣=max⁡∣p∣≤Λp⋅q\Lambda|q| = \max_{|p|\leq\Lambda}p\cdot q and H=L∗H = L^*.

Exercise 9.15 The dented solution

(a) Check that u2u_2 of Example 9.6 satisfies ut+ux2=0u_t + u_x^2 = 0 wherever it is differentiable. (b) Show that u2u_2 is not a viscosity supersolution: at (0,t0)(0, t_0), find a C1C^1 function vv touching u2u_2 from below with vt+vx2<0v_t + v_x^2 < 0. (c) Show that at the corners ∣x∣=t|x| = t no C1C^1 function touches u2u_2 from below, and explain why the dent at x=0x = 0 is the problem.

Solution

(a) For ∣x∣>t|x| > t, u2=0u_2 = 0. For 0<∣x∣<t0 < |x| < t, ut=−1u_t = -1 and ux=±1u_x = \pm1, so ut+ux2=0u_t + u_x^2 = 0. (b) Near (0,t0)(0, t_0), u2=∣x∣−t≥−tu_2 = |x| - t \geq -t, with equality at x=0x = 0. So v(x,t)=−tv(x, t) = -t touches from below at (0,t0)(0, t_0) (u2−v=∣x∣≥0u_2 - v = |x| \geq 0, minimum 00), and vt+vx2=−1<0v_t + v_x^2 = -1 < 0: the supersolution test fails. (c) At x=tx = t, u2=min⁡(0,x−t)u_2 = \min(0, x - t) near the corner, a concave corner ∧\wedge; a C1C^1 function touching from below would need slopes ≤0\leq 0 from one side and ≥1\geq 1 from the other, impossible. The only failure is the convex corner ∨\vee at x=0x = 0, where smooth functions with slopes in [−1,1][-1, 1] fit underneath.

Exercise 9.16 The distance function

On (−1,1)(-1, 1), consider ∣u′∣−1=0|u'| - 1 = 0 with u(±1)=0u(\pm1) = 0, a stationary Hamilton–Jacobi equation with H(p)=∣p∣−1H(p) = |p| - 1 and the same definition of viscosity solution (without time). (a) Show that u=1−∣x∣u = 1 - |x|, the distance to the boundary, is a viscosity solution. (b) Show that u=∣x∣−1u = |x| - 1 is not. (c) What happens for the equation 1−∣u′∣=01 - |u'| = 0, which has the same classical solutions?

Solution

(a) Away from 00, uu is smooth with ∣u′∣=1|u'| = 1. At 00, the corner is concave: nothing C1C^1 touches from below, so the supersolution test is vacuous; a C1C^1 function touching from above has v′(0)=p∈[−1,1]v'(0) = p \in [-1, 1], and ∣p∣−1≤0|p| - 1 \leq 0 holds. (b) At 00, v=−1v = -1 touches ∣x∣−1|x| - 1 from below with v′=0v' = 0, and ∣0∣−1=−1<0|0| - 1 = -1 < 0 violates the supersolution test. (c) Multiplying the equation by −1-1 exchanges sub- and supersolutions: for 1−∣u′∣=01 - |u'| = 0 the viscosity solution is ∣x∣−1|x| - 1. The viscosity solution depends on how the equation is written, which reflects the choice between a minimum (distance) and a maximum.

Exercise 9.17 From heat to Hopf–Lax

Let wεw^\varepsilon solve wt=ε2Δww_t = \frac\varepsilon2\Delta w with w(x,0)=e−g(x)/εw(x, 0) = e^{-g(x)/\varepsilon}, and uε=−εlog⁡wεu^\varepsilon = -\varepsilon\log w^\varepsilon. (a) Show that utε+12∣∇uε∣2=ε2Δuεu^\varepsilon_t + \frac12|\nabla u^\varepsilon|^2 = \frac\varepsilon2\Delta u^\varepsilon (the Hopf–Cole transformation of 6B.2 Conservation Laws and Shocks). (b) Using the heat kernel, write uε(x,t)=−εlog⁡∫(2πεt)−n/2exp⁡(−1ε(∣x−y∣22t+g(y))) dyu^\varepsilon(x, t) = -\varepsilon\log\int(2\pi\varepsilon t)^{-n/2}\exp\big(-\frac1\varepsilon\big(\frac{|x - y|^2}{2t} + g(y)\big)\big)\,dy, and explain (Laplace's method) why uε→min⁡y{∣x−y∣22t+g(y)}u^\varepsilon \to \min_y\big\{\frac{|x - y|^2}{2t} + g(y)\big\}. Together with Theorem 9.8, this proves again that the Hopf–Lax function is the viscosity solution for H=12∣p∣2H = \frac12|p|^2.

Solution

(a) w=e−u/εw = e^{-u/\varepsilon}: wt=−1εutww_t = -\frac1\varepsilon u_tw, ∇w=−1εw∇u\nabla w = -\frac1\varepsilon w\nabla u, Δw=(1ε2∣∇u∣2−1εΔu)w\Delta w = \big(\frac{1}{\varepsilon^2}|\nabla u|^2 - \frac1\varepsilon\Delta u\big)w. The heat equation gives −1εut=ε2(1ε2∣∇u∣2−1εΔu)-\frac1\varepsilon u_t = \frac\varepsilon2\big(\frac{1}{\varepsilon^2}|\nabla u|^2 - \frac1\varepsilon\Delta u\big), i.e. ut+12∣∇u∣2=ε2Δuu_t + \frac12|\nabla u|^2 = \frac\varepsilon2\Delta u. (b) The heat kernel of ∂t−ε2Δ\partial_t - \frac\varepsilon2\Delta is (2πεt)−n/2e−∣x−y∣2/(2εt)(2\pi\varepsilon t)^{-n/2}e^{-|x - y|^2/(2\varepsilon t)}. By Laplace's method, −εlog⁡∫e−Ψ(y)/ε dy→min⁡Ψ-\varepsilon\log\int e^{-\Psi(y)/\varepsilon}\,dy \to \min\Psi as ε→0\varepsilon \to 0 (the integral is dominated by a neighbourhood of the minimum, and the prefactors contribute O(εlog⁡ε)→0O(\varepsilon\log\varepsilon) \to 0).

Exercise 9.18 A control problem with explicit solution

On the line, x˙=a\dot x = a with ∣a∣≤1|a| \leq 1, running cost r=0r = 0 and terminal cost g(x)=∣x∣g(x) = |x| at time TT. (a) Guess the value function. (b) Check that it satisfies (HJB), ut+min⁡∣a∣≤1aux=ut−∣ux∣=0u_t + \min_{|a|\leq1}au_x = u_t - |u_x| = 0, where it is differentiable, and that it is the viscosity solution (check the corner).

Solution

(a) Move towards 00 at full speed: u(x,t)=max⁡(∣x∣−(T−t),0)u(x, t) = \max(|x| - (T - t), 0). (b) Where ∣x∣>T−t|x| > T - t: ut=1u_t = 1 and ∣ux∣=1|u_x| = 1, so ut−∣ux∣=0u_t - |u_x| = 0. Where ∣x∣<T−t|x| < T - t: u=0u = 0. To check the corners, reverse time: u~(x,s)=u(x,T−s)=max⁡(∣x∣−s,0)\tilde u(x, s) = u(x, T - s) = \max(|x| - s, 0) solves u~s+∣u~x∣=0\tilde u_s + |\tilde u_x| = 0 with u~(x,0)=∣x∣\tilde u(x, 0) = |x|. This is the Hopf–Lax problem for H(p)=∣p∣H(p) = |p|, whose Legendre transform is L(q)=0L(q) = 0 for ∣q∣≤1|q| \leq 1 and +∞+\infty otherwise, so the formula reads u~(x,s)=min⁡∣y−x∣≤s∣y∣=max⁡(∣x∣−s,0)\tilde u(x, s) = \min_{|y - x|\leq s}|y| = \max(|x| - s, 0). The proofs of Lemma 9.2 and Proposition 9.9 used only convexity of LL and the existence of minimisers, both true here, so u~\tilde u, and hence uu, is the viscosity solution.

Exercise 9.19 Rehearsal: the reduced distance in flat space

In Rn\mathbb{R}^n (a static flat Ricci flow, R=0R = 0), Perelman's L\mathcal L-length of a path γ:[0,τ]→Rn\gamma : [0, \tau] \to \mathbb{R}^n from the origin is L(γ)=∫0τs ∣γ˙(s)∣2 ds\mathcal L(\gamma) = \int_0^\tau\sqrt s\,|\dot\gamma(s)|^2\,ds. (a) Show that the minimiser from 00 to xx is γ(s)=xs/τ\gamma(s) = x\sqrt{s/\tau}, and the minimum is L(x,τ)=∣x∣22τL(x, \tau) = \frac{|x|^2}{2\sqrt\tau}. (b) The Lagrangian s∣v∣2\sqrt s|v|^2 has Hamiltonian ∣p∣24s\frac{|p|^2}{4\sqrt s}; check that LL solves Lτ+∣∇L∣24τ=0L_\tau + \frac{|\nabla L|^2}{4\sqrt\tau} = 0. (c) The reduced distance is ℓ=L2τ\ell = \frac{L}{2\sqrt\tau}. Show ℓ=∣x∣24τ\ell = \frac{|x|^2}{4\tau}, so (4πτ)−n/2e−ℓ(4\pi\tau)^{-n/2}e^{-\ell} is the heat kernel, and Perelman's reduced volume ∫(4πτ)−n/2e−ℓ dx\int(4\pi\tau)^{-n/2}e^{-\ell}\,dx equals 11 for all τ\tau: in flat space the monotone quantity is constant (12A.5 Reduced Distance and Reduced Volume).

Solution

(a) The Euler–Lagrange equation is dds(2sγ˙)=0\frac{d}{ds}(2\sqrt s\dot\gamma) = 0, so γ˙=cs\dot\gamma = \frac{c}{\sqrt s} and γ=2cs\gamma = 2c\sqrt s; γ(τ)=x\gamma(\tau) = x gives c=x2τc = \frac{x}{2\sqrt\tau}. Then L=∫0τs∣c∣2s ds=2∣c∣2τ=∣x∣22τ\mathcal L = \int_0^\tau\sqrt s\frac{|c|^2}{s}\,ds = 2|c|^2\sqrt\tau = \frac{|x|^2}{2\sqrt\tau}; by convexity of the Lagrangian in vv, this critical path is the minimiser. (b) sup⁡v(p⋅v−s∣v∣2)\sup_v\big(p\cdot v - \sqrt s|v|^2\big) is attained at v=p2sv = \frac{p}{2\sqrt s}, value ∣p∣24s\frac{|p|^2}{4\sqrt s}. Lτ=−∣x∣24τ3/2L_\tau = -\frac{|x|^2}{4\tau^{3/2}}, ∇L=xτ\nabla L = \frac{x}{\sqrt\tau}, ∣∇L∣24τ=∣x∣24τ3/2\frac{|\nabla L|^2}{4\sqrt\tau} = \frac{|x|^2}{4\tau^{3/2}}; the sum is 00. (c) ℓ=∣x∣22τ⋅2τ=∣x∣24τ\ell = \frac{|x|^2}{2\sqrt\tau\cdot2\sqrt\tau} = \frac{|x|^2}{4\tau}, and ∫(4πτ)−n/2e−∣x∣2/(4τ) dx=1\int(4\pi\tau)^{-n/2}e^{-|x|^2/(4\tau)}\,dx = 1.

Free resources for this chapter

Chosen for what this chapter covers, and all free to read. Links checked Oct 20, 2026.

© 2026 NeckPinch (www.neckpinch.com). All content in the guidebook (text, mathematics, figures and exercises) is protected by copyright. All rights reserved. No part may be copied, republished or redistributed without written permission.