Alphabeta Math
RemarkRemark: 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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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