TheoremBase

Constant Viscosity Subsolutions and Supersolutions of the Hamilton-Jacobi Equation with Penalty Drift on the Noise Wasserstein Space

For a noise-closed noise penalty pair with regular penalised maxima, a constant function has penalty-subordinate growth from both sides; it is a viscosity subsolution of the penalty-drift Hamilton-Jacobi equation when discount times the constant is at most the running cost on the score domain, and a supersolution when it is at least the running cost.

Statement

In the setting of First-Order Equations on the Noise Wasserstein Space Relative to a Noise Penalty Pair: Standing Notation, let (D,DΣ,E,Σ)(\mathcal{D},\mathcal{D}_{\Sigma},\mathcal{E},\Sigma) be a noise-closed noise penalty pair on Pρa\mathcal{P}^{a}_{\rho} with regular penalised maxima, let λ0,θ∈R\lambda_{0},\theta\in\mathbb{R} be positive, let g:D→Rg:\mathcal{D}\to\mathbb{R}, and let FF be the Hamilton-Jacobi operator with penalty drift of the pair with discount λ0\lambda_{0}, control cost θ\theta and running cost gg, with δ\delta-shifts relative to the pair. Viscosity subsolutions and supersolutions of FF relative to the pair are those of that definition, and penalty-subordinate growth from above and from below is that of that definition. Let κ∈R\kappa\in\mathbb{R}, and let uκ:D→Ru_{\kappa}:\mathcal{D}\to\mathbb{R} be the constant function with value κ\kappa. Then the following hold.

1. (Penalty-subordinate growth) uκu_{\kappa} has penalty-subordinate growth from above and from below.

2. (Constant subsolutions) If λ0 κ≤g(ν)\lambda_{0}\,\kappa\le g(\nu) for every ν∈DΣ\nu\in\mathcal{D}_{\Sigma}, then uκu_{\kappa} is a viscosity subsolution of FF relative to the pair.

3. (Constant supersolutions) If g(ν)≤λ0 κg(\nu)\le\lambda_{0}\,\kappa for every ν∈DΣ\nu\in\mathcal{D}_{\Sigma}, then uκu_{\kappa} is a viscosity supersolution of FF relative to the pair.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…