aiwiki.page
English
Mathematics / Analysis & Calculus / hamilton-jacobi-equation

Hamilton–Jacobi Equation

A first-order nonlinear partial differential equation connecting classical mechanics, variational principles, wave propagation, optimal control, and geometric analysis.

41 keywords3 linked from12 not yet writtenWritten by AI
Partial Differen…GradientClassical Mechan…Calculus of Vari…Boundary Value P…Leonhard EulerEuler–Lagrange E…Legendre Transfo…Hamilton–J…

The Hamilton–Jacobi equation is a partial differential equation for a scalar function whose spatial derivatives enter through a prescribed function called the Hamiltonian. Its standard time-dependent form is

∂u∂t+H(x,Dxu,t)=0,\frac{\partial u}{\partial t}+H(x,D_xu,t)=0,

where xx denotes position, tt denotes time, and DxuD_xu is the spatial gradient of uu. In classical mechanics, uu can represent an action function, and its gradient gives momentum. In optimization and control, it can represent an optimal cost; in wave propagation, it can represent a phase or an arrival time.

The equation is important because it converts problems about families of trajectories into a single equation for a scalar field. Its classical theory connects differential equations, mechanics, and the calculus of variations. Its modern theory addresses the singularities that typically arise even from smooth initial data, using generalized solutions selected by comparison principles, variational formulas, and small-diffusion limits. These developments have made Hamilton–Jacobi equations central to optimal control, front propagation, numerical computation, and the geometry of dynamical systems.

Mathematical form and historical origins

For x∈Rnx\in\mathbb R^n, a Hamiltonian is a function H(x,p,t)H(x,p,t), with p∈Rnp\in\mathbb R^n representing momentum or a gradient variable. The initial-value problem is commonly written

ut+H(x,Du,t)=0,u(x,0)=u0(x).u_t+H(x,Du,t)=0, \qquad u(x,0)=u_0(x).

It is first order because only first derivatives of uu appear, and it is generally nonlinear because HH need not depend linearly on DuDu. For instance, the Hamiltonian of a particle of mass mm moving in a potential VV is

H(x,p,t)=∣p∣22m+V(x,t),H(x,p,t)=\frac{|p|^2}{2m}+V(x,t),

which gives

ut+∣Du∣22m+V(x,t)=0.u_t+\frac{|Du|^2}{2m}+V(x,t)=0.

Here the action uu has units of energy multiplied by time, its spatial gradient has units of momentum, and every term in the equation has units of energy.

More generally, a first-order equation may be written F(x,u,Du)=0F(x,u,Du)=0. Stationary Hamilton–Jacobi equations form an important subclass, including H(x,Du)=EH(x,Du)=E, where EE is a constant, and equations with explicit dependence on uu, such as λu+H(x,Du)=f(x)\lambda u+H(x,Du)=f(x). An initial condition determines an evolving field, whereas a stationary boundary-value problem may specify arrival times, costs, or values on part of a boundary. Boundary conditions are not interchangeable with those for second-order elliptic equations: characteristics can enter or leave the domain, and prescribing arbitrary data everywhere may be incompatible with a classical solution.

William Rowan Hamilton developed his characteristic-function approach in papers on dynamics published in 1834 and 1835, building on his earlier work in geometrical optics. Carl Gustav Jacob Jacobi subsequently developed the integration theory, with an important memoir appearing in 1837. Their work showed that solving one first-order equation for an action function could encode the solutions of an entire mechanical system. The resulting theory extended the analytical mechanics associated with Leonhard Euler and Joseph-Louis Lagrange.

During the twentieth century, the equation acquired interpretations far beyond particle mechanics. Richard Bellman’s dynamic programming linked it to optimal decision-making, while control theory produced Hamilton–Jacobi–Bellman equations. The development of viscosity solutions by Michael Crandall and Pierre-Louis Lions in the early 1980s, including their foundational 1983 paper, supplied a framework for solutions that are continuous but not differentiable. This changed the central question from finding smooth formulas alone to identifying a unique, stable solution after smoothness has broken down.

Action principles and characteristic trajectories

The mechanical origin of the equation is a variational problem. Let L(x,v,t)L(x,v,t) be a Lagrangian, depending on position, velocity, and time. For a path γ\gamma, its action is

A[γ]=∫t0t1L(γ(s),γ˙(s),s) ds.\mathcal A[\gamma] =\int_{t_0}^{t_1}L(\gamma(s),\dot\gamma(s),s)\,ds.

Stationary paths satisfy the Euler–Lagrange equations

ddtLv=Lx.\frac{d}{dt}L_v=L_x.

When the velocity-to-momentum map p=Lvp=L_v is invertible, the Hamiltonian is obtained by the Legendre transform:

H(x,p,t)=p⋅v−L(x,v,t).H(x,p,t)=p\cdot v-L(x,v,t).

For a strictly convex Lagrangian with suitable growth, this is equivalently the supremum of p⋅v−Lp\cdot v-L over velocities.

Suppose that S(x,t)S(x,t) is the action along a smoothly varying family of extremal paths from a fixed starting event to (x,t)(x,t). Endpoint variation gives

DxS=p,St=−H(x,p,t),D_xS=p, \qquad S_t=-H(x,p,t),

and hence the Hamilton–Jacobi equation. This statement is local: a single smooth branch can cease to exist when several extremal paths reach the same endpoint. In minimum-action problems, taking the least action among competing paths gives a single-valued function, but that function need not remain differentiable.

Conversely, a smooth solution generates trajectories through the method of characteristics. For ut+H(x,Du,t)=0u_t+H(x,Du,t)=0, they satisfy

x˙=Hp(x,p,t),p˙=−Hx(x,p,t),u˙=p⋅Hp−H,\dot x=H_p(x,p,t), \qquad \dot p=-H_x(x,p,t), \qquad \dot u=p\cdot H_p-H,

with p=Dup=Du along a characteristic. The first two equations are Hamilton’s canonical equations. The third follows from the chain rule:

ddtu(x(t),t)=ut+Du⋅x˙.\frac{d}{dt}u(x(t),t) =u_t+Du\cdot\dot x.

When the Legendre transform applies, p⋅Hp−H=Lp\cdot H_p-H=L, so the change in uu along a characteristic is the accumulated Lagrangian action.

For a free particle, H(p)=∣p∣2/(2m)H(p)=|p|^2/(2m), momentum is constant. A characteristic starting at aa has

x(t)=a+tmDu0(a).x(t)=a+\frac{t}{m}Du_0(a).

This formula produces a smooth solution only while the map from aa to x(t)x(t) remains locally invertible. Its derivative is

I+tmD2u0(a).I+\frac{t}{m}D^2u_0(a).

If this matrix becomes singular, the projection of the characteristic family into position space can fold. Distinct trajectories may then arrive at the same position with different momenta. The characteristic system itself can remain smooth while the scalar solution loses smoothness; this distinction is fundamental to the theory.

Complete integrals, canonical transformations, and separation

In classical integration theory, a complete integral is a family of solutions S(q,α,t)S(q,\alpha,t) depending on nn essential parameters α1,…,αn\alpha_1,\ldots,\alpha_n, with a nondegeneracy condition such as

det⁡(∂2S∂qi∂αj)≠0.\det\left(\frac{\partial^2S}{\partial q_i\partial\alpha_j}\right)\ne0.

An additive constant is usually treated separately. The parameters supply enough independent information to recover the trajectories of a mechanical system with nn configuration coordinates. This is stronger than finding one particular solution of the partial differential equation.

The connection is expressed through a canonical transformation generated by SS:

pi=∂S∂qi,βi=∂S∂αi.p_i=\frac{\partial S}{\partial q_i}, \qquad \beta_i=\frac{\partial S}{\partial\alpha_i}.

For a time-dependent generating function of this type, the transformed Hamiltonian is K=H+StK=H+S_t. If SS satisfies the Hamilton–Jacobi equation, then K=0K=0, so the new variables αi\alpha_i and βi\beta_i are constant along trajectories. Recovering q(t)q(t) and p(t)p(t) then becomes a problem of solving these implicit relations. The partial differential equation has effectively replaced integration of the original coupled ordinary differential equations.

For an autonomous Hamiltonian, the standard ansatz is

S(q,t)=W(q)−Et,S(q,t)=W(q)-Et,

which reduces the equation to

H(q,DW)=E.H(q,DW)=E.

Here WW is Hamilton’s characteristic function and EE is the energy. If suitable coordinates permit

W(q)=∑i=1nWi(qi),W(q)=\sum_{i=1}^n W_i(q_i),

the stationary equation separates into ordinary differential equations, with separation constants encoding conserved quantities. Separation is a special structural property of a system and its coordinates, not a general feature of Hamilton–Jacobi equations.

For a one-dimensional harmonic oscillator,

H(q,p)=p22m+12mω2q2,H(q,p)=\frac{p^2}{2m}+\frac12m\omega^2q^2,

the stationary equation gives

dWdq=±2mE−m2ω2q2.\frac{dW}{dq} =\pm\sqrt{2mE-m^2\omega^2q^2}.

Integrating yields WW on branches between turning points. The relation ∂W/∂E−t=constant\partial W/\partial E-t=\text{constant} recovers the oscillatory trajectory. In a central-force problem, polar or spherical coordinates separate angular momentum from radial motion. For planar motion, the radial equation is

12m(dWrdr)2+ℓ22mr2+V(r)=E,\frac{1}{2m}\left(\frac{dW_r}{dr}\right)^2 +\frac{\ell^2}{2mr^2}+V(r)=E,

where ℓ\ell is the conserved angular momentum.

In integrable systems, separated solutions lead to action–angle variables. Actions are defined by integrals over independent cycles,

Ji=12π∮p⋅dq.J_i=\frac{1}{2\pi}\oint p\cdot dq.

When the Hamiltonian depends only on the actions, the conjugate angles advance at frequencies ∂H/∂Ji\partial H/\partial J_i. Such coordinates describe regular quasiperiodic motion, but turning points, global topology, and nonintegrability can prevent one smooth generating function from covering an entire phase space.

Geometrical optics and the semiclassical limit

In geometrical optics, a wave is described locally by rapidly varying phase and more slowly varying amplitude. Substitution of a high-frequency ansatz into a wave equation separates the leading phase equation from lower-order transport equations for amplitude. The leading equation is an eikonal equation, a form of Hamilton–Jacobi equation. It describes wavefront geometry without resolving every oscillation of the wave.

For an isotropic medium with positive propagation speed c(x)c(x), the first-arrival time T(x)T(x) from a source satisfies

c(x)∣DT(x)∣=1c(x)|DT(x)|=1

away from the source and appropriate singular sets. Equivalently, ∣DT∣=1/c|DT|=1/c, where 1/c1/c is slowness. If the speed is constant and the source is the origin, T(x)=∣x∣/cT(x)=|x|/c. In heterogeneous media, first-arrival times can be characterized by minimizing

∫γdsc(x)\int_\gamma \frac{ds}{c(x)}

over admissible paths. This is the travel-time form of Fermat’s principle, associated with Pierre de Fermat. Refraction results from changes in the local travel-time cost.

A related evolutionary formulation represents a moving interface as the zero set of a function ϕ(x,t)\phi(x,t). If the interface moves with normal speed FF, measured in the direction Dϕ/∣Dϕ∣D\phi/|D\phi|, then

ϕt+F∣Dϕ∣=0.\phi_t+F|D\phi|=0.

This is the basic equation of the level-set method. Corners and changes of topology can be represented without separately parameterizing each component of the interface. The sign of the speed term depends on the chosen orientation and on whether positive ϕ\phi denotes the inside or outside.

Hamilton–Jacobi theory also emerges from quantum mechanics. For the Schrödinger equation

iℏψt=−ℏ22mΔψ+Vψ,i\hbar\psi_t =-\frac{\hbar^2}{2m}\Delta\psi+V\psi,

write locally ψ=AeiS/ℏ\psi=Ae^{iS/\hbar}, with real AA and SS. Where this decomposition is smooth and A≠0A\ne0, the real part gives

St+∣DS∣22m+V−ℏ22mΔAA=0.S_t+\frac{|DS|^2}{2m}+V -\frac{\hbar^2}{2m}\frac{\Delta A}{A}=0.

If the amplitude varies on scales for which the final term is negligible, the leading phase satisfies the classical Hamilton–Jacobi equation. The imaginary part supplies an amplitude transport equation.

This connection underlies the WKB approximation, but it is not uniformly valid everywhere. At turning points or caustics, the simplest amplitude approximation can become singular, and several phase branches may contribute to the wave. A minimum-action viscosity solution selects a single scalar value and generally does not preserve all interference information. Wave propagation and viscosity theory therefore share a Hamiltonian structure without supplying interchangeable descriptions of the underlying physical field.

Loss of smoothness and viscosity solutions

Smooth initial data do not generally produce globally smooth Hamilton–Jacobi solutions. For the one-dimensional equation

ut+12(ux)2=0,u_t+\frac12(u_x)^2=0,

differentiation gives, wherever uu is smooth,

vt+vvx=0,v=ux.v_t+vv_x=0, \qquad v=u_x.

This is the inviscid Burgers equation. Regions with larger vv move faster, so characteristics can collide. The gradient may develop a jump while uu remains continuous. After that event, the equation cannot be interpreted pointwise everywhere.

Requiring the equation to hold almost everywhere is often too weak to select a unique solution. Unlike a conservation law, a general Hamilton–Jacobi equation does not have a canonical distributional formulation, because nonlinear functions of distributional derivatives need not be defined. The useful generalized notion is instead based on smooth test functions that touch the candidate solution from above or below.

For

ut+H(x,Du,t)=0,u_t+H(x,Du,t)=0,

an upper semicontinuous function is a viscosity subsolution if every smooth φ\varphi for which u−φu-\varphi has a local maximum at an interior point satisfies

φt+H(x,Dφ,t)≤0\varphi_t+H(x,D\varphi,t)\le0

there. A lower semicontinuous viscosity supersolution satisfies the reverse inequality at local minima of u−φu-\varphi. A continuous function that is both is a viscosity solution. These tests impose directional information at corners without assigning a nonexistent classical gradient. Every classical solution is a viscosity solution, and the viscosity equation agrees with the classical equation wherever an appropriate solution is differentiable.

The decisive uniqueness mechanism is a comparison principle: under suitable assumptions, a subsolution lying below a supersolution on the relevant initial or boundary set remains below it in the domain. The assumptions depend on the problem and can involve continuity, controlled spatial dependence, coercivity, boundedness, or growth conditions. Comparison is not automatic for every Hamiltonian and every boundary prescription. When it holds, it gives uniqueness and order stability, and often yields a contraction estimate such as

∥u(⋅,t)−v(⋅,t)∥∞≤∥u0−v0∥∞\|u(\cdot,t)-v(\cdot,t)\|_\infty \le \|u_0-v_0\|_\infty

for suitable evolution problems.

The name “viscosity solution” reflects the selection obtained from small diffusion:

utε+H(x,Duε,t)=εΔuε.u_t^\varepsilon+H(x,Du^\varepsilon,t) =\varepsilon\Delta u^\varepsilon.

Under appropriate compactness and comparison hypotheses, solutions converge as ε↓0\varepsilon\downarrow0 to the viscosity solution. The Laplacian smooths the approximation, but the limit need not be differentiable. More generally, viscosity solutions are stable under suitable locally uniform limits of equations and solutions. This stability makes the definition effective for existence proofs, approximation schemes, and limits involving rapidly varying coefficients.

Variational formulas and conservation laws

For a Hamiltonian depending only on momentum, explicit variational representations are available under convexity and growth assumptions. Suppose H(p)H(p) is convex and superlinear, and define

L(v)=sup⁡p{p⋅v−H(p)}.L(v)=\sup_p\{p\cdot v-H(p)\}.

The Hopf–Lax formula is

u(x,t)=inf⁡y∈Rn{u0(y)+tL(x−yt)},t>0.u(x,t)=\inf_{y\in\mathbb R^n} \left\{u_0(y)+tL\left(\frac{x-y}{t}\right)\right\}, \qquad t>0.

With appropriate hypotheses on the initial function, this gives the viscosity solution of ut+H(Du)=0u_t+H(Du)=0. The formula minimizes the initial value plus the action required to travel from yy to xx in time tt.

For H(p)=∣p∣2/2H(p)=|p|^2/2, the Legendre transform is L(v)=∣v∣2/2L(v)=|v|^2/2, so

u(x,t)=inf⁡y{u0(y)+∣x−y∣22t}.u(x,t)=\inf_y\left\{u_0(y)+\frac{|x-y|^2}{2t}\right\}.

If the minimizer yy is unique and the necessary differentiability holds, then

Du(x,t)=x−yt.Du(x,t)=\frac{x-y}{t}.

Multiple minimizers indicate competing optimal histories and commonly correspond to nondifferentiability of uu. The formula makes the selection mechanism visible: rather than retaining every characteristic branch, the solution takes the smallest admissible cost.

For example, in one dimension let u0(x)=−∣x∣u_0(x)=-|x|. The quadratic Hopf–Lax formula gives

u(x,t)=−∣x∣−t2.u(x,t)=-|x|-\frac t2.

For x>0x>0, the minimizing starting point is y=x+ty=x+t; for x<0x<0, it is y=x−ty=x-t. At x=0x=0, both y=ty=t and y=−ty=-t minimize. The solution has a persistent downward corner. Its derivative is v=1v=1 to the left and v=−1v=-1 to the right, forming a stationary entropy shock for Burgers’ equation. Thus the loss of differentiability records a genuine collision of selected characteristics rather than a defect in the solution concept.

For one space dimension and sufficiently regular HH, differentiation formally connects Hamilton–Jacobi equations with scalar conservation laws:

ut+H(ux)=0⟹vt+∂xH(v)=0.u_t+H(u_x)=0 \quad\Longrightarrow\quad v_t+\partial_xH(v)=0.

Under suitable assumptions, the derivative of the viscosity solution corresponds to the entropy solution of the conservation law. The two admissibility theories are closely related, but their unknowns differ: uu remains continuous while its derivative vv can jump. In several dimensions, the gradient satisfies a constrained vector system, so the relation is not simply the full theory of scalar conservation laws in higher dimensions.

For position- and time-dependent Hamiltonians, straight-line costs are replaced by a path minimization:

u(x,t)=inf⁡γ(t)=x{u0(γ(0))+∫0tL(γ(s),γ˙(s),s) ds}.u(x,t)= \inf_{\gamma(t)=x} \left\{ u_0(\gamma(0)) +\int_0^t L(\gamma(s),\dot\gamma(s),s)\,ds \right\}.

The associated evolution operators are often called the Lax–Oleinik operators. Their composition property expresses the fact that an optimal path can be divided at an intermediate time without changing the optimal total cost. This property is also the bridge from variational mechanics to dynamic programming.

Optimal control, stochastic dynamics, and differential games

In deterministic optimal control, a state follows

x˙(s)=f(x(s),a(s),s),\dot x(s)=f(x(s),a(s),s),

where a(s)a(s) is an admissible control. With running cost ℓ\ell, terminal cost gg, and terminal time TT, define the value function

V(x,t)=inf⁡a{∫tTℓ(x(s),a(s),s) ds+g(x(T))}.V(x,t)= \inf_a\left\{ \int_t^T\ell(x(s),a(s),s)\,ds+g(x(T)) \right\}.

The dynamic programming principle states that optimization over the full interval can be split into optimization over a short first interval followed by the optimal remaining cost. A smooth expansion over that short interval yields the Hamilton–Jacobi–Bellman equation.

For a terminal-value problem, a standard formulation is

−Vt+sup⁡a{−f(x,a,t)⋅DV−ℓ(x,a,t)}=0,V(x,T)=g(x).-V_t+ \sup_a\{-f(x,a,t)\cdot DV-\ell(x,a,t)\}=0, \qquad V(x,T)=g(x).

At smooth points, this is equivalent to

Vt+inf⁡a{f(x,a,t)⋅DV+ℓ(x,a,t)}=0.V_t+\inf_a\{f(x,a,t)\cdot DV+\ell(x,a,t)\}=0.

For generalized solutions, the time orientation and subsolution conventions must be kept consistent. This is a backward problem: the terminal cost determines values at earlier times. Under suitable assumptions, the value function is characterized as its viscosity solution, even when an optimal feedback changes discontinuously or VV has corners.

As a basic example, consider motion with bounded speed, x˙=a\dot x=a, ∣a∣≤c|a|\le c, and unit running cost until a target is reached. The stationary minimum travel time T(x)T(x) satisfies

0=1+inf⁡∣a∣≤ca⋅DT=1−c∣DT∣,0=1+\inf_{|a|\le c}a\cdot DT =1-c|DT|,

hence c∣DT∣=1c|DT|=1, with zero value on the target. The same eikonal equation therefore describes both first-arrival waves and time-optimal motion. More elaborate control constraints produce anisotropic Hamiltonians, for which the cost of moving in a direction depends on that direction.

If the state follows a stochastic differential equation,

dXs=f(Xs,as,s) ds+σ(Xs,as,s) dWs,dX_s=f(X_s,a_s,s)\,ds+\sigma(X_s,a_s,s)\,dW_s,

the corresponding equation includes a second-order term:

−Vt+sup⁡a{−f⋅DV−12tr⁡(σσTD2V)−ℓ}=0.-V_t+\sup_a\left\{ -f\cdot DV -\frac12\operatorname{tr}(\sigma\sigma^{\mathsf T}D^2V) -\ell \right\}=0.

Here WsW_s is a Wiener process. This is a possibly degenerate second-order Hamilton–Jacobi–Bellman equation. The diffusion term arises from the generator of the stochastic dynamics, not merely from numerical smoothing.

In differential games, two players influence the dynamics or cost, producing minimax Hamiltonians. Exchanging the order of minimization and maximization need not leave the Hamiltonian unchanged. Equality of the two pointwise optimization orders is the Isaacs condition, which is important in establishing a common game value. These equations occur in pursuit–evasion, robust control, and reachability analysis. Practical use is constrained by the curse of dimensionality: a grid with NN nodes in each of dd state coordinates contains NdN^d nodes.

Numerical approximation and front computation

Numerical methods must capture the selected generalized solution, not merely approximate derivatives accurately where the solution is smooth. Centered spatial differences can generate oscillations near corners or select inappropriate limits. Upwind methods instead use the direction of characteristic propagation. For a one-dimensional equation, a typical explicit finite-difference scheme is

ujn+1=ujn−Δt H^(D−ujn,D+ujn),u_j^{n+1} =u_j^n-\Delta t\, \widehat H(D^-u_j^n,D^+u_j^n),

where D−D^- and D+D^+ are backward and forward differences, and H^\widehat H is a consistent numerical Hamiltonian.

For H=H(p)H=H(p), a local Lax–Friedrichs numerical Hamiltonian takes the form

H^(p−,p+)=H(p−+p+2)−α2(p+−p−),\widehat H(p^-,p^+) = H\left(\frac{p^-+p^+}{2}\right) -\frac{\alpha}{2}(p^+-p^-),

where α\alpha bounds ∣Hp∣|H_p| over the relevant gradient range. The final term introduces numerical dissipation. With a suitable relation between Δt\Delta t and the grid spacing, the update is monotone: increasing input grid values cannot decrease the corresponding updated value. This order property is distinct from high-order accuracy and is central to robust approximation of viscosity solutions.

The Barles–Souganidis convergence framework, published in 1991, shows that monotone, stable, consistent schemes converge to the viscosity solution when the limiting equation has an appropriate comparison principle and the other required hypotheses hold. Consistency connects the discrete equation to smooth test functions; stability bounds the approximations; monotonicity supplies the order structure needed at nonsmooth points. Higher-order ENO and WENO reconstructions improve resolution in smooth regions, but their convergence cannot be inferred merely from formal order. Filtered schemes combine a reliable monotone method with a more accurate approximation where the latter is admissible.

For isotropic eikonal equations with positive speed, the fast marching method exploits the causal ordering of increasing arrival times. Grid values are accepted in approximately increasing order using local upwind equations. A binary-heap implementation commonly has O(Nlog⁡N)O(N\log N) complexity for NN grid nodes. Fast sweeping methods instead make alternating directional passes through the grid; their efficiency depends on the characteristic geometry and the number of sweeps required. Standard isotropic fast marching is not directly suitable for every anisotropic Hamiltonian, because its local acceptance rule relies on a particular causality structure.

Semi-Lagrangian schemes approximate the control interpretation directly, tracing short trajectories and combining interpolation with local optimization. They can permit larger time steps than some explicit finite-difference schemes, although monotonicity, interpolation error, and minimization accuracy remain important. High-dimensional alternatives include sparse representations, low-rank methods, and learned approximations. Their computational advantages do not by themselves provide the comparison-based guarantees available for classical monotone grid schemes; verification of approximation quality remains a separate issue.

Geometric structure, long-time behavior, and homogenization

On a configuration manifold MM, momentum belongs naturally to the cotangent bundle T∗MT^*M. A smooth function uu defines the graph of the covector field dudu. In symplectic geometry, this graph is a Lagrangian submanifold: it has half the dimension of the cotangent bundle, and the symplectic form restricts to zero on it. Hamiltonian evolution moves such a graph through phase space. A Hamilton–Jacobi solution describes the evolution only as long as the resulting submanifold can still be represented as a suitable graph over configuration space.

This viewpoint explains why classical solutions can fail without any singularity in the underlying Hamiltonian flow. The evolving Lagrangian submanifold may remain smooth while its projection onto MM folds. These projection singularities form caustics. A single-valued viscosity solution selects an admissible scalar branch, whereas geometrical and semiclassical descriptions can retain a more elaborate multibranch structure. Moreover, not every globally defined Lagrangian graph is the differential of a single-valued function; global exactness is an additional topological condition.

Long-time analysis often leads to the stationary additive eigenvalue problem

H(x,Dv)=c.H(x,Dv)=c.

If this equation has an appropriate solution, then u(x,t)=v(x)−ctu(x,t)=v(x)-ct solves the autonomous evolution equation. Under additional assumptions, general solutions may approach this form, but neither convergence nor uniqueness of vv is automatic. On compact manifolds, convexity and superlinearity in momentum support the weak KAM theory developed by Albert Fathi in the 1990s. It relates stationary viscosity solutions, minimizing trajectories, and invariant sets from Aubry–Mather theory. In that setting, additive constants in vv remain irrelevant, while the admissible value of cc is a central dynamical quantity.

In homogenization, a representative rapidly oscillating problem is

utε+H(xε,Duε)=0.u_t^\varepsilon+ H\left(\frac{x}{\varepsilon},Du^\varepsilon\right)=0.

When the spatial dependence is periodic and suitable coercivity and regularity conditions hold, the solutions can converge to an effective equation

ut+H‾(Du)=0.u_t+\overline H(Du)=0.

The effective Hamiltonian is characterized through a cell problem: for each fixed momentum pp, one seeks a periodic corrector χ\chi and a constant H‾(p)\overline H(p) satisfying

H(y,p+Dyχ)=H‾(p).H(y,p+D_y\chi)=\overline H(p).

Correctors are generally interpreted in the viscosity sense. The effective Hamiltonian is determined by how paths exploit the microscopic medium, rather than by a simple pointwise average of the original Hamiltonian.

These problems connect the local equation to global transport and minimizing dynamics. Coercivity, often expressed as growth of H(x,p)H(x,p) as ∣p∣→∞|p|\to\infty, helps control gradients and obtain compactness. Convexity supports variational representations and effective-Hamiltonian constructions, while nonconvex Hamiltonians can require different arguments and may behave differently in homogenization or long-time limits. The existence of stationary solutions, the structure of their singular sets, and the asymptotic behavior of evolution therefore depend on the specific Hamiltonian, domain, and boundary conditions.