Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 25 results · all verified · 15 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Hamilton Jacobi Equations and Viscosity Solutions

1 · Prerequisites

2 · Summary

This page develops the viscosity theory of first-order Hamilton--Jacobi equations from the test-function definition. It fixes the Cauchy problem, its classical solutions, the upper and lower semicontinuous envelopes and their least-majorant properties, and the equivalence between test-function and first-order-jet formulations, with the quartic strictification device used to localise contacts. Finite maxima of subsolutions and minima of supersolutions, stability under locally uniform convergence and the half-relaxed-limit stability theorem with vanishing perturbations are proved, followed by the doubling-of-variables localisation lemma, the time-penalisation lemma and comparison for the Cauchy problem in the two settings of the design, including the autonomous convex superlinear case. Uniqueness and sup-norm contraction are derived, and Perron's method is proved between the two explicit barriers with the upper-envelope and local-bump lemmas. The convex-duality half of the page defines the Legendre transform, proves biconjugacy for finite convex Hamiltonians without choice, and develops the Hopf--Lax operator: localisation of its infima, sup-norm contraction, preservation of a modulus of continuity, the dynamic-programming semigroup, the characteristic Euler relation, the Hopf--Lax solution of the Cauchy problem and vanishing viscosity. Finite speed of dependence and the value-function orientation close the page. No item of the page consumes the Axiom of Choice; Countable Choice is declared exactly where the half-relaxed-limit stability theorem extracts sequences under its sequential hypothesis.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The Hamilton--Jacobi Cauchy problem and its classical solutions

Definition

Let n≥1, let O⊆Rn be nonempty and open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement), let T>0, and let H:O×[0,T]×Rn→R be continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form). Write Z:=O×(0,T),Z‾:=O‾×[0,T],Γ:=(O×{0})∪(∂O×[0,T]) for the open space--time cylinder, its closure in Rn+1, and the parabolic boundary. Given a continuous u0:O→R, the Hamilton--Jacobi Cauchy problem is ut+H(x,t,Du)=0 in Z,u=u0 on O×{0}, where Du denotes the spatial gradient and ut the time derivative of the unknown function (Directional derivatives and partial derivatives of a map U⊆Rm→Rn, The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

A classical solution of this problem is a function u∈C0(Z‾)∩C1(Z) (Ck maps and multi-index derivative notation in Euclidean space) with u(x,0)=u0(x) for every x∈O and ut(x,t)+H(x,t,Du(x,t))=0for every (x,t)∈Z. The continuity requirement u∈C0(Z‾) ensures continuous attainment of the initial datum and also continuity on the lateral and terminal faces; no condition on the lateral face ∂O×[0,T] is imposed unless it is stated explicitly.

Stationary specialization. Suppose that H does not depend on t and that v∈C1(O) satisfies H(x,Dv(x))=0 for every x∈O; such a v is called a classical solution of the stationary Hamilton--Jacobi equation H(x,Dv)=0. If in addition v extends continuously to O‾, then u(x,t):=v(x) is a classical solution of the Cauchy problem with datum u0:=v∣O, because u∈C0(Z‾)∩C1(Z) and ut≡0 on Z.

Remarks

  • What the definition fixes. The open cylinder Z=O×(0,T), its closure, the parabolic boundary Γ, the initial face O×{0} on which the datum is read, the Hamiltonian domain O×[0,T]×Rn with its continuity, and the regularity class C0(Z‾)∩C1(Z) of a classical solution are the data used by every viscosity notion on this page. In particular, "the initial datum is attained" means continuous attainment on the initial face, not a merely pointwise boundary value on a larger set.

  • No lateral condition, no choice. The definition imposes no condition on ∂O×[0,T]; statements about bounded domains add whatever boundary comparison they need explicitly. Nothing is selected anywhere in the definition, so no choice principle is used.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Upper and lower semicontinuous envelopes by local limsup and liminf

Definition

Let A⊆Rm be nonempty (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and let u:A→R. For x∈A and r>0 put Mr(x):=sup⁡{u(y):y∈A, ∣y−x∣≤r},mr(x):=inf⁡{u(y):y∈A, ∣y−x∣≤r}, the supremum and infimum being taken in R‾=R∪{±∞} (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, Greatest lower bound (infimum), Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R).

The upper semicontinuous envelope of u is u∗(x):=inf⁡r>0Mr(x)=lim⁡r↓0 sup⁡y∈A∣y−x∣≤ru(y), and the lower semicontinuous envelope of u is u∗(x):=sup⁡r>0mr(x)=lim⁡r↓0 inf⁡y∈A∣y−x∣≤ru(y), both with values in R‾.

Remarks

  • The limits exist. For fixed x∈A the map r↦Mr(x) is nondecreasing in r (the set it is taken over grows with r) and the map r↦mr(x) is nonincreasing in r, so the one-sided limits as r↓0 exist in R‾, with inf⁡r>0Mr(x)=lim⁡r↓0Mr(x) and sup⁡r>0mr(x)=lim⁡r↓0mr(x). Since A is nonempty, the sets over which the suprema and infima are taken are nonempty; infinite values are kept rather than discarded.
  • Comparison with u. For every x∈A one has mr(x)≤u(x)≤Mr(x) for all r>0, hence u∗(x)≤u(x)≤u∗(x) pointwise. If u is bounded on A, then all values Mr(x),mr(x) lie between inf⁡Au and sup⁡Au, so u∗ and u∗ are real-valued and bounded on A; this is a sufficient hypothesis for real-valued envelopes. Local boundedness near each point also suffices, because only arbitrarily small radii affect the defining infimum and supremum.
  • Scope. These are the envelopes of u on the Euclidean set A. The space--time cylinder of The Hamilton--Jacobi Cauchy problem and its classical solutions is used with m=n+1 and A=Z, and the envelope notation is the one appearing in the stability, Perron and comparison statements of this page (Upper and lower semicontinuity on subsets of Rn is the underlying mode of semicontinuity). No choice is used: each envelope is the value of a monotone limit indexed by r, hence by r=1/k, and no sequence or point is selected.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The envelopes are the least upper and greatest lower semicontinuous functions

Statement

Let A⊆Rm be nonempty and let u:A→R be bounded, with envelopes u∗,u∗ as in Upper and lower semicontinuous envelopes by local limsup and liminf. Then u∗ is upper semicontinuous on A, u∗ is lower semicontinuous on A, and u∗≤u≤u∗ pointwise. Moreover: (1) u∗ is the least upper semicontinuous function w:A→R‾ with w≥u pointwise, and u∗=u if and only if u is upper semicontinuous; (2) u∗ is the greatest lower semicontinuous function w:A→R‾ with w≤u pointwise, and u∗=u if and only if u is lower semicontinuous; (3) (u∗)∗=u∗ and (u∗)∗=u∗. No choice principle is used.

Facts & Assumptions

Given: A nonempty set A⊆Rm, a bounded function u:A→R, the local suprema Mr(x)=sup⁡{u(y):y∈A, ∣y−x∣≤r} and local infima mr(x)=inf⁡{u(y):y∈A, ∣y−x∣≤r} for x∈A, r>0, all computed in R‾, and the envelopes u∗(x)=inf⁡r>0Mr(x), u∗(x)=sup⁡r>0mr(x).

[F1]

For every x∈A the sets {Mr(x):r>0} and {mr(x):r>0} are nonempty and bounded (by the bounds of u); u∗(x)=inf⁡r>0Mr(x) is the greatest lower bound of the first set, u∗(x)=sup⁡r>0mr(x) is the least upper bound of the second, and mr(x)≤u(x)≤Mr(x) for every r>0. In particular u∗(x)≤Mr(x) and mr(x)≤u∗(x) for every r>0 (Upper and lower semicontinuous envelopes by local limsup and liminf).

[F2]

For real-valued functions, upper and lower semicontinuity have the local ε characterizations: near a, respectively f(x)<f(a)+ε and f(x)>f(a)−ε (Upper and lower semicontinuity on subsets of Rn). For an extended-real upper semicontinuous w, we use the standard strict-sublevel convention {w<c} open for every real c; if w(a) is finite, applying it with c=w(a)+ε gives the same local upper bound. The dual strict-superlevel convention for lower semicontinuity gives the local lower bound when w(a) is finite. These are exactly the finite-value cases used in steps 1.3 and 1.4; the infinite endpoint cases are disposed of there directly.

[F3]

If S⊆R is nonempty and ℓ=inf⁡S, then ℓ≤s for every s∈S, and ℓ′≤ℓ for every lower bound ℓ′ of S (Greatest lower bound (infimum)).

[F4]

If S⊆R is nonempty, bounded above and v∈R is an upper bound of S, then v=sup⁡S if and only if for every ε>0 there is s∈S with v−ε<s; in particular a supremum of S in R is an upper bound of S (Epsilon characterisation of the supremum).

Proof

technique · monotone localisation; the envelopes are compared with a competing semicontinuous function by testing the defining infimum and supremum
1.1F1F2F3F4algebra

u∗ is upper semicontinuous on A and u∗≤u≤u∗. Fix x∈A and ε>0. Since u∗(x)+2−1ε>u∗(x) is not a lower bound of the nonempty set {Mr(x):r>0} by the leastness clause of [F3], there is r>0 with Mr(x)<u∗(x)+2−1ε. For z∈A with ∣z−x∣<r put δ:=r−∣z−x∣>0; every w∈A with ∣w−z∣≤δ satisfies ∣w−x∣≤∣w−z∣+∣z−x∣≤r, so the set defining Mδ(z) is contained in the set defining Mr(x) and therefore Mδ(z)≤Mr(x)<u∗(x)+2−1ε; since u∗(z)≤Mδ(z) by [F1], we get u∗(z)<u∗(x)+ε. Thus u∗ is upper semicontinuous at x by [F2], and x was arbitrary. Next, u(x) is a lower bound of {Mr(x):r>0} by [F1], so u(x)≤u∗(x) by the greatest-lower-bound clause of [F3]. Finally u(x) is an upper bound of {mr(x):r>0} by [F1]; if u∗(x)>u(x) held, then η:=u∗(x)−u(x)>0 and [F4] would give r>0 with u∗(x)−η<mr(x), that is u(x)<mr(x), contradicting mr(x)≤u(x); hence u∗(x)≤u(x).

1.2F1F2F4algebra

u∗ is lower semicontinuous on A. Fix x∈A and ε>0. By [F4] applied to the nonempty bounded-above set {mr(x):r>0} with supremum u∗(x), there is r>0 with u∗(x)−ε<mr(x). For z∈A with ∣z−x∣<r put δ:=r−∣z−x∣>0; every w∈A with ∣w−z∣≤δ satisfies ∣w−x∣≤r, so mδ(z)≥mr(x), and u∗(z)≥mδ(z) by [F1]; hence u∗(z)>u∗(x)−ε, which is lower semicontinuity at x by [F2].

1.3F1F2F3algebra

Least upper semicontinuous majorant. Let w:A→R‾ be upper semicontinuous with w≥u, fix x∈A and ε>0. Since w≥u and u is real-valued, w takes no value −∞; if w(x)=+∞ then u∗(x)≤w(x) holds because u∗ is real-valued by [F1] and boundedness of u, so assume w(x)∈R. By [F2] there is r0>0 with w(y)<w(x)+ε for all y∈A with ∣y−x∣<r0. For y∈A with ∣y−x∣≤r0/2 we then have u(y)≤w(y)<w(x)+ε, so w(x)+ε is an upper bound of the set defining Mr0/2(x), whence Mr0/2(x)≤w(x)+ε. Since u∗(x)=inf⁡r>0Mr(x)≤Mr0/2(x) by [F3], we get u∗(x)≤w(x)+ε, and letting ε↓0 gives u∗(x)≤w(x). Hence u∗≤w for every upper semicontinuous majorant w of u.

1.4F1F2algebra

Greatest lower semicontinuous minorant. Let w:A→R‾ be lower semicontinuous with w≤u, fix x∈A and ε>0. Since w≤u, w(x)∈R∪{−∞}; if w(x)=−∞ then u∗(x)≥w(x) is automatic, so assume w(x)∈R. By [F2] there is r0>0 with w(y)>w(x)−ε for all y∈A with ∣y−x∣<r0. For y∈A with ∣y−x∣≤r0/2 we have w(y)>w(x)−ε and w(y)≤u(y), so w(x)−ε is a lower bound of the set defining mr0/2(x), whence mr0/2(x)≥w(x)−ε. Since u∗(x) is an upper bound of {mr(x):r>0} by [F1], we get u∗(x)≥mr0/2(x)≥w(x)−ε, and letting ε↓0 gives u∗(x)≥w(x).

2.1step 1.1step 1.2step 1.3step 1.4

The two equivalences. If u is upper semicontinuous, then u is an upper semicontinuous majorant of itself, so u∗≤u by step 1.3; with u≤u∗ from step 1.1 this gives u∗=u. Conversely, if u∗=u, then u is upper semicontinuous because u∗ is, by step 1.1. The same two lines with step 1.4 and step 1.2 show that u∗=u if and only if u is lower semicontinuous.

3.1step 1.1step 1.2step 2.1∎

Idempotence. The function u∗ is bounded and upper semicontinuous on A by step 1.1, and it is its own upper semicontinuous majorant; applying the equivalence of step 2.1 to u∗ in place of u gives (u∗)∗=u∗. Likewise u∗ is bounded and lower semicontinuous by steps 1.1 and 1.2, so (u∗)∗=u∗.

Remarks

  • Where boundedness is used. Boundedness of u keeps every Mr(x) and mr(x) in R, so the infimum and supremum over r are taken in the ordered field and the elementary leastness arguments of steps 1.1--1.4 apply directly. For unbounded u the envelopes can be infinite; idempotence in that setting must use the same local formulas extended to extended-valued inputs, whereas the present statement and Upper and lower semicontinuous envelopes by local limsup and liminf take real-valued input.
  • Strictness is not needed. The proof nowhere requires the contact or the majorant to be strict: the least-majorant property is proved by a direct pointwise comparison against an arbitrary upper semicontinuous majorant.
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem

Definition

Let n≥1, let U⊆Rn+1 be nonempty open with coordinates (x,t)∈Rn×R, and let H:U×Rn→R be continuous. A function u:U→R that is upper semicontinuous on U (Upper and lower semicontinuity on subsets of Rn) is a viscosity subsolution of ut+H(x,t,Du)=0 in U if for every ϕ∈C1(U) (Ck maps and multi-index derivative notation in Euclidean space) and every point z0∈U at which u−ϕ has a local maximum, ϕt(z0)+H(z0,Dϕ(z0))≤0. A function v:U→R that is lower semicontinuous on U is a viscosity supersolution if for every ϕ∈C1(U) and every point z0∈U at which v−ϕ has a local minimum, ϕt(z0)+H(z0,Dϕ(z0))≥0. A viscosity solution of the equation in U is a function that is both a viscosity subsolution and a viscosity supersolution.

Cauchy problem. Let Z=O×(0,T) and H:O×[0,T]×Rn→R be as in The Hamilton--Jacobi Cauchy problem and its classical solutions, and let u0:O→R. A viscosity subsolution of the Cauchy problem is an upper semicontinuous u:Z→R satisfying the subsolution inequality at every z0∈Z together with the relaxed initial condition lim sup⁡(y,s)→(x,0)s>0, y∈Ou(y,s)≤u0(x)for every x∈O; a viscosity supersolution v satisfies the supersolution inequality at every z0∈Z together with lim inf⁡(y,s)→(x,0)s>0, y∈Ov(y,s)≥u0(x)for every x∈O. A viscosity solution of the Cauchy problem is a function that is both a subsolution and a supersolution of the Cauchy problem; a continuous solution of the Cauchy problem satisfies the initial data pointwise, u(x,0)=u0(x) for every x∈O.

Remarks

  • Direction of the contact. The subsolution test is taken at a local maximum of u−ϕ, equivalently where ϕ touches u from above, and the supersolution test at a local minimum; reversing the extremum reverses the direction of the required inequality. This is exactly the sign asymmetry that A strict subsolution can fail the supersolution lower-test condition ↗ records.
  • Semicontinuity is part of the definition. The subsolution must be upper semicontinuous and the supersolution lower semicontinuous: those are the classes in which the tested extrema behave well under localisation and limits. No continuity of u on U and no almost-everywhere class is assumed; a merely locally bounded function is handled through the two envelopes in Discontinuous viscosity solutions through the two envelopes.
  • The initial condition is relaxed. The limsup/liminf condition is imposed at points of the initial face through sequences with s>0; it does not require u to extend to t=0. For a continuous u the two relaxed conditions force u(x,s)→u0(x) as (y,s)→(x,0), hence the pointwise equality. No choice principle is used.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Strictification of a viscosity test function by a quartic perturbation

Statement

Let U⊆Rm be open, let v:U→R, let ϕ∈C1(U), suppose v−ϕ has a local maximum at z0∈U, and fix r>0 with B‾(z0,r)⊆U and v(z)−ϕ(z)≤v(z0)−ϕ(z0) for every z∈B‾(z0,r). For ε>0 define ϕε(z):=ϕ(z)+ε∣z−z0∣4. Then ϕε∈C1(U) agrees with ϕ to first order at the contact, ϕε(z0)=ϕ(z0),Dϕε(z0)=Dϕ(z0), and v−ϕε has a strict maximum over B‾(z0,r) at z0: v(z)−ϕε(z)<v(z0)−ϕε(z0)for every z∈B‾(z0,r)∖{z0}. The same statement with ϕε:=ϕ−ε∣z−z0∣4 strictifies a local minimum contact of a test function, and the first jet at the contact is again unchanged. No choice principle is used.

Facts & Assumptions

Given: An open U⊆Rm, functions v:U→R and ϕ∈C1(U), a point z0∈U, a radius r>0 with B‾(z0,r)⊆U and v(z)−ϕ(z)≤v(z0)−ϕ(z0) for all z∈B‾(z0,r), and for ε>0 the function ϕε(z)=ϕ(z)+ε∣z−z0∣4.

[F1]

The map q(z):=∣z−z0∣4 is a polynomial in the coordinates of z, hence of class C1 on Rm, with q(z0)=0 and Dq(z0)=0; more precisely Dq(z)=4∣z−z0∣2(z−z0) for every z, the derivative being the total derivative in the sense of The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder and its components the partial derivatives of Directional derivatives and partial derivatives of a map U⊆Rm→Rn.

[F2]

If f,g are C1 on an open set, then so is f+g, with D(f+g)=Df+Dg and (f+g)(z0)=f(z0)+g(z0) (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, Directional derivatives and partial derivatives of a map U⊆Rm→Rn).

Proof

technique · an explicit perturbation whose first jet vanishes at the contact
1.1F1F2algebra

Regularity and first jet. The function q(z)=∣z−z0∣4 is a polynomial with q(z0)=0 and Dq(z0)=0 by [F1]; adding it to the C1 function ϕ with coefficient ε>0 gives ϕε∈C1(U) with ϕε(z0)=ϕ(z0)+εq(z0)=ϕ(z0) and Dϕε(z0)=Dϕ(z0)+εDq(z0)=Dϕ(z0) by [F2].

2.1step 1.1algebra

Strict maximum. Let z∈B‾(z0,r) with z≠z0. Then ∣z−z0∣4>0, and the hypothesised maximum inequality gives v(z)−ϕ(z)≤v(z0)−ϕ(z0); subtracting the positive quantity ε∣z−z0∣4 from the left-hand side and using ϕε=ϕ+ε∣⋅−z0∣4 and ϕε(z0)=ϕ(z0), we get v(z)−ϕε(z)≤v(z0)−ϕ(z0)−ε∣z−z0∣4<v(z0)−ϕ(z0)=v(z0)−ϕε(z0). Hence z0 is the strict maximum of v−ϕε over B‾(z0,r).

3.1step 2.1F1F2algebra

Minimum case. If v−ϕ has a local minimum at z0 with v(z)−ϕ(z)≥v(z0)−ϕ(z0) on B‾(z0,r) and ϕε−:=ϕ−ε∣z−z0∣4, the same two computations with signs reversed give ϕε−(z0)=ϕ(z0), Dϕε−(z0)=Dϕ(z0) and v(z)−ϕε−(z)>v(z0)−ϕε−(z0) for every z∈B‾(z0,r)∖{z0}.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Step 1.1 and step 2.1 give the upper-contact statement, and step 3.1 gives the lower-contact statement; the proof used only the polynomial computation [F1] and additivity [F2], so it selects nothing and uses no choice principle.

Remarks

  • Why the quartic. The perturbation has value 0 and gradient 0 at the contact, so it changes neither the value nor the first jet tested in the viscosity inequalities, while it is strictly positive away from the contact and therefore turns a nonstrict contact into a strict one. This is the device that lets the stability and supremum-envelope arguments localise a maximum on a closed ball without losing the tested jet.
  • Scope. The statement is pointwise in the ball and does not require v to be semicontinuous, bounded or measurable; the compactness and extreme-value suppliers For n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact and Semicontinuous extreme value theorem on compact Euclidean sets are available for applications that patch such a ball maximum into a global one, and they are not needed for the computation above.
DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Discontinuous viscosity solutions through the two envelopes

Definition

Let n≥1, let O⊆Rn be open, T>0, let H:O×[0,T]×Rn→R be continuous, Z=O×(0,T), and let u0:O→R. A locally bounded function u:Z→R is a viscosity solution of the Cauchy problem if its upper semicontinuous envelope u∗ is a viscosity subsolution and its lower semicontinuous envelope u∗ is a viscosity supersolution in the sense of Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem, each carrying the initial datum u0 in the relaxed limsup/liminf sense. Both envelopes are taken over Z as a subset of Rn+1 (Upper and lower semicontinuous envelopes by local limsup and liminf); the subsolution inequalities are imposed at every point of Z and the relaxed initial conditions at every point of O.

A continuous viscosity solution is a viscosity solution u that is continuous on Z. For such a u one has u∗=u∗=u (apply The envelopes are the least upper and greatest lower semicontinuous functions on a small closed ball about each interior point, where continuity makes u bounded). The relaxed initial conditions give a continuous extension to the initial face with value u0, so the definition specializes to the one for continuous test functions. In the opposite direction, the envelope formulation is forced whenever u is not continuous: it keeps the subsolution inequality attached to u∗ and the supersolution inequality to u∗, and never asks a single discontinuous function to satisfy both.

Remarks

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Viscosity testing by first-order jets, and closure of the jet inequality

Statement

Let U⊆Rn+1 be open and let H:U×Rn→R be continuous. For w:U→R and z0∈U define the first-order superjet and subjet D+w(z0):={p=(px,pt)∈Rn×R: w(z)≤w(z0)+⟨p,z−z0⟩+o(∣z−z0∣)  (z→z0)}, D−w(z0):=−D+(−w)(z0)={p: w(z)≥w(z0)+⟨p,z−z0⟩+o(∣z−z0∣) (z→z0)}. Then: (1) an upper semicontinuous u:U→R is a viscosity subsolution of ut+H(x,t,Du)=0 in U if and only if pt+H(z0,px)≤0for all z0∈U and all p∈D+u(z0); (2) a lower semicontinuous v is a viscosity supersolution if and only if pt+H(z0,px)≥0 for all z0∈U and all p∈D−v(z0); (3) if u is such a subsolution, zk→z0 in U with u(zk)→u(z0), and pk∈D+u(zk) with pk→p, then pt+H(z0,px)≤0; the analogous closure statement holds for supersolutions and subjets. The closure statement does not assert that p itself belongs to D+u(z0); that membership may fail, and it is not needed. No choice principle is used.

Facts & Assumptions

Given: An open U⊆Rn+1, continuous H:U×Rn→R, an upper semicontinuous u:U→R, a lower semicontinuous v:U→R, and the superjet and subjet of the statement.

[F1]

u is a viscosity subsolution of ut+H(x,t,Du)=0 in U when ϕt(z0)+H(z0,Dϕ(z0))≤0 holds for every ϕ∈C1(U) and every z0∈U at which u−ϕ has a local maximum; v is a viscosity supersolution when the reverse inequality holds at every local minimum of v−ϕ (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

A map f defined near a is totally differentiable at a with derivative Df(a) exactly when f(a+h)=f(a)+Df(a)h+r(h) with ∥r(h)∥/∥h∥→0 as h→0 (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, Directional derivatives and partial derivatives of a map U⊆Rm→Rn).

[F3]

If g:[0,ρ]→R is continuous and G(r):=∫0rg, then G is differentiable at every r∈[0,ρ] with G′(r)=g(r) (The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive), the integral existing because a continuous function on a closed bounded interval is Riemann integrable (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion).

Proof

technique · a test function gives its own jet directly; conversely a jet is converted into a $C^1$ majorant whose radial part is built by integrating a continuous dyadic modulus
1.1F1F2algebra

Test functions produce jets. Suppose ϕ∈C1(U) and u−ϕ has a local maximum at z0; then for z near z0 we have u(z)−u(z0)≤ϕ(z)−ϕ(z0)=⟨Dϕ(z0),z−z0⟩+o(∣z−z0∣) by [F2], so Dϕ(z0)∈D+u(z0). If instead v−ϕ has a local minimum at z0, the same computation with the inequality reversed gives Dϕ(z0)∈D−v(z0). Hence the jet inequality for all jets implies the test-function inequality of [F1], in both the sub- and the supersolution case.

1.2F1F2F3F4algebra

Jets produce test functions. Assume u is an upper semicontinuous subsolution in the test-function sense and let p∈D+u(z0). Choose ρ>0 with B‾(z0,ρ)⊆U and put R(h):=u(z0+h)−u(z0)−⟨p,h⟩ for ∣h∣≤ρ. By the definition of D+u(z0), lim sup⁡h→0R(h)/∣h∣≤0, so r+(h):=max⁡{R(h),0}=o(∣h∣). Define μ(s):=sup⁡{r+(h)/∣h∣:0<∣h∣≤s} for 0<s≤ρ. This supremum is finite: the jet condition bounds the quotient near h=0, and on every remaining closed annulus u(z0+h) is bounded above by upper semicontinuity and compactness [F4]. Thus μ is finite and nondecreasing, μ(s)→0 as s↓0, and r+(h)≤μ(∣h∣)∣h∣. The function μ need not be continuous, so we first construct a continuous majorant. Put rk:=2−kρ and ak:=μ(rk) for k≥0. Define ν(0):=0, set ν(rk):=ak−1 for k≥1, interpolate linearly on each [rk+1,rk], and set ν(s):=a0 on [ρ/2,ρ]. The definitions agree at r1=ρ/2, ν is continuous with ν(s)→0 at 0, and ν(s)≥μ(s): on [rk+1,rk], ν(s)≥ak=μ(rk)≥μ(s), while on [ρ/2,ρ] it equals μ(ρ). Let σ(s):=max⁡{0,min⁡{1,2(ρ−s)/ρ}}, continuous with σ=1 on [0,ρ/2] and σ(ρ)=0, and put g(s):=2ν(min⁡{2s,ρ})σ(s); this is continuous on [0,ρ], with g(0)=g(ρ)=0. Define λ(r):=∫0rg(s) ds for 0≤r≤ρ and λ(r):=λ(ρ) for r>ρ. By [F3], λ′(r)=g(r) on [0,ρ], and g(ρ)=0 makes the constant extension C1. For 0<r≤ρ/2, λ(r)≥∫r/2r2ν(2s) ds≥∫r/2r2μ(r) ds=rμ(r), because 2s≥r, ν(2s)≥μ(2s)≥μ(r) and σ=1 there. Hence λ(∣h∣)≥r+(h)≥R(h) for 0<∣h∣≤ρ/2. Define ϕ(z):=u(z0)+⟨p,z−z0⟩+λ(∣z−z0∣) on U. Then u−ϕ has a local maximum at z0, and Dϕ(z0)=p because λ(r)/r≤max⁡0≤s≤rg(s)→0. The radial term has gradient g(∣z−z0∣)(z−z0)/∣z−z0∣ off z0, which tends to 0 there; thus ϕ∈C1(U). The subsolution inequality [F1] gives pt+H(z0,px)≤0. The subjet case applies this construction to −v and −p, then negates the resulting test function, giving pt+H(z0,px)≥0 for every p∈D−v(z0).

2.1step 1.1step 1.2F1

Parts (1) and (2). Step 1.1 shows that the jet inequalities imply the test-function inequalities. Step 1.2 proves the reverse implication by constructing a C1 test for every prescribed jet, with signs reversed for subjets. Hence both equivalences (1) and (2) hold.

3.1step 2.1algebra∎

Closure. Let u be a subsolution in the test-function sense, let zk→z0 in U, and let pk∈D+u(zk) with pk→p. Fix k. By step 2.1, part (1), applied at zk, we have pkt+H(zk,pkx)≤0. Since (zk,pk)→(z0,p) and H is continuous, passing to the limit in the inequality gives pt+H(z0,px)≤0, which is the closure statement for subsolutions; the same argument with the inequalities reversed and subjets in place of superjets gives the supersolution statement. The limit p need not lie in D+u(z0), and this is not used.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Classical solutions are viscosity solutions and differentiable viscosity solutions solve the equation pointwise

Statement

Let O⊆Rn be open, T>0, let H:O×[0,T]×Rn→R be continuous, let u0:O→R be continuous, and let Z=O×(0,T). (1) If u∈C1(Z)∩C0(Z‾) satisfies ut+H(x,t,Du)=0 pointwise on Z and u(x,0)=u0(x) on O (a classical solution in the sense of The Hamilton--Jacobi Cauchy problem and its classical solutions), then u is a viscosity solution of the Cauchy problem. (2) Conversely, if u:Z→R is a continuous viscosity solution and u is differentiable at a point z0∈Z, then ut(z0)+H(z0,Du(z0))=0. In particular, a viscosity solution of class C1(Z) is a classical solution of the equation on Z (its initial trace being part of the Cauchy-problem notion). No choice principle is used.

Facts & Assumptions

Given: Open O⊆Rn, T>0, continuous H:O×[0,T]×Rn→R, continuous u0:O→R, Z=O×(0,T).

[F1]

w is a viscosity subsolution of ut+H(x,t,Du)=0 in Z when ϕt(z0)+H(z0,Dϕ(z0))≤0 at every local maximum of w−ϕ, ϕ∈C1(Z); a supersolution satisfies the reverse inequality at every local minimum; a subsolution of the Cauchy problem also satisfies lim sup⁡(y,s)→(x,0), s>0, y∈Ow(y,s)≤u0(x) and a supersolution lim inf⁡(y,s)→(x,0), s>0, y∈Ow(y,s)≥u0(x) at every x∈O (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

If a real-valued function on an open set is differentiable at a point where it has a local maximum or a local minimum, then its total derivative vanishes there (Fermat's theorem: an interior differentiable local extremum has zero gradient).

[F3]

For an upper semicontinuous u: u is a viscosity subsolution of the equation in Z if and only if pt+H(z0,px)≤0 for every z0∈Z and every p∈D+u(z0); for a lower semicontinuous v: v is a supersolution if and only if pt+H(z0,px)≥0 for every p∈D−v(z0) (Viscosity testing by first-order jets, and closure of the jet inequality).

[F4]

Total differentiability of u at z0 with derivative Du(z0) means u(z0+h)=u(z0)+Du(z0)h+o(∣h∣); consequently Du(z0)∈D+u(z0)∩D−u(z0) (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, Directional derivatives and partial derivatives of a map U⊆Rm→Rn).

Proof

technique · Fermat's theorem at a $C^1$ contact for the classical direction, and the jet characterisation for the converse
1.1F1F2algebra

Classical solutions are viscosity solutions. Let u∈C1(Z)∩C0(Z‾) solve the equation pointwise, and let ϕ∈C1(Z) with u−ϕ having a local maximum at z0∈Z. Then u−ϕ is differentiable at z0 and has a local extremum there, so Dϕ(z0)=Du(z0) by [F2]; hence ϕt(z0)+H(z0,Dϕ(z0))=ut(z0)+H(z0,Du(z0))=0≤0. At a local minimum the same computation gives ϕt(z0)+H(z0,Dϕ(z0))=0≥0. Since u extends continuously to Z‾ with u(x,0)=u0(x), the relaxed initial conditions of [F1] hold; so u is both a subsolution and a supersolution of the Cauchy problem.

1.2F1F3F4

Differentiable viscosity solutions solve the equation pointwise. Let u:Z→R be continuous and differentiable at z0∈Z. By [F4], Du(z0)∈D+u(z0)∩D−u(z0); since u is a continuous viscosity solution, it equals its envelopes (Discontinuous viscosity solutions through the two envelopes), so u is both an upper semicontinuous subsolution and a lower semicontinuous supersolution in the sense of [F1]. Applying [F3] at z0 with p=Du(z0) gives both ut(z0)+H(z0,Du(z0))≤0 and ut(z0)+H(z0,Du(z0))≥0, hence equality.

2.1step 1.1step 1.2F1∎

Conclusion. If in addition u∈C1(Z), then the pointwise equation holds at every z0∈Z by step 1.2, and by step 1.1 the classical solution is a viscosity solution; the initial trace of a Cauchy-problem viscosity solution is the datum by [F1], so a C1 viscosity solution solves the equation classically on Z and extends continuously to the initial face. To be a classical solution of the Cauchy problem in the stronger sense of The Hamilton--Jacobi Cauchy problem and its classical solutions, it must additionally extend continuously to all of Z‾.

Remarks

  • What is not claimed. Part (2) presupposes that the viscosity solution is differentiable at the point; viscosity solutions of Hamilton--Jacobi equations are typically not differentiable everywhere, and the proposition says nothing about the nondifferentiable set.
  • Choice. Both directions are pointwise computations with the definitions; no selection principle occurs.
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Finite maxima of subsolutions and finite minima of supersolutions

Statement

Let n≥1 and k≥1, let U⊆Rn+1 be open, and let H:U×Rn→R be continuous. (1) If u1,…,uk are viscosity subsolutions of ut+H(x,t,Du)=0 in U, then u:=max⁡(u1,…,uk) is a viscosity subsolution in U. (2) If v1,…,vk are viscosity supersolutions, then v:=min⁡(v1,…,vk) is a viscosity supersolution in U. (3) For the Cauchy problem on Z=O×(0,T) the same statements hold when all the functions carry the same continuous initial datum u0 in the relaxed sense; the maximum of subsolutions then also satisfies the relaxed initial condition for u0. The mixed operations are not asserted: a finite minimum of subsolutions and a finite maximum of supersolutions need not preserve the corresponding inequality when the equation has a zero-order term. No choice principle is used.

Facts & Assumptions

Given: An open U⊆Rn+1, continuous H:U×Rn→R, viscosity subsolutions u1,…,uk and supersolutions v1,…,vk of ut+H(x,t,Du)=0 in U, and u=max⁡(u1,…,uk), v=min⁡(v1,…,vk).

[F1]

Each ui is upper semicontinuous and satisfies ϕt(z0)+H(z0,Dϕ(z0))≤0 at every local maximum z0 of ui−ϕ, ϕ∈C1(U); each vj is lower semicontinuous and satisfies the reverse inequality at every local minimum of vj−ϕ (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

For all reals a1,…,ak the set {a1,…,ak} has a maximum and a minimum, and its maximum equals one of the ai (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[F3]

A real-valued function has a local maximum at z0 when it is defined on a neighbourhood of z0 and its value there is at most its value at z0 (Local and strict local extrema for scalar fields on Euclidean open sets).

Proof

technique · select the active index at the contact
1.1F1F2F3algebra

Finite maxima of subsolutions. The function u=max⁡(u1,…,uk) is the pointwise maximum of finitely many upper semicontinuous functions and is therefore upper semicontinuous. Let ϕ∈C1(U) and let u−ϕ have a local maximum at z0∈U; by [F2] there is an index i with ui(z0)=u(z0). Since ui≤u pointwise, for every z in a neighbourhood of z0 we have ui(z)−ϕ(z)≤u(z)−ϕ(z)≤u(z0)−ϕ(z0)=ui(z0)−ϕ(z0); hence ui−ϕ has a local maximum at z0 by [F3], and the subsolution inequality for ui gives ϕt(z0)+H(z0,Dϕ(z0))≤0. Therefore u is a viscosity subsolution.

1.2F1F2F3algebra

Finite minima of supersolutions. If v=min⁡(v1,…,vk) and ϕ∈C1(U) with v−ϕ having a local minimum at z0, [F2] gives an index j with vj(z0)=v(z0); since v≤vj and v(z0)=vj(z0), for z near z0 we have vj(z)−ϕ(z)≥v(z)−ϕ(z)≥v(z0)−ϕ(z0)=vj(z0)−ϕ(z0), so vj−ϕ has a local minimum at z0 and ϕt(z0)+H(z0,Dϕ(z0))≥0 by [F1]. Hence v is a viscosity supersolution, and it is lower semicontinuous as a finite minimum of lower semicontinuous functions.

2.1step 1.1step 1.2F1algebra

The Cauchy problem. Suppose all ui and vj satisfy the relaxed initial conditions with the same continuous datum u0. Fix x∈O and write Li:=lim sup⁡(y,s)→(x,0), s>0ui(y,s)≤u0(x). For any real c>max⁡iLi, the definition of each limsup gives a neighbourhood Ni of (x,0) on which ui<c in Z; the finite intersection of these neighbourhoods then has max⁡iui<c, so lim sup⁡max⁡iui≤max⁡iLi≤u0(x). The reverse inequality lim sup⁡max⁡iui≥max⁡iLi follows from max⁡iui≥ui for each i. Dually, put Mj:=lim inf⁡(y,s)→(x,0), s>0vj(y,s)≥u0(x). For any real c<min⁡jMj, each liminf gives a neighbourhood Nj on which vj>c in Z; on their finite intersection min⁡jvj>c, so lim inf⁡min⁡jvj≥min⁡jMj≥u0(x). The reverse inequality follows from min⁡jvj≤vj for every j. These finite-neighbourhood arguments also cover infinite relaxed limits and use no sequence extraction. With steps 1.1 and 1.2, the maximum of the subsolutions and minimum of the supersolutions satisfy the relaxed Cauchy conditions.

3.1step 1.1step 1.2step 2.1∎

Conclusion. Steps 1.1 and 1.2 prove the interior statements (1) and (2), and step 2.1 proves (3). Nothing is selected beyond a finite index, supplied by [F2], and no envelope or infinite supremum is used; the mixed operations are not claimed.

Remarks

The passage from finite families to arbitrary suprema requires upper regularisation and local boundedness, which is treated in The upper envelope of a locally bounded supremum of subsolutions is a subsolution.

  • Why the mixed operations fail. The active-index argument requires the function that touches ϕ to be the same function that satisfies the one-sided inequality; for a maximum of subsolutions the active function is a subsolution, for a minimum of supersolutions it is a supersolution, and no argument of this shape covers a minimum of subsolutions. The companion counterexample Minima of viscosity subsolutions need not be subsolutions ↗ shows the failure is genuine for an equation with a zero-order term.
  • Choice. Only finitely many indices are involved and the selection is made inside a finite set, so no choice principle is used.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Stability of viscosity sub-, super- and solutions under locally uniform convergence

Statement

Let O⊆Rn be open, T>0, Z=O×(0,T), and Z0=O×[0,T). Let Hk,H:O×[0,T]×Rn→R be continuous with Hk→H uniformly on every compact subset as k→∞. For each k, let uk:Z0→R be continuous, with uk restricted to Z a viscosity subsolution of (uk)t+Hk(x,t,Duk)=0 and with uk(x,0)=u0(k)(x). Suppose u0(k)→u0 locally uniformly on O and uk→u locally uniformly on Z0. Then u is a viscosity subsolution of ut+H(x,t,Du)=0 in Z and its continuous initial trace is u0. The same statement holds for supersolutions, and combining the two, locally uniform limits of viscosity solutions are viscosity solutions. The conclusion is insensitive to the sign of the approximation: no differentiability and no monotonicity of convergence is used, only local uniformity up to the initial face. No choice principle is used.

Facts & Assumptions

Given: Open O⊆Rn, T>0, Z=O×(0,T), Z0=O×[0,T), continuous Hk,H, continuous uk:Z0→R with uk→u locally uniformly on Z0, continuous data u0(k)→u0 locally uniformly on O, and uk∣Z a viscosity subsolution of (uk)t+Hk(x,t,Duk)=0.

[F1]

uk∣Z is upper semicontinuous and satisfies ϕt(z0)+Hk(z0,Dϕ(z0))≤0 at every z0∈Z at which uk−ϕ has a local maximum, ϕ∈C1(Z) (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

If v−ϕ has a local maximum at z0 for a C1 test ϕ, and r>0 is such that v−ϕ≤v(z0)−ϕ(z0) on B‾(z0,r)⊆U, then for every ε>0 the function ϕε:=ϕ+ε∣z−z0∣4 is C1 with ϕε(z0)=ϕ(z0), Dϕε(z0)=Dϕ(z0) and v−ϕε strictly maximised over B‾(z0,r) at z0 (Strictification of a viscosity test function by a quartic perturbation).

[F3]

A nonempty subset of Rm is compact if and only if it is closed and bounded, and every continuous real-valued function on a nonempty compact subset attains a maximum and a minimum there (For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

[F4]

In this statement, local uniform convergence on Z0 means that for every compact K⊆Z0 and every η>0 there is N such that ∣uk(z)−u(z)∣<η for all k≥N and z∈K; the Hamiltonians and data have the analogous meaning on their stated domains. Compactness here is intrinsic (Open cover, subcover, compact metric space, and compact subset of a metric space). In particular u is continuous: on a small compact relative neighbourhood of any point, approximate u within η/3 by one continuous uk, then use continuity of that uk and the triangle inequality to bound the variation of u by η. This convergence condition is an explicit convention here.

Proof

technique · compact maximum localisation and passage to the limit in the test inequality
1.1F1F3F4algebra

The strict-contact case. Let ϕ∈C1(Z) and suppose u−ϕ has a strict local maximum at z0∈Z. Choose r>0 with K:=B‾(z0,r)⊆Z and strict inequality at every point of K∖{z0}. For each k, let Mk be the nonempty compact set of maximisers of uk−ϕ on K; it is compact because uk−ϕ is continuous. For every r0∈(0,r), the upper semicontinuous function u−ϕ has a strict gap below its value at z0 on the compact annulus K∖B(z0,r0). Uniform convergence on K therefore puts every point of Mk inside B(z0,r0) for all sufficiently large k. Since r0 is arbitrary, sup⁡z∈Mk∣z−z0∣→0, without choosing a maximiser for each k. Every point z∈Mk is then an interior local maximum of uk−ϕ and satisfies [F1]. If the desired residual ϕt(z0)+H(z0,Dϕ(z0)) were positive, continuity would make ϕt(z)+H(z,Dϕ(z)) positive on a neighbourhood of z0; uniform convergence of Hk to H on the compact set K×Dϕ(K) would make ϕt(z)+Hk(z,Dϕ(z))>0 there for all large k. This contradicts [F1] at every point of the nonempty set Mk. Hence the subsolution inequality holds at z0.

2.1F1F4algebra

The initial trace and the supersolution case. The local uniform convergence on Z0 makes u continuous on Z0 with u(x,0)=lim⁡kuk(x,0)=lim⁡ku0(k)(x)=u0(x) for every x∈O, the convergence on compact subsets of O being uniform; hence u has the continuous initial trace u0 and satisfies the relaxed initial condition lim sup⁡(y,s)→(x,0),s>0u(y,s)=u0(x). The same argument as in step 1.1 with local minima in place of local maxima, and the supersolution inequality of [F1] in place of the subsolution inequality, shows that a locally uniform limit of supersolutions is a supersolution with the same initial trace; no sign of the convergence is used, only that the test function is fixed.

3.1step 1.1step 2.1F2∎

Removal of strictness and conclusion. If u−ϕ merely has a (nonstrict) local maximum at z0, fix r>0 with B‾(z0,r)⊆Z on which the maximum inequality holds and strictify: by [F2], ϕε=ϕ+ε∣z−z0∣4 satisfies Dϕε(z0)=Dϕ(z0), ∂tϕε(z0)=ϕt(z0) and makes u−ϕε strictly maximised at z0 over B‾(z0,r); step 1.1 applied to ϕε gives ϕt(z0)+H(z0,Dϕ(z0))≤0. Hence u is a viscosity subsolution of the limit equation in Z, and by step 2.1 it carries the datum u0; the supersolution statement and the solution statement follow by step 2.1 and by combining the two one-sided conclusions.

Remarks

  • Where local uniformity up to t=0 is needed. The interior equation only uses convergence on compact subsets of Z; the initial trace uses the convergence on compact subsets of Z0, which includes the initial face. Interior convergence alone would not imply the boundary conclusion, and the theorem does not claim it.
  • Choice. The proof uses the sets of maximisers on compact balls and the uniform strict gap away from the limiting contact; it selects no sequence of points and uses no choice principle.
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Half-relaxed limits of a locally bounded family

Definition

Let U⊆Rm be open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and let (uε)ε∈(0,1) be a family of real-valued functions on U that is locally bounded: for every compact K⊆U there is MK<∞ with ∣uε(y)∣≤MK for all ε∈(0,1) and y∈K. The upper half-relaxed limit and the lower half-relaxed limit of the family, computed in R‾ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, Greatest lower bound (infimum), Epsilon characterisation of the supremum), are u‾(z):=lim sup⁡ε↓0U∋y→zuε(y):=inf⁡δ>0 sup⁡{uε(y):0<ε<δ, y∈U, ∣y−z∣<δ}, u‾(z):=lim inf⁡ε↓0U∋y→zuε(y):=sup⁡δ>0 inf⁡{uε(y):0<ε<δ, y∈U, ∣y−z∣<δ}. The quantifiers range over the index ε and the point y simultaneously, so the limit records the behaviour of the whole family near z, not the limit of the single family of values (uε(z))ε; both envelopes are local and depend only on the germ of the family at z.

Remarks

  • Basic properties. If the family converges locally uniformly on U to a continuous function u, then u‾=u‾=u. If the family is only locally bounded, then u‾≤u‾ pointwise, and u‾ is upper semicontinuous while u‾ is lower semicontinuous on U: the expressions are again monotone limits of local suprema and infima over families, and the proof of The envelopes are the least upper and greatest lower semicontinuous functions applies verbatim with the family indexed by δ. Every value is kept in R‾; local boundedness makes both envelopes real-valued on each compact subset of U.
  • Why the joint limit. Under Countable Choice, there are pairs (εj,yj)→(0,z) with uεj(yj)→u‾(z), and likewise for u‾(z). For finite lower limit, take the infima over 0<ε<1/j, ∣y−z∣<1/j and choose a point within 1/j of each infimum; these infima increase to u‾(z). The upper case is dual, with suprema decreasing to u‾(z). Infinite values use diverging finite thresholds. The definition itself is set-based and selects no subsequence or point; only this sequential characterization uses Countable Choice. This is the limit notion consumed by Half-relaxed limits of sub- and supersolutions with vanishing perturbations.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Half-relaxed limits of sub- and supersolutions with vanishing perturbations

Statement

Let O⊆Rn be open, T>0, Z=O×(0,T), let Hε,H:O×[0,T]×Rn→R be continuous for ε∈(0,1), and let (uε) be a locally bounded family of real functions on Z that are upper semicontinuous in the subsolution case. Assume one of the two forms of the Hamiltonian condition: (a) Hε→H uniformly on compact subsets of O×[0,T]×Rn; or (b) the exact limit-inferior condition: for all sequences εj↓0, zj→z∈Z and pj→p one has lim inf⁡jHεj(zj,pj)≥H(z,p). Suppose moreover that for every ϕ∈C1(Z) and every local maximum point zε∈Z of uε−ϕ there holds ϕt(zε)+Hε(zε,Dϕ(zε))≤cε(zε), where cε:Z→[0,∞) is locally bounded with cε→0 locally uniformly. Then the upper half-relaxed limit u‾ (Half-relaxed limits of a locally bounded family) is a viscosity subsolution of ut+H(x,t,Du)=0 in Z. If in addition uε(x,0)≤u0(ε)(x) in the relaxed sense with u0(ε)→u0 locally uniformly on O and the family is locally equicontinuous up to the initial face, then u‾ carries the initial datum u0 in the relaxed sense. The dual statement with lim sup⁡jHεj(zj,pj)≤H(z,p), ≥−cε and the lower half-relaxed limit holds for supersolutions. Choice. Under hypothesis (a) the proof is choice-free. Under hypothesis (b) it extracts a sequence of near-maximisers at the relaxed limit and therefore uses Countable Choice (The Axiom of Countable Choice (ACω)), which is declared as a dependency; the extraction is the only place where the principle is consumed.

Facts & Assumptions

Given: The open sets O⊆Rn, Z=O×(0,T), continuous Hamiltonians Hε,H, a locally bounded family (uε) of real functions on Z, locally bounded perturbations cε≥0 with cε→0 locally uniformly, and the half-relaxed limits u‾,u‾ of Half-relaxed limits of a locally bounded family.

[F1]

u‾(z)=inf⁡δ>0sup⁡{uε(y):0<ε<min⁡{1,δ}, y∈Z, ∣y−z∣<δ} and u‾(z)=sup⁡δ>0inf⁡{uε(y):0<ε<min⁡{1,δ}, y∈Z, ∣y−z∣<δ}; local boundedness makes both real-valued on compact subsets of Z; u‾ is upper semicontinuous and u‾ lower semicontinuous (Half-relaxed limits of a locally bounded family).

[F2]

At every local maximum of uε−ϕ with ϕ∈C1(Z) the assumed inequality ϕt(zε)+Hε(zε,Dϕ(zε))≤cε(zε) holds; a viscosity subsolution of the limit equation is a function that satisfies ϕt(z0)+H(z0,Dϕ(z0))≤0 at every local maximum of the function and test function (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F3]

If v−ϕ has a local maximum at z0 and B‾(z0,r)⊆U is a ball on which v−ϕ≤v(z0)−ϕ(z0), then for every ε>0 the perturbed test ϕε=ϕ+ε∣z−z0∣4 has the same value and first jet as ϕ at z0 and makes v−ϕε strictly maximised over B‾(z0,r) at z0 (Strictification of a viscosity test function by a quartic perturbation).

[F4]

Every upper semicontinuous real-valued function on a nonempty compact subset of Rm attains its maximum there (Semicontinuous extreme value theorem on compact Euclidean sets).

[F5]

Countable Choice is the principle that every sequence (Sj)j≥1 of nonempty sets has a sequence of choices (sj) with sj∈Sj (The Axiom of Countable Choice (ACω)).

[F7]

Local equicontinuity up to the initial face gives each uε a continuous trace uε0(x):=lim⁡(y,s)→(x,0), s>0uε(y,s) and a common local modulus there; the relaxed initial inequality implies uε0(x)≤u0(ε)(x).

Proof

technique · separate the uniform case (a) from the sequential case (b); in case (a) the argument uses a single near-maximal pair and one compact maximiser, and in case (b) a sequence of near-maximisers is extracted at the relaxed limit
1.1F1F2F4F6algebra

Case (a): the strict-contact case, choice-free. Let ϕ∈C1(Z) and let u‾−ϕ have a strict local maximum at z0=(x0,t0)∈Z. Choose ρ>0 with B‾(z0,ρ)⊆Z and strict inequality away from z0. Assume for contradiction that θ:=ϕt(z0)+H(z0,Dϕ(z0))>0. By continuity there is r∈(0,ρ/2) such that ϕt(z)+2(t−t0)+H(z,Dϕ(z)+2(x−x0))>3θ/4 for ∣z−z0∣≤r. The compact annulus Ar:={z:r/2≤∣z−z0∣≤r} has a strict gap g:=u‾(z0)−ϕ(z0)−max⁡Ar(u‾−ϕ)>0 by [F1, F4]. Write z=(x,t) and z0=(x0,t0). For each z∈Ar, the defining infimum for u‾(z) gives δz>0 such that uε(y)<u‾(z)+g/8 whenever 0<ε<δz and ∣y−z∣<δz; shrink δz so also ∣ϕ(y)+∣y−z0∣2−ϕ(z)−∣z−z0∣2∣<g/8 there. Use the collection of all pairs (z,δ) satisfying these bounds; their balls B(z,δ/2) cover Ar without choosing one radius at each point. By compactness and [F6], finitely many such balls B(zi,δi/2) cover Ar; let εA:=min⁡iδi. For every 0<ε<εA and y∈Ar, these bounds give uε(y)−ϕ(y)−∣y−z0∣2<u‾(zi)−ϕ(zi)−∣zi−z0∣2+g/4≤u‾(z0)−ϕ(z0)−3g/4 for some i. Uniform convergence Hε→H on compact subsets and local uniform convergence cε→0 provide εH>0 such that for ε<εH and ∣z−z0∣≤r, the corresponding upper-test residual with gradient Dϕ(z)+2(x−x0) is >θ/2 and cε(z)<θ/2. Choose 0<η<g/12 and then δ<min⁡{r/4,εA,εH} so that ∣ϕ(y)−ϕ(z0)∣<η and ∣y−z0∣2<η when ∣y−z0∣<δ. By [F1] there is one pair (ε,y) with 0<ε<δ, ∣y−z0∣<δ and uε(y)>u‾(z0)−η. Let zε maximise the upper semicontinuous function uε(z)−ϕ(z)−∣z−z0∣2 on the compact ball B‾(z0,r), possible by [F4]. Its value is >u‾(z0)−ϕ(z0)−3η, so the uniform annulus bound forces ∣zε−z0∣<r/2. Thus uε−(ϕ+∣z−z0∣2) has a local maximum at zε. Writing z0=(x0,t0) and zε=(xε,tε), the test has time derivative ϕt(zε)+2(tε−t0) and spatial gradient Dϕ(zε)+2(xε−x0); its residual is >θ/2 while cε(zε)<θ/2, contradicting the assumed subsolution inequality. Hence ϕt(z0)+H(z0,Dϕ(z0))≤0 at every strict local maximum.

1.2F1F7algebra

The initial trace. Assume the relaxed initial inequality and data convergence of the statement, and use the traces of [F7]. Fix x∈O and η>0. By local equicontinuity and continuity of u0(ε)→u0 there is a neighbourhood V of (x,0) such that, for all sufficiently small ε and (y,s)∈V∩Z, uε(y,s)≤uε0(x)+η≤u0(ε)(x)+η≤u0(x)+2η. Shrink to a neighbourhood V′ whose closure lies in V. For each z′∈V′∩Z sufficiently close to (x,0), the neighborhoods in the definition of u‾(z′) can be taken inside V, so the same bound gives u‾(z′)≤u0(x)+2η. Therefore lim sup⁡(y,s)→(x,0), s>0u‾(y,s)≤u0(x)+2η; letting η↓0 proves the relaxed subsolution initial condition. The lower-limit argument is the dual one.

2.1F1F2F4F5F6algebra

Case (b): the strict-contact case with near-maximiser extraction. Assume the exact limit-inferior condition and let ϕ and z0 be as in step 1.1. For each j≥1, consider triples (ε,y,z) with 0<ε<min⁡{1,1/j}, y∈Z, ∣y−z0∣<min⁡{ρ/2,1/j}, uε(y)>u‾(z0)−1/j, and z a maximiser of uε(⋅)−ϕ(⋅)−∣⋅−z0∣2 on B‾(z0,ρ). This set is nonempty by [F1] and [F4]; Countable Choice [F5] selects triples (εj,yj,zj). Then εj→0, yj→z0 and the maximal values satisfy uεj(zj)−ϕ(zj)−∣zj−z0∣2≥u‾(z0)−ϕ(z0)−o(1). Fix any r∈(0,ρ). The strict maximum of u‾−ϕ gives a positive gap on the compact annulus r/2≤∣z−z0∣≤ρ; the finite-cover argument of step 1.1 then bounds uε(z)−ϕ(z)−∣z−z0∣2 strictly below u‾(z0)−ϕ(z0) on this annulus for all sufficiently small ε. Since εj→0 and the maximizing values are at least that limit minus o(1), eventually ∣zj−z0∣<r/2. As r>0 was arbitrary, zj→z0. By taking the canonical strictly decreasing subsequence of (εj) (at each stage use the least later index with smaller ε, which exists because εj→0) and relabelling, we may assume εj↓0; then zj→z0 still. Eventually zj is interior to B‾(z0,ρ), so ψj:=ϕ+∣z−z0∣2 is a local upper test for uεj there. Thus ϕt(zj)+2(tj−t0)+Hεj(zj,Dϕ(zj)+2(xj−x0))≤cεj(zj). Writing zj=(xj,tj), the extra time derivative 2(tj−t0) tends to zero. Since the gradients converge and cεj(zj)→0, taking the limit inferior of the displayed inequality and using (b) gives ϕt(z0)+H(z0,Dϕ(z0))≤0. Condition (a) implies (b) by uniform convergence on compact sets, so this proves the strict-contact case.

3.1step 1.1step 1.2step 2.1F3∎

General contacts, the dual statement and conclusion. If u‾−ϕ merely has a local maximum at z0, strictify with [F3] and apply the strict-contact conclusion of steps 1.1 or 2.1 to the strictified test; the perturbed test has the same value and first jet at z0, so the resulting inequality is exactly ϕt(z0)+H(z0,Dϕ(z0))≤0. Hence u‾ is a viscosity subsolution of the limit equation, and by step 1.2 it carries the initial datum when the additional hypotheses hold. The dual argument, replacing uε by −uε and local maxima by local minima, shows that u‾ is a viscosity supersolution with the dual initial condition. The half-relaxed limits themselves are computed as infima and suprema over sets, and only step 2.1 involves a countable selection, so under hypothesis (a) no choice principle is used and under hypothesis (b) Countable Choice is used exactly as declared.

Remarks

  • The role of cε. The vanishing perturbation cε is the fixed-test mechanism used for the viscous equation ut+H(x,t,Du)=εΔu, where the extra term εΔϕ is locally bounded and tends to 0 uniformly on compact sets for a fixed C1,2 test. This is not directly the theorem's hypothesis for all C1 tests with one common error function; Vanishing viscosity selects the viscosity solution supplies the fixed-test argument and smooth approximation needed there.
  • Choice ledger. Case (a), which is the case used by the vanishing-viscosity argument of this page, is choice-free: a single near-maximal pair and a single compact maximiser suffice. Case (b) needs Countable Choice to turn the defining infimum-of-suprema at the relaxed limit into a sequence of near-maximisers; this is the use of choice declared in the statement.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Doubling variables: existence, relative contacts at the maximiser and localisation

Statement

Let n≥1, T>0, let u:Rn×[0,T]→R be bounded above and upper semicontinuous, and let v:Rn×[0,T]→R be bounded below and lower semicontinuous. Fix α,ρ>0 and define Φ(x,y,t,s):=u(x,t)−v(y,s)−α2∣x−y∣2−α2∣t−s∣2−ρ (∣x∣2+∣y∣2) on Rn×Rn×[0,T]2, with Mα,ρ:=sup⁡Φ. Then: (1) Mα,ρ is finite and attained, and at every maximiser (xα,yα,tα,sα) the C1 test functions ψ1(x,t):=α2∣x−yα∣2+α2∣t−sα∣2+ρ∣x∣2,ψ2(y,s):=−α2∣xα−y∣2−α2∣tα−s∣2−ρ∣y∣2 satisfy: u−ψ1 has a local maximum at (xα,tα) and v−ψ2 has a local minimum at (yα,sα), with pα:=Dxψ1(xα)=α(xα−yα)+2ρxα,qα:=Dyψ2(yα)=α(xα−yα)−2ρyα,pα0:=∂tψ1(tα)=∂sψ2(sα)=α(tα−sα); (2) for each fixed ρ>0, along any sequence of maximisers as α→∞, α(∣xα−yα∣2+∣tα−sα∣2)⟶0,(1+∣pα∣)(∣xα−yα∣+∣tα−sα∣)⟶0,∣xα−yα∣+∣tα−sα∣⟶0, while ∣qα−pα∣=2ρ∣xα+yα∣ is bounded by 2ρ(∣xα∣+∣yα∣) and is not claimed to vanish for fixed ρ; (3) at every maximiser α2(∣xα−yα∣2+∣tα−sα∣2)+ρ(∣xα∣2+∣yα∣2)≤sup⁡u−inf⁡v−Mα,ρ, so whenever the maximiser values Mα,ρ are bounded below by m on a set of parameters, the corresponding maximisers satisfy ρ(∣xα∣2+∣yα∣2)≤sup⁡u−inf⁡v−m and ∣qα−pα∣≤2(2ρ(sup⁡u−inf⁡v−m))1/2. No choice principle is used.

Facts & Assumptions

Given: Bounded-above upper semicontinuous u and bounded-below lower semicontinuous v on Rn×[0,T], parameters α,ρ>0, and the function Φ of the statement.

[F1]

Upper semicontinuity of u and lower semicontinuity of v mean that every superlevel set of u and every sublevel set of v is relatively closed; equivalently, −v is upper semicontinuous (Upper and lower semicontinuity on subsets of Rn).

[F2]

Every upper semicontinuous real-valued function on a nonempty compact subset of Rn is bounded above and attains its maximum (Semicontinuous extreme value theorem on compact Euclidean sets).

[F4]

If S⊆R is nonempty, bounded above and w is an upper bound of S with the property that for every ε>0 there is s∈S with w−ε<s, then w=sup⁡S; in particular sup⁡S−ε<s for some s∈S and every ε>0 (Epsilon characterisation of the supremum).

Proof

technique · coercive weight for existence, monotonicity in $\alpha$ for the localisation, and explicit $C^1$ contacts for the two tests
1.1F1F2F3algebra

Existence and finiteness of Mα,ρ. On Rn×Rn×[0,T]2 the function Φ is upper semicontinuous, being u plus the upper semicontinuous −v plus continuous terms by [F1]; it is bounded above by sup⁡u−inf⁡v<∞ because the quadratic and weight terms are nonpositive. Pick any point p0:=(0,0,0,0) and put m0:=Φ(p0)∈R; the superlevel set S0:={Φ≥m0} is nonempty, closed by upper semicontinuity, and bounded because ρ(∣x∣2+∣y∣2)≤sup⁡u−inf⁡v−m0 on it; hence S0 is compact by [F3]. On S0 the restriction of Φ is real-valued and upper semicontinuous, so it attains a maximum by [F2]; that maximum is a global maximum of Φ because every point outside S0 has value <m0≤max⁡S0Φ. Hence Mα,ρ is finite and attained.

2.1step 1.1algebra

The relative contacts and their derivatives. Let (xα,yα,tα,sα) be a maximiser. Fixing (y,s)=(yα,sα), the inequality Φ(x,yα,t,sα)≤Φ(xα,yα,tα,sα) for all (x,t) reads u(x,t)−ψ1(x,t)≤u(xα,tα)−ψ1(xα,tα), so u−ψ1 has a local maximum at (xα,tα); fixing (x,t)=(xα,tα) similarly gives v(y,s)−ψ2(y,s)≥v(yα,sα)−ψ2(yα,sα), a local minimum of v−ψ2 at (yα,sα). The displayed gradients and time derivatives are the derivatives of the two quadratic test functions: Dxψ1=α(x−yα)+2ρx evaluated at xα gives pα, Dyψ2=α(xα−y)−2ρy evaluated at yα gives qα, and ∂tψ1=α(t−sα), ∂sψ2=α(tα−s) both equal pα0 at the maximiser.

3.1step 2.1algebra

The weight bound (3). At a maximiser, Φ(xα,yα,tα,sα)=Mα,ρ, that is u(xα,tα)−v(yα,sα)−α2dα2−ρ(∣xα∣2+∣yα∣2)=Mα,ρ; since u(xα,tα)≤sup⁡u and −v(yα,sα)≤−inf⁡v, the sum of the two penalty terms is at most sup⁡u−inf⁡v−Mα,ρ, which is (3). If in addition Mα,ρ≥m then ρ(∣xα∣2+∣yα∣2)≤sup⁡u−inf⁡v−m, and ∣qα−pα∣≤2ρ(∣xα∣+∣yα∣)≤2ρ2(∣xα∣2+∣yα∣2)≤2(2ρ(sup⁡u−inf⁡v−m))1/2.

4.1step 2.1step 3.1F4algebra

Localisation as α→∞. Fix any sequence αj→∞ and any corresponding sequence of maximisers (xj,yj,tj,sj); these are exactly the sequences quantified in part (2). For fixed ρ, α↦Mα,ρ is nonincreasing and bounded below by Φ(0,0,0,0), so it converges. Put dj2:=∣xj−yj∣2+∣tj−sj∣2. Evaluating the αj/2-function at this same maximiser gives Mαj/2,ρ≥Mαj,ρ+αj4dj2, hence αjdj2≤4(Mαj/2,ρ−Mαj,ρ)→0. In particular ∣xj−yj∣+∣tj−sj∣→0. By step 3.1, ∣xj∣ is uniformly bounded for fixed ρ. With pj=αj(xj−yj)+2ρxj, the bounds αj∣xj−yj∣(∣xj−yj∣+∣tj−sj∣)≤2αjdj2→0 and 2ρ∣xj∣(∣xj−yj∣+∣tj−sj∣)→0 give (1+∣pj∣)(∣xj−yj∣+∣tj−sj∣)→0. Finally qj−pj=−2ρ(xj+yj) and step 3.1 gives the asserted bound on ∣qj−pj∣, which need not vanish for fixed ρ. The argument applies to every given sequence of maximisers and selects none.

5.1step 1.1step 2.1step 3.1step 4.1∎

Conclusion. Part (1) is steps 1.1 and 2.1, part (2) is step 4.1, and part (3) is step 3.1; the maximiser is obtained from the compactness of a closed bounded superlevel set and the extreme-value property for upper semicontinuous functions, and no sequence, point or index is selected in the construction.

Remarks

The contacts in part (1) are relative to Rn×[0,T]. A maximiser may have tα=0 or sα=0 (for example, u(x,t)=−t, v(y,s)=s), or lie on a terminal face. The corresponding derivative belongs to the first-order superjet or subjet of Viscosity testing by first-order jets, and closure of the jet inequality only when the contact time is in (0,T), where the restricted domain is open. Viscosity inequalities in the interior therefore require a separate exclusion of time-boundary contacts.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Time penalisation moves a doubling-variables maximum away from the terminal boundary

Statement

Let T>0, Z=Rn×(0,T), and let H:Rn×[0,T]×Rn→R be continuous. Suppose u,v:Rn×[0,T)→R, where u is upper semicontinuous and bounded above, v is lower semicontinuous and bounded below, and their restrictions to Z are respectively a viscosity subsolution and a viscosity supersolution of ut+H(x,t,Du)=0. For η,η′>0 put u~η(x,t)=u(x,t)−η/(T−t) and v~η′(x,t)=v(x,t)+η′/(T−t) for t<T. Then: (1) every C1 upper contact ϕ for u~η at z0=(x0,t0)∈Z satisfies ϕt(z0)+H(x0,t0,Dϕ(z0))≤−η(T−t0)2<0; (2) every C1 lower contact ϕ for v~η′ at z0∈Z satisfies ϕt(z0)+H(x0,t0,Dϕ(z0))≥η′(T−t0)2>0; moreover u~η→−∞ and v~η′→+∞ uniformly in x as t↑T; (3) for every α,ρ>0, define on Rn×Rn×[0,T]2 Φα,ρ(x,y,t,s)=u~η(x,t)−v~η′(y,s)−α2∣x−y∣2−α2∣t−s∣2−ρ(∣x∣2+∣y∣2) when t,s<T, and set Φα,ρ=−∞ when t=T or s=T. Then Φα,ρ attains a finite maximum, and every maximiser has t,s<T. A maximum may occur on an initial face (that is, with t=0 or s=0). No choice principle is used.

Facts & Assumptions

Given: T>0, continuous H:Rn×[0,T]×Rn→R, an upper semicontinuous function u:Rn×[0,T)→R bounded above, a lower semicontinuous v bounded below, whose restrictions to Z=Rn×(0,T) are a viscosity subsolution and supersolution of ut+H(x,t,Du)=0, the functions u~η=u−η/(T−t), v~η′=v+η′/(T−t) for η,η′>0, and the functions Φα,ρ of the statement, read in R‾ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined).

[F1]

A viscosity subsolution w of ut+H(x,t,Du)=0 in Z satisfies ψt(z0)+H(z0,Dψ(z0))≤0 at every local maximum z0∈Z of w−ψ with ψ∈C1(Z); a viscosity supersolution satisfies the reverse inequality ≥0 at every local minimum of w−ψ (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

The function t↦η/(T−t) is C1 on (−∞,T) with derivative η/(T−t)2; sums of C1 functions are C1 with the sum of the total derivatives (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder), and a local maximum of u~η−ϕ is a local maximum of u−(ϕ+η/(T−t)) because the two differences are the same function.

[F3]

Upper semicontinuity of u and lower semicontinuity of v are the relative notions on the Euclidean set Rn×[0,T) (Upper and lower semicontinuity on subsets of Rn); w is upper semicontinuous exactly when every superlevel set {w≥c} is closed.

[F5]

A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection; no choice principle is used (A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection).

Proof

technique · add the two explicit time-boundary penalties, then use spatial coercivity and compact superlevel sets
1.1F1F2algebra

The subsolution penalty. Let ϕ∈C1(Z) and suppose u~η−ϕ has a local maximum at z0=(x0,t0)∈Z. Then u−ψ has a local maximum at z0 for ψ(z):=ϕ(z)+η/(T−t), which is C1 on Z with ψt=ϕt+η/(T−t)2 and Dψ=Dϕ by [F2]; the subsolution inequality [F1] gives ϕt(z0)+η/(T−t0)2+H(x0,t0,Dϕ(z0))≤0, that is ϕt+H(x0,t0,Dϕ(z0))≤−η/(T−t0)2<0.

1.2F1F2algebra

The supersolution penalty and the uniform terminal limits. If v~η′−ϕ has a local minimum at z0∈Z, then v−ψ has a local minimum at z0 for ψ:=ϕ−η′/(T−t), C1 with ψt=ϕt−η′/(T−t)2; the supersolution inequality [F1] gives ϕt+H(x0,t0,Dϕ(z0))≥η′/(T−t0)2>0. For the terminal limits, u~η(x,t)≤sup⁡u−η/(T−t) and v~η′(x,t)≥inf⁡v+η′/(T−t) for every x, and the right-hand sides are independent of x and tend to −∞, respectively +∞, as t↑T.

1.3F3F4F5algebra

Existence and finiteness of the maximum of Φα,ρ. On the product space Rn×Rn×[0,T]2 the function Φα,ρ is upper semicontinuous: it is built from the upper semicontinuous u~η, the function −v~η′, which is upper semicontinuous because v is lower semicontinuous, and continuous terms, and at a sequence with t→T or s→T it tends to −∞ uniformly, since u~η(x,t)≤sup⁡u−η/(T−t) and −v~η′(y,s)≤−inf⁡v−η′/(T−s); hence it takes the value −∞ on the terminal faces in the upper-semicontinuous sense fixed in [F3]. It is bounded above by sup⁡u−inf⁡v<∞, and its value at any diagonal point (0,0,τ,τ) with 0<τ<T is finite, so M:=sup⁡Φα,ρ∈R. For each k≥1 the set Ak:={(x,y,t,s):Φα,ρ≥M−1/k} is nonempty by the definition of M, closed by upper semicontinuity [F3], bounded because ρ(∣x∣2+∣y∣2)≤sup⁡u−inf⁡v−M+1/k≤sup⁡u−inf⁡v−M+1 on Ak, and disjoint from the terminal faces because M−1/k is finite there; hence each Ak is a compact subset of A1 by [F4]. The family {Ak}k≥1 is nested, so it has the finite intersection property, and [F5] applied in the compact set A1 gives a point of ⋂kAk, at which Φα,ρ≥M−1/k for every k, hence Φα,ρ≥M; since M is an upper bound, Φα,ρ=M there. Thus the maximum is attained and equals the finite number M, and every maximiser has t,s<T because the terminal faces carry the value −∞.

2.1step 1.1step 1.2step 1.3∎

Conclusion. Parts (1) and (2) of the statement are steps 1.1 and 1.2, and part (3) is step 1.3, whose construction nowhere selects a sequence or a point: the maximiser is obtained from the finite intersection property, which the cited lemma proves choice-free. Nothing in the argument rules out a maximiser with t=0 or s=0, since only the terminal faces t=T, s=T carry the value −∞.

Remarks

  • Why the penalties are the right shape. Each penalty is continuous on [0,T) with derivative diverging at T, so it produces the exact interior residual shift η/(T−t)2, whose magnitude is at least η/T2 (and similarly for η′), and pushes every doubling maximum off the terminal face. The initial faces carry finite values and are deliberately allowed: the comparison theorem treats them separately with the pointwise initial inequality.
  • Choice. The only compactness input is the finite-intersection characterisation [F5], which is choice-free.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Comparison for first-order Hamilton--Jacobi equations

Statement

Comparison for first-order Hamilton--Jacobi equations, in the two settings of the design. (a) The case O=Rn. Let T>0 and let H:Rn×[0,T]×Rn→R be continuous for which there is C>0 with ∣H(x,t,p)−H(y,s,p)∣≤C(1+∣p∣) (∣x−y∣+∣t−s∣),∣H(x,t,p)−H(x,t,q)∣≤C∣p−q∣ for all x,y,p,q∈Rn and t,s∈[0,T]. Let u be a bounded upper semicontinuous viscosity subsolution and v a bounded lower semicontinuous viscosity supersolution of the Cauchy problem in Z=Rn×(0,T), each defined on the closed slab Rn×[0,T) and satisfying the pointwise initial inequality u(x,0)≤v(x,0) for every x∈Rn. Then u≤v on Z. (b) The compact-cylinder case. Let O⊆Rn be bounded and open, T>0, and let H:O‾×[0,T]×Rn→R be continuous and uniformly continuous in (x,t) uniformly on bounded p-sets: there is a nondecreasing modulus ω:[0,∞)→[0,∞) with ω(0+)=0 such that ∣H(x,t,p)−H(y,s,p)∣≤ω((1+∣p∣) (∣x−y∣+∣t−s∣)) for all (x,t),(y,s)∈O‾×[0,T] and all p∈Rn. Let u,v be continuous on Z‾=O‾×[0,T], u a viscosity subsolution and v a viscosity supersolution of ut+H(x,t,Du)=0 in Z, with u≤v on the parabolic boundary Γ=(O×{0})∪(∂O×[0,T]). Then u≤v on Z‾. No growth hypothesis on H in the momentum variable is imposed in this case; the modulus condition replaces it. For an x-independent autonomous Hamiltonian H(p), it holds with the zero modulus. No choice principle is used.

Facts & Assumptions

Given: The two settings of the statement; parameters η,η′,ρ,α>0; the time penalties u~η=u−η/(T−t) and v~η′=v+η′/(T−t) (case (a)) or v~η′=v+η′/(T−s) read at the respective time variable; the doubling functions Φα(x,y,t,s):=u~η(x,t)−v~η′(y,s)−α2∣x−y∣2−α2∣t−s∣2 in case (b) and the same with the additional weight −ρ(∣x∣2+∣y∣2) in case (a); their suprema Mα.

[F1]

Every C1 upper contact ϕ of u~η at an interior point satisfies ϕt+H(x,t,Dϕ)≤−η/(T−t)2≤−η/T2, and every C1 lower contact of v~η′ satisfies the reverse with η′; moreover u~η(x,t)≤sup⁡u−η/(T−t)→−∞ and v~η′(x,t)≥inf⁡v+η′/(T−t)→+∞ uniformly at the terminal time (Time penalisation moves a doubling-variables maximum away from the terminal boundary).

[F2]

At every maximiser of the doubling function, the two test functions displayed in Doubling variables: existence, relative contacts at the maximiser and localisation are C1 contacts for u~η and v~η′ with the jets p=α(x−y)+2ρx (case (a)) or p=α(x−y) (case (b)), q=α(x−y)−2ρy or q=α(x−y), and common time derivative p0=α(t−s); and the weight bound α2(∣x−y∣2+∣t−s∣2)+ρ(∣x∣2+∣y∣2)≤sup⁡u~η−inf⁡v~η′−Mα holds at every maximiser, a bound that in case (a) restricts every maximiser by ρ(∣x∣2+∣y∣2)≤sup⁡u−inf⁡v−Mα (Doubling variables: existence, relative contacts at the maximiser and localisation).

[F3]

In case (a), u is upper semicontinuous and v lower semicontinuous on the closed slab, so u(x,0)−v(y,s) and u(x,t)−v(y,0) are upper semicontinuous in their variables. In case (b), u,v are continuous on the compact set Z‾, hence uniformly continuous by Heine--Cantor; choose a common space-time modulus ϖ with ∣u(x,t)−u(y,s)∣,∣v(x,t)−v(y,s)∣≤ϖ(∣x−y∣+∣t−s∣) (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem, Upper and lower semicontinuity on subsets of Rn, Uniform continuity of a map of metric spaces: one δ serving every point, Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

[F5]

A finite-valued upper semicontinuous function has closed superlevel sets; if f is upper semicontinuous and g lower semicontinuous, then f−g is upper semicontinuous, by applying their local one-sided bounds with half the tolerance (Upper and lower semicontinuity on subsets of Rn).

[F6]

An upper semicontinuous real-valued function on a nonempty compact Euclidean set is bounded above and attains a maximum (Semicontinuous extreme value theorem on compact Euclidean sets).

[F7]

A continuous function on a compact metric space is uniformly continuous (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

Proof

technique · doubling with terminal-time penalisation; all localisation estimates are proved for every maximiser, so that no sequence of maximisers and no choice principle is used
1.1F1F2F4algebra

Case (a): setup and uniform localisation estimates. Assume σ:=sup⁡Z(u−v)>0 and fix (x1,t1)∈Z with u(x1,t1)−v(x1,t1)>3σ/4. Choose η,η′>0 with (η+η′)/(T−t1)<σ/4 and put B:=η+η′; then u~η(x1,t1)−v~η′(x1,t1)>σ/2. Fix ρ>0 with 2ρ∣x1∣2<σ/8; then for the doubling function of case (a) with these penalties, Mα≥Φα(x1,x1,t1,t1)>σ/2−σ/8=3σ/8 for every α. Every maximiser (x,y,t,s) of Φα has t,s<T, and by [F2] the weight bound gives ρ(∣x∣2+∣y∣2)≤sup⁡u−inf⁡v−3σ/8=:Kρ, so ∣x∣,∣y∣≤Cρ:=Kρ/ρ. Writing d2:=∣x−y∣2+∣t−s∣2 and evaluating Φα/2 at any maximiser of Φα (the penalty difference is α4d2) gives Mα/2≥Mα+α4d2, hence d≤δα:=(4(Mα/2−Mα)/α)1/2 for every maximiser; since Mα↓M∞ boundedly as α→∞, δα→0. With p=α(x−y)+2ρx as in [F2] we get ∣p∣≤αd+2ρCρ and therefore (1+∣p∣)d≤d+αd2+2ρCρd≤δα+4(Mα/2−Mα)+2ρCρδα→0 and ∣q−p∣=2ρ∣x+y∣≤4ρCρ uniformly over all maximisers, both limits being as α→∞ with ρ fixed.

1.2F1F2F4F6algebra

Case (b): setup and uniform localisation estimates. Let σ:=max⁡Z‾(u−v)>0; the maximum is attained by compactness and continuity, and if it were attained on Γ it would be ≤0, then continuity supplies a point (x1,t1)∈Z with u(x1,t1)−v(x1,t1)>3σ/4, even if the maximum occurs at t=T. Choose η,η′>0 with B:=η+η′<σ(T−t1)/4; then u~η(x1,t1)−v~η′(x1,t1)>σ/2, and the doubling function of case (b) satisfies Mα≥σ/2 for every α. It is upper semicontinuous on the compact box O‾×O‾×[0,T]2 (the penalties tend to −∞ at the terminal faces, where the value is declared −∞); a nonempty compact superlevel set and [F6] give a finite attained maximum, and every maximiser has t,s<T. Evaluating Φα/2 at a maximiser of Φα again gives α4d2≤Mα/2−Mα, hence d≤δα→0 uniformly over maximisers, and with p=q=α(x−y) in case (b) one has (1+∣p∣)d≤d+αd2≤δα+4(Mα/2−Mα)→0. Since ∣x−y∣+∣t−s∣≤2d, it follows that (1+∣p∣)(∣x−y∣+∣t−s∣)≤2δα+8(Mα/2−Mα)→0.

2.1step 1.2F1F2F3F6F7algebra

Case (b): exclusion of the parabolic boundary and the contradiction. Let α be large enough that ϖ(2δα)<B/T. If a maximiser had t=0, then (x,0)∈Γ gives u(x,0)≤v(x,0) and ∣x−y∣+s≤2d≤2δα, so Φα≤u(x,0)−v(y,s)−BT≤ϖ(2δα)−BT<0, contradicting Mα≥σ/2. If x∈∂O with t,s>0, then (x,t)∈Γ gives u(x,t)≤v(x,t) and ∣x−y∣+∣t−s∣≤2d≤2δα, so Φα≤ϖ(2δα)−B/T<0; the case y∈∂O is symmetric, as is s=0 using the initial inequality at (y,0) and the modulus of u. Thus all maximisers for large α have 0<t,s<T and x,y∈O. At such a maximiser the penalty inequalities of [F1] hold at the jets p=q, p0 of case (b), and subtracting them gives BT2≤H(y,s,p)−H(x,t,p)≤ω((1+∣p∣)(∣x−y∣+∣t−s∣))≤ω(2δα+8(Mα/2−Mα)), which tends to 0 as α→∞ by step 1.2 and ω(0+)=0; this contradicts B/T2>0. Hence σ≤0, that is u≤v on Z‾.

2.2step 1.1F1F2F3F4F5F6algebra

Case (a): exclusion of the initial faces and the contradiction. Fix the ρ of step 1.1 and let K be the closed ball containing every spatial coordinate of every maximiser. On the compact set K×K×[0,T/2], the functions f0(x,y,s):=u(x,0)−v(y,s) and f1(x,y,t):=u(x,t)−v(y,0) are upper semicontinuous by [F3, F5], and both are nonpositive on the diagonal sets (z,z,0) by the initial inequality. There is δ0>0 such that f0(x,y,s)<3σ/8 whenever ∣x−y∣+s<δ0, and likewise δ1>0 for f1 whenever ∣x−y∣+t<δ1: otherwise the closed superlevel sets {fi≥3σ/8} intersected with the nested closed sets where the corresponding distance is at most 1/m would be nonempty compact sets with the finite-intersection property, so [F4] would give a point (z,z,0) in the superlevel set, a contradiction. For α large enough that 2δα<min⁡{δ0,δ1,T/2}, if a maximiser had t=0, then Φα≤f0(x,y,s) because all remaining penalties are nonpositive, while ∣x−y∣+s≤2d≤2δα; this contradicts Φα=Mα≥3σ/8. If s=0, similarly Φα≤f1(x,y,t) and ∣x−y∣+t≤2δα, again a contradiction. Hence for all sufficiently large α every maximiser has 0<t,s<T. At such a maximiser the contact inequalities of [F1] apply at the jets p,q,p0 of [F2]: p0+H(x,t,p)≤−η/T2 and p0+H(y,s,q)≥η′/T2. Subtracting and using the two Lipschitz conditions of case (a) gives B/T2≤H(y,s,q)−H(x,t,p)≤C∣q−p∣+C(1+∣p∣)(∣x−y∣+∣t−s∣), and by step 1.1 the right-hand side is at most 4ρCCρ+2C(δα+4(Mα/2−Mα)+2ρCρδα), using ∣x−y∣+∣t−s∣≤2d for every maximiser with α large. Letting α→∞ gives B/T2≤4ρCCρ=4C(ρ(sup⁡u−inf⁡v−3σ/8))1/2, and then letting ρ↓0 gives B/T2≤0, a contradiction. Thus σ≤0 and u≤v on Z.

3.1step 2.1step 2.2∎

Conclusion. Case (a) is step 2.2 and case (b) is step 2.1; in both cases the contradiction is obtained by uniform estimates over the maximiser sets, so no maximiser, subsequence or index is selected and no choice principle is used.

Remarks

  • Autonomy. In case (b) an x-independent autonomous Hamiltonian H(p) satisfies the modulus condition with ω≡0. A general autonomous H(x,p) still needs the stated spatial modulus condition; in case (a) the two Lipschitz conditions are exactly what the subtracted inequality consumes.
  • What each hypothesis is for. The terminal-time penalties give the strict margin B/T2; the localisation αd2→0 makes the momentum gap q−p=2ρ(x+y) and the space-time displacement disappear after α→∞ and ρ↓0; the pointwise initial inequality (case (a)) or the boundary inequality (case (b)) excludes the initial and lateral faces.
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Uniqueness and sup-norm contraction for the Cauchy problem

Statement

Let n≥1, T>0, and let H:Rn×[0,T]×Rn→R satisfy the Lipschitz conditions of part (a) of Comparison for first-order Hamilton--Jacobi equations. (1) If u,v are bounded viscosity solutions of the Cauchy problem in Z=Rn×(0,T) with the same bounded continuous initial datum u0, then u=v on Z; in particular the classical and the Hopf--Lax solutions of later sections are the unique ones in the bounded class whenever H satisfies those conditions. (2) More generally, if u,v are bounded viscosity solutions with initial data u0,v0, then for every T>0 sup⁡z∈Z(u−v)≤max⁡(0, sup⁡x∈Rn(u0(x)−v0(x))), and applying the same bound to v−u gives sup⁡Z∣u−v∣≤sup⁡Rn∣u0−v0∣ when the initial difference is bounded. In particular the solution operator is a contraction in the supremum norm on the bounded initial data. No choice principle is used.

Facts & Assumptions

Given: A Hamiltonian H satisfying the Lipschitz conditions of comparison case (a), T>0, bounded viscosity solutions u,v of the Cauchy problem in Z=Rn×(0,T) with bounded continuous data u0,v0.

[F1]

Comparison, case (a): if U is a bounded upper semicontinuous subsolution and V a bounded lower semicontinuous supersolution on the closed slab with U(x,0)≤V(x,0) pointwise, then U≤V on Z (Comparison for first-order Hamilton--Jacobi equations).

[F2]

For a bounded viscosity solution u, its upper envelope u∗ is a bounded upper semicontinuous subsolution and its lower envelope u∗ is a bounded lower semicontinuous supersolution, each satisfying the corresponding relaxed initial inequality (Discontinuous viscosity solutions through the two envelopes). Adding a constant K shifts both envelopes by K and preserves their one-sided viscosity inequalities because H is independent of the unknown (Discontinuous viscosity solutions through the two envelopes, Comparison for first-order Hamilton--Jacobi equations for the equation class).

[F3]

Boundedness of u,v and of their continuous initial data is assumed in the statement and Given, so the displayed suprema are finite. The relaxed joint initial limsup/liminf conditions are part of Discontinuous viscosity solutions through the two envelopes, as recorded in [F2]. No uniform-continuity hypothesis is needed for this comparison consequence.

Proof

technique · comparison applied twice, plus the constant-shift invariance of the equation
1.1F1F2F3

Uniqueness. Let u,v be bounded viscosity solutions with the same datum u0. By [F2], u∗ is a bounded upper semicontinuous subsolution and v∗ is a bounded lower semicontinuous supersolution. Extend them to the initial face by U(x,0)=u0(x) and V(x,0)=u0(x). Their relaxed initial inequalities and continuity of u0 make U upper semicontinuous and V lower semicontinuous on the closed slab, with ordered pointwise initial values. Comparison [F1] gives u∗≤v∗ on Z. Since u≤u∗ and v∗≤v, this yields u≤v. Applying the same argument to (v,u) gives v≤u, hence u=v on Z; in fact all four envelopes and functions coincide. In particular, whenever a classical or Hopf--Lax solution is known to be a bounded viscosity solution of the same Cauchy problem, it is the unique bounded solution.

1.2F1F2F3algebra

The one-sided bound for general data. Put K:=max⁡{0,sup⁡Rn(u0−v0)}<∞. By [F2], u∗ is a bounded upper semicontinuous subsolution and (v+K)∗=v∗+K is a bounded lower semicontinuous supersolution. Extend these envelopes to t=0 by u0 and v0+K, respectively; their relaxed initial inequalities and continuity of the data make the extensions semicontinuous on the closed slab with ordered pointwise initial values. Comparison [F1] gives u∗≤v∗+K on Z. Since u≤u∗ and v∗≤v, this implies u−v≤K; taking the supremum over Z gives sup⁡Z(u−v)≤K.

2.1step 1.1step 1.2∎

Conclusion. Applying step 1.2 to the pair (u,v) and to the exchanged pair (v,u) gives sup⁡Z(u−v)≤max⁡(0,sup⁡(u0−v0)) and sup⁡Z(v−u)≤max⁡(0,sup⁡(v0−u0)); when the initial difference is bounded, both right-hand sides are at most sup⁡Rn∣u0−v0∣, hence sup⁡Z∣u−v∣≤sup⁡Rn∣u0−v0∣ and the solution operator is a contraction in the supremum norm.

Remarks

  • Domain. The corollary is stated on O=Rn because comparison case (a) is; on a bounded domain without lateral data uniqueness fails, as the companion counterexample shows.
  • Choice. Only comparison and the constant shift are used, both choice-free.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The upper envelope of a locally bounded supremum of subsolutions is a subsolution

Statement

Let U⊆Rn+1 be open, let H:U×Rn→R be continuous, and let F be a nonempty family of real-valued upper semicontinuous viscosity subsolutions of ut+H(x,t,Du)=0 in U. Put w(z):=sup⁡w′∈Fw′(z) for z∈U and assume that w is locally bounded above: w(z)<∞ for every z∈U and w is bounded above on every compact subset of U. Then the upper semicontinuous envelope w∗ (Upper and lower semicontinuous envelopes by local limsup and liminf) is a viscosity subsolution of ut+H(x,t,Du)=0 in U. No choice principle is used.

Facts & Assumptions

Given: An open U⊆Rn+1, continuous H:U×Rn→R, a nonempty family F of upper semicontinuous viscosity subsolutions, w=sup⁡w′∈Fw′, locally bounded above, and its upper envelope w∗.

[F1]

w∗(z)=inf⁡r>0Mr(z) with Mr(z):=sup⁡{w(y):∣y−z∣≤r, y∈U}, and w∗(z)=lim⁡r↓0Mr(z); if w is locally bounded above then w∗ is real-valued on U. The envelope is upper semicontinuous: for z and η>0 choose r>0 with Mr(z)≤w∗(z)+η; then for ∣z′−z∣<r one has Mr−∣z′−z∣(z′)≤Mr(z), hence w∗(z′)≤w∗(z)+η (Upper and lower semicontinuous envelopes by local limsup and liminf).

[F2]

Each w′∈F satisfies ϕt(z0)+H(z0,Dϕ(z0))≤0 at every z0∈U at which w′−ϕ has a local maximum, ϕ∈C1(U) (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem, Viscosity testing by first-order jets, and closure of the jet inequality).

[F3]

Every upper semicontinuous real-valued function on a nonempty compact subset of Rm attains its maximum there (Semicontinuous extreme value theorem on compact Euclidean sets).

[F4]

If v−ϕ has a local maximum at z0 and B‾(z0,r)⊆U is a ball on which v−ϕ≤v(z0)−ϕ(z0), then for every ε>0 the test ϕε=ϕ+ε∣z−z0∣4 has the same value and first jet as ϕ at z0 and makes v−ϕε strictly maximised over B‾(z0,r) at z0 (Strictification of a viscosity test function by a quartic perturbation).

Proof

technique · near-maximal selection from the supremum plus strict test perturbation
1.1F1F2F3algebra

Strict-contact case. Let ϕ∈C1(U) touch w∗ from above at z0=(x0,t0) with a strict local maximum of w∗−ϕ, and suppose θ:=ϕt(z0)+H(z0,Dϕ(z0))>0. Choose r>0 so that B‾(z0,r)⊆U, the contact is strict on this ball, and ϕt(z)+2(t−t0)+H(z,Dϕ(z)+2(x−x0))>θ/2 throughout it, by continuity. On the compact annulus A={r/2≤∣z−z0∣≤r}, [F1, F3] give the positive gap g=(w∗−ϕ)(z0)−max⁡A(w∗−ϕ). Choose 0<η<g/4 and 0<δ<r/2 such that ∣ϕ(y)−ϕ(z0)∣<η and ∣y−z0∣2<η for ∣y−z0∣<δ. The two supremum definitions in [F1] supply one pair (w′,y) with w′∈F, ∣y−z0∣<δ, and w′(y)>w∗(z0)−η (use a closed radius smaller than δ). By [F3], w′−ϕ−∣z−z0∣2 attains a maximum on B‾(z0,r), of value greater than (w∗−ϕ)(z0)−3η. Its value on A is at most (w∗−ϕ)(z0)−g, since w′≤w≤w∗. Thus any maximiser z∗=(x∗,t∗) lies in B(z0,r/2) and is an interior upper contact for ψ=ϕ+∣z−z0∣2. Its derivatives are ψt(z∗)=ϕt(z∗)+2(t∗−t0) and Dψ(z∗)=Dϕ(z∗)+2(x∗−x0). Their residual is greater than θ/2, contradicting the subsolution inequality [F2]. Hence the desired residual at z0 is nonpositive.

2.1step 1.1F4∎

General contacts and conclusion. If w∗−ϕ merely has a local maximum at z0, fix r>0 with B‾(z0,r)⊆U on which the maximum inequality w∗−ϕ≤w∗(z0)−ϕ(z0) holds and strictify by [F4]: the test ϕε=ϕ+ε∣z−z0∣4 has the same value and first jet at z0 and makes w∗−ϕε strictly maximised at z0 over B‾(z0,r). Step 1.1 applied to ϕε gives ϕt(z0)+H(z0,Dϕ(z0))=(ϕε)t(z0)+H(z0,Dϕε(z0))≤0. Hence w∗ is a viscosity subsolution of the equation in U; the selection of the single witness (w′,y) and of the compact maximiser z∗ involves no choice principle, and the whole argument is pointwise.

Remarks

  • Where local boundedness above is used. It makes w∗ real-valued so that the compact-annulus maximum and the test inequality are meaningful; the family is not assumed to consist of locally bounded functions or to be directed, and no member of the family other than the single witness (w′,y) is examined.
  • Role in Perron's method. This is the load-bearing half of Perron's method for the Cauchy problem: existence between two barriers: the supremum of the admissible subsolutions is made upper semicontinuous by passing to w∗, and this theorem says the envelope is still a subsolution.
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Failure of the supersolution test for the lower envelope allows a local bump

Statement

Let U⊆Rn+1 be open, let H:U×Rn→R be continuous, and let w:U→R be an upper semicontinuous viscosity subsolution of ut+H(x,t,Du)=0 in U. Suppose the lower semicontinuous envelope w∗ fails the supersolution test at z^∈U in the following precise sense: w∗(z^)∈R and there is ϕ∈C1(U) such that w∗−ϕ has a local minimum at z^ and ϕt(z^)+H(z^,Dϕ(z^))<0. Then for every sufficiently small κ>0 there is a viscosity subsolution Wκ of the same equation in U with Wκ≥w on U,sup⁡U(Wκ−w)>0,Wκ=w on {z∈U:∣z−z^∣≥κ}. Moreover Wκ can be taken to be max⁡(w,χ) on a small ball around z^ and w outside it, where χ is a classical subsolution with χ(z^)=w∗(z^)+δ for some δ>0. No choice principle is used.

Facts & Assumptions

Given: Open U⊆Rn+1, continuous H:U×Rn→R, an upper semicontinuous viscosity subsolution w:U→R, its lower envelope w∗, a point z^∈U with w∗(z^)∈R and a C1 test ϕ with w∗−ϕ having a local minimum at z^ and c:=−(ϕt(z^)+H(z^,Dϕ(z^)))>0.

[F1]

w∗(z)=sup⁡r>0inf⁡{w(y):∣y−z∣≤r} is the lower semicontinuous envelope of w, it satisfies w∗≤w pointwise, and for every η>0 there are points z arbitrarily close to z^ with w(z)<w∗(z^)+η (Upper and lower semicontinuous envelopes by local limsup and liminf).

[F2]

A finite maximum of finitely many viscosity subsolutions of the equation in an open set is a viscosity subsolution (Finite maxima of subsolutions and finite minima of supersolutions); a C1 function with χt+H(z,Dχ)≤0 pointwise is a viscosity subsolution of the same equation (Classical solutions are viscosity solutions and differentiable viscosity solutions solve the equation pointwise, Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F3]

A continuous function f with f(z^)<0 is negative on a neighbourhood of z^; here the function in question is z↦ϕt(z)+H(z,Dϕ(z)) (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem for the smoothness conventions).

Proof

technique · a strict test-function bump plus the finite-maximum rule
1.1F1F2F3algebra

The bump function. Fix κ>0 with B‾(z^,κ)⊆U and choose r∈(0,κ] small. For γ>0 put ϕ~(z):=ϕ(z)−γ∣z−z^∣4, so that ϕ~∈C1(U), ϕ~(z^)=ϕ(z^) and Dϕ~(z^)=Dϕ(z^); shrinking r if necessary and using [F3], we may assume ϕ~t(z)+H(z,Dϕ~(z))≤−c/2<0 for all z∈B‾(z^,r), so every vertical translate of ϕ~ is a classical, hence viscosity, subsolution there. Since w∗−ϕ has a local minimum at z^, after shrinking r we have w∗(z)−ϕ~(z)≥m+γ∣z−z^∣4 for z∈B‾(z^,r), where m:=w∗(z^)−ϕ(z^). Choose 0<δ<γ(r/2)4 and define χ:=ϕ~+m+δ, a classical subsolution on B‾(z^,r) with χ(z^)=w∗(z^)+δ. On the annulus r/2≤∣z−z^∣≤r we have w∗(z)≥ϕ~(z)+m+γ∣z−z^∣4≥χ(z)−δ+γ(r/2)4>χ(z), and since w∗≤w by [F1] this gives χ<w there. By continuity of χ, choose r0∈(0,r/2) so that χ(z)>w∗(z^)+δ/2 whenever ∣z−z^∣<r0. The lower-envelope definition [F1] gives a point z0 in this ball with w(z0)<w∗(z^)+δ/2<χ(z0).

2.1step 1.1F2algebra∎

The bump is a subsolution. Define W:=max⁡(w,χ) on B(z^,r) and W:=w on U∖B(z^,r); this is well defined because on the sphere ∣z−z^∣=r one has χ<w by step 1.1. Then W≥w on U, and sup⁡U(W−w)>0 at the point z0 of step 1.1. On the ball B(z^,r) the function W is the maximum of the viscosity subsolution w and the classical, hence viscosity, subsolution χ, so it is a viscosity subsolution there by [F2]; on the exterior of B‾(z^,r) it equals the subsolution w; and near every point of the sphere it equals w, which is a subsolution, so by locality of the definition W is a viscosity subsolution on all of U. Since χ<w on the annulus, W=w outside B(z^,r)⊆B(z^,κ), that is W=w on {z:∣z−z^∣≥κ}; and W is upper semicontinuous as a maximum of the upper semicontinuous w and the continuous χ.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Time-space barriers enforce the initial trace for the Cauchy problem

Statement

Let n≥1, T>0, O⊆Rn open, Z=O×(0,T), let H:O×[0,T]×Rn→R be continuous, and let u0∈C1(O) have bounded gradient. Assume C0:=sup⁡x∈O, 0≤t≤T∣H(x,t,Du0(x))∣<∞. Define ϕ±(x,t):=u0(x)±C0t. Then: (1) ϕ− is a classical subsolution and ϕ+ a classical supersolution in Z, each with initial datum u0; (2) if w:Z→R is locally bounded with ϕ−≤w≤ϕ+ on Z, then for every x∈O the relaxed limits satisfy lim inf⁡(y,s)→(x,0)s>0w(y,s)≥u0(x)≥lim sup⁡(y,s)→(x,0)s>0w(y,s), so both equal u0(x); (3) consequently w satisfies the relaxed initial condition for the Cauchy problem in both directions, and any continuous extension of w to the initial face takes the value u0 pointwise. No choice principle is used.

Facts & Assumptions

Given: Open O⊆Rn, T>0, continuous H:O×[0,T]×Rn→R, u0∈C1(O) with bounded gradient, C0=sup⁡O×[0,T]∣H(x,t,Du0(x))∣<∞, the barriers ϕ±=u0±C0t, and a locally bounded w:Z→R with ϕ−≤w≤ϕ+.

[F1]

If a C1 function satisfies the differential inequality pointwise on the open set Z, then it satisfies the corresponding viscosity test inequality: at a local contact with another C1 function, Fermat's theorem makes their first derivatives equal (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem, Fermat's theorem: an interior differentiable local extremum has zero gradient).

[F2]

The functions (x,t)↦u0(x)±C0t are C1 on Z, with time derivatives ±C0 and spatial gradient Du0(x); since u0 is continuous on O, they extend continuously to the initial face O×{0} with value u0 (Ck maps and multi-index derivative notation in Euclidean space).

[F3]

The relaxed initial conditions for a subsolution and a supersolution of the Cauchy problem are stated as limsup and liminf over (y,s)→(x,0) with s>0 (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

Proof

technique · explicit affine-in-time barriers and continuity of the datum
1.1F1F2algebra

The barriers are pointwise classical sub- and supersolutions on Z. By [F2], ϕ± are C1 there, with (ϕ±)t=±C0 and Dϕ±=Du0. The definition of C0 gives −C0≤H(x,t,Du0(x))≤C0 for every (x,t)∈O×[0,T], so (ϕ−)t+H(x,t,Dϕ−)=−C0+H(x,t,Du0(x))≤0 and (ϕ+)t+H(x,t,Dϕ+)=C0+H(x,t,Du0(x))≥0 pointwise on Z. By [F1] these pointwise inequalities imply the viscosity test inequalities, and [F2] gives the pointwise initial values. No continuity on the lateral boundary ∂O×[0,T] is needed.

2.1step 1.1algebra

The squeeze at the initial face. Fix x∈O. For (y,s)∈Z the pointwise bounds give ϕ−(y,s)=u0(y)−C0s≤w(y,s)≤u0(y)+C0s=ϕ+(y,s). As (y,s)→(x,0) with s>0 we have s→0 and y→x, so by continuity of u0 at x both u0(y)−C0s→u0(x) and u0(y)+C0s→u0(x); the squeeze therefore gives lim inf⁡w≥u0(x) and lim sup⁡w≤u0(x), both relaxed limits being taken along s>0.

3.1step 2.1F3∎

Conclusion. By step 2.1 the two relaxed limits both equal u0(x), which is exactly the bisided relaxed initial condition of [F3]; in particular a continuous extension of w to O×{0} must take the value u0 there. This is the two-barrier boundary control used by the Perron construction.

Remarks

  • Sharpness of the hypothesis. The boundedness of C0 is what makes the barriers classical; it holds, for example, when H is uniformly bounded on O×[0,T]×{∣p∣≤∥Du0∥∞}. Boundedness of O or boundedness for each fixed momentum alone does not supply that uniform bound. The barriers are the model two-sided control of the initial face and are used in the Perron existence theorem.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Perron's method for the Cauchy problem: existence between two barriers

Statement

Let n≥1, T>0, let H:Rn×[0,T]×Rn→R satisfy the Lipschitz conditions of part (a) of Comparison for first-order Hamilton--Jacobi equations, and let u0∈C1(Rn) be bounded with bounded gradient. Assume C0:=sup⁡x∈Rn, 0≤t≤T∣H(x,t,Du0(x))∣<∞, and put ϕ±=u0±C0t as in Time-space barriers enforce the initial trace for the Cauchy problem. Define W(x,t) on Z=Rn×(0,T) as the supremum of all viscosity subsolutions w with ϕ−≤w≤ϕ+ on Z. Then: (1) W is well defined and ϕ−≤W≤ϕ+; (2) W∗ is a viscosity subsolution and W∗ is a viscosity supersolution in Z; (3) comparison gives W∗≤W∗, hence W=W∗=W∗ is continuous, solves the Cauchy problem and carries datum u0 in the relaxed sense; (4) W is the unique viscosity solution in the class lying between ϕ− and ϕ+. No choice principle is used.

Facts & Assumptions

Given: The Hamiltonian H with comparison case (a), u0∈C1 bounded with bounded gradient, C0=sup⁡∣H(x,t,Du0(x))∣<∞, the barriers ϕ±=u0±C0t, and the set W of viscosity subsolutions w of ut+H(x,t,Du)=0 in Z with ϕ−≤w≤ϕ+, with W:=sup⁡w∈Ww.

[F1]

ϕ− is a classical subsolution and ϕ+ a classical supersolution, each with datum u0, and the barriers control both relaxed initial limits: for every locally bounded w with ϕ−≤w≤ϕ+ the liminf and limsup at O×{0} both equal u0 (Time-space barriers enforce the initial trace for the Cauchy problem).

[F2]

The upper semicontinuous envelope of a locally bounded-above supremum of a nonempty family of upper semicontinuous viscosity subsolutions is a viscosity subsolution (The upper envelope of a locally bounded supremum of subsolutions is a subsolution); if the lower envelope w∗ of an upper semicontinuous subsolution w strictly fails the supersolution test at a point, a local bump produces a subsolution Wκ≥w with Wκ>w at some point of an arbitrarily small ball about the failure point and Wκ=w outside that ball (Failure of the supersolution test for the lower envelope allows a local bump).

[F3]

Comparison case (a) applies to bounded upper semicontinuous subsolutions and bounded lower semicontinuous supersolutions with ordered pointwise initial traces (Comparison for first-order Hamilton--Jacobi equations), and uniqueness in the bounded class follows (Uniqueness and sup-norm contraction for the Cauchy problem).

Proof

technique · envelope subsolution, bump contradiction, comparison
1.1F1F2

Well-definedness and the upper envelope. The barrier ϕ− is itself an admissible subsolution by [F1], so W is nonempty, and every w∈W satisfies w≤ϕ+, so W is real-valued and bounded above on compact subsets of Z. By [F2] the envelope W∗ is a viscosity subsolution; moreover W≤ϕ+ gives W∗≤ϕ+ because ϕ+ is continuous (the limsup defining the envelope of a function bounded above by the continuous ϕ+ is at most ϕ+), and W∗≥W≥ϕ−. Hence W∗ is itself an admissible member of W, so W∗≤W by maximality and therefore W=W∗ is upper semicontinuous.

2.1step 1.1F1F2

The lower envelope is a supersolution. Suppose W∗ failed the supersolution test strictly at some z^∈Z: there is ϕ∈C1 with W∗−ϕ having a local minimum at z^ and ϕt(z^)+H(z^,Dϕ(z^))<0. First, W∗(z^)<ϕ+(z^): otherwise W∗(z^)=ϕ+(z^) and, since W∗≤ϕ+, the function ϕ+−ϕ would have a local minimum at z^, so the supersolution inequality for the classical supersolution ϕ+ would give ϕt(z^)+H(z^,Dϕ(z^))≥0, a contradiction. Choose a small bump supported in B(z^,κ); by [F2] it gives a viscosity subsolution Wκ≥W that exceeds W at some point in that ball and equals W outside it. It is constructed as max⁡(W,χ) on a smaller ball, where χ is a classical subsolution and is below W on the surrounding annulus. In the construction of the bump lemma, the unshifted smooth part ϕ~+m has value W∗(z^)<ϕ+(z^). First choose its ball radius r small enough that ϕ~+m lies strictly below ϕ+ throughout the closed ball. Then choose the offset δ smaller than both the positive minimum of ϕ+−(ϕ~+m) on that ball and the annular allowance γ(r/2)4. The resulting χ=ϕ~+m+δ stays below ϕ+ while all annular gluing inequalities hold; together with W≤ϕ+ this gives Wκ≤ϕ+, while Wκ≥W≥ϕ− always holds. Hence Wκ is squeezed between the barriers, and by the two-sided initial control [F1] it satisfies the relaxed initial condition; so Wκ∈W, contradicting maximality because Wκ exceeds W at the point supplied by the bump. Therefore W∗ is a viscosity supersolution.

3.1step 1.1step 2.1F1F3∎

Comparison, continuity and uniqueness. The upper envelope W∗=W is a bounded upper semicontinuous subsolution and W∗ is a bounded lower semicontinuous supersolution; both carry the datum u0 in the relaxed sense by [F1] applied to W, which lies between the barriers. Comparison [F3] gives W∗≤W∗; since always W∗≤W≤W∗, all three coincide, so W is continuous and is a viscosity solution of the Cauchy problem with datum u0. For uniqueness, let V be any, possibly discontinuous, viscosity solution with ϕ−≤V≤ϕ+. By definition V∗ is a bounded upper semicontinuous subsolution and V∗ a bounded lower semicontinuous supersolution, both with datum u0. Continuity of the barriers and ϕ−≤V≤ϕ+ give ϕ−≤V∗≤V≤V∗≤ϕ+, so V∗ belongs to W and hence V∗≤W by maximality. Comparison between the subsolution W and supersolution V∗ gives W≤V∗. Thus W≤V∗≤V≤V∗≤W, so all are equal.

Remarks

  • What the barriers do. They provide the nonempty admissible class, keep W locally bounded above, control the initial face in both directions through Time-space barriers enforce the initial trace for the Cauchy problem, and supply the strict inequality W∗(z^)<ϕ+(z^) used to keep the bump below the upper barrier.
  • Choice. The family is defined by a formula and the supremum is taken in R‾; no member of the family is selected, and the bump argument uses one compact maximiser at a time.
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The Legendre transform of a finite-valued convex Hamiltonian

Definition

Let n≥1 and let H:Rn→R be finite-valued. The Legendre transform (convex conjugate) of H is the function L:Rn→R‾ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined) defined by L(v):=sup⁡p∈Rn(p⋅v−H(p)),v∈Rn, the supremum being taken in R‾ (Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R) and the inner product being the Euclidean one (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn). The value L(v)=+∞ is possible and is not excluded.

In the biconjugate expressions p⋅v−(+∞) the convention p⋅v−(+∞):=−∞ is adopted, so that the supremum defining the biconjugate L∗(p):=sup⁡v∈Rn(p⋅v−L(v)) is an ordinary supremum of a set in R∪{−∞} when the value +∞ occurs: every v with L(v)=+∞ contributes the value −∞ and can be discarded.

When H is convex (Convex and strictly convex functions on Euclidean convex sets), L is the convex conjugate used in the Hopf--Lax construction. For every finite-valued H the transform L is convex and lower semicontinuous, being the pointwise supremum of the affine functions v↦p⋅v−H(p); no superlinearity, differentiability, strict convexity, coercivity or smoothness of H is assumed at this point. The notation H∗ is used interchangeably with L.

Remarks

  • Why the convention is recorded. The supremum over v∈Rn in the biconjugate runs over all of Rn even when L takes the value +∞; the convention makes each such term −∞, so those points neither enlarge nor obstruct the supremum, and L∗(p)=sup⁡{p⋅v−L(v):v∈Rn, L(v)<∞}. This is the convention under which the biconjugacy lemma A finite-valued convex Hamiltonian equals its biconjugate is stated, and it is fixed here once for every later use.
  • Scope. The transform is defined for every finite-valued H; convexity, lower semicontinuity and the affine-supremum representation are consequences of the definition, not hypotheses. The later Hopf--Lax regime adds superlinearity of H, which is a separate hypothesis and is what makes L real-valued; no choice principle occurs here.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

A finite-valued convex Hamiltonian equals its biconjugate

Statement

Let n≥1 and let H:Rn→R be convex (Convex and strictly convex functions on Euclidean convex sets), with Legendre transform L as in The Legendre transform of a finite-valued convex Hamiltonian and the convention p⋅v−(+∞):=−∞. Then for every p∈Rn H(p)=sup⁡v∈Rn(p⋅v−L(v)), so that H=L∗=H∗∗ is the biconjugate of H. Equivalently, the Moreau envelopes eλH(p):=inf⁡q∈Rn{H(q)+∣p−q∣22λ}(λ>0) satisfy eλH≤L∗≤H for every λ>0, and eλH(p)→H(p) as λ↓0 for every p. No superlinearity, differentiability, smoothness, coercivity or strict convexity of H is assumed, and no choice principle is used; in particular the supporting-hyperplane route is not needed.

Facts & Assumptions

Given: An integer n≥1, a convex function H:Rn→R, its Legendre transform L(v)=sup⁡p(p⋅v−H(p)) with the convention p⋅v−(+∞):=−∞, the biconjugate L∗(p)=sup⁡v(p⋅v−L(v)), and the Moreau envelopes eλH(p)=inf⁡q{H(q)+∣p−q∣2/(2λ)} for λ>0.

[F1]

L(v)=sup⁡p∈Rn(p⋅v−H(p)) is the least upper bound in R‾ of the set {p⋅v−H(p):p∈Rn}, and in the biconjugate the convention p⋅v−(+∞):=−∞ is adopted (The Legendre transform of a finite-valued convex Hamiltonian).

[F2]

H is convex: H((1−t)x+ty)≤(1−t)H(x)+tH(y) for all x,y∈Rn and t∈[0,1] (Convex and strictly convex functions on Euclidean convex sets).

[F3]

Every convex function on an open convex set is continuous on it; in particular H is continuous on Rn (A convex function on an open convex set is continuous).

[F4]

A nonempty subset of Rn is compact if and only if it is closed and bounded, and every continuous real-valued function on a nonempty compact subset attains a maximum and a minimum there (For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

[F5]

Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, and on a nonempty subset of R bounded in R these agree with the real supremum and infimum (Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R).

[F6]

If S⊆R is nonempty and ℓ=inf⁡S, then ℓ≤s for every s∈S and ℓ′≤ℓ for every lower bound ℓ′ of S (Greatest lower bound (infimum)).

Proof

technique · conjugate monotonicity plus an attained Moreau minimiser; the supporting inequality is derived from two-point convexity at the minimiser
1.1F1F5algebra

L∗(p)≤H(p) for every p. Fix p and v. By [F1] and the least-upper-bound property of [F5], p⋅v−H(p)≤L(v), that is p⋅v−L(v)≤H(p); if L(v)=+∞ this reads −∞≤H(p) by the convention of [F1], so the inequality holds in all cases. Hence H(p) is an upper bound in R‾ of {p⋅v−L(v):v∈Rn}, and since L∗(p) is the least upper bound of that set by [F1] and [F5], L∗(p)≤H(p).

1.2F2F3F4algebra

A linear-growth lower bound for H. By [F3] the function H is continuous, and the closed unit ball B‾(0,1) is nonempty, closed and bounded; by [F4] it is compact and H attains on it a minimum m∈R and a maximum M∈R. Put D:=max⁡{∣M−H(0)∣,∣m−H(0)∣}, so that ∣H(u)−H(0)∣≤D for every ∣u∣≤1. For ∣q∣≥1 put u:=q/∣q∣, so that u=(1/∣q∣)q+(1−1/∣q∣)⋅0 is a convex combination of q and 0; convexity [F2] gives H(u)≤(1/∣q∣)H(q)+(1−1/∣q∣)H(0), hence H(q)≥∣q∣(H(u)−H(0))+H(0)≥−∣q∣ ∣H(u)−H(0)∣−∣H(0)∣≥−(D+∣H(0)∣)∣q∣. For ∣q∣≤1 we have H(q)≥m≥−(D+∣H(0)∣). Thus with C:=D+∣H(0)∣+1 we get H(q)≥−C(1+∣q∣) for every q∈Rn.

1.3F2F3F6algebra

eλH(p)→H(p) as λ↓0, for fixed p. The competitor q=p gives eλH(p)≤H(p) for every λ>0. Fix ε>0. By continuity of H at p [F3] there is δ>0 with ∣H(q)−H(p)∣≤ε whenever ∣q−p∣≤δ. With r:=∣q−p∣ and φ(q):=H(q)+r2/(2λ): if r≤δ then φ(q)≥H(p)−ε; if r≥δ, put u:=(q−p)/r, so that p+δu=(1−δ/r)p+(δ/r)q and convexity [F2] gives H(p+δu)≤(1−δ/r)H(p)+(δ/r)H(q), that is H(q)≥H(p)+(r/δ)(H(p+δu)−H(p))≥H(p)−(ε/δ)r. Hence for r≥δ we have φ(q)≥H(p)−(ε/δ)r+r2/(2λ), and the right-hand side is minimised over r≥δ at r=δ whenever λ≤δ2/ε, with value H(p)−ε+δ2/(2λ)≥H(p)−ε/2. Therefore H(p)−ε is a lower bound of the set {φ(q):q∈Rn} whenever 0<λ≤δ2/ε, and since eλH(p) is its greatest lower bound [F6] we get eλH(p)≥H(p)−ε for all such λ. As ε>0 was arbitrary, lim inf⁡λ↓0eλH(p)≥H(p), which with the upper bound gives eλH(p)→H(p).

2.1step 1.2F3F4F6algebra

The Moreau infimum is attained. Fix p and λ>0 and put φ(q):=H(q)+∣p−q∣2/(2λ). By [F3] φ is continuous on Rn, and by the bound of step 1.2, φ(q)≥−C(1+∣q∣)+∣p−q∣2/(2λ), whose right-hand side tends to +∞ as ∣q∣→∞ because ∣p−q∣≥∣q∣−∣p∣; hence there is R>∣p∣ with φ(q)>φ(p) for every ∣q∣≥R. The set S:={q∈Rn:φ(q)≤φ(p)} is then nonempty (it contains p), contained in the closed ball B‾(0,R), and closed (it is the preimage under the continuous φ of a closed interval); being closed and bounded it is compact by [F4], so φ attains on S a minimum at some q∗∈S by [F4]. For q∉S we have φ(q)>φ(p)≥φ(q∗), so q∗ is a global minimiser of φ on Rn, and by the definition of the infimum [F6] φ(q∗)=inf⁡qφ(q)=eλH(p).

3.1step 2.1F1F2algebra

Supporting inequality and finiteness of L(v∗) at a minimiser. Keep p,λ,q∗ and φ from step 2.1, put w:=p−q∗, v∗:=w/λ, and fix q∈Rn with h:=q−q∗. For 0<r≤1 the point q∗+rh belongs to Rn and minimality of q∗ gives φ(q∗)≤φ(q∗+rh); convexity [F2] gives H(q∗+rh)≤(1−r)H(q∗)+rH(q). Subtracting and using ∣w−rh∣2=∣w∣2−2rw⋅h+r2∣h∣2, these two inequalities yield r(H(q)−H(q∗))≥r w⋅h/λ−r2∣h∣2/(2λ); dividing by r>0 and letting r↓0 gives H(q)≥H(q∗)+v∗⋅h. Hence q⋅v∗−H(q)≤q∗⋅v∗−H(q∗) for every q, with equality at q=q∗, so the least upper bound L(v∗) of [F1] equals q∗⋅v∗−H(q∗)∈R.

4.1step 2.1step 3.1F1F5algebra

L∗(p)≥eλH(p). By [F1] and [F5], L∗(p)≥p⋅v∗−L(v∗) for the vector v∗ of step 3.1 (the value L(v∗) is real, so p⋅v∗−L(v∗) is an ordinary real number and no convention is needed). Substituting L(v∗)=q∗⋅v∗−H(q∗) from step 3.1 and v∗=(p−q∗)/λ, we get L∗(p)≥(p−q∗)⋅v∗+H(q∗)=∣p−q∗∣2/λ+H(q∗)≥∣p−q∗∣2/(2λ)+H(q∗)=eλH(p), where the last equality is step 2.1.

5.1step 1.1step 1.3step 4.1∎

Conclusion. Steps 1.1 and 4.1 give eλH(p)≤L∗(p)≤H(p) for every λ>0 and every p, and step 1.3 gives eλH(p)→H(p) as λ↓0; hence L∗(p)=sup⁡v(p⋅v−L(v))=H(p) for every p, that is H=L∗.

Remarks

  • What replaces the subgradient theorem. The only existence input is the attained minimiser of the strictly convex perturbation q↦H(q)+∣p−q∣2/(2λ), obtained from continuity, a linear lower bound and compactness. The supporting inequality H(q)≥H(q∗)+v∗⋅(q−q∗) is then a two-point convexity computation at that minimiser, so no supporting-hyperplane theorem and no choice principle is consumed.
  • Sharpness of hypotheses. Neither superlinearity nor coercivity of H is used: the quadratic penalty provides the coercivity, and the continuity of H is a consequence of convexity and finite-valuedness by [F3].
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The Hopf--Lax operator and the Hopf--Lax formula

Definition

Let n≥1, let H:Rn→R be convex and superlinear, lim⁡∣p∣→∞H(p)∣p∣=+∞, let L be its Legendre transform (The Legendre transform of a finite-valued convex Hamiltonian), and let u0:Rn→R be bounded and uniformly continuous (Uniform continuity of a map of metric spaces: one δ serving every point, Lower bound, bounded below, bounded set). For t>0 and x∈Rn define Qtu0(x):=inf⁡y∈Rn{u0(y)+tL(x−yt)}, the infimum being computed in R∪{+∞} (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, Greatest lower bound (infimum)) over the extended-real values u0(y)+tL((x−y)/t); the term tL((x−y)/t) is +∞ exactly when L((x−y)/t)=+∞. Set Q0u0:=u0.

The Hopf--Lax operator with Lagrangian L is the family (Qt)t≥0, and the function (x,t)↦Qtu0(x) is the Hopf--Lax formula for the Cauchy problem ut+H(Du)=0, u(⋅,0)=u0. The infimum is an extended-real expression at this point: finiteness and the confinement of near-minimisers are proved in Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers, where superlinearity makes L real-valued everywhere.

Remarks

  • What is fixed and what is postponed. The definition fixes the autonomous Hamiltonian H:Rn→R, convex and superlinear; the datum class, bounded and uniformly continuous u0; the infimum over all y∈Rn of u0(y)+tL((x−y)/t) for t>0, read in the extended reals; and the value Q0u0=u0. Neither the attainment of the infimum nor its finiteness is asserted here, and no assertion that L is real-valued is smuggled into the definition; the value +∞ is kept visible until Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers proves the opposite under superlinearity.
  • Time scaling. The velocity variable in the formula is (x−y)/t, the average velocity of a straight path from y at time 0 to x at time t; the factor t multiplies the Lagrangian density. This normalisation is the one for which the dynamic-programming identity Qt+su0=Qt(Qsu0) of The Hopf--Lax operators form a semigroup (dynamic programming) holds with the coefficient t+s. No choice principle is used in the definition.
  • Bounded data without continuity. The same pointwise infimum formula defines Qtf(x) for any bounded function f, even when f is not uniformly continuous. Since L(v)≥−H(0) and the competitor y=x is finite, these values are real. This extension is used for the nonexpansiveness estimate in The Hopf--Lax operator is a contraction in the supremum norm; continuity conclusions such as The Hopf--Lax operator preserves a modulus of continuity retain their stated hypotheses.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers

Statement

Let H:Rn→R be convex and superlinear with Legendre transform L, and let u0:Rn→R be bounded and continuous. Then: (1) L is real-valued on Rn, convex, continuous, and superlinear; (2) for every x∈Rn and t>0 the infimum defining Qtu0(x) is attained, and for every δ>0 there is a finite radius ρ=ρ(x,t,δ,∥u0∥∞) such that every near-minimiser y with u0(y)+tL(x−yt)≤Qtu0(x)+δ satisfies ∣y−x∣≤ρ; (3) consequently Qtu0 is real-valued for every x and every t≥0. No choice principle is used.

Facts & Assumptions

Given: A convex superlinear H:Rn→R with lim⁡∣p∣→∞H(p)/∣p∣=+∞, its Legendre transform L, a bounded continuous u0:Rn→R, and the operators Qt of The Hopf--Lax operator and the Hopf--Lax formula.

[F1]

For t>0, Qtu0(x)=inf⁡y∈Rn{u0(y)+tL((x−y)/t)}, and Q0u0=u0 (The Hopf--Lax operator and the Hopf--Lax formula).

[F2]

L(v)=sup⁡p∈Rn(p⋅v−H(p)) for every v∈Rn, the supremum being the least upper bound in R‾ of the set of real numbers p⋅v−H(p) (The Legendre transform of a finite-valued convex Hamiltonian).

[F3]

Every convex function on an open convex set is continuous on it; in particular any finite convex function on Rn is continuous (A convex function on an open convex set is continuous).

[F4]

A nonempty subset of Rn is compact exactly when it is closed and bounded, and every continuous real-valued function on such a set attains a maximum and a minimum (For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

Proof

technique · coercivity of the Lagrangian confines near-minimisers to a compact ball, where continuity gives attainment
1.1F2F3F4algebra

Properties of L. Fix v∈Rn. Superlinearity of H gives R>0 with H(p)≥2∣v∣ ∣p∣ for ∣p∣≥R, so p⋅v−H(p)≤−∣v∣ ∣p∣≤0 there; on the closed ball B‾(0,R), which is closed and bounded and hence compact by [F4], the continuous function p↦p⋅v−H(p) (continuity of H is [F3]) attains a maximum Mv<∞ by [F4]. Hence p⋅v−H(p)≤max⁡{Mv,0}<∞ for every p, while L(v)≥−H(0) because p=0 is admissible; by the least-upper-bound property of [F2], L(v) is a real number. Convexity of L: for fixed p the map v↦p⋅v−H(p) is affine, and a pointwise supremum of affine functions is convex; L is real-valued, so it is finite and convex on the open convex set Rn and therefore continuous by [F3]. Superlinearity: fix a>0; for v≠0 the admissible test point p:=av/∣v∣ gives L(v)≥a∣v∣−H(av/∣v∣)≥a∣v∣−max⁡∣q∣≤aH(q), where the maximum is finite by [F3] and [F4]; dividing by ∣v∣ and letting ∣v∣→∞ gives lim inf⁡∣v∣→∞L(v)/∣v∣≥a, and since a>0 was arbitrary, L(v)/∣v∣→+∞.

2.1step 1.1F1F2F3F4algebra

Attainment and localisation. Fix x, t>0 and δ>0, and put φ(y):=u0(y)+tL((x−y)/t), so that Qtu0(x)=inf⁡φ by [F1]. The competitor y=x gives Qtu0(x)≤φ(x)=u0(x)+tL(0)≤∥u0∥∞+tL(0)=:A<∞, where L(0)∈R. Also every term is at least inf⁡u0−tH(0)>−∞ by [F2], so Qtu0(x)∈R. Let y satisfy φ(y)≤Qtu0(x)+δ; then tL(x−yt)≤A+δ−inf⁡u0≤2∥u0∥∞+tL(0)+δ=:C. Superlinearity of L from step 1.1 gives R>0 such that L(w)>C/t whenever ∣w∣≥R. If ∣x−y∣/t≥R, then tL((x−y)/t)>C, contradicting the preceding bound. Hence ∣y−x∣<tR, so every δ-near-minimiser lies in the closed ball B‾(x,ρ) with ρ:=tR<∞; the radius depends only on t,δ,∥u0∥∞ and the fixed H (and may harmlessly be viewed as a function of x as in the statement). For attainment, let S:={y∈Rn:φ(y)≤Qtu0(x)+1}. By the definition of the finite infimum, S is nonempty. It is closed by continuity of φ and bounded by the localisation just proved with δ=1, so [F4] makes it compact. The continuous function φ attains a minimum on S at some y∗. This minimum equals the global infimum: it is at least Qtu0(x), and for every 0<ε<1 the infimum property gives y with φ(y)<Qtu0(x)+ε, which lies in S, so the minimum is at most Qtu0(x)+ε. Thus φ(y∗)=Qtu0(x) and the infimum is attained, without selecting a sequence.

3.1step 1.1step 2.1F1

Real-valuedness of Qtu0. For t>0 each term satisfies u0(y)+tL((x−y)/t)≥inf⁡Rnu0−tH(0)>−∞ by the estimate L≥−H(0) of step 1.1, and the value at y=x is finite; hence Qtu0(x)∈R by [F1]. For t=0 this is Q0u0=u0, real-valued by hypothesis.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Part (1) is step 1.1, part (2) is step 2.1, and part (3) is step 3.1.

Remarks

  • Dependence of the radius. The radius produced depends on x, t, δ and ∥u0∥∞ only through the quantifier-free bounds of step 2.1; it is uniform in x on compact x-sets because the estimates are translation invariant. No compactness of the ambient space and no subsequence selection is used, hence no choice principle.
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Hopf--Lax operator is a contraction in the supremum norm

Statement

Let H:Rn→R be convex and superlinear with Legendre transform L, and let u0,v0:Rn→R be bounded. Then for every t≥0 and every x∈Rn ∣Qtu0(x)−Qtv0(x)∣≤sup⁡Rn∣u0−v0∣, and consequently sup⁡Rn∣Qtu0−Qtv0∣≤∥u0−v0∥∞; both Qtu0 and Qtv0 are real-valued (see the proof for the explicit finiteness argument). No uniform continuity of the data is needed for this particular estimate, and no choice principle is used.

Facts & Assumptions

Given: A convex superlinear H:Rn→R, its Legendre transform L(v)=sup⁡p(p⋅v−H(p)), bounded data u0,v0:Rn→R, the operators Qt of The Hopf--Lax operator and the Hopf--Lax formula, and c:=sup⁡Rn∣u0−v0∣∈[0,∞).

[F1]

For t>0 and x∈Rn, Qtu0(x)=inf⁡y∈Rn{u0(y)+tL((x−y)/t)} and Qtv0(x)=inf⁡y∈Rn{v0(y)+tL((x−y)/t)}, with infima computed in R∪{+∞}; for t=0, Q0u0=u0 and Q0v0=v0 (The Hopf--Lax operator and the Hopf--Lax formula).

[F2]

L(v)=sup⁡p∈Rn(p⋅v−H(p)) for every v, so L(v)≥−H(0) and L(v) is the least upper bound of {p⋅v−H(p):p∈Rn} (The Legendre transform of a finite-valued convex Hamiltonian).

[F3]

Every convex function on an open convex set is continuous; in particular H is continuous on Rn (A convex function on an open convex set is continuous).

[F4]

A nonempty subset of Rn is compact if and only if it is closed and bounded, and every continuous real-valued function on a nonempty compact subset attains a maximum and a minimum there (For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

Proof

technique · compare the two infima termwise, then record the finiteness of the Lagrangian values
1.1F1F2F3F4algebra

The Lagrangian values and Hopf--Lax values are real. Fix v∈Rn. The lower bound L(v)≥−H(0) is [F2]. For the upper bound, superlinearity of H gives R>0 with H(p)≥2∣v∣ ∣p∣ whenever ∣p∣≥R; then p⋅v−H(p)≤∣v∣ ∣p∣−2∣v∣ ∣p∣≤0 for such p. On the closed ball B‾(0,R), which is nonempty, closed and bounded and hence compact by [F4], the continuous function p↦p⋅v−H(p) (continuity of H is [F3]) attains a maximum Mv<∞ by [F4]. Therefore p⋅v−H(p)≤max⁡{Mv,0}<∞ for every p, so the least upper bound L(v) of [F2] is real. For t>0, every Hopf--Lax term is bounded below by inf⁡u0−tH(0), and the competitor y=x gives the finite upper bound Qtu0(x)≤u0(x)+tL(0); hence Qtu0(x)∈R, and likewise for v0.

2.1F1F2step 1.1algebra

One-sided comparison for t>0. Fix x and t>0, and write a(y):=u0(y)+tL((x−y)/t) and b(y):=v0(y)+tL((x−y)/t). By step 1.1 and [F2], b is real-valued, bounded below by inf⁡v0−tH(0), and has a finite value at y=x, so m:=inf⁡yb(y)=Qtv0(x) is real. Since u0(y)≤v0(y)+c, we have a(y)≤b(y)+c for every y. For each ε>0, the infimum property gives a y with b(y)<m+ε, and then Qtu0(x)=inf⁡ya(y)≤a(y)≤b(y)+c<m+c+ε. Letting ε↓0 gives Qtu0(x)≤Qtv0(x)+c.

3.1step 1.1step 2.1F1∎

Conclusion. Fix t>0 and x. Applying step 2.1 to (u0,v0) and to (v0,u0), whose value of c is unchanged, gives both one-sided inequalities; the Hopf--Lax values are real by step 1.1, so ∣Qtu0(x)−Qtv0(x)∣≤c. For t=0 this is ∣u0(x)−v0(x)∣≤c by [F1]. Taking the supremum over x gives sup⁡∣Qtu0−Qtv0∣≤c=∥u0−v0∥∞.

Remarks

  • Hypotheses actually used. Only convexity, superlinearity, boundedness of the data and the algebraic form of the infimum enter; uniform continuity and the localisation lemma are not needed for this estimate. The argument also shows L is real-valued under superlinearity, a fact used independently in Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers.
  • Sharpness. The constant 1 is optimal: for t>0 constant data are preserved by Qt up to the same constant, so the operator is nonexpansive and no smaller universal constant can hold.
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The Hopf--Lax operator preserves a modulus of continuity

Statement

Let H:Rn→R be convex and superlinear with Legendre transform L, and let u0:Rn→R be bounded and uniformly continuous with a nondecreasing modulus of continuity ω satisfying ω(r)→0 as r↓0 and ∣u0(y)−u0(y′)∣≤ω(∣y−y′∣). Then for every t≥0 and all x,x′∈Rn, ∣Qtu0(x)−Qtu0(x′)∣≤ω(∣x−x′∣). Thus every Qtu0 has the same modulus of continuity and the family is spatially equicontinuous; this is the equicontinuity input of the initial-trace and vanishing-viscosity arguments. No choice principle is used.

Facts & Assumptions

Given: A convex superlinear H, its Legendre transform L, a bounded uniformly continuous u0 with modulus ω as in the statement, the operators Qt of The Hopf--Lax operator and the Hopf--Lax formula, and points x,x′∈Rn with d:=x−x′.

[F1]

For t>0, Qtu0(x)=inf⁡y∈Rn{u0(y)+tL((x−y)/t)}, with the infimum in R∪{+∞}; Q0u0=u0 (The Hopf--Lax operator and the Hopf--Lax formula).

[F2]

Under the present hypotheses L is real-valued, the infima above are attained, and Qtu0(x)∈R for every x and every t≥0 (Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers), so all infima compared below are real numbers.

[F3]

The given modulus is a nondecreasing function ω with ω(r)→0 as r↓0 and ∣u0(y)−u0(y′)∣≤ω(∣y−y′∣) for all y,y′. This is a hypothesis of the statement; it implies the epsilon--delta uniform continuity of Uniform continuity of a map of metric spaces: one δ serving every point by choosing δ>0 with ω(δ)<ε.

Proof

technique · translate a competitor in the infimum
1.1F1F2F3algebra

Translation of a competitor. Fix t>0 and let d:=x−x′. For every y′∈Rn put y:=y′+d. Then (x−y)/t=(x′−y′)/t and, by [F3], u0(y)≥u0(y′)−ω(∣d∣); hence u0(y)+tL((x−y)/t)≥u0(y′)+tL((x′−y′)/t)−ω(∣d∣). As y′ ranges over Rn so does y, so taking the infimum over y′ of the right-hand side and using [F1] and [F2] gives Qtu0(x)≥Qtu0(x′)−ω(∣x−x′∣). Exchanging x and x′ gives the reverse inequality Qtu0(x′)≥Qtu0(x)−ω(∣x−x′∣).

2.1step 1.1F1∎

Conclusion. For t>0 step 1.1 gives ∣Qtu0(x)−Qtu0(x′)∣≤ω(∣x−x′∣), and for t=0 the same inequality is the hypothesis ∣u0(x)−u0(x′)∣≤ω(∣x−x′∣) by [F1]. Hence every Qtu0 has modulus ω, uniformly in t, and the estimate is translation invariant because L does not depend on the space variable.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Hopf--Lax operators form a semigroup (dynamic programming)

Statement

Let H:Rn→R be convex and superlinear with Legendre transform L, and let u0:Rn→R be bounded and uniformly continuous. Then for all t,s≥0 the Hopf--Lax operators of The Hopf--Lax operator and the Hopf--Lax formula satisfy Qt+su0=Qt(Qsu0)=Qs(Qtu0)pointwise on Rn, where the inner operators are applied to the bounded uniformly continuous function Qsu0 (or Qtu0) produced by The Hopf--Lax operator preserves a modulus of continuity. Equivalently, for all t,s>0 and x∈Rn the short-time variational principle holds: Qt+su0(x)=inf⁡z∈Rn{Qsu0(z)+tL(x−zt)}. The family (Qt)t≥0 is therefore a semigroup with Q0=id on the bounded uniformly continuous data. No choice principle is used.

Facts & Assumptions

Given: A convex superlinear H with Legendre transform L, a bounded uniformly continuous u0, the operators Qt of The Hopf--Lax operator and the Hopf--Lax formula, and t,s>0.

[F1]

Qtu0(x)=inf⁡y∈Rn{u0(y)+tL((x−y)/t)} for t>0, Q0u0=u0, and under the present hypotheses all these infima are real and attained (The Hopf--Lax operator and the Hopf--Lax formula, Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers).

[F2]

L is convex: L((1−λ)w1+λw2)≤(1−λ)L(w1)+λL(w2) for all w1,w2 and λ∈[0,1] (Convex and strictly convex functions on Euclidean convex sets).

[F3]

Qsu0 is bounded and has the modulus of continuity of u0; in particular it is bounded and uniformly continuous, so the inner operator Qt is defined on it (The Hopf--Lax operator preserves a modulus of continuity).

Proof

technique · the two-point convexity inequality with weights adapted to $t$ and $s$
1.1F1F2F3algebra

The inequality Qt+su0≤Qt(Qsu0). Fix y,z∈Rn and write (x−y)/(t+s)=tt+sx−zt+st+sz−ys, a convex combination with weights t/(t+s) and s/(t+s); by [F2], L((x−y)/(t+s))≤tt+sL((x−z)/t)+st+sL((z−y)/s). Multiplying by t+s and adding u0(y) gives u0(y)+(t+s)L((x−y)/(t+s))≤[u0(y)+sL((z−y)/s)]+tL((x−z)/t). Taking the infimum over y on the left and over y and then z on the right (the double infimum is an infimum over pairs, legitimate for real infima by [F1]) yields Qt+su0(x)≤inf⁡z{Qsu0(z)+tL((x−z)/t)}=Qt(Qsu0)(x).

1.2F1F2F3algebra

The reverse inequality. Fix y∈Rn and choose the segment point z:=y+st+s(x−y), for which z−ys=x−zt=x−yt+s. Then u0(y)+sL((z−y)/s)+tL((x−z)/t)=u0(y)+(t+s)L((x−y)/(t+s)); taking the infimum over y gives Qt(Qsu0)(x)≤Qt+su0(x).

2.1step 1.1step 1.2F1F3∎

Conclusion. Steps 1.1 and 1.2 give Qt+su0=Qt(Qsu0) for all t,s>0. The operator Qs maps the bounded uniformly continuous datum to a bounded uniformly continuous function by [F3], so the composition is well defined; swapping the roles of t and s in the same computation gives Qt+su0=Qs(Qtu0), and the case t=0 or s=0 is the definition Q0=id of [F1]. Hence (Qt)t≥0 is a semigroup of operators on the bounded uniformly continuous data, and the displayed short-time variational principle is the identity Qt(Qsu0)=Qt+su0 written out.

Remarks

  • Choice. The two inequalities are computed by taking infima over explicit sets of reals; the segment point z is given by a formula, so nothing is selected and no choice principle is used.
  • Why the datum class is preserved. The semigroup statement needs the inner operator to be applied to a bounded uniformly continuous function, which is exactly the content of The Hopf--Lax operator preserves a modulus of continuity together with the boundedness following from u0 bounded and L≥−H(0).
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

A Hopf--Lax minimiser satisfies the characteristic Euler relation at differentiability points

Statement

Let H:Rn→R be convex and superlinear with Legendre transform L, let u0:Rn→R be bounded and continuous, and let t>0, x∈Rn. Let y be a minimiser of φ(y):=u0(y)+tL((x−y)/t), which exists by Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers, put v:=(x−y)/t, and set u:=Qtu0. Then: (1) if u0 is differentiable at y and L is differentiable at v, then Du0(y)=DL(v); (2) if L is differentiable at v and u is differentiable at x, then Du(x)=DL(v). No choice principle is used.

Facts & Assumptions

Given: A convex superlinear H with Legendre transform L, bounded continuous u0, t>0, x∈Rn, a minimiser y of φ(y)=u0(y)+tL((x−y)/t), v=(x−y)/t, u=Qtu0, and the Euclidean norm ∣⋅∣.

[F1]

Qtu0(x)=inf⁡y∈Rn{u0(y)+tL((x−y)/t)}, and the infimum is attained under the present hypotheses (The Hopf--Lax operator and the Hopf--Lax formula, Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers).

[F2]

f is differentiable at a with derivative Df(a) exactly when f(a+h)=f(a)+Df(a)h+r(h) with r(h)/∣h∣→0 as h→0; in that case every directional derivative exists and equals Df(a)h (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, Directional derivatives and partial derivatives of a map U⊆Rm→Rn).

Proof

technique · expand the minimality inequality to first order in the direction of the perturbation
1.1F1F2algebra

First-order condition at a minimiser. Fix h∈Rn and τ∈(0,1); minimality of y at the point x gives u0(y)+tL(v)≤u0(y+τh)+tL(v−τh/t), where u0(y)+tL(v)=Qtu0(x) by [F1]. Assume u0 is differentiable at y and L at v. Then u0(y+τh)=u0(y)+τ⟨Du0(y),h⟩+ru(τh) and L(v−τh/t)=L(v)−τ⟨DL(v),h/t⟩+rL(−τh/t) with ru(τh)/∣τh∣→0 and rL(−τh/t)/∣τh∣→0 as τ↓0 by [F2]. Substituting and cancelling u0(y)+tL(v) gives τ⟨Du0(y),h⟩+ru(τh)≥τ⟨DL(v),h⟩−trL(−τh/t); dividing by τ>0 and letting τ↓0 gives ⟨Du0(y),h⟩≥⟨DL(v),h⟩.

2.1step 1.1F2algebra∎

The two equalities. The inequality of step 1.1 holds for every h∈Rn; applying it to −h as well gives ⟨Du0(y)−DL(v),h⟩≥0 and ⟨Du0(y)−DL(v),−h⟩≥0, that is ∣⟨Du0(y)−DL(v),h⟩∣≤0 for all h. Taking h=Du0(y)−DL(v) gives ∣Du0(y)−DL(v)∣2≤0, hence Du0(y)=DL(v), which is (1). For (2), minimality of y at the point x+τh gives u(x+τh)=Qtu0(x+τh)≤u0(y)+tL(v+τh/t)=u(x)+t(L(v+τh/t)−L(v)), and if L is differentiable at v and u at x then [F2] gives u(x+τh)=u(x)+τ⟨Du(x),h⟩+r1(τh) and t(L(v+τh/t)−L(v))=τ⟨DL(v),h⟩+r2(τh) with ri(τh)/(τ∣h∣)→0. Dividing by τ and letting τ↓0 gives ⟨Du(x),h⟩≤⟨DL(v),h⟩ for every h; applying this to −h yields Du(x)=DL(v) by the same argument as above, which is (2).

Remarks

  • Differentiability is assumed only where used. The minimiser exists by the localisation lemma, and the first-order conditions are obtained by perturbing the minimiser in a direction and expanding: no global smoothness of u0, L or Qtu0 is asserted, and in the convex-quadratic case H(p)=∣p∣2/2 a minimiser need not be unique when u0 is merely continuous.
  • Direction of the two relations. Part (1) relates the datum to the Lagrangian at the minimiser, part (2) relates the value function to the Lagrangian at the same minimiser; together they identify the slope of the minimising chord with the conjugate momentum.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Comparison for autonomous convex superlinear Hamiltonians

Statement

Let n≥1 and let H:Rn→R be finite-valued, continuous, convex and superlinear. Let T>0. Suppose u and v are bounded uniformly continuous on Rn×[0,T], their restrictions to Z=Rn×(0,T) are respectively a viscosity subsolution and a viscosity supersolution of ut+H(Du)=0, and their continuous initial traces satisfy u(x,0)≤v(x,0) for every x∈Rn. Then u≤v on Z. No choice principle is used.

Facts & Assumptions

Given: A finite continuous convex superlinear H:Rn→R, T>0, bounded uniformly continuous u,v on Rn×[0,T] whose restrictions to Z are a viscosity subsolution and supersolution of ut+H(Du)=0 with u(⋅,0)≤v(⋅,0), and positive parameters η,η′,ρ,α,P,ε,δ.

[F1]

At every local maximum of w−ϕ with ϕ∈C1(Z) a viscosity subsolution w satisfies ϕt+H(Dϕ)≤0, and at every local minimum a viscosity supersolution satisfies ϕt+H(Dϕ)≥0 (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

Uniform continuity of a map on a metric space means: for every σ>0 there is τ>0 such that ∣f(p)−f(q)∣<σ whenever d(p,q)<τ; hence u and v admit bounded time moduli ωu,ωv and their two initial traces admit a bounded common spatial modulus ω0, with ∣u(x,t)−u(x,t′)∣≤ωu(∣t−t′∣), ∣v(y,s)−v(y,s′)∣≤ωv(∣s−s′∣), and both ∣u(x,0)−u(y,0)∣,∣v(x,0)−v(y,0)∣≤ω0(∣x−y∣) (Uniform continuity of a map of metric spaces: one δ serving every point).

[F3]

A nonempty subset of Rn is compact exactly when it is closed and bounded, and a continuous real-valued function on such a set attains its maximum and minimum (For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

[F4]

A continuous function on a compact metric space is uniformly continuous there (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

[F5]

Every upper semicontinuous real-valued function on a nonempty compact subset of Rn is bounded above and attains a maximum (Semicontinuous extreme value theorem on compact Euclidean sets).

Proof

technique · strict time penalties, a bounded-gradient radial spatial penalty with a vanishing coercive weight, and control of the initial faces by the ordered traces and their moduli
1.1F1algebra

Penalisation. Put u~η(x,t)=u(x,t)−η/(T−t) and v~η′(y,s)=v(y,s)+η′/(T−s) for t,s<T. If ϕ is a C1 upper test for u~η at an interior point z0, then ϕ+η/(T−t) is a C1 upper test for u, so ut evaluation and [F1] give ϕt(z0)+η/(T−t0)2+H(Dϕ(z0))≤0, that is ϕt+H(Dϕ)≤−η/(T−t0)2≤−η/T2; dually every C1 lower test ϕ for v~η′ satisfies ϕt+H(Dϕ)≥η′/(T−s0)2≥η′/T2. Moreover u~η(x,t)≤sup⁡u−η/(T−t)→−∞ and v~η′(y,s)≥inf⁡v+η′/(T−s)→+∞ as t↑T, respectively s↑T, uniformly in the space variable.

1.2assume-contraF2F3F4F5algebra

The doubling function and the initial-face bound. Assume for contradiction that u(x0,t0)>v(x0,t0) for some 0<t0<T and put δ:=14(u(x0,t0)−v(x0,t0))>0. Fix η,η′>0 with u~η(x0,t0)−v~η′(x0,t0)>3δ and put B:=η+η′>0. Choose a>0 so small that ω0(a)<B/(8T), and then P>0 with Pa>sup⁡r≥0ω0(r); this gives sup⁡r≥0(ω0(r)−Pr)<B/(8T) by splitting at a. then ε>0 with Pε<B/(8T), and ψ(r):=P(r2+ε2−ε), so that ∣P(x−y)/∣x−y∣2+ε2∣≤P, ψ(r)≥Pr−Pε and ψ(0)=0; put χ(x):=1+∣x∣2. Choose ρ>0 with ρ≤1, 2ρχ(x0)<δ, and such that ∣H(p)−H(q)∣<B/T2 whenever ∣p−q∣≤2ρ and ∣p∣,∣q∣≤P+1: the last requirement is possible because H is uniformly continuous on the compact set {∣p∣≤P+1} by [F3] and [F4]. For α>0 define Φα(x,y,t,s):=u~η(x,t)−v~η′(y,s)−ψ(∣x−y∣)−α2∣t−s∣2−ρ(χ(x)+χ(y)) for 0≤t,s<T, and set Φα:=−∞ if t=T or s=T. At the diagonal point (x0,x0,t0,t0) we have Φα=u~η(x0,t0)−v~η′(x0,t0)−2ρχ(x0)>3δ−δ=2δ for every α, while Φα≤sup⁡u−inf⁡v<∞. The penalty −ρ(χ(x)+χ(y)) makes the superlevel set Sα:={Φα≥2δ} bounded, and Sα is closed because Φα is upper semicontinuous (it is continuous where t,s<T, and tends to −∞ at the terminal faces, where it is −∞) and 2δ>−∞; by [F3] Sα is compact and it is nonempty by the diagonal estimate. On Sα the function Φα is real-valued, and it is upper semicontinuous as a restriction of an upper semicontinuous function, so it attains on Sα a maximum Mα≥2δ by [F5], and by [F3] the value Mα is finite; a maximum on Sα is a global maximum of Φα because every point outside Sα has value <2δ≤Mα, and every maximiser lies in Sα, hence has tα,sα<T. So for every α there is a maximiser (xα,yα,tα,sα) with Φα(xα,yα,tα,sα)≥2δ and tα,sα<T.

2.1step 1.2F2algebra

Initial faces are excluded for large α. Since u~η−v~η′≤sup⁡u−inf⁡v, the inequality Φα≥2δ gives α2∣tα−sα∣2≤sup⁡u−inf⁡v−2δ, so ∣tα−sα∣→0 as α→∞. If tα=0, then using u(xα,0)≤v(xα,0), the initial modulus ω0, the time modulus ωv and ψ(r)≥Pr−Pε we get Φα≤ω0(∣xα−yα∣)−P∣xα−yα∣+Pε+ωv(sα)−BT≤B8T+B8T−BT+ωv(sα)<0 for all large α, because sα→0 by ∣tα−sα∣→0; this contradicts Φα≥2δ. The case sα=0 is identical with ωu in place of ωv. Hence for all sufficiently large α every maximiser has 0<tα,sα<T.

3.1step 1.1step 1.2step 2.1algebradischarge-contradiction∎

Contact inequalities and the contradiction. Fix α large enough that step 2.1 applies and ∣tα−sα∣<T. At the maximiser, fixing (yα,sα) shows that ϕU(x,t):=ψ(∣x−yα∣)+ρχ(x)+α2∣t−sα∣2 is a C1 upper test for u~η at (xα,tα), and fixing (xα,tα) shows that ϕV(y,s):=−ψ(∣xα−y∣)−ρχ(y)−α2∣tα−s∣2 is a C1 lower test for v~η′ at (yα,sα). Their derivatives are p:=P(xα−yα)∣xα−yα∣2+ε2+ρxαχ(xα), q:=P(xα−yα)∣xα−yα∣2+ε2−ρyαχ(yα) and a:=α(tα−sα), with ∣p∣,∣q∣≤P+ρ≤P+1 and ∣p−q∣=ρ∣xαχ(xα)+yαχ(yα)∣≤2ρ because ∣z∣/χ(z)≤1 for every z. Step 1.1 applied to the two tests gives a+H(p)≤−η/T2 and a+H(q)≥η′/T2, hence B/T2=η+η′T2≤H(q)−H(p). But ∣p−q∣≤2ρ and ∣p∣,∣q∣≤P+1, so the choice of ρ in step 1.2 gives ∣H(q)−H(p)∣<B/T2, a contradiction. Therefore no point with u>v exists in Z, that is u≤v on Z.

Remarks

  • Why the radial penalty has bounded gradient. With ψ(r)=P(r2+ε2−ε) one has 0≤ψ′(r)<P, so the spatial doubling contributes gradients of modulus at most P and the difference p−q contains exactly the term ρ(⋅) of the weight. The vanishing of ε is not used as a limit: the estimates hold for a fixed positive ε.
  • Role of each face. The time penalties give the strict margin B/T2 and remove the terminal faces; the weight ρ(χ(x)+χ(y)) makes the superlevel sets compact; the initial faces are handled by the pointwise order of the traces and their moduli, so no value-function or semijet machinery beyond the stated hypotheses is needed. The Hilbert-space semijet theorem is not required, which is why H(p)=∣p∣2/2 is covered.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Hopf--Lax formula solves the Hamilton--Jacobi Cauchy problem

Statement

Let H:Rn→R be finite-valued, continuous, convex, and superlinear, with Legendre transform L, and let u0:Rn→R be bounded and uniformly continuous. Define u(x,t):=Qtu0(x) by The Hopf--Lax operator and the Hopf--Lax formula. Then u is a bounded uniformly continuous function on Rn×[0,T] for every T>0, and: (1) u is a viscosity solution of ut+H(Du)=0 in Rn×(0,∞); (2) u attains the initial datum locally uniformly, sup⁡x∈K∣u(x,t)−u0(x)∣⟶0(t↓0) for every compact K⊆Rn; (3) u is the unique bounded uniformly continuous viscosity solution of the Cauchy problem with datum u0; (4) u satisfies the dynamic-programming relation Qt+su0=QtQsu0 of The Hopf--Lax operators form a semigroup (dynamic programming). No choice principle is used.

Facts & Assumptions

Given: A finite continuous convex superlinear H with Legendre transform L, a bounded uniformly continuous datum u0 with bounded modulus ω (replace any given modulus by its minimum with 2∥u0∥∞), and u=Qtu0.

[F1]

For t>0, Qtu0(x)=inf⁡y{u0(y)+tL((x−y)/t)}, the infimum being attained, and L is real-valued on Rn (The Hopf--Lax operator and the Hopf--Lax formula, Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers).

[F2]

Qt+su0=Qt(Qsu0) for all t,s≥0 (The Hopf--Lax operators form a semigroup (dynamic programming)).

[F3]

H=L∗, that is H(p)=sup⁡v(p⋅v−L(v)) (A finite-valued convex Hamiltonian equals its biconjugate).

[F4]

Qtu0 has the modulus ω of u0, and ∣Qtu0(x)−Qtv0(x)∣≤∥u0−v0∥∞ (The Hopf--Lax operator preserves a modulus of continuity, The Hopf--Lax operator is a contraction in the supremum norm).

[F5]

Comparison for autonomous convex superlinear Hamiltonians: bounded uniformly continuous subsolutions and supersolutions of ut+H(Du)=0 on Rn×[0,T] with ordered continuous initial traces satisfy the comparison inequality (Comparison for autonomous convex superlinear Hamiltonians).

Proof

technique · the dynamic-programming inequality in both directions, the biconjugacy $H=L^*$, and comparison for uniqueness
1.1F1F2F4algebra

Boundedness and uniform continuity. For every x and t≥0 we have inf⁡u0−tH(0)≤u(x,t)≤∥u0∥∞+tL(0): the upper bound is the competitor y=x in [F1], and the lower bound follows from L≥−H(0). By [F4] the map x↦u(x,t) is uniformly continuous with modulus ω uniformly in t. For t≥s≥0, [F2] and [F4] give ∣u(x,t)−u(x,s)∣≤∥Qt−su0−u0∥∞; and ∥Qτu0−u0∥∞→0 as τ↓0, since Qτu0≤u0+τL(0) and Qτu0(x)≥u0(x)−sup⁡v{ω(τ∣v∣)−τL(v)}, the supremum tending to 0 as follows. For a>0, set M=∥u0∥∞ and choose A=(2M+1)/a. Superlinearity and continuity of L give b≥0 with L(v)≥A∣v∣−b everywhere. If τ∣v∣≥a, then ω(τ∣v∣)−τL(v)≤−1+bτ; if τ∣v∣<a, then L(v)≥−H(0) gives the bound ω(a)+τH(0). Thus the limsup of the supremum is at most ω(a), which tends to zero as a↓0; its liminf is at least zero by the competitor v=0 and ω(0)=0. Hence u is bounded and uniformly continuous on each strip Rn×[0,T].

1.2F2F3algebra

The subsolution inequality. Let ϕ∈C1 and let u−ϕ have a strict local maximum at (x0,t0) with t0>0. Fix v∈Rn and small h>0, put y:=x0−hv, and use the dynamic-programming identity u(x0,t0)=Qh(Qt0−hu0)(x0)≤u(y,t0−h)+hL(v), the inequality coming from the competitor y in the infimum defining Qh. The contact inequality at (x0,t0) gives u(y,t0−h)≤u(x0,t0)−ϕ(x0,t0)+ϕ(y,t0−h), and combining the two gives ϕ(x0,t0)−ϕ(x0−hv,t0−h)≤hL(v). Dividing by h and letting h↓0 yields ϕt(x0,t0)+⟨Dϕ(x0,t0),v⟩≤L(v) for every v; taking the supremum over v and using H=L∗ of [F3] gives ϕt(x0,t0)+H(Dϕ(x0,t0))≤0. Non-strict maxima are handled by strictification, so u is a viscosity subsolution.

2.1F1F2F3step 1.2algebra

The supersolution inequality. Let u−ϕ have a strict local minimum at (x0,t0) with t0>0. By [F1] there is a minimiser y of u0(y)+t0L((x0−y)/t0); put v:=(x0−y)/t0, so that u(x0,t0)=u0(y)+t0L(v). For 0<h<t0 put zh:=y+t0−ht0(x0−y), so that (zh−y)/(t0−h)=v and zh→x0. The dynamic-programming identity at (zh,t0−h) with the competitor y gives u(zh,t0−h)≤u0(y)+(t0−h)L(v)=u(x0,t0)−hL(v), hence u(x0,t0)−u(zh,t0−h)≥hL(v). The contact inequality at the local minimum gives u(zh,t0−h)≥u(x0,t0)−ϕ(x0,t0)+ϕ(zh,t0−h); combining, ϕ(x0,t0)−ϕ(zh,t0−h)≥hL(v). Dividing by h and letting h↓0 along zh→x0 gives ϕt(x0,t0)+⟨Dϕ(x0,t0),v⟩≥L(v), and since H(Dϕ)=sup⁡w(⟨Dϕ,w⟩−L(w))≥⟨Dϕ,v⟩−L(v) by [F3], we get ϕt+H(Dϕ)≥0. Hence u is a viscosity supersolution, and with step 1.2 it is a viscosity solution of ut+H(Du)=0.

2.2F1step 1.1algebra

The initial trace. For τ>0 and every x, Qτu0(x)≤u0(x)+τL(0) and Qτu0(x)≥u0(x)−sup⁡v{ω(τ∣v∣)−τL(v)}, and the latter supremum tends to 0 by the bounded-modulus estimate in step 1.1; hence sup⁡Rn∣Qτu0−u0∣→0, which is the stated locally uniform (indeed uniform) attainment of the initial datum.

3.1step 1.2step 2.1F2F5∎

Uniqueness and the semigroup. Any bounded uniformly continuous viscosity solution of the Cauchy problem with datum u0 is comparable with u by [F5], in both orders, because both are bounded uniformly continuous and have the same continuous initial trace; hence u is the unique such solution. Property (4) is [F2].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Vanishing viscosity selects the viscosity solution

Statement

Let n≥1, T>0, Z=Rn×(0,T), and Z0=Rn×[0,T). Let H:Rn×[0,T]×Rn→R satisfy the Lipschitz conditions of part (a) of Comparison for first-order Hamilton--Jacobi equations, let u0:Rn→R be bounded and uniformly continuous, and let u0(ε)→u0 locally uniformly on Rn. For each ε∈(0,1) let uε:Z→R be a viscosity solution of utε+H(x,t,Duε)=εΔuεin Z, meaning that for every test function ϕ∈C1,2(Z) the residual ϕt+H(z,Dϕ)−εΔϕ is nonpositive at each local maximum of uε−ϕ and nonnegative at each local minimum. Assume that uε has initial datum u0(ε) in the relaxed Cauchy sense. Suppose the family is uniformly bounded on Z and locally equicontinuous up to the initial face: there is M<∞ with ∣uε(z)∣≤M for every ε∈(0,1) and z∈Z, and for every compact K⊆Z0 and every η>0 there is δ>0 such that ∣uε(z)−uε(z′)∣<η for all ε∈(0,1) and z,z′∈K∩Z with ∣z−z′∣<δ. These estimates give each uε a continuous trace on the initial face. Then uε→u locally uniformly on Z, where u is the unique bounded viscosity solution of ut+H(x,t,Du)=0 with datum u0. Neither existence of the approximants nor a compactness theorem is asserted: the boundedness and equicontinuity estimates are hypotheses. No choice principle is used.

Facts & Assumptions

Given: The Hamiltonian H with the Lipschitz conditions of comparison case (a), bounded uniformly continuous u0, data u0(ε)→u0 locally uniformly, a uniformly bounded family (uε) of viscous solutions, locally equicontinuous up to the initial face, with data u0(ε) in the relaxed sense, and the half-relaxed limits u‾,u‾ of the family (Half-relaxed limits of a locally bounded family).

[F1]

For every fixed ϕ∈C1,2(Z), at each local maximum of uε−ϕ one has ϕt+H(z,Dϕ)≤εΔϕ(z), and at each local minimum ϕt+H(z,Dϕ)≥εΔϕ(z). Thus the errors are bounded in absolute value by cε(z):=ε∣Δϕ(z)∣, which is locally bounded and tends to 0 locally uniformly by the explicitly assumed second-order test inequalities in the statement; the limit equation is tested in the first-order sense of Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem.

[F2]

The case-(a) finite-cover argument of Half-relaxed limits of sub- and supersolutions with vanishing perturbations proves the subsolution inequality at a strict contact from the inequality for that fixed smooth test and a locally uniformly vanishing error; the dual argument proves the supersolution inequality. The same item proves passage of the relaxed initial datum under local equicontinuity up to that face.

[F3]

Comparison, case (a), applies to the bounded upper semicontinuous subsolution u‾ and the bounded lower semicontinuous supersolution u‾ when their relaxed initial data agree (Comparison for first-order Hamilton--Jacobi equations); uniqueness in the bounded class is Uniqueness and sup-norm contraction for the Cauchy problem.

[F5]

A nonnegative smooth compactly supported bump equal to 1 on a smaller ball is supplied by A smooth bump between concentric Euclidean balls. Its integral is finite and positive, so normalization gives a unit-mass bump and the scaled family of The mollifier family generated by a unit-mass smooth bump. Here only compact Riemann integrals are needed: continuous integrands on compact boxes are integrable (A continuous real function on a compact Jordan measurable set is Riemann integrable over that set), and monotonicity and linearity give ∣∫Qg∣≤vol⁡(Q)sup⁡Q∣g∣ (Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm). For a C1 function f near a compact ball, first multiply by such a smooth cutoff equal to 1 on a slightly larger ball and extend by zero, obtaining a globally C1 compactly supported function. Its convolution with the fixed bump is smooth: on a fixed integration box every kernel-derivative difference quotient converges uniformly, by the mean value theorem and uniform continuity of the next derivative, so the integral bound passes each derivative through the integral. For the affine changes y=x−ρz on a compact integration box, Change of variables for an injective C1 map on a compact Jordan set applies: the derivative is the invertible matrix −ρI and the absolute determinant is ρn+1. Thus, using the fixed-kernel formula ∫f(x−ρy)η(y) dy gives first derivatives by the same uniform difference-quotient argument. Unit mass then bounds the errors in f and Dif by their moduli of continuity at distance ρRη, which tend to zero by Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous. These compact-integral arguments use no choice (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)).

Proof

technique · half-relaxed limits, stability with a vanishing perturbation, comparison, and a compactness-free conversion to local uniform convergence
1.1F1F2F4F5

The relaxed limits are sub- and supersolutions with common initial data. First take a smooth strict upper test ψ for u‾ at an interior point. The case-(a) compact finite-cover proof in [F2] applies using the fixed smooth test ψ+∣z−z0∣2 at the approximating contacts: its viscosity error is bounded by ε∣Δx(ψ+∣z−z0∣2)∣, which tends uniformly to zero on the compact contact region, so the half-relaxed limit satisfies ψt+H(z,Dψ)≤0. The dual argument gives the lower-limit supersolution inequality for smooth strict lower tests. To extend these inequalities to an arbitrary C1 test ϕ, strictify its contact by adding or subtracting a quartic (Strictification of a viscosity test function by a quartic perturbation). On a closed ball around the contact, convolve ϕ locally with a fixed compactly supported smooth unit-mass bump at scales tending to zero; uniform continuity of ϕ and Dϕ on that ball gives smooth approximants converging in C1. Maximise u‾−ϕj on the ball for each approximant. The strict contact and uniform convergence imply that the sets of such maximisers are interior for large j and their distance to the original contact tends uniformly to zero. Strictify each smooth test at its maximiser by a quartic and apply the fixed-test argument above. Passing to the limit using C1 convergence and continuity of H proves the required inequality for ϕ; the lower-test argument is dual. Thus u‾ is a subsolution and u‾ a supersolution for the full C1 test definition. Finally, local equicontinuity gives each approximant a continuous initial trace. Its relaxed initial condition makes that trace equal to u0(ε); local uniform convergence of these data and the shared boundary modulus then pass the initial trace to both half-relaxed limits.

2.1step 1.1F3

Comparison forces the two limits to agree. The subsolution u‾ is bounded and upper semicontinuous and the supersolution u‾ is bounded and lower semicontinuous, with the same relaxed initial data u0; comparison [F3] gives u‾≤u‾ on Z. Since u‾≤u‾ pointwise by the definition of the half-relaxed limits, the two coincide: u‾=u‾=:u, which is therefore continuous; by [F3] it is the unique bounded viscosity solution with datum u0.

3.1step 2.1givenF4algebra∎

Locally uniform convergence. Let K⊆Z be compact and δ>0. For each z∈K, the equalities u‾(z)=u‾(z)=u(z) and the definition of the joint half-relaxed limits in Given give a radius rz>0 such that ∣uε(y)−u(z)∣<δ/3 whenever 0<ε<rz and y∈Z satisfies ∣y−z∣<rz. Shrink the radius, if necessary, so that also ∣u(y)−u(z)∣<δ/3 there. The family of all such admissible balls covers K; by [F4] take a finite subcover B(zi,ri) and put ε0:=min⁡iri>0. For every 0<ε<ε0 and y∈K, one of these balls contains y, so ∣uε(y)−u(y)∣<2δ/3<δ. This proves uniform convergence on K without selecting a sequence of parameters or points.

Remarks

  • What is not asserted. No existence of the viscous family is proved and no subsequence is extracted from the family itself; the boundedness and local equicontinuity are hypotheses. The pointwise equality of the two relaxed limits is equivalent to local uniform convergence of the family, which is the content of step 3.1.
  • Choice. The half-relaxed limits are computed as infima and suprema over sets; the comparison and uniqueness steps are choice-free, and the final conversion uses a finite cover of each compact set.
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Finite speed of dependence for Hamiltonians Lipschitz in momentum

Statement

Let n≥1, T>0, and let H:Rn×[0,T]×Rn→R be continuous. Suppose there are constants C>0 and L>0 such that, for all x,y,p,q∈Rn and t,s∈[0,T], ∣H(x,t,p)−H(y,s,p)∣≤C(1+∣p∣)(∣x−y∣+∣t−s∣),∣H(x,t,p)−H(x,t,q)∣≤L∣p−q∣. Let u,v:Rn×[0,T)→R be bounded, with u upper semicontinuous and v lower semicontinuous; assume that u is a viscosity subsolution and v a viscosity supersolution of ut+H(x,t,Du)=0 on Rn×(0,T). Fix x0∈Rn and R>0. If u(x,0)≤v(x,0) for every x∈B(x0,R), then u(x,t)≤v(x,t)for 0≤t<min⁡{T,R/L} and ∣x−x0∣<R−Lt. In particular, if u and v are bounded viscosity solutions with the same initial values on B(x0,R) and are also respectively lower and upper semicontinuous on Rn×[0,T) (so both are continuous there), then u(x,t)=v(x,t) on this open backward cone. The cone is stated with strict spatial inequality because B(x0,R) is open and no continuity of the initial traces is assumed. No choice principle is used.

Facts & Assumptions

Given: Continuous H with the two Lipschitz conditions, bounded u,v on Rn×[0,T) with u upper semicontinuous and v lower semicontinuous, u a subsolution and v a supersolution on Rn×(0,T), and u(x,0)≤v(x,0) for ∣x−x0∣<R.

[F1]

At every C1 local maximum of u−ϕ: ϕt+H(x,t,Dϕ)≤0; at every C1 local minimum of v−ϕ: ϕt+H(x,t,Dϕ)≥0 (Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem).

[F2]

The difference u−v is upper semicontinuous, since u is upper semicontinuous and −v is upper semicontinuous; adding continuous penalty terms preserves upper semicontinuity (Upper and lower semicontinuity on subsets of Rn).

[F3]

Closed bounded subsets of finite-dimensional Euclidean space are compact, upper semicontinuous real-valued functions attain their maxima on nonempty compact sets, and continuous functions attain their minima there (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent, Semicontinuous extreme value theorem on compact Euclidean sets). In particular, two disjoint compact sets in Euclidean space have positive distance.

[F4]

Comparison case (a) applies to the Hamiltonian G(x,t,p)=−L∣p∣, which has ∣G(x,t,p)−G(y,s,p)∣=0 and ∣G(x,t,p)−G(x,t,q)∣≤L∣p−q∣: a bounded upper semicontinuous subsolution and a bounded lower semicontinuous supersolution on the closed slab with ordered initial traces satisfy the comparison inequality (Comparison for first-order Hamilton--Jacobi equations).

Proof

technique · reduce the difference by a localised two-time doubling argument, then compare with a smooth radial cone barrier
1.1F1F2F3algebra

Reduction. Put w:=u−v, which is bounded and upper semicontinuous. Let ϕ∈C1 and suppose w−ϕ has a strict local maximum at z∗=(x∗,t∗)∈Z. Choose T∗ with t∗<T∗<T and a compact cylinder Q⋐Rn×(0,T∗) around z∗ on which the maximum is strict. Write z=(x,t) and z′=(y,s). For fixed ρ>0 set Gρ(z,z′):=u(x,t)−v(y,s)−ϕ(x,t)−ρ(∣x−x∗∣2+∣y−x∗∣2) and Fα(z,z′):=Gρ(z,z′)−α2∣z−z′∣2. By [F2]--[F3], Fα attains a finite maximum Mα on Q×Q, and Mα≥m∗:=(w−ϕ)(z∗) by evaluation at (z∗,z∗). The values Mα decrease with α and are bounded below by m∗, so they converge. For every maximiser (z,z′), comparison with Fα/2 at that same point gives α∣z−z′∣2≤4(Mα/2−Mα)→0, uniformly over the maximiser sets; in particular ∣z−z′∣→0 uniformly. Fix any sufficiently small open neighbourhood V of z∗ with closure in the interior of Q, and put A:=Q∖V. Strictness and [F2]--[F3] give mA:=max⁡z∈A(w−ϕ)(z)<m∗. Let γ:=(m∗−mA)/2>0 and ΔA:={(z,z):z∈A}. On ΔA, Gρ(z,z)≤mA=m∗−2γ. The compact superlevel set C:={(z,z′)∈A×Q:Gρ(z,z′)≥m∗−γ} is disjoint from ΔA. If C is nonempty, [F3] gives a positive distance d∗>0 between these compact sets; if it is empty, choose any d∗>0. Thus Gρ(z,z′)<m∗−γ whenever z∈A and ∣z−z′∣<d∗. For all sufficiently large α, every maximiser has ∣z−z′∣<d∗, so its first slot cannot lie in A, since its value is at least m∗. As V was arbitrary, all first slots converge uniformly to z∗; the second slots do also by the diagonal estimate. At each maximiser, fixing one slot gives C1 upper and lower contacts for u and v with spatial gradients pα:=Dϕ(z)+α(x−y)+2ρ(x−x∗) and qα:=α(x−y)−2ρ(y−x∗), and time derivatives ϕt(z)+α(t−s) and α(t−s). By [F1] and the two Lipschitz bounds, ϕt(z)≤H(y,s,qα)−H(x,t,pα)≤L∣qα−pα∣+2C(1+∣pα∣)∣z−z′∣. Since ∣z−z′∣→0, α∣z−z′∣2→0, and Dϕ is bounded on Q, the last error tends to zero uniformly over maximisers. Also qα−pα=−Dϕ(z)−2ρ((x−x∗)+(y−x∗))→−Dϕ(z∗) uniformly for fixed ρ. Passing to these uniform limits gives ϕt(z∗)−L∣Dϕ(z∗)∣≤0. The non-strict case follows by Strictification of a viscosity test function by a quartic perturbation; hence w is a viscosity subsolution of wt−L∣Dw∣=0 in Z.

1.2F3algebra

The cone barrier. Let M:=max⁡{0,sup⁡Rn×[0,T)w}, and let h:R→R be the explicit nondecreasing C1 cutoff with h=0 on (−∞,0], h(s)=3s2−2s3 for s∈[0,1] and h=1 on [1,∞). For 0<ε<R and δ>0 put ξε(r):=Mh((r−(R−ε))/ε) and ψε,δ(x,t):=ξε(∣x−x0∣2+δ2+Lt). Then ψε,δ is C1, bounded and nonnegative, and it is a classical supersolution of ψt−L∣Dψ∣=0 on Rn×(0,T): indeed ∣Dψ∣=ξε′⋅∣x−x0∣/∣x−x0∣2+δ2 and ψt=Lξε′, so ψt−L∣Dψ∣=Lξε′(1−∣x−x0∣/∣x−x0∣2+δ2)≥0 because ξε′≥0. At t=0 we have w(x,0)≤ψε,δ(x,0) for every x: for ∣x−x0∣<R this uses w(x,0)≤0≤ψε,δ(x,0), and for ∣x−x0∣≥R it uses ψε,δ(x,0)=M≥w(x,0) (the cutoff argument at t=0 is (∣x−x0∣2+δ2−(R−ε))/ε≥1).

2.1step 1.1step 1.2F3F4∎

Comparison with the barrier and conclusion. By step 1.1 the difference w is a bounded upper semicontinuous subsolution of wt+G(x,t,Dw)=0 and by step 1.2 the barrier is a bounded continuous supersolution of the same equation with ordered initial traces; comparison [F4] gives w≤ψε,δ on Rn×(0,T). At t=0 the desired inequality is the assumed initial order. Now fix 0<t<min⁡{T,R/L} and ∣x−x0∣<R−Lt. Choose ε>0 with ∣x−x0∣+Lt<R−ε and then δ>0 with ∣x−x0∣2+δ2+Lt≤R−ε; for these parameters the cutoff argument is at most 0, so ψε,δ(x,t)=0 and comparison gives w(x,t)≤0, that is u(x,t)≤v(x,t). Under the additional semicontinuity assumptions in the equality clause, v is an upper semicontinuous subsolution and u a lower semicontinuous supersolution on the same half-closed slab. Applying the same conclusion to (v,u) with the initial agreement then gives the reverse inequality and hence equality on the cone.

Remarks

  • Why the strict cone. The initial agreement is assumed only on the open ball and the initial traces need not be continuous; the barrier is built with R−ε and the limiting argument therefore produces the strict inequality ∣x−x0∣<R−Lt.
  • The reduction is not the comparison theorem for u−v directly. The reduction uses the two-sided doubling contacts and the momentum-Lipschitz bound, so the difference satisfies the Hamilton--Jacobi equation with the Hamiltonian −L∣p∣, to which comparison case (a) applies.
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Value functions and the Hamilton--Jacobi--Bellman equation: orientation only

Remarks

For a controlled dynamical system y′(⋅)=b(y,v) with running cost L(y,v) and initial cost u0, consider the value function u(x,t)=inf⁡{∫0tL(γ(s),v(s)) ds+u0(γ(0)): γ(t)=x, γ′=b(γ,v)} over admissible controls. When hypotheses make this value finite and continuous, ensure the dynamic programming principle, and give the viscosity characterization, u is a viscosity solution of the Hamilton--Jacobi--Bellman equation ut+H(x,Du)=0 with H(x,p)=sup⁡v{p⋅b(x,v)−L(x,v)}. To express the Legendre duality precisely, define the effective velocity cost ℓ(x,ξ):=inf⁡{L(x,v):b(x,v)=ξ}, with value +∞ when the fiber is empty. Then H(x,⋅) is the convex conjugate of ℓ(x,⋅); when ℓ(x,⋅) is proper, lower semicontinuous and convex, Fenchel--Moreau gives ℓ(x,ξ)=sup⁡p{p⋅ξ−H(x,p)} (Clason, Theorem 5.1(iii), recorded here as source-only orientation; The Legendre transform of a finite-valued convex Hamiltonian fixes the conjugate notation but does not prove this extended-valued result). If comparison holds in the chosen solution class, the viscosity solution is unique.

The sign convention is the one of this page: velocities are integrated forward from time 0 to time t, the running cost is accumulated forward, the initial cost is paid at time 0, and H is convex in p because it is a supremum of affine functions of p, irrespective of convexity of the control or velocity set. With this convention the Hopf--Lax operator of The Hopf--Lax operator and the Hopf--Lax formula is the special case of the formula in which the infimum over paths has been reduced to a single infimum over the starting point, u(x,t)=inf⁡y{u0(y)+tL((x−y)/t)}, for the autonomous convex superlinear case.

This remark records the interpretation only: no admissible-control framework, no measurable selection, no existence of optimal controls and no dynamic programming theorem for control systems is developed on this page, The stationary specialization of the displayed evolution equation is H(x,Du)=0; a separately discounted formulation leads to equations such as λu+H(x,Du)=f. The only dynamic-programming content of this page is the semigroup law for the Hopf--Lax operator The Hopf--Lax operators form a semigroup (dynamic programming), which is proved directly from the convexity of the Lagrangian. No choice principle is used; this orientation is recorded so that the Cauchy problems of The Hamilton--Jacobi Cauchy problem and its classical solutions can be read against their control origin.

5 · Examples, counterexamples and false statements

None yet.

Sources