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.
The Hopf--Lax operator and the Hopf--Lax formula
Definition
Let , let be convex and superlinear, let be its Legendre transform (The Legendre transform of a finite-valued convex Hamiltonian), and let be bounded and uniformly continuous (Uniform continuity of a map of metric spaces: one serving every point, Lower bound, bounded below, bounded set). For and define the infimum being computed in (The extended real line , its order, and the arithmetic that is left undefined, Greatest lower bound (infimum)) over the extended-real values ; the term is exactly when . Set .
The Hopf--Lax operator with Lagrangian is the family , and the function is the Hopf--Lax formula for the Cauchy problem , . 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 real-valued everywhere.
Remarks
- What is fixed and what is postponed. The definition fixes the autonomous Hamiltonian , convex and superlinear; the datum class, bounded and uniformly continuous ; the infimum over all of for , read in the extended reals; and the value . Neither the attainment of the infimum nor its finiteness is asserted here, and no assertion that 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 , the average velocity of a straight path from at time to at time ; the factor multiplies the Lagrangian density. This normalisation is the one for which the dynamic-programming identity of The Hopf--Lax operators form a semigroup (dynamic programming) holds with the coefficient . No choice principle is used in the definition.
- Bounded data without continuity. The same pointwise infimum formula defines for any bounded function , even when is not uniformly continuous. Since and the competitor 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.
Depends on
- The Legendre transform of a finite-valued convex Hamiltonian
- Uniform continuity of a map of metric spaces: one $\delta$ serving every point
- Lower bound, bounded below, bounded set
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Greatest lower bound (infimum)
Used by
- The Hopf--Lax operator is a contraction in the supremum norm Corollary
- The Hopf--Lax operator preserves a modulus of continuity Corollary
- Nonconvexity can break the equation; nonsuperlinearity can limit the Lagrangian domain Counterexample
- A Hopf--Lax solution with a forming corner from smooth data Example
- The quadratic Hopf--Lax formula as an infimal convolution Example
- Vanishing viscosity selects the Hopf--Lax solution for bounded data Example
- A Hopf--Lax minimiser satisfies the characteristic Euler relation at differentiability points Lemma
- Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers Lemma
- Value functions and the Hamilton--Jacobi--Bellman equation: orientation only Remark
- The Hamilton--Jacobi correspondence in one dimension Theorem
- The Hopf--Lax formula solves the Hamilton--Jacobi Cauchy problem Theorem
- The Hopf--Lax operators form a semigroup (dynamic programming) Theorem
Dependency tree · two levels
18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.