Math 2.0

Calculus of variations and optimal control; optimization Dynamic programming and Hamilton-Jacobi theory Theorem

Crandall–Lions uniqueness theorem

Builds on Viscosity solutionHamilton–Jacobi equationUniform continuity

Statement

Let n≥1n \ge 1, let T>0T > 0, and let H ⁣:ℝn×ℝn→ℝH \colon \R^n \times \R^n \to \R be continuous, written H(x,p)H(x, p). Assume that there is a constant CC such that, for all x,y,p,q∈ℝnx, y, p, q \in \R^n, ∣H(x,p)−H(x,q)∣≤C∣p−q∣,∣H(x,p)−H(y,p)∣≤C∣x−y∣(1+∣p∣).\abs{H(x, p) - H(x, q)} \le C \abs{p - q}, \qquad \abs{H(x, p) - H(y, p)} \le C \abs{x - y} (1 + \abs{p}). Let g ⁣:ℝn→ℝg \colon \R^n \to \R be bounded and uniformly continuous. Consider the Cauchy problem for the Hamilton–Jacobi equation ut+H(x,Dxu)=0in ℝn×(0,T),u(x,0)=g(x)for x∈ℝn.u_t + H(x, D_x u) = 0 \quad \text{in } \R^n \times (0, T), \qquad u(x, 0) = g(x) \quad \text{for } x \in \R^n. Then this problem has at most one solution u ⁣:ℝn×[0,T]→ℝu \colon \R^n \times [0, T] \to \R in the following sense. The function uu is bounded and uniformly continuous, satisfies the initial condition, and is a viscosity solution of the equation in ℝn×(0,T)\R^n \times (0, T).

Remarks

The theorem is a consequence of a comparison principle: if uu is a bounded uniformly continuous subsolution and vv a bounded uniformly continuous supersolution with u(⋅,0)≤v(⋅,0)u(\cdot, 0) \le v(\cdot, 0), then u≤vu \le v. The proof doubles the variables. One maximises u(x,t)−v(y,s)−∣x−y∣2/ε−∣t−s∣2/εu(x, t) - v(y, s) - \abs{x - y}^2 / \varepsilon - \abs{t - s}^2 / \varepsilon over pairs of points, after adding small extra terms that force a maximum to exist on the unbounded domain. At the maximum point the two halves of the penalty serve as test functions for uu and for vv, and the two inequalities of the definition are subtracted. The Lipschitz hypotheses on HH make the error terms tend to 00 with ε\varepsilon, which gives a contradiction if u−vu - v had a positive supremum.

Example: for H(x,p)=∣p∣H(x, p) = \abs{p} the hypotheses hold with C=1C = 1. The unique bounded uniformly continuous viscosity solution is given by the Hopf–Lax formula u(x,t)=min⁡∣y−x∣≤tg(y)u(x, t) = \min_{\abs{y - x} \le t} g(y).

The viscosity sense is needed. For H(x,p)=∣p∣H(x, p) = \abs{p} and g=0g = 0, both u=0u = 0 and w(x,t)=min⁡(0,∣x∣−t)w(x, t) = \min(0, \abs{x} - t) (with n=1n = 1) are Lipschitz and satisfy the equation almost everywhere. Only u=0u = 0 is a viscosity solution: at a point (0,t)(0, t) the function w−φw - \varphi with φ(x,s)=−s\varphi(x, s) = -s has a local minimum, while φt+∣φx∣=−1<0\varphi_t + \abs{\varphi_x} = -1 < 0.

Going deeper

For a student

Uniqueness is what makes viscosity solutions useful in control theory. To show that a value function equals a given formula, it is enough to check that both are viscosity solutions of the same Hamilton–Jacobi–Bellman equation with the same data. The same doubling-of-variables argument gives comparison for stationary equations such as u+H(x,Du)=0u + H(x, Du) = 0, and, with more work, for second-order degenerate elliptic equations. Existence comes separately, for instance from the value function of a control problem or from the vanishing viscosity method.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Hamilton–Jacobi equation concept
  2. Uniform continuity concept
  3. Viscosity solution concept
  4. Crandall–Lions uniqueness theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Viscosity_solution
About this page
TagHTK7A4JRW7
URIm2://HTK7A4JRW7
Kindstatement, theorem
WritingW0 stub
MSC49L25, 35D40, 35F21
StatusThis copy of the site has no build data. Run m2 status HTK7A4JRW7.
AboutViscosity solution, Hamilton–Jacobi equation
UsesViscosity solution, Hamilton–Jacobi equation, Uniform continuity

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.