TheoremBase

Structure Condition: the Trace Operator of a Lipschitz Diffusion Coefficient

The linear second-order operator F(x,r,p,X)=−tr⁡(Σ(x)⊤Σ(x)X)F(x,r,p,X)=-\operatorname{tr}(\Sigma(x)^{\top}\Sigma(x)X) satisfies the structure condition of the comparison principle with the linear modulus ω(t)=3L2t\omega(t)=3L^{2}t, whenever the coefficient Σ\Sigma is Lipschitz with constant LL in the row-sum-of-squares sense.

Statement

Throughout we work in the setting of Second-Order Equations on Euclidean Open Sets and of Bounded Open Domain in Euclidean Space, whose notation, including that of Euclidean Space and Real Matrices: Standing Notation on which the former rests, is in force in the dimensions nn and mm, natural numbers with 1≤n1\le n and 1≤m1\le m. In addition tr⁡\operatorname{tr} denotes the trace of a square real matrix; for A∈Mm×n(R)A\in\mathcal{M}_{m\times n}(\mathbb{R}) and k∈[m]k\in[m] the kkth row of AA is the point of Rn\mathbb{R}^{n} whose jjth coordinate is AkjA_{kj}; T={t∈R:0≤t}T=\{t\in\mathbb{R}:0\le t\}; s2=sss^{2}=ss for s∈Rs\in\mathbb{R}; and 3=1+1+13=1+1+1, so that 0<30<3, since 0<20<2 by claim 8 of Elementary Order Arithmetic in an Ordered Field and 0≤10\le1 by claim 6 there, whence 0<30<3 by claim 3 there.

Two elementary consequences of the ordered field axioms are used freely below. First, multiplication by a nonnegative real number preserves ≤\le: if a≤ba\le b and 0≤λ0\le\lambda then either a=ba=b, and the products are equal, or a<ba<b, and then λa≤λb\lambda a\le\lambda b by claim 10 of Elementary Order Arithmetic in an Ordered Field when 0<λ0<\lambda, while λ=0\lambda=0 makes both products 00. Second, if a≤ba\le b and 0≤e0\le e then a≤b+ea\le b+e, since b=b+0≤b+eb=b+0\le b+e by the compatibility of ≤\le with addition and ≤\le is transitive.

The data. Let Σ:Ω→Mm×n(R)\Sigma:\Omega\to\mathcal{M}_{m\times n}(\mathbb{R}) be a function, and for x∈Ωx\in\Omega and k∈[m]k\in[m] write σk(x)∈Rn\sigma_{k}(x)\in\mathbb{R}^{n} for the kkth row of Σ(x)\Sigma(x). Let L∈RL\in\mathbb{R} be nonnegative, and assume that

tr⁡((Σ(x)−Σ(y))⊤(Σ(x)−Σ(y))) ≤ L2∥x−y∥2for all x,y∈Ω.\operatorname{tr}\Bigl(\bigl(\Sigma(x)-\Sigma(y)\bigr)^{\top}\bigl(\Sigma(x)-\Sigma(y)\bigr)\Bigr)\ \le\ L^{2}\lVert x-y\rVert^{2}\qquad\text{for all }x,y\in\Omega .

By the entry formula for a difference of matrices and the coordinate formula for a difference of points, the kkth row of Σ(x)−Σ(y)\Sigma(x)-\Sigma(y) is σk(x)−σk(y)\sigma_{k}(x)-\sigma_{k}(y), so The Trace as a Sum of Quadratic Forms, its Monotonicity and a Norm Bound (ii) rewrites the left-hand side as ∑k=1m∥σk(x)−σk(y)∥2\sum_{k=1}^{m}\lVert\sigma_{k}(x)-\sigma_{k}(y)\rVert^{2}; the hypothesis is thus a Lipschitz condition on Σ\Sigma with constant LL, the size of a matrix being measured by the sum over its rows of the squared Euclidean norms.

For x∈Ωx\in\Omega and X∈S(n)X\in\mathcal{S}(n) the product Σ(x)⊤Σ(x)X\Sigma(x)^{\top}\Sigma(x)X is an unambiguously defined element of Mn(R)\mathcal{M}_{n}(\mathbb{R}), as recorded in The Trace as a Sum of Quadratic Forms, its Monotonicity and a Norm Bound. Hence

F(x,r,p,X)=−tr⁡(Σ(x)⊤Σ(x)X)F(x,r,p,X)=-\operatorname{tr}\bigl(\Sigma(x)^{\top}\Sigma(x)X\bigr)

defines a function F:Ω×R×Rn×S(n)→RF:\Omega\times\mathbb{R}\times\mathbb{R}^{n}\times\mathcal{S}(n)\to\mathbb{R}, that is, a second-order equation operator on Ω\Omega.

Let ω:T→R\omega:T\to\mathbb{R} be given by ω(t)=3L2t\omega(t)=3L^{2}t. Since 0≤L0\le L, multiplying by the nonnegative LL gives 0≤L20\le L^{2}, and multiplying by the nonnegative 33 gives 0≤3L20\le3L^{2}; so ω\omega is a modulus of continuity by Linear Moduli of Continuity (i).

The claim. FF and ω\omega satisfy the structure condition of the comparison principle for the Dirichlet problem.

Justification. Let x,y∈Ωx,y\in\Omega, let r∈Rr\in\mathbb{R}, let α∈R\alpha\in\mathbb{R} be positive and let X,Y∈S(n)X,Y\in\mathcal{S}(n) satisfy

−3α(∥ξ∥2+∥η∥2) ≤ ξ⋅(Xξ)−η⋅(Yη) ≤ 3α∥ξ−η∥2for all ξ,η∈Rn;-3\alpha\bigl(\lVert\xi\rVert^{2}+\lVert\eta\rVert^{2}\bigr)\ \le\ \xi\cdot(X\xi)-\eta\cdot(Y\eta)\ \le\ 3\alpha\lVert\xi-\eta\rVert^{2}\qquad\text{for all }\xi,\eta\in\mathbb{R}^{n};

write p=α(x−y)p=\alpha(x-y), and abbreviate A=Σ(x)A=\Sigma(x) and B=Σ(y)B=\Sigma(y), with rows ak=σk(x)a_{k}=\sigma_{k}(x) and bk=σk(y)b_{k}=\sigma_{k}(y) for k∈[m]k\in[m].

Step 1: the difference as a sum of quadratic forms. By The Trace as a Sum of Quadratic Forms, its Monotonicity and a Norm Bound (i), applied to AA with XX and to BB with YY, and by claims 2 and 3 of Properties of Finite Sums, which together give ∑k=1m(uk−vk)=∑k=1muk−∑k=1mvk\sum_{k=1}^{m}(u_{k}-v_{k})=\sum_{k=1}^{m}u_{k}-\sum_{k=1}^{m}v_{k},

F(y,r,p,Y)−F(x,r,p,X)=tr⁡(A⊤AX)−tr⁡(B⊤BY)=∑k=1m(ak⋅(Xak)−bk⋅(Ybk)).F(y,r,p,Y)-F(x,r,p,X)=\operatorname{tr}\bigl(A^{\top}AX\bigr)-\operatorname{tr}\bigl(B^{\top}BY\bigr)=\sum_{k=1}^{m}\Bigl(a_{k}\cdot(Xa_{k})-b_{k}\cdot(Yb_{k})\Bigr).

Step 2: the matrix hypothesis, row by row. For each k∈[m]k\in[m], taking ξ=ak\xi=a_{k} and η=bk\eta=b_{k} in the second inequality of the hypothesis gives

ak⋅(Xak)−bk⋅(Ybk) ≤ 3α∥ak−bk∥2.a_{k}\cdot(Xa_{k})-b_{k}\cdot(Yb_{k})\ \le\ 3\alpha\lVert a_{k}-b_{k}\rVert^{2}.

By claim 1 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers and claim 3 of Properties of Finite Sums,

F(y,r,p,Y)−F(x,r,p,X) ≤ ∑k=1m3α∥ak−bk∥2=3α∑k=1m∥ak−bk∥2.F(y,r,p,Y)-F(x,r,p,X)\ \le\ \sum_{k=1}^{m}3\alpha\lVert a_{k}-b_{k}\rVert^{2}=3\alpha\sum_{k=1}^{m}\lVert a_{k}-b_{k}\rVert^{2}.

Step 3: the Lipschitz hypothesis. The kkth row of A−BA-B is ak−bka_{k}-b_{k}, so The Trace as a Sum of Quadratic Forms, its Monotonicity and a Norm Bound (ii) gives ∑k=1m∥ak−bk∥2=tr⁡((A−B)⊤(A−B))\sum_{k=1}^{m}\lVert a_{k}-b_{k}\rVert^{2}=\operatorname{tr}\bigl((A-B)^{\top}(A-B)\bigr), which is at most L2∥x−y∥2L^{2}\lVert x-y\rVert^{2} by hypothesis. Since 0<30<3 and 0<α0<\alpha, claim 5 of Elementary Order Arithmetic in an Ordered Field gives 0<3α0<3\alpha, so multiplying by 3α3\alpha preserves the inequality and

F(y,r,p,Y)−F(x,r,p,X) ≤ 3α(L2∥x−y∥2)=3L2(α∥x−y∥2),F(y,r,p,Y)-F(x,r,p,X)\ \le\ 3\alpha\bigl(L^{2}\lVert x-y\rVert^{2}\bigr)=3L^{2}\bigl(\alpha\lVert x-y\rVert^{2}\bigr),

the last equality by the commutativity and associativity of multiplication in R\mathbb{R}.

Step 4: conclusion. Put t=α∥x−y∥2+∥x−y∥t=\alpha\lVert x-y\rVert^{2}+\lVert x-y\rVert. By claim 1 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square the number ∥x−y∥\lVert x-y\rVert is nonnegative, hence so is ∥x−y∥2\lVert x-y\rVert^{2} by claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field, and therefore 0≤α∥x−y∥20\le\alpha\lVert x-y\rVert^{2}; consequently α∥x−y∥2≤t\alpha\lVert x-y\rVert^{2}\le t and 0≤t0\le t, so t∈Tt\in T. Multiplying α∥x−y∥2≤t\alpha\lVert x-y\rVert^{2}\le t by the nonnegative 3L23L^{2} and using transitivity,

F(y,r,α(x−y),Y)−F(x,r,α(x−y),X) ≤ 3L2t=ω(α∥x−y∥2+∥x−y∥),F\bigl(y,r,\alpha(x-y),Y\bigr)-F\bigl(x,r,\alpha(x-y),X\bigr)\ \le\ 3L^{2}t=\omega\bigl(\alpha\lVert x-y\rVert^{2}+\lVert x-y\rVert\bigr),

which is the inequality required by the structure condition.

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…