TheoremBase

Proof of Comparison Principle with a Weighted Penalty for Operators Convex in the Value, Gradient and Matrix Variables

theoremthm:comparison-weighted-penalty-convex-euclidean-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
· 5,252 chars · 14 deps · depth 24 Reason: Phase F: proof of the weighted-penalty comparison principle.

The convex combination of u with the barrier sP-K is a subsolution lying strictly below v outside a sublevel set of P; the Dirichlet comparison principle on that sublevel set and a limit in the combination weight give u <= v.

Proof

Each result cited is universally quantified over the data in its own statement. Fix s,Ks,K as in hypothesis Comparison Principle with a Weighted Penalty for Operators Convex in the Value, Gradient and Matrix Variables §barrier, write φ=sP−K\varphi=sP-K, a classical subsolution of FF on DD, and put a=w−sa=w-s, which is positive by claim 1 of Elementary Order Arithmetic in an Ordered Field. Fix x∈Dx\in D; we show u(x)≤v(x)u(x)\le v(x).

Step 1: the perturbed subsolution. Fix t∈Rt\in\mathbb{R} with 0<t<10<t<1 and let ut=(1−t)u+tφu_{t}=(1-t)u+t\varphi. By hypothesis Comparison Principle with a Weighted Penalty for Operators Convex in the Value, Gradient and Matrix Variables §convex and A Convex Combination of a Viscosity Subsolution and a Classical Subsolution is a Viscosity Subsolution, for an Operator Convex in the Value, Gradient and Matrix Variables, utu_{t} is a viscosity subsolution of FF on DD.

Step 2: ut<vu_{t}<v outside a sublevel set. Put δ=ta/4\delta=ta/4, positive by claims 5, 7 and 8 of Elementary Order Arithmetic in an Ordered Field. By Penalty-Subordinate Growth of a Function on an Open Subset of Euclidean Space §above applied to u−wPu-wP and Penalty-Subordinate Growth of a Function on an Open Subset of Euclidean Space §below applied to v−wPv-wP, both with this δ\delta, there are C1,C2∈RC_{1},C_{2}\in\mathbb{R} with

u(y)≤C1+(w+δ)P(y),(w−δ)P(y)−C2≤v(y)for every y∈D.u(y)\le C_{1}+(w+\delta)P(y),\qquad (w-\delta)P(y)-C_{2}\le v(y)\qquad\text{for every }y\in D .

Multiplying the first by 1−t≥01-t\ge0 (claim 5 of Elementary Arithmetic in an Ordered Field), adding tφ(y)=tsP(y)−tKt\varphi(y)=tsP(y)-tK and subtracting the second, we get for every y∈Dy\in D

ut(y)−v(y)≤C3+cP(y),C3=(1−t)C1−tK+C2,c=(1−t)(w+δ)+ts−(w−δ).u_{t}(y)-v(y)\le C_{3}+cP(y),\qquad C_{3}=(1-t)C_{1}-tK+C_{2},\quad c=(1-t)(w+\delta)+ts-(w-\delta).

By the field axioms c=−ta+(2−t)δ=−ta2−t2a4c=-ta+(2-t)\delta=-\tfrac{ta}{2}-\tfrac{t^{2}a}{4}, so with b=ta2>0b=\tfrac{ta}{2}>0 we have c+b=−t2a4≤0c+b=-\tfrac{t^{2}a}{4}\le0. Hence for y∈Dy\in D with 0≤P(y)0\le P(y), (c+b)P(y)≤0(c+b)P(y)\le0 (claim 5 of Elementary Arithmetic in an Ordered Field and claim 1 of Zero Products and Elementary Identities in a Field), that is cP(y)≤−bP(y)cP(y)\le-bP(y). Put R=b−1(∣C3∣+1)R=b^{-1}(|C_{3}|+1), which is positive. For every y∈Dy\in D with R≤P(y)R\le P(y) we have 0≤P(y)0\le P(y), so, using bR=∣C3∣+1bR=|C_{3}|+1 and C3≤∣C3∣C_{3}\le|C_{3}| (claim 3 of Properties of the Absolute Value in an Ordered Field),

ut(y)−v(y)≤C3−bP(y)≤C3−bR=C3−∣C3∣−1<0.(1)u_{t}(y)-v(y)\le C_{3}-bP(y)\le C_{3}-bR=C_{3}-|C_{3}|-1<0 . \tag{1}

Step 3: comparison on DRD_{R}. If DRD_{R} is empty, every y∈Dy\in D has R≤P(y)R\le P(y) and (1) gives ut<vu_{t}<v on DD. Otherwise Ω=DR\Omega=D_{R} is nonempty, open and bounded, and Ω‾\overline{\Omega} is a subset of DD, by Basic Properties of the Sublevel Sets of a Penalty §sublevel-sets; so Ω\Omega satisfies Bounded Open Domain in Euclidean Space §domain. We apply Comparison Principle for the Dirichlet Problem for Second-Order Equations on Ω\Omega to the operator F∣ΩF|_{\Omega} of Restriction of a Second-Order Equation Operator to an Open Subset §operator, the constant γ\gamma, the modulus ωR\omega_{R} of hypothesis Comparison Principle with a Weighted Penalty for Operators Convex in the Value, Gradient and Matrix Variables §structure, and the restrictions ut∣Ω‾u_{t}|_{\overline{\Omega}} and v∣Ω‾v|_{\overline{\Omega}}.

Comparison Principle for the Dirichlet Problem for Second-Order Equations §continuity: F∣ΩF|_{\Omega} is continuous by hypothesis Comparison Principle with a Weighted Penalty for Operators Convex in the Value, Gradient and Matrix Variables §continuity and Restriction of a Second-Order Equation Operator to an Open Subset §continuity.

Comparison Principle for the Dirichlet Problem for Second-Order Equations §strictly-proper: F∣ΩF|_{\Omega} is degenerate elliptic by hypothesis Comparison Principle with a Weighted Penalty for Operators Convex in the Value, Gradient and Matrix Variables §strictly-proper and Restriction of a Second-Order Equation Operator to an Open Subset §elliptic, and condition 2 of Strictly Proper Second-Order Equation Operator holds for F∣ΩF|_{\Omega} because it holds for FF at every point of D⊇ΩD\supseteq\Omega and the two operators agree on Ω\Omega.

Comparison Principle for the Dirichlet Problem for Second-Order Equations §structure: this is hypothesis Comparison Principle with a Weighted Penalty for Operators Convex in the Value, Gradient and Matrix Variables §structure.

The functions: ut∣Ω‾u_{t}|_{\overline{\Omega}} is upper semicontinuous on Ω‾\overline{\Omega} by claim 4 of Semicontinuity and Continuity Under Composition with a Continuous Map, and its restriction to Ω\Omega is a viscosity subsolution of F∣ΩF|_{\Omega} on Ω\Omega by Restriction of Viscosity Sub- and Supersolutions to an Open Subset §subsolution; so it is a viscosity subsolution of F∣ΩF|_{\Omega} up to the boundary of Ω\Omega. Likewise, by the lower-semicontinuous half of the same claim and Restriction of Viscosity Sub- and Supersolutions to an Open Subset §supersolution, v∣Ω‾v|_{\overline{\Omega}} is a viscosity supersolution of F∣ΩF|_{\Omega} up to the boundary of Ω\Omega.

The boundary: every y∈∂Ωy\in\partial\Omega lies in DD and satisfies P(y)=RP(y)=R by Basic Properties of the Sublevel Sets of a Penalty §boundary, so ut(y)<v(y)u_{t}(y)<v(y) by (1).

Hence ut≤vu_{t}\le v on Ω‾⊇DR\overline{\Omega}\supseteq D_{R}, and by (1) also at every y∈Dy\in D with R≤P(y)R\le P(y). Since every y∈Dy\in D satisfies P(y)<RP(y)<R or R≤P(y)R\le P(y), ut(y)≤v(y)u_{t}(y)\le v(y) for every y∈Dy\in D. In particular, at our fixed xx,

u(x)−v(x)≤t Mfor every t∈R with 0<t<1,M=u(x)−sP(x)+K,(2)u(x)-v(x)\le t\,M\qquad\text{for every }t\in\mathbb{R}\text{ with }0<t<1,\qquad M=u(x)-sP(x)+K, \tag{2}

by rearranging (1−t)u(x)+t(sP(x)−K)≤v(x)(1-t)u(x)+t(sP(x)-K)\le v(x) with the field axioms.

Step 4: t→0t\to0. Suppose v(x)<u(x)v(x)<u(x) and put e=u(x)−v(x)>0e=u(x)-v(x)>0. Taking t=12t=\tfrac12 in (2) gives 0<e≤M20<e\le\tfrac{M}{2}, so MM is positive. Let tt be the least of 12\tfrac12 and e2M\tfrac{e}{2M} (claim 9 of Elementary Order Arithmetic in an Ordered Field); then 0<t<10<t<1 and tM≤e2<etM\le\tfrac{e}{2}<e, contradicting (2). Hence u(x)≤v(x)u(x)\le v(x), and as x∈Dx\in D was arbitrary the theorem is proved.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…