An Optimal Geometric Condition on Domains for Boundary Differentiability of Solutions of Elliptic Equations
Dongsheng Li, Kai Zhang

TL;DR
This paper establishes an optimal geometric condition on domains that ensures solutions to elliptic equations are differentiable at the boundary, advancing understanding of boundary regularity in elliptic PDEs.
Contribution
It introduces a new geometric condition on domains that guarantees boundary differentiability of elliptic solutions and proves this condition is optimal.
Findings
The geometric condition guarantees boundary differentiability of solutions.
The condition is proven to be optimal.
Provides a characterization of boundary regularity for elliptic equations.
Abstract
In this paper, a geometric condition on domains will be given which guarantees the boundary differentiability of solutions of elliptic equations, that is, the solutions are differentiable at any boundary point. We will show that this geometric condition is optimal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
An Optimal Geometric Condition on Domains for Boundary Differentiability of Solutions of Elliptic Equations111Research supported by NSFC 11171266.
Dongsheng Li
Kai Zhang
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an 710049, China
Abstract
In this paper, a geometric condition on domains will be given which guarantees the boundary differentiability of solutions of elliptic equations, that is, the solutions are differentiable at any boundary point. We will show that this geometric condition is optimal.
keywords:
Elliptic equations , Boundary differentiability , Optimal geometric condition
††journal: Journal of Differential Equations
1 Introduction
In this paper, we will study the boundary differentiability of solutions of the following equations:
[TABLE]
where is a bounded domain; the matrix is symmetric and satisfies the uniformly elliptic condition with some constant , i.e., for any ,
[TABLE]
in the sense of nonnegative definiteness and . For convenience, solutions in this paper will always indicate viscosity solutions.
It is well known that the geometric properties of domains have significant influence on the boundary regularity of solutions. There are many remarkable results in this respect. First, Dirichlet problem asked what conditions on domains guarantee that the solutions of Laplace’s equations are continuous at boundary. This problem was completely solved by Wiener [14] in 1924 where the conception ”Wiener Criterion” was introduced to describe such sufficient and necessary geometric properties of domains’ boundaries. Besides, if satisfies a uniform exterior cone condition, the solutions of (1.1) are Hölder continuous at the boundary (see Corollary 9.29[2]). Also, Trudinger obtained the Lipschitz continuity at the boundary under the hypothesis that satisfies a uniform exterior sphere condition (see [12] and [13]).
With regarding to the differentiability at boundary, Krylov got the boundary regularity when belongs to (see [4] and [5]). Lieberman in [8] gave a more general result (Theorem 5.5) which contains above results in[5]. Furthermore, some results concerning Dini continuity can be found in [1], [3], [9] and [11].
Almost all the previous results state that if the data are sufficiently smooth, then the solutions are or . Li and Wang in [6] removed the smoothness assumptions on the boundary and obtained that the solutions of (1.1) are differentiable at boundary when is convex. Later, the same authors got the boundary differentiability concerning the inhomogeneous boundary data condition (see [7]). It is natural to ask whether convexity is the optimal geometric condition to guarantee the boundary differentiability. Actually, it is not and we will show that the boundary differentiability of solutions holds for a more general class of domains, which we call convex domains. From Counterexample 4.1 and 4.3 in [6] and Theorem 1.11 in [10], we see that our result is optimal , i.e., the condition on the domain can not be weakened(cf. Remark 1.4).
First, we define the concept convexity.
Definition 1.1** (-convexity**).
Suppose that is a domain with continuous boundary. We call it convex if the following holds:
There exist a constant and a function , which is nondecreasing and satisfies
[TABLE]
such that for any there exists a unit vector such that
[TABLE]
Remark 1.2**.**
(i) Clearly, if is convex, then it is convex with . Hence, results in [6] and [7] are special cases of our results.
(ii) From (1.2), we see that as . It follows that (as a function in ) is differentiable at 0 with . These properties will be used later.
(iii) If and , then
[TABLE]
It follows that there exists (depending only on ) such that
[TABLE]
Therefore,
[TABLE]
This means that there exists a differentiable hypersurface who touches at [math] by below locally. This is the geometric explanation of convexity.∎
Now we state our main result:
Theorem 1.3**.**
Suppose that is convex and is the solution of (1.1). Then is differentiable at any boundary point. That is, for any , there exists a vector such that .
Remark 1.4**.**
Theorem 1.3 is optimal in the following two senses:
(1) convexity can only guarantee the boundary differentiability and no more regularity can be expected. Li and Wang gave two counterexamples in [6] to show that the gradients of the solutions are not continuous.
(2) It is worth noting that to guarantee the boundary differentiability, the convexity condition can not be weakened. Actually, Safonov proved the following result (see Theorem 1.11[10]):
Let and be a positive supersolution of
[TABLE]
*such that on for some . *
If there exist a unit vector and a function , which is nondecreasing and satisfies
[TABLE]
such that
[TABLE]
then
[TABLE]
Taking in (1.1), then the classical solution of (1.1) satisfies the hypothesis above. Hence, can not be differentiable at . Therefore, we see that the convexity condition, thus (1.2) can not be released. From this point of view, our result is optimal.∎
This paper is organized as follows: The geometric properties of convex domains will be studied in Section 2 where the main property is that blowing up at any boundary point of a convex domain, we will obtain a cone. This is the same as convex domains. In Section 3, we will prove Theorem 1.3 by an iteration method, where the Harnack inequality and Aleksandrov-Bakelman-Pucci maximum principle are the main tools. We use the following notations in this paper, many of which are standard.
Notation 1.5**.**
For any , we may write , where and . 2. 2.
: the standard basis of . 3. 3.
4. 4.
. 5. 5.
the complement of in . 6. 6.
the closure of . 7. 7.
. 8. 8.
and . 9. 9.
. 10. 10.
and . 11. 11.
. 12. 12.
. 13. 13.
14. 14.
.
2 Geometric properties of convex domains
In this section, we study the blow-up sets at boundary points of convex domains. It is well known that for a convex domain, the blow-up set at any boundary point is a cone. For a convex domain, we will show the same conclusion.
Definition 2.1**.**
Let be a domain and . The blow-up set at is defined by
[TABLE]
Definition 2.2**.**
We call a cone if it satisfies:
(i) If , then ;
(ii) If , then .
The following lemma gives the relation between the boundary points of the blow-up set and that of the convex domain.
Lemma 2.3**.**
Suppose that is convex and . Then for any there exist a sequence monotone decreasing to 0, a sequence , a unit vector sequence and a unit vector with such that:
(i) ;
(ii) ;
(iii) ,
where and are the function and the constant in Definition 1.1.
**Proof.**1. Without loss of generality, we assume that .
- Suppose . Since , there exists such that . By Definition 2.1, there exists a sequence monotone decreasing to 0 such that and there exists such that . Without loss of generality, we assume that . Thus, for any . Then, for any , there exists which lies in the line segment from to . Hence,
[TABLE]
That is, (i) holds.
For any , since is convex, there exists a unit vector such that
[TABLE]
That is, (ii) holds.
Since is bounded in , there exists a subsequence of , which we also denote by , and a unit vector such that
[TABLE]
By Definition 2.1, for any , there exists such that . Without loss of generality, we assume that . Thus, for any . Hence,
[TABLE]
Therefore,
[TABLE]
for large enough.
Then, we have that
[TABLE]
where . Hence,
[TABLE]
Let , combining with Remark 1.2(ii), we obtain that
[TABLE]
That is, (iv) holds.
- Suppose . Then there exists such that . Interchanging and in step 2, we can obtain such that (i), (ii) and (iii) hold similarly.∎
The following theorem is the main result of this section which is a direct consequence of Lemma 2.3.
Theorem 2.4**.**
If is convex, then is a cone for any .
Proof. Without loss of generality, we assume that . Let and be the function and constant in Definition 1.1. By Definition 2.1, it is easy to see that
[TABLE]
Therefore, to show that is a cone, we only need to prove the convexity of , which is equivalent to
[TABLE]
Let be given by Lemma 2.3. By Lemma 2.3(iii), (2.1) holds clearly.∎
Definition 2.5**.**
Let be convex. For any , if , we call it a corner point. Otherwise, we call it a flat point.
Before the end of this section, we prove the following two lemmas which give the geometric properties of the boundary with respect to corner points and flat points. These properties will be used to prove the boundary differentiability in the next section.
Lemma 2.6**.**
Let be a corner point and be the unit vector given in Definition 1.1. Then
[TABLE]
Proof. 1. Without loss of generality, we assume that and . Thus . Let and be the function and constant in Definition 1.1. Instead of proving (2.2), we only need to prove the following:
[TABLE]
- Now, we choose the vector we need. Since , there exists with (we write ). Let , , and be given by Lemma 2.3 (with ). Let
[TABLE]
where is chosen such that . From and Lemma 2.3(iii), we have . Thus, combining with and , we have . Hence, . Then, it is easy to see that . Without loss of generality, we may assume that (otherwise, we may consider ). Combining with Lemma 2.3(i), we have that
[TABLE]
Since , there exists such that
[TABLE]
- Suppose (2.3) not hold. That is, there exists a sequence monotone decreasing to 0 such that . From (2.4) and (2.5), we have that
[TABLE]
Hence,
[TABLE]
On the other hand, since , we may assume that the exponent of is positive. Combining with , we have that
[TABLE]
Hence,
[TABLE]
Finally,
[TABLE]
Divide by in above equation and let . Consequently, from Lemma 2.3(ii) and (iii), the left side but the right side . We obtain a contradiction. Thus, (2.3) holds.∎
Lemma 2.7**.**
If is a flat point, then is differentiable at .
Proof. 1. Without loss of generality, we assume that , and where is the unit vector in Definition 1.1. Hence, . Let and be the function and constant in Definition 1.1.
- Since , there exists such that
[TABLE]
Since as , there exists such that
[TABLE]
Since is the blow-up set at 0, there exist such that
[TABLE]
where are the standard basis in . Let
[TABLE]
- Suppose that is not differentiable at 0. That is,
[TABLE]
We may assume that and that there exist and such that and . By a translation on the coordinate system, we assume that . From step 2, we have that
[TABLE]
Since , there exists a unit vector such that
[TABLE]
Combining with , we have that
[TABLE]
Hence,
[TABLE]
Similarly, since , we have that
[TABLE]
Since , we have that
[TABLE]
Since , we have that
[TABLE]
Hence, we obtain a contradiction with . Therefore, is differentiable at 0.∎
3 Differentiability at the boundary
In this section we will prove Theorem 1.3. Our proof will be divided into two parts according to the two kinds of boundary points: corner points and flat points (cf. Definition 2.5). In order to prove the theorem concisely, we make the following normalizations without loss of generality.
Normalization 3.1**.**
(1) We assume that and we only prove that is differentiable at [math].
(2) By the linearity of the equation, we assume that and .
(3) We assume that and in Definition 1.1.
(4) We may write and assume that
[TABLE]
(5) Since as , there exists such that where depending only on and is small enough (in fact, we may take ). We assume that . Hence, we have that
[TABLE]
(6) By (1.4) in Remark 1.2, we assume that
[TABLE]
Combining with (5), we have that
[TABLE]
In the following lemma, we construct two barrier functions which will be used later repeatedly.
Lemma 3.2**.**
Suppose that , , and . Then there exist two twice differentiable functions and which satisfy
[TABLE]
and
[TABLE]
respectively.
Proof. Choose small enough such that
[TABLE]
Define and as follows:
[TABLE]
and
[TABLE]
Since the proofs of (3.7) and (3.13) are similar, we only prove (3.7). By the definition of , (3.7(1)) and (3.7(4)) hold clearly.
From (3.1), we have that
[TABLE]
Hence, (3.7(2)) holds.
If , we have that
[TABLE]
If , there exists an index such that
[TABLE]
Thus, from and (3.15), we have that
[TABLE]
That is, (3.7(3)) holds.
Finally, from (3.14), we have that
[TABLE]
That is, (3.7(5)) holds.∎
3.1 Differentiability at corner points
In this subsection, we prove Theorem 1.3 with respect to corner points. By Lemma 2.6, there exist and such that
[TABLE]
Without loss of generality, we assume that . Then combining with Normalization 3.1, Theorem 1.3 is a direct consequence of the following:
Theorem 3.3**.**
There exist positive constants , and depending only on , , and such that
[TABLE]
for any and .
In this subsection, unless otherwise stated, , , , , etc., denote constants depending only on , , and .
Now, we use an iteration method to prove Theorem 3.3 where the Aleksandrov-Bakelman-Pucci maximum principle and the Harnack inequality are the main tools.
Lemma 3.4** (Key iteration).**
There exist positive constants , , , and depending only on , and such that if
[TABLE]
for some nonnegative constants and , then
[TABLE]
Proof. 1. Claim: There exist positive constants , and depending only on and such that
[TABLE]
Proof.
Let , , and (see Lemma 3.2 and recall ). Let . We claim that
[TABLE]
In fact, we separate into two parts: and . On the first part, since , we have . On the second part, since , and , we have . Thus, we have proved the claim. Then it is easy to verify that
[TABLE]
According to the Aleksandrov-Bakelman-Pucci maximum principle[2], we have that
[TABLE]
From (3.7(4)) and the definition of , we have that
[TABLE]
Since , (3.19) holds.
- Let , and (recall ). Then Let
[TABLE]
where is a constant depending only on and and is determined by the following way. Since is convex, satisfies the uniform exterior cone condition. Therefore, is Hölder continuous on . Then by Corollary 9.28 in [2], we have that
[TABLE]
for any and , where and are positive constants depending only on and . Let be small enough such that Then combining with (3.19), we have that
[TABLE]
Let
[TABLE]
Then
[TABLE]
First, we assume that . Thus, and thereby
[TABLE]
Since , we apply the Harnack inequality to on and have that
[TABLE]
Hence,
[TABLE]
Clearly, if , we also have .
Let . We claim that
[TABLE]
In fact, we separate into three parts: , and On the first part, since and , we have . On the second part, since and , we have . On the last part, since , we have that
[TABLE]
Thus, we have proved the claim. Then it is easy to verify that
[TABLE]
According to the Aleksandrov-Bakelman-Pucci maximum principle, we have that
[TABLE]
From (3.13(4)) and the definition of , we have that
[TABLE]
Let , , and . Then (3.18) holds.∎
Lemma 3.5**.**
For , let
[TABLE]
where and . Then
[TABLE]
for .
Proof. 1. Claim: Let . Then is also convex with the function and the constant (see Definition 1.1).
Proof.
Since is convex, we have that for any , there exists a unit vector such that
[TABLE]
Let , we have that
[TABLE]
Hence is convex with the function and the constant .
- We use induction method to prove the lemma. From Lemma 3.4 and we see that (3.23) holds for . Suppose that (3.23) holds for .
Let . It is clear that satisfies the uniformly elliptic condition with and . Let denotes the boundary of near 0. Then satisfies that
[TABLE]
By Claim 1, . On the other hand, it is easy to verify that
[TABLE]
From the induction assumptions and the definition of , we have that
[TABLE]
Then, by Lemma 3.4, we have that
[TABLE]
By variables changing, combining with , we have that (3.23) hold for .∎
Before proving Theorem 3.3, we first give the following two important facts which will be used both in the proof of corner points and in the proof of flat points:
[TABLE]
In fact
[TABLE]
Since , we obtain that . Similarly, .
Proof of Theorem 3.3. Let and be defined as in Lemma 3.5. For simplicity, we denote by and by . For , we have that
[TABLE]
From (3.25), it is easy to verify that
[TABLE]
Thus, by a simple calculation, we see that
[TABLE]
Let , we calculate that
[TABLE]
Similarly,
[TABLE]
Therefore,
[TABLE]
Then from Lemma 3.5, we have that
[TABLE]
for .
Suppose . Let such that . Then for , we have that
[TABLE]
where .∎
3.2 Differentiability at flat points
In this subsection, we prove Theorem 1.3 with respect to flat points. We denote nearby 0 by
[TABLE]
where . From Lemma 2.7, we know that is differentiable. Combining with , we have that . Hence,
[TABLE]
Let
[TABLE]
and
[TABLE]
Hence, as . Then just like (5) in Normalization 3.1, we assume that
[TABLE]
where is the same constant in (5).
Under above assumptions, we observe that for and Hence, combining with Normalization 3.1, Theorem 1.3 is equivalent to:
Theorem 3.6**.**
There exists such that
[TABLE]
Remark 3.7**.**
Notice here that we only know that as and have no estimate of the convergence rate. We prove (3.26) by bounding the graph of between two hyperplanes in each scale and then use the principle that any bounded sequence has an accumulation to show the convergence of the slopes of the hyperplanes. Therefore no convergence rate can be obtained. Actually, Counterexample 4.1 and 4.3 in [6] imply that there should be no convergence rate, otherwise the gradient of will be continuous. ∎
Lemma 3.8** (Key iteration).**
There exist positive constants , , , and depending only on and such that if
[TABLE]
for some nonnegative constants , , and , then there exist nonnegative constants and such that
[TABLE]
where either
[TABLE]
*or
[TABLE]
Remark 3.9**.**
From the geometric point of view, (3.27) means that the graph of lies between two hyperplanes, and (3.29) and (3.30) imply , which means that the two hyperplanes approach to each other as the scale decreases.∎
Proof. 1. Claim: There exist positive constants , and depending only on and such that
[TABLE]
Proof.
Let , , and (see Lemma 3.2 and recall ). Let . We claim that
[TABLE]
In fact, we separate into two parts: and . On the first part, since , we have . On the second part, since , and , we have . Thus, we have proved the claim. Then it is easy to verify that
[TABLE]
According to the Aleksandrov-Bakelman-Pucci maximum principle[2], there exists a positive constant depending only on and such that
[TABLE]
From (3.7(4)) and the definition of , we have that
[TABLE]
or (recall )
[TABLE]
Therefore, we have proved the right side of (3.31).
On the other hand, let . Similarly, We claim that
[TABLE]
In fact, we separate into two parts: and . On the first part, since , we have . On the second part, since , and , we have . Thus, we have proved the claim. Then it is easy to verify that (recall )
[TABLE]
According to the Aleksandrov-Bakelman-Pucci maximum principle, we have that
[TABLE]
Similarly, from (3.7(4)) and the definition of , we have that
[TABLE]
Hence, the left side of (3.31) holds. Therefore, we have proved Claim 1.
- Let and (recall ). Then and . In the following, we will prove the lemma according to two cases: and , corresponding to which (3.29) and (3.30) hold respectively.
Case 1: Let
[TABLE]
Then
[TABLE]
Since , by the Harnack inequality[2], we have that
[TABLE]
where is a constant depending only on . Therefore,
[TABLE]
Let and . We claim that
[TABLE]
In fact, we separate into three parts: , and On the first part, since and , we have . On the second part, since and , we have . On the last part, since , we have that
[TABLE]
Since , we have that
[TABLE]
Thus, we have proved the claim. Then it is easy to verify that
[TABLE]
According to the Aleksandrov-Bakelman-Pucci maximum principle, we have that
[TABLE]
From (3.13(4)) and the definition of , we have that
[TABLE]
Let
[TABLE]
Then combining with (3.31) and we obtain that (3.28) and (3.29) hold.
Case 2: The proof is similar to Case 1. Let
[TABLE]
Then
[TABLE]
Since , by the Harnack inequality, we have that
[TABLE]
Hence,
[TABLE]
Let . We claim that
[TABLE]
In fact, we separate into three parts: , and On the first part, since and , we have . On the second part, since and , we have . On the last part, since and , we have that
[TABLE]
Thus, we have proved the claim. Then it is easy to verify that
[TABLE]
According to the Aleksandrov-Bakelman-Pucci maximum principle, we have that
[TABLE]
From (3.13(4)) and the definition of , we have that
[TABLE]
Combining with (3.31), (3.35) and , we have that (3.28) and (3.30) hold.∎
As the proof of Lemma 3.5, by and Lemma 3.8, we have
Lemma 3.10**.**
There exist nonnegative sequences , , and with , and for
[TABLE]
such that
[TABLE]
Proof of Theorem 3.6. Let , , and be defined as in Lemma 3.10. For simplicity, we denote by , by and by . We prove the theorem by the following several claims.
- Claim 1: is bounded.
Proof.
By induction, we have that
[TABLE]
Since (see (3.43)), we have that
[TABLE]
From (3.25), it is to see that is bounded. Hence, is bounded.
- Claim 2: and .
Proof.
Since the proofs of and are similar, we only prove the first identity. By Claim 1, there exists a positive constant such that for any . Then combining with and (for an integer large enough), we have that
[TABLE]
Then is bounded since Since
[TABLE]
and is bounded, we conclude that is bounded (recall ). Therefore, it follows that
[TABLE]
- Claim 3:
Proof.
From and (3.43), we have that
[TABLE]
or
[TABLE]
where is a positive constant such that for any . The existence of such follows from Claim 1 and Claim 2. Let . It follows that
[TABLE]
Let , we calculate that
[TABLE]
For and , we have the similar result. Hence,
[TABLE]
By L’Hospital rule, the right-hand side of (3.46) tends to 0 as . Thus, we have proved the claim.
- Claim 4: is convergent and we set
[TABLE]
Proof.
For any , we define , , and as follows:
[TABLE]
and
[TABLE]
where is a constant such that for any . Then , for any . Thus, by induction, we have that , and for any .
Likewise (3.45), we have that
[TABLE]
or
[TABLE]
Let , by the same arguments to derive (3.46), we have that
[TABLE]
By the definition of , we have that
[TABLE]
Hence,
[TABLE]
Therefore,
[TABLE]
Now we estimate the right-hand side of (3.49). Let and then
[TABLE]
Similarly,
[TABLE]
On the other hand, by the same arguments to derive (3.25), we have that
[TABLE]
Therefore,
[TABLE]
where is a positive constant.
We suppose by the contradiction that is not convergent. Since is bounded, it has at least two different accumulation points which we denote by . Since , and , the right side of above inequality tends to zero as Then, there exists an integer large enough such that
[TABLE]
and
[TABLE]
Hence, for any ,
[TABLE]
Therefore, we get a contradiction with that is an accumulation point of .
- Claim 5: Let be given in Claim 4. Then for each , there exists such that and for any .
Proof.
For any and any , we have that
[TABLE]
From (3.44),
[TABLE]
Let and then
[TABLE]
From Claim 2 and Claim 3, we have that
[TABLE]
Let . From (3.51) and (3.52), it follows that
[TABLE]
From Claim 4 and (3.53), we have that as .
From Claim 5, we deduce that is differentiable at [math] with derivative . Therefore, the proof of Theorem 3.6 is completed.∎
Remark 3.11**.**
If in (1.1) and satisfies the Dini condition (see (1.2) in [7]), it is not hard to verify that Theorem 1.3 is also true and the Dini condition can not be weaken. As pointed out in [6], no continuity of the gradient of solutions can be expected. So far, together with related papers, we gain a deep insight into the boundary differentiability of solutions of (1.1).∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] C.C. Burch, The Dini condition and regularity of weak solutions of elliptic equations, Journal of Differential Equations. 30(3) (1978) 308-323.
- 2[2] D. Gilbarg, N.S. Trudinger, Elliptic partial differential equations of second order, second ed., Springer-Verlag, 1983.
- 3[3] A.M. Il’in, Parabolic equations whose coefficients do not satsify the Dini condition, (Russian) Matematicheskie Zametki. 1 (1967) 71-80.
- 4[4] N.V. Krylov, Boundedly inhomogeneous elliptic and parabolic equations in a domain, (Russian) Izvestiya Akademii Nauk SSSR. 47(1) (1983) 75-108.
- 5[5] N.V. Krylov, Estimates for derivatives of the solutions of nonlinear parabolic equations, (Russian) Doklady Akademii Nauk SSSR. 274(1) (1984) 23-26.
- 6[6] Dongsheng Li, Lihe Wang, Boundary differentiability of solutions of elliptic equations on convex domains, Manuscript Math.121 (7) (2006) 137-156
- 7[7] Dongsheng Li, Lihe Wang, Elliptic equations on convex domains with nonhomogeneous Dirichlet boundary conditions, Journal of Differential Equations, 121.137-156 (2009)
- 8[8] G.M. Lieberman, The Dirichlet problem for quasilinear elliptic equations with Hölder continuous boundary values, Archive for Rational Mechanics and Analysis. 79(4) (1982) 305-323.
