Pointwise gradient bounds for entire solutions of elliptic equations with non-standard growth conditions and general nonlinearities
Cecilia Cavaterra, Serena Dipierro, Alberto Farina, Zu Gao, and Enrico, Valdinoci

TL;DR
This paper establishes pointwise gradient bounds for solutions to very general elliptic PDEs with non-standard growth, including singular, degenerate, and nonlinear cases, in the entire Euclidean space.
Contribution
It provides a unified framework for gradient bounds applicable to a broad class of elliptic equations with complex nonlinearities and growth conditions.
Findings
Derived pointwise gradient bounds for solutions
Applicable to singular and degenerate nonlinear cases
Handles general nonlinear source terms
Abstract
We give pointwise gradient bounds for solutions of (possibly non-uniformly) elliptic partial differential equations in the entire Euclidean space. The operator taken into account is very general and comprises also the singular and degenerate nonlinear case with non-standard growth conditions. The sourcing term is also allowed to have a very general form, depending on the space variables, on the solution itself, on its gradient, and possibly on higher order derivatives if additional structural conditions are satisfied.
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.
Pointwise gradient bounds for entire solutions
of elliptic equations with non-standard growth conditions
and general nonlinearities
Cecilia Cavaterra*(1,5)*
Serena Dipierro*(2)*
Alberto Farina*(3)*
Zu Gao*(4)*
Enrico Valdinoci*(2,1)*
Abstract
We give pointwise gradient bounds for solutions of (possibly non-uniformly) elliptic partial differential equations in the entire Euclidean space.
The operator taken into account is very general and comprises also the singular and degenerate nonlinear case with non-standard growth conditions. The sourcing term is also allowed to have a very general form, depending on the space variables, on the solution itself, on its gradient, and possibly on higher order derivatives if additional structural conditions are satisfied.
(1) – Dipartimento di Matematica “Federigo Enriques”
Università degli studi di Milano
Via Saldini 50, I-20133 Milano (Italy)
(2) – Department of Mathematics and Statistics
University of Western Australia
35 Stirling Highway, WA6009 Crawley (Australia)
(3) – LAMFA, CNRS UMR 7352
Faculté des Sciences
Université de Picardie Jules Verne
33 rue Saint Leu, 80039 Amiens CEDEX 1 (France)
(4) – School of Mathematics and Statistics
Central South University
932 Lushan S Road
410083 Hunan, Changsha (China)
(5) – Istituto di Matematica Applicata e Tecnologie Informatiche “Enrico Magenes”, CNR
Via Ferrata 1, 27100 Pavia (Italy)
E-mail addresses: [email protected], [email protected], [email protected], [email protected], [email protected]
2000 Mathematics Subject Classification: 35J60, 35J70, 35J75.
Keywords: Regularity theory, singular and degenerate equations, -Laplacian, pointwise gradient estimates in terms of a potential function.
1 Introduction
In this paper we consider a very general elliptic equation, set in the whole of the Euclidean space, and we will establish pointwise gradient bounds for the solutions. The operator taken into account can be degenerate and singular, and we can also consider the case of the superposition of differential operators with different homogeneity.
The main result establishes that (a possibly nonlinear function of) the gradient of the solution is bounded at any point by a suitable potential function. Moreover, the bound obtained, which can be seen as a generalization of the Energy Conservation Principle to PDEs, is in general sharp, since if equality is attained in this bound, the solution is shown to be necessarily constant.
Our results comprise, as particular cases, the classical results in [MR803255, MR1296785]. The method of proof is based on Maximum Principles and it can be seen as a refinement of the classical Bernstein method introduced in [MR1544873], as extended in [MR0454338, MR583337, MR615561]. Namely, one considers a suitable auxiliary function, called “-function” in jargon, which is defined in terms of the solution and its gradient, and shows that such a -function satisfies a differential inequality: from this and the Maximum Principle, the desired bounds on the gradient plainly follow.
In spite of its intrinsic simplicity (and unquestionable beauty), the idea of obtaining gradient bounds via the Maximum Principle turned out to be very effective, and it found several applications in many topics, including Riemannian geometry (see e.g. [MR0385749, MR1230276, MR2285258, MR2812957]) anisotropic or nonhomogeneous equations (see e.g. [MR1942128, MR3158523, MR3168616, MR3231999, MR3348935, MR3587074]), and also subelliptic equations (see [MR2545524]), and, when the equation is set in a domain, the technique also detects the geometry of the domain itself (see e.g. [MR2680184, MR2911121]). Moreover, a novel approach to the Maximum Principle method has been recently exploited in a very successful way in [MR3125548, MR3381494, 2018arXiv180809615A], in order to obtain oscillation and modulus of continuity estimates. In general, these types of gradient and continuity estimates are also related to rigidity results for overdetermined problems (see e.g. [MR980297, MR2591980, MR3145008]) and they also provide, as a byproduct, new classification results of Liouville type (see also [MR1674355, MR2317549]).
In the case under consideration in this paper, given the very general structure of the equation, one needs to exploit a technique introduced in [MR3049726]: in our case, such differential inequality will be satisfied, in general, only up to a reminder, which can be shown to have the appropriate sign in a number of concrete examples.
Let us now describe in detail the mathematical framework in which we work. We consider the following PDE in divergence form:
[TABLE]
where \Phi\in C^{3,\alpha}_{\mathrm{loc}}\big{(}(0,+\infty)\big{)}\cap C\big{(}[0,+\infty)\big{)} for some , with , and .
We denote by the variables of the function , i.e., , and we assume that for all we have that
[TABLE]
where the subscript denotes partial derivative with respect to the variable .
In (1.1) and throughout this article,
[TABLE]
will denote an operator111For instance, in our setting,
S(u)=\Big{(}x,\;u,\;x+\nabla u,\;u_{111}-u_{22}+\Delta^{2}u,\;u_{11}^{5},\;x\cdot\nabla u+\log(1+u_{2222}^{4})+\sqrt{-\Delta}(\arctan u)\Big{)}
is an admissible (though not specially meaningful) operator. In this case, , that is . In our setting, it is an interesting feature that the nonlinear source can also depend on higher derivatives, on nonlinear differential operators, on integro-differential operators, etc. acting on bounded and smooth functions, with and , and we will write where . If , we have that does not depend on the variable .
We stress that is just a map sending functions into vectorial functions, and it does not necessarily need to be linear or continuous in any topology. Also, for the sake of simplicity, we will consider smooth222In this paper, we did not optimize the regularity assumptions on the solution . For our purposes, it is sufficient to have sufficient regularity to write (1.1) in the pointwise sense and consider its derivatives. Hence, if the operator only involves a finite number of derivatives, then also is required to have a finite number of derivatives. When only involves operators of order or less, in concrete cases one can also apply standard elliptic regularity theory to obtain the desired regularity of starting with rather minimal assumptions. Since the minimal regularity assumptions in this general setting are rather technical, we will not introduce this additional complication in this article, sticking to the case of sufficiently smooth solutions. solutions of (1.1).
As customary, we will assume that the divergence form operator in (1.1) possesses suitable (possibly singular or degenerate) elliptic structure, which will ensure the validity of the Maximum Principle. For this, for any , we set
[TABLE]
and we will always assume in this paper that at least one of the following Assumptions A and B is satisfied:
Assumption A. There exist , and , such that, for every , ,
[TABLE]
[TABLE]
Assumption B. We have that , and there exist , such that, for every and every , with ,
[TABLE]
[TABLE]
Related structural assumptions on the diffusive operators have been considered in [MR1296785, MR3049726]. We observe that Assumptions A and B will be enforced with , hence, under a Lipschitz condition on the solution , one has that for some . So that it will be sufficient to require Assumptions A and B with belonging to the ball of radius centered at the origin, which we will denote by . Therefore, from now on, when we say that Assumptions A and B are satisfied, we mean that they are fulfilled when , and the constants and can depend on . In particular, when Assumption B is in force, we can reduce to Assumption A with , with constants depending on .
In our setting, we have that Assumptions A and B are satisfied by very general nonlinear operators, as established by the following result:
Proposition 1.1**.**
Let and
[TABLE]
with
[TABLE]
and
[TABLE]
Then:
- (i)
If
[TABLE]
for some , then Assumption A holds true.
- (ii)
If
[TABLE]
for some , then Assumption B holds true.
In view of Proposition 1.1 it follows that Assumptions A and B comprise the important case of nonlinear operators with non-standard growth conditions and with non-uniform ellipticity properties, see [MR1814973, MR3614673, MR3775180].
In our setting, the bounds on the gradient of the solution will require the control on the sign of a suitable reminder. To describe this feature in details, we give some notation. For any , we define
[TABLE]
In this setting, the reminder function that we consider is defined333We take this opportunity to amend a flaw in [MR3049726]. As a matter of fact, due to a cut-and-paste error, the term
is missing from formula (1.13) in [MR3049726]. The proof in [MR3049726] (which is based on Lemma 2.1 there) is however correct as it is. Formula (1.11) and Remark 1.4 of [MR3049726] have also to be corrected by adding the missing term (e.g., saying that ). Also, for clarity, we point out some minor typos in [MR3049726]: the statement “” three lines below (3.4) should be “”, the set on line 3 of page 625 should be corrected into , the “neighborhood of ” in the last line of the proof of Theorem 1.3 should be the “neighborhood of ”. Also, throughout all [MR3049726], the function is assumed to be uniformly in with respect to the variable. on by
[TABLE]
As customary, if the second term in the right hand side of (1.14) is considered to be zero (equivalently, in this case, the function does not depend on the variable ).
Given we will also denote by the space of functions such that
[TABLE]
In this framework, our pivotal result is the following:
Theorem 1.2**.**
Assume that is a solution of (1.1). For every , let
[TABLE]
Assume that
[TABLE]
and
[TABLE]
Then,
[TABLE]
We observe that, since is bounded, we have that is finite and the setting in (1.15) is well posed. As a matter of fact, such a setting can be seen as a “gauge” on the potential function that makes nonnegative on the range of the solution.
Condition (1.16) can be seen as a regularity assumption on the solution (it can be also relaxed, for instance, if , with T:L^{\infty}(\mathbb{R}^{n})\cap C^{\ell}(\mathbb{R}^{n})\mapsto\big{(}C^{\ell^{\prime}}(\mathbb{R}^{n})\big{)}^{N-2n}, it is enough to suppose that is uniformly in the variable and ).
We also point out that Theorem 1.2 comprises, as special cases, some classical results. In particular, when and vanishes identically, then also vanishes identically, hence condition (1.17) is satisfied. In this case, equation (1.1) reduces to
[TABLE]
and (1.18) boils down to
[TABLE]
which is precisely the classical result in [MR803255]. Similarly, some results in [MR1296785] and [MR3049726] are also recovered as particular cases of Theorem 1.2 (and, from the technical point of view, the setting introduced here simplifies and extends that in [MR3049726], by keeping track at the same time of all the derivatives of the nonlinear source ). In particular, recovering the elliptic regularity theory as mentioned in the footnote on page 2, one can obtain from Theorem 1.2 the classical results in [MR803255], [MR1296785] and [MR3049726] also for weak solutions.
In some sense, one can consider Theorem 1.2 as an abstract result, in which a very general framework is taken into account, with minimal structural assumptions on the equation, but under a fundamental condition on the sign of the reminder function, as given in (1.17). To apply this result to particular cases of interest, we point out now that condition (1.17) is indeed satisfied in a number of concrete situations, such as the -Laplacian operator, the graphical mean curvature operators, and operators obtained by the superposition of singular and degenerate operators with different scaling properties, proving gradient bounds under simple structural assumptions on the nonlinear sources. Indeed, we have the following result:
Proposition 1.3**.**
Let and be as in (1.8), under assumptions (1.9) and (1.10), and suppose that for all . Assume that
[TABLE]
Suppose also that
[TABLE]
In addition, assume that one of the following five conditions is satisfied: either
[TABLE]
or
[TABLE]
or
[TABLE]
or
[TABLE]
or
[TABLE]
or
[TABLE]
Then .
A concrete example that satisfies assumptions (1.20) and (1.21) is
[TABLE]
with and increasing.
Other concrete situations in which one can explicitly check that will be discussed in the forthcoming Remarks 1.5 and 1.6.
Combining Theorem 1.2 with Propositions 1.1 and 1.3, we plainly obtain the following gradient estimate in a very general, but concrete, situation:
Corollary 1.4**.**
Let and
[TABLE]
with and for every .
Suppose that either
[TABLE]
or
[TABLE]
for some .
Suppose also that satisfies the following monotonicity and homogeneity assumptions:
[TABLE]
In addition, assume that one of the following five conditions is satisfied: either
[TABLE]
or
[TABLE]
or
[TABLE]
[TABLE]
or
[TABLE]
or
[TABLE]
Assume that is a solution of
[TABLE]
For every , let
[TABLE]
Then,
[TABLE]
Remark 1.5**.**
Checking condition (1.17) can be, in principle, not a trivial task in practice. Nevertheless, there are a number of concrete cases in which condition (1.17) is automatically satisfied. Without any attempt of being exhaustive, and only for the sake of confirming the interest of such a condition, we list here some of these situations in which condition (1.17) is fulfilled. For simplicity, we focus here on the case in which vanishes identically, and thus (1.14) reduces to
[TABLE]
(i). An interesting example is given by the equation
[TABLE]
with , , , under the assumption that the matrix is nonnegative definite.
To check that (1.17) is satisfied in this case, it is convenient to take , , that is
[TABLE]
and
[TABLE]
Notice that, with this choice, the general setting in (1.1) gives precisely (1.41).
To check that condition (1.17) is satisfied in this case, we point out that for every we have that , and . Accordingly,
[TABLE]
Furthermore,
[TABLE]
Consequently, by (1.40),
[TABLE]
This generalizes the result in (1.10) of [MR3049726] to more general operators.
(ii). As a further example, one can assume that
[TABLE]
and consider the projection operator
[TABLE]
In this case, condition (1.17) is satisfied by all solutions which are nondecreasing in the first direction, since, by (1.40),
[TABLE]
with .
(iii). Another interesting case is when (1.42) holds true and one considers the integral operator
[TABLE]
and then (1.17) is satisfied by all nonnegative solutions which are nondecreasing in every direction (i.e., for all ).
Indeed, in this case we have that
[TABLE]
and hence, by (1.40),
[TABLE]
(iv). One can also assume (1.42) and take into account the convolution operator
[TABLE]
with . In this case, condition (1.17) is satisfied by all solutions which are nondecreasing in every direction, since
[TABLE]
and (1.40) gives that
[TABLE]
(v). More generally, one can also assume (1.42) and take into account the multi-convolution operator
[TABLE]
with . Then, condition (1.17) is satisfied by all solutions which are nonnegative, and nondecreasing in every direction, since
[TABLE]
and hence (1.40) gives that
[TABLE]
(vi). Another interesting example is given by the equation
[TABLE]
with and such that .
In this case, one takes and . Then
[TABLE]
and hence, by (1.40),
[TABLE]
Remark 1.6**.**
An interesting example satisfying the structural assumption in (1.17) is provided by the equation
[TABLE]
with , , and . In this case, assumption (1.17) is fulfilled if is monotone nondecreasing in direction , i.e. .
Indeed, in this case we can take , , and . Then, the general equation in (1.1) reduces in this setting to the one in (1.44).
We observe that for all and . Moreover, by (1.13), we see that . Consequently, we deduce from (1.14) that
[TABLE]
and thus condition (1.17) is satisfied in this case as well.
Following some classical lines of research in [MR803255, MR1296785, MR3049726] one has that pointwise gradient bounds are often related to classification results, since attaining the potential gauge at some point provides a very rigid information that can completely determine the solution. This is the counterpart of the fact that particles subject to ordinary differential equations remain motionless if they start with zero velocity at a potential well. In our setting, the corresponding result in this direction goes as follows:
Theorem 1.7**.**
Let and let the setting in (1.15) hold true. Assume also that (1.18) is satisfied.
Let be such that , with and .
If in Assumption A, suppose also that
[TABLE]
Then is constantly equal to .
We observe that condition (1.45) cannot be dropped: indeed, if and
[TABLE]
the function
[TABLE]
satisfies
[TABLE]
with
[TABLE]
Notice that in this case , and , but is not constant, and (1.45) is violated since
[TABLE]
The rest of the paper is organized as follows. In Section 2, we show that Assumptions A and B are satisfied in several cases of interest, by proving Proposition 1.1.
Section 3 introduces the notion of -function relative to equation (1.1) and contains the computations needed to check that such a function satisfies a suitable differential inequality, possibly in terms of the remainder .
Then, the proof of Theorem 1.2 is presented in Section 4, while Section 5 is devoted to the proofs of Proposition 1.3 and Corollary 1.4, and Section 6 contains the proof of Theorem 1.7.
2 Structural assumptions and proof of Proposition 1.1
In this section, we will establish Proposition 1.1. This will be accomplished in Propositions 2.1 and 2.2 (which will give, under suitable structural conditions, the setting in Assumption A), and in Propositions 2.3 and 2.4 (which will give, under suitable structural conditions, the setting in Assumption B). The precise computational details go as follows.
Proposition 2.1**.**
Assume (1.9) and (1.10) hold true. Suppose also that
[TABLE]
[TABLE]
for some .
Let also
[TABLE]
for some . Then we have that
[TABLE]
where
[TABLE]
Proof.
By (1.8), we have
[TABLE]
As a consequence,
[TABLE]
In addition, we observe
[TABLE]
therefore
[TABLE]
for all .
Now, to establish the upper bound in (2.4), we use (2.8) and observe that
[TABLE]
Now we claim
[TABLE]
Indeed, if , we recall (2.2) and have that
[TABLE]
which gives (2.11). If instead , we use the inequality
[TABLE]
and this gives (2.11) in this case as well.
Then, we insert (2.11) into (2.10) and find that
[TABLE]
This and (2.9) give
[TABLE]
From this and (2.6) we conclude that the upper bound in (2.4) is satisfied, as desired.
Now we check the lower bound in (2.4). For this, by (2.8) and (2.9), we have
[TABLE]
This and (2.5) give the lower bound in (2.4).
Proposition 2.2**.**
Assume (1.9) and (1.10) hold true. Suppose also that (2.1), (2.2) and (2.3) are satisfied. Then, for every we have that
[TABLE]
where
[TABLE]
Proof.
First of all, from (2.7), we obtain
[TABLE]
Accordingly, we have that
[TABLE]
and therefore, for every ,
[TABLE]
To prove the upper bound in (2.12) we argue as follows. We exploit (1.9) to see that
[TABLE]
Furthermore, in view of (1.9), (2.3) and (2.11), we see that
[TABLE]
Consequently, by (2.9), we have
[TABLE]
Hence (2.17) gives that
[TABLE]
This together with (2.14) establishes the upper bound in (2.12), and we now deal with the lower bound in (2.12). To this end, we observe that if , then
[TABLE]
thanks to (2.2).
This and (2.16) yield that
[TABLE]
From this and (2.9) we obtain
[TABLE]
This gives the lower bound in (2.12), thanks to the setting in (2.13), and we stress that , in light of (2.1).
Proposition 2.3**.**
Assume (1.9) and (1.10) hold true. Suppose also that
[TABLE]
for some .
Let also
[TABLE]
for some . Then we have that
[TABLE]
where
[TABLE]
Proof.
We use (1.9), (2.18) and (2.19) to obtain that
[TABLE]
This and (2.9) yield
[TABLE]
Plugging this information into (2.8), we see that
[TABLE]
This and (2.22) give the upper bound in (2.20).
Furthermore, by (2.8) and (2.18), we have
[TABLE]
This and (2.9) lead to
[TABLE]
Hence, recalling (2.21), we obtain the lower bound in (2.20), as desired.
Proposition 2.4**.**
Assume (1.9) and (1.10) hold true. Suppose also that (2.18) and (2.19) are satisfied. Then, for every with , we have that
[TABLE]
where
[TABLE]
Proof.
The argument is a careful modification of that used in the proof of Proposition 2.2, taking into special consideration the th component of the vector .
To prove the upper bound in (2.23), we recall (2.16) and perform the following computation:
[TABLE]
thanks to (2.18) and (2.19). Hence, recalling (2.9), we have
[TABLE]
This proves the upper bound in (2.23), in light of (2.25) and the fact that .
Now we prove the lower bound in (2.23). For this, we use (2.19) to see that
[TABLE]
Also, if , then
[TABLE]
This and (2.16) give that
[TABLE]
Hence, in view of (2.26), we get
[TABLE]
This and (2.9) give that
[TABLE]
that is the lower bound in (2.23), thanks to (2.24).
By means of the above conclusions, we are in the position of proving Propostion 1.1:
Proof.
The claim in (i) of Proposition 1.1 directly follows from Propositions 2.1 and 2.2. Similarly, the claim in (ii) of Proposition 1.1 is a consequence of Propositions 2.3 and 2.4.
3 -function computations
The goal of this section is to introduce an appropriate -function relative to equation (1.1) and establish a differential inequality for it (combining this with the Maximum Principle, we will obtain also the desired gradient bounds). To implement this strategy, for such a solution , for all we define
[TABLE]
and we prove the following result:
Lemma 3.1**.**
Let be an open subset of . Let be a solution of (1.1) in , with in , and
[TABLE]
Let
[TABLE]
and
[TABLE]
Then, we have that
[TABLE]
Proof.
By (3.2), the map is invertible, and we denote by its inverse. Notice that
[TABLE]
Moreover, by the definition of and (1.13), we have
[TABLE]
hence
[TABLE]
Now, differentiating (3.1) and recalling (1.13), we see that
[TABLE]
Hence, recalling (3.3), we get
[TABLE]
Also, (1.3) gives that
[TABLE]
By (1.1), we obtain
[TABLE]
Therefore, by (3.10) and (3.11), for any fixed , we have
[TABLE]
From (3) and (3), we find that
[TABLE]
Furthermore, from (1.13) and (3.3), we obtain
[TABLE]
Plugging this into (3), we conclude that
[TABLE]
Also, it follows from (3.3) and (3.11) that
[TABLE]
and so (3) becomes
[TABLE]
Moreover, making use of (1.3), (1.13) and (3.3), we obtain
[TABLE]
Also, from (1.3) and (3.11), we get
[TABLE]
from which we obtain
[TABLE]
Therefore, recalling also (3.8), we write (3) as
[TABLE]
Thus, exploiting (3), one has
[TABLE]
Now we set
[TABLE]
and we use Schwarz Inequality to see that
[TABLE]
and so
[TABLE]
This and (1.3) give that
[TABLE]
Moreover, by (3.8), we have that
[TABLE]
This and (3) lead to
[TABLE]
By substituting this into (3), we obtain
[TABLE]
Therefore, we have that
[TABLE]
Now, for fixed, we use (3.6) to get that
[TABLE]
Consequently, by (3.7), we conclude
[TABLE]
Multiplying both sides of (3) by , we see that
[TABLE]
From this, we obtain the desired result in (3.5).
4 Proof of Theorem 1.2
This section contains the proof of the pointwise gradient estimate in (1.18). This relies on Lemma 3.1 and the Maximum Principle. The technical details go as follows:
Proof of Theorem 1.2.
First of all, we observe that (3.2) holds true. Indeed, taking and , we deduce from (1.3) and (1.13) that
[TABLE]
Hence, if Assumption A is satisfied, we obtain
[TABLE]
If instead Assumption B is satisfied, we deduce from (4.1) that
[TABLE]
This observation and (4.2) show that (3.2) is satisfied, and therefore we are in the position of applying Lemma 3.1. In this way, recalling (1.17) and (3.5), we see
[TABLE]
in , where the notations in (3.1) and (3.4) have been utilized.
From this, we can repeat some classical arguments used also in the proof of Theorem 1.2 in [MR3049726] to obtain our Theorem 1.2. We show the arguments in full detail for the facility of the reader. Besides, in order to address the general case treated in this paper, these classical arguments need to be carefully adapted, producing a number of additional technical difficulties.
Recalling the notation in (3.1), we define
[TABLE]
We claim that
[TABLE]
To prove this, we assume by contradiction that
[TABLE]
First, take sequence such that
[TABLE]
We can define . This function satisfies an elliptic equation with bounded right hand side and therefore, by elliptic regularity theory (possibly reducing Assumption B to Assumption A with ), we have that, for every ,
[TABLE]
for some .
Also, from (4.5), we have that
[TABLE]
Furthermore, by (3.1), we get
[TABLE]
In view of this and (4.8), we conclude that
[TABLE]
By the Theorem of Ascoli-Arzelà (and up to a subsequence) and possibly renaming , we may suppose that converges to some in , and therefore, by (3.1), we see
[TABLE]
Using this, (4.10) and (4.11), we thereby obtain
[TABLE]
Now, we define
[TABLE]
We observe that , thanks to (4.12), and hence
[TABLE]
Also, by the continuity of and ,
[TABLE]
Here, we denote by for simplicity, so
[TABLE]
and we claim that for all
[TABLE]
To prove this, we first remark that
[TABLE]
by and either (1.4) or (1.6). Moreover, taking , , , by (1.3) we see that
[TABLE]
and accordingly
[TABLE]
Now, to prove (4.16) we distinguish two cases, according to whether Assumption A or Assumption B is satisfied. First of all, if Assumption A is satisfied, we use (1.5) and (4.18) to see that
[TABLE]
We now distinguish two subcases, depending on . If , we deduce from (4.19) that
[TABLE]
for some . This and (4.17) yield that
[TABLE]
for all , and this gives (4.16), up to renaming .
On the other hand, if , we deduce from (4.19) that
[TABLE]
which, together with (4.17), gives that
[TABLE]
for all , and this gives (4.16).
It remains to prove (4.16) if Assumption B holds true. In this case, we use (1.7) and (4.18) to see that
[TABLE]
This and (4.17) give that
[TABLE]
for all , and the proof of (4.16) is thereby complete.
Now, we claim that
[TABLE]
For this, let . We recall that on the range of , thanks to (1.15). Then, in light of (3.1), (4.15) and (4.16) we see that
[TABLE]
Now, we set
[TABLE]
and, recalling (4.7), we observe that . As a consequence, in light of (4.21), it follows that there exists such that
[TABLE]
Therefore, there exists such that for all and all we have that
[TABLE]
In particular, and therefore, by (4.4), we get
[TABLE]
Moreover, by (3.1), we have , and therefore we can write (4.23) in the form
[TABLE]
for all , as long as , where
[TABLE]
We stress that, by (3.4), (4.22) and (4.25), we can obtain
[TABLE]
which is bounded, thanks to (1.2) (recall also (4.2) and (4.3)). Therefore, up to subsequences, we can suppose that
[TABLE]
Furthermore, by (1.1), we conclude
[TABLE]
where
[TABLE]
In view of (1.16) and (4.9), we have that , with
[TABLE]
Consequently, by (4.22) and uniform elliptic regularity theory, we obtain that
[TABLE]
Therefore, up to a subsequence and possibly renaming , we can suppose that converges to in , as .
As a consequence, recalling (3.1), we conclude that
[TABLE]
Exploiting (4.24), (4.26) and (4.27), we obtain that
[TABLE]
for all , in the distributional sense.
Therefore, recalling (4.12), by Maximum Principle (see e.g. [MR038022, Theorem 8.19], or [MR2356201]), it follows that for any , and this establishes (4.20).
Now, by (4.13) and (4.20), we infer that is both closed and open, so that , that is
[TABLE]
On the other hand, since is bounded, by following the gradient lines we find a sequence of points such that
[TABLE]
By using this in (4.28), we obtain
[TABLE]
which is in contradiction with (4.7). This proves (4.6), from which Theorem 1.2 follows at once.
5 Proofs of Proposition 1.3 and Corollary 1.4
We start by proving Proposition 1.3:
Proof of Proposition 1.3.
From the definition of in (1.8) and in (1.13) (recall also (2.7) and (2.15)) we have that
[TABLE]
Therefore
[TABLE]
Also, by (1.19), we write , referring to as the variable corresponding to and to as the variable corresponding to . By (1.20), we know that
[TABLE]
Moreover, by the homogeneity of in (1.21), we have that
[TABLE]
As a consequence, by (1.14), (5.2) and (5.3) (and using short notations whenever possible), we have
[TABLE]
Hence, recalling (5.1), we obtain
[TABLE]
Now we claim that
[TABLE]
To prove (5.5) we distinguish six cases, according to the different assumptions in (1.22)-(1.27). To start with, let us assume that (1.22) is satisfied. Then, we have that
[TABLE]
and this proves (5.5) in this case. The same way can be used to discuss cases (1.23) and (1.24), we omit them here.
If instead (1.25) is satisfied, we find that and consequently , which shows (5.5) in this case.
In addition, if (1.26) is satisfied, we see that
[TABLE]
and thus
[TABLE]
Finally, if (1.27) holds true, we see that
[TABLE]
This completes the proof of (5.5).
Then, the desired result follows from (5.4) and (5.5).
With the previous work, we can now establish Corollary 1.4, which gives a series of concrete situations in which our main gradient estimate holds true.
Proof of Corollary 1.4.
By either (1.28) or (1.29) we have the validity of either (1.11) or (1.12) and consequently, by Proposition 1.1, we deduce that either Assumption A or Assumption B is satisfied.
This is one of the cornerstones to apply Theorem 1.2. The other fundamental ingredient to apply Theorem 1.2 lies in the reminder estimate (1.17), which we are now going to check. To this end, we want to exploit Proposition 1.3 and, for this, we need to verify that its assumptions are fulfilled in our setting. Indeed, we have that (1.20) and (1.21) follow from (1.30) and (1.31). Furthermore, at least one among (1.22)-(1.27) is satisfied, in light of (1.32)-(1.37). Condition 1.19 is also fulfilled, due to the structure of in (1.38). Therefore, all the hypotheses of Proposition 1.3 are satisfied, and consequently we deduce from Proposition 1.3 that .
This in turn gives that condition (1.17) is satisfied and, as a consequence, we are in the position of exploiting Theorem 1.2. In this way, the desired result in (1.39) plainly follows from (1.18).
6 Proof of Theorem 1.7
In this section, we prove Theorem 1.7. After our preliminary work, this part follows closely some arguments in [MR1296785, MR3049726]. We provide full details in the specific case in which we are interested, for the facility of the reader.
Proof of Theorem 1.7.
We take and as in the statement of Theorem 1.7 and we define
[TABLE]
Notice that , and hence . Furthermore, by the continuity of , we have that is closed. We claim that
[TABLE]
From this, we would obtain that , which is the thesis of Theorem 1.7. Therefore we focus on the proof of (6.1). For this, we fix and . For any , we define
[TABLE]
We claim that there exist positive constants and such that
[TABLE]
For this, we define
[TABLE]
We also make use of the function introduced in the proof of Lemma 3.1, which satisfies the functional identity
[TABLE]
Let also
[TABLE]
The parameter will be chosen conveniently small with respect to and to the structural constants given in either (1.5) or (1.7). Observe that if , then in and so the result is true.
Now we take , with , and and we use (1.13) and (1.3), and either (1.5) or (1.7), to see that
[TABLE]
as long as is small enough.
Furthermore, notice that, by and either (1.4) or (1.6), we have that . Also, by (1.13), we have
[TABLE]
for any and therefore for any , thanks to (6) (as long as is small enough). As a consequence, and therefore
[TABLE]
for any . By taking in (6.14) and using (1.18), we obtain
[TABLE]
Now, we claim that if is sufficiently close to then there exists such that
[TABLE]
To check this we distinguish two cases, according to the value of . First of all, if , we use a second order Taylor expansion of , and we conclude that
[TABLE]
from which (6.16) plainly follows in this case.
If, on the other hand, , then the setting in (6.3) gives that Assumption A holds true with . Then, in this case (6.16) follows from (1.45). The proof of (6.16) is therefore complete.
Now, plugging (6.16) into (6.15), we get that there exists small enough such that
[TABLE]
Taking , we obtain (6.2), as desired.
From (6.2) we obtain that the function is non-increasing for small . Accordingly, for small , that is vanishes identically (for small , independently of ). By varying , we obtain that is constant in a small neighborhood of . This proves (6.1) and thus Theorem 1.7.
Acknowledgments
Cecilia Cavaterra has been partially supported by GNAMPA (Gruppo Nazionale per l’Analisi Matematica, la Probabilit� e le loro Applicazioni) of INdAM (Istituto Nazionale di Alta Matematica).
Serena Dipierro has been supported by the DECRA Project DE180100957 “PDEs, free boundaries and applications”.
Serena Dipierro and Enrico Valdinoci have been supported by the Australian Research Council Discovery Project DP170104880 “N.E.W. Nonlocal Equations at Work”.
Zu Gao has been supported by the Chinese Scholarship Council. This work was written on the occasion of a very pleasant and fruitful visit of Zu Gao at the Università di Milano, which we thank for the warm hospitality.
References
