TheoremBase

The Test-Datum Estimate at a Maximum Point of the Doubled Function

At a maximum point of the doubled function of the delta-envelopes of a subsolution and a supersolution, perturbed by a small linear term, there are test points in D(A) close to the maximum point, with envelope values close to those at the maximum point, at which the properness constant times the difference of the envelopes is bounded by the two moduli of a structure pair evaluated at the test data plus small terms.

Statement

In the setting of Hilbert Triples: Standing Notation and Background, the set HH is open in HH, since every open ball of (H,dH)(H,d_{H}) is a subset of HH; accordingly W=D(A)∩H=D(A)W=D(A)\cap H=D(A) and V∩H=VV\cap H=V in the notation of Hilbert Triples: Standing Notation and Background (v), and hh is the penalty function. Let FF be a second-order equation operator on HH relative to (H,V,A)(H,V,A), with δ\delta-shifts Fδ−F^{-}_{\delta} and Fδ+F^{+}_{\delta}.

Let u,v:H→Ru,v:H\to\mathbb{R} and let C∈RC\in\mathbb{R} satisfy 0≤C0\le C, u(x)≤Cu(x)\le C and −C≤v(x)-C\le v(x) for every x∈Hx\in H; then uu is bounded above near each point of HH and vv is bounded below near each point of HH by Basic Properties of the δ\delta-Envelopes: Semicontinuity, Duality, Closed Superlevel Sets, Bounds and Monotonicity (iv), so that for each real δ>0\delta>0 the δ\delta-envelopes uδ−u^{-}_{\delta} and vδ+v^{+}_{\delta} are defined on VV. Assume that uu is a viscosity subsolution of FF on HH and that vv is a viscosity supersolution of FF on HH.

Let δ,α,σ,ε,B,G,R∈R\delta,\alpha,\sigma,\varepsilon,B,G,R\in\mathbb{R} satisfy

0<δ<1,1<α,0<σ≤1,0<ε≤1,0≤G,C≤B,0<\delta<1,\qquad 1<\alpha,\qquad 0<\sigma\le1,\qquad 0<\varepsilon\le1,\qquad 0\le G,\qquad C\le B,

let p,q∈Hp,q\in H satisfy ∣p∣H≤σ|p|_{H}\le\sigma and ∣q∣H≤σ|q|_{H}\le\sigma, and let x^,y^∈V\hat{x},\hat{y}\in V be such that the function V×V→RV\times V\to\mathbb{R} whose value at (x,y)(x,y) is

uδ−(x)−vδ+(y)−α2∣x−y∣H2−⟨p,x⟩H−⟨q,y⟩Hu^{-}_{\delta}(x)-v^{+}_{\delta}(y)-\tfrac{\alpha}{2}|x-y|_{H}^{2}-\langle p,x\rangle_{H}-\langle q,y\rangle_{H}

attains a maximum at (x^,y^)(\hat{x},\hat{y}). Assume

δ h(x^)≤B,δ h(y^)≤B,∣uδ−(x^)∣≤B,∣vδ+(y^)∣≤B,α ∣x^−y^∣H≤G,\delta\,h(\hat{x})\le B,\qquad \delta\,h(\hat{y})\le B,\qquad |u^{-}_{\delta}(\hat{x})|\le B,\qquad |v^{+}_{\delta}(\hat{y})|\le B,\qquad \alpha\,|\hat{x}-\hat{y}|_{H}\le G,

and

2B+1δ<R,3B+2<R,α+1<R,G+2α<R.\frac{2B+1}{\delta}<R,\qquad 3B+2<R,\qquad \alpha+1<R,\qquad G+2\alpha<R .

Finally, let λ\lambda be a properness constant for FF at 3B+23B+2, let (ω1,ω2)(\omega_{1},\omega_{2}) be a structure pair for FF at 3B+23B+2, and let ω\omega be a shift modulus for FF at (δ,R)(\delta,R). In the estimate below, 1α\tfrac{1}{\alpha} is the quotient, and h(x1)h(x_{1}) and h(y1)h(y_{1}) are defined because D(A)⊆VD(A)\subseteq V by Hilbert Triples: Standing Notation and Background (iii).

Then there exist x1,y1∈D(A)x_{1},y_{1}\in D(A) and τ1,τ2∈R\tau_{1},\tau_{2}\in\mathbb{R} with

∣x1−x^∣H<ε,∣y1−y^∣H<ε,∣uδ−(x1)−uδ−(x^)∣<ε,∣vδ+(y1)−vδ+(y^)∣<ε,|x_{1}-\hat{x}|_{H}<\varepsilon,\qquad |y_{1}-\hat{y}|_{H}<\varepsilon,\qquad |u^{-}_{\delta}(x_{1})-u^{-}_{\delta}(\hat{x})|<\varepsilon,\qquad |v^{+}_{\delta}(y_{1})-v^{+}_{\delta}(\hat{y})|<\varepsilon, 0≤τ1≤(2α+1)ε+σ,0≤τ2≤(2α+1)ε+σ,0\le\tau_{1}\le(2\alpha+1)\varepsilon+\sigma,\qquad 0\le\tau_{2}\le(2\alpha+1)\varepsilon+\sigma,

such that

λ(uδ−(x^)−vδ+(y^)) ≤ 2λε+2ε+ω(τ1)+ω(τ2)+ω1(α∣x1−y1∣H2+1α)+ω2(δ (h(x1)+h(y1)+1), α).\lambda\bigl(u^{-}_{\delta}(\hat{x})-v^{+}_{\delta}(\hat{y})\bigr)\ \le\ 2\lambda\varepsilon+2\varepsilon+\omega(\tau_{1})+\omega(\tau_{2})+\omega_{1}\Bigl(\alpha|x_{1}-y_{1}|_{H}^{2}+\tfrac{1}{\alpha}\Bigr)+\omega_{2}\bigl(\delta\,(h(x_{1})+h(y_{1})+1),\,\alpha\bigr).

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…