Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 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.

Depends on

Used by

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.

Sources