The optimal exponent in the embedding into the Lebesgue spaces for functions with gradient in the Morrey space
Xavier Cabre, Fernando Charro

TL;DR
This paper investigates the optimal Lebesgue space embedding for functions with gradients in Morrey spaces, disproving a previous claim of a larger exponent range and providing explicit counterexamples.
Contribution
It corrects a mistaken claim about the embedding range by constructing counterexamples and clarifies the precise exponent bounds for functions with Morrey space gradients.
Findings
Disproved the larger embedding range $q<n p/(\lambda-p)$ for functions with Morrey space gradients.
Constructed explicit counterexamples using functions related to fractal sets.
Established the exact optimal exponent $q=rac{\lambda p}{\lambda-p}$ for the embedding.
Abstract
We study the following natural question that, apparently, has not been well addressed in the literature: Given functions with support in the unit ball and with gradient in the Morrey space , where , what is the largest range of exponents for which necessarily ? While David R. Adams proved in 1975 that this embedding holds for , an article from 2011 claimed the embedding in the larger range . Here we disprove this last statement by constructing a function that provides a counterexample for . The function is basically a negative power of the distance to a set of Hausdorff dimension . When , this set is a fractal. We also make a detailed study of the radially symmetric case, a situation in which the…
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.
The optimal exponent in the embedding into the Lebesgue spaces for functions with gradient in the Morrey space
Xavier Cabré
X.C.1,2,3 — 1ICREA, Pg. Lluis Companys 23, 08010 Barcelona, Spain & 2Universitat Politècnica de Catalunya, Departament de Matemàtiques, Diagonal 647, 08028 Barcelona, Spain & 3BGSMath, Campus de Bellaterra, Edifici C, 08193 Bellaterra, Spain.
and
Fernando Charro
F.C. — Department of Mathematics, Wayne State University, 656 W. Kirby, Detroit, MI 48202, USA.
Abstract.
We study the following natural question that, apparently, has not been well addressed in the literature: Given functions with support in the unit ball and with gradient in the Morrey space , where , what is the largest range of exponents for which necessarily ? While David R. Adams proved in 1975 that this embedding holds for , an article from 2011 claimed the embedding in the larger range . Here we disprove this last statement by constructing a function that provides a counterexample for . The function is basically a negative power of the distance to a set of Hausdorff dimension . When , this set is a fractal. We also make a detailed study of the radially symmetric case, a situation in which the exponent can go up to .
Key words and phrases:
Morrey spaces, Optimal embeddings, Cantor sets.
2010 Mathematics Subject Classification: 42B37, 46E35
The authors were supported by MINECO grant MTM2014-52402-C3-1-P. X. Cabré is also supported by MINECO grants MTM2017-84214-C2-1-P and MDM-2014-0445, and is member of the Catalan research group 2017 SGR 1392. F. Charro was also partially supported by a Juan de la Cierva fellowship.
1. Introduction
This article originated from the following natural question: Given functions with support in the unit ball and with gradient in the Morrey space , where , what is the optimal range of exponents such that necessarily ? Apparently, this question has not been well addressed in the literature. In fact, the authors of [3, Theorem 2.5] claimed a range of exponents which, as we will prove in the current paper, turns out to be larger than the true one.
Our motivation came from the recent work [7] of the first author in collaboration with A. Figalli, X. Ros-Oton, and J. Serra, on the regularity of stable solutions to semilinear elliptic equations. Actually, the results of [7] are deduced from a Morrey type bound for the gradient of a stable solution, among other tools (see Remark 1.2 below for more details).
The following is the precise statement of the question that we are concerned with. Given real numbers and such that
[TABLE]
we wish to know for which exponents the inequality
[TABLE]
holds true for functions with support in and for a constant independent of , where
[TABLE]
is the Morrey norm of in a domain . Notice that when equals the dimension and , (1.1) corresponds to the Sobolev inequality in .
In 1975, D. R. Adams [1, Theorem 3.1] proved the following result. Let us denote in the sequel
[TABLE]
Observe that, clearly, .
Theorem 1.1** (D. R. Adams [1]).**
Let satisfy and let be a Lipschitz function with in . Then, for every , inequality (1.1) holds for a constant depending only on and .
For the reader’s convenience, in Section 4 we will include his proof in this case . The case , which involves weak spaces, is also treated in [1].
In fact, Adams [1, Proposition 3.1 and Theorems 3.1 and 3.2] proved the following stronger embedding:
[TABLE]
While inequality (1.2) is dimensionless by scaling, note that the dimensionless exponent for inequality (1.1) is . This suggests that (1.1) could hold with , or at least for . In fact, it is easy to prove that among radially symmetric functions, (1.1) holds for every (see [5, Proposition 1.2(i)] and also Theorem 1.5 below).
In 2011, the authors of [3, Theorem 2.5] claimed that (1.1) held for every and for general functions, not necessarily radial. Some years later, we realized that the proof of [3, Theorem 2.5] was not correct. After that, the claim was withdrawn by the same authors in the Errata papers [4] and [5]. At the same time, we could not find other works addressing the exact question of what is the optimal exponent.
In the present paper we show that actually is the largest possible exponent in (1.1). To show this, for every we construct a non-radial function, described in detail below, for which while . An important feature of the function is that it depends only (up to a cutoff function) on variables , where is the smallest integer such that . The function is basically a negative power of the distance to a set of Hausdorff dimension . When is not an integer this set is a fractal and, therefore, the structure of the function is not so “simple”. In fact, it will be rather delicate to control the Morrey norm of its gradient. We could not find a simpler counterexample for , although we had several candidates that finally did not work. The possibility of finding simpler examples remains as an open question.
In addition, we also consider a related norm, which we call the “triple norm”, given by
[TABLE]
where is a domain. The article [7] on stable solutions to semilinear equations gives rise naturally to such a norm (see Remark 1.2 below).111The triple norm has been previously considered in the setting of the hole-filling technique for integral estimates; see [6, Section 1.2.3] among others. It also appears in [11], where it is called the Cordes-Nirenberg norm.
Note that, clearly, we have
[TABLE]
for every function . The function that we construct will also satisfy , and thus is the largest possible exponent also for the embedding
[TABLE]
Instead, among radial functions we show that inequality (1.5) holds for every , in contrast to inequality (1.1) for radial functions, which holds only for .
Remark 1.2*.*
The regularity results from the recent paper [7] on stable solutions to semilinear equations in a domain are based on bounds for a Morrey norm with , of or, given a point , of the radial derivative . For this, see [7, Lemma 2.1, step 2 in the proof of Theorem 1.2, and proof of Theorem 7.1], which also lead to the triple norm (1.3). The boundedness results from [7] up to dimension correspond to and , while in the results for one has as in our paper. The results of the current article are used in [7] to determine optimally a range of exponents for which stable solutions necessarily belong to in dimensions .
Summarizing, our main contribution is the following result. It provides a counterexample to the validity of (1.1) and (1.5) for , given by a function which is basically a negative power of the distance to a set of Hausdorff dimension . When , this set is a fractal.
Theorem 1.3**.**
Let satisfy . Then, for every there exists a function with in ,
[TABLE]
In particular, we also have
[TABLE]
If is an integer, such function can be taken to be
[TABLE]
where , the parameter satisfies
[TABLE]
and is a cutoff function with in and in
If for some integer , the function can be taken to be
[TABLE]
where , satisfies (1.8), is a cutoff function as above, and is a set of Hausdorff dimension in given by
[TABLE]
where is the generalized Cantor set with parameter defined in the following remark.
We emphasize that the counterexample to the embedding is therefore given by a function that, up to a cutoff, only depends on variables, where is the smallest integer such that .
Remark 1.4*.*
The generalized Cantor set (see [9]) is obtained from the interval by removing at iteration the central interval of length from each remaining segment of length ; see Figure 2 in Section 6. The usual Cantor set corresponds to . The reason for our choice of is that the Hausdorff dimension of is
[TABLE]
(see [9, Theorem 9.3]). In particular, letting range from to yields any fractal dimension between 0 and 1, and (1.9) somehow interpolates between the integer cases and .
Let us describe briefly how we found that is the optimal exponent. In the case when is an integer, the hint came from the number , which can be thought of as the Sobolev exponent in dimension . It was natural then to choose the function (1.7), since it gives a counterexample for the Sobolev inequality in when and the exponent is chosen appropriately.
When , (1.7) is basically a negative power of the distance to a subspace of dimension . Therefore, when , a negative power of the distance to a set of Hausdorff dimension became a natural candidate to counterexample. This is what the function in (1.9) basically is, a power of the distance to .
It may be of interest to recall here the solutions found by R. Schoen and S.-T. Yau in [12, Section 5] for nonlinear equations with critical exponent. They construct weak solutions which are singular on a Cantor set with fractional Hausdorff dimension; see [12, Page 70]. Obviously, nonlinear equations with critical exponent are closely related to the Sobolev embedding. Another result on solutions with a singular set of Cantor type is due to Fonseca, Malý, and Mingione [10], a paper that concerns the minimizers of a certain scalar, convex, and regular Lagrangian.
The paper [2] by Adams and Lewis was brought to our attention after the completion of the current article. In [2], the authors proved that functions which satisfy an integrability condition of Morrey-Besov type belong also to a certain Lorentz space. In addition, they construct examples of functions to show that their embeddings are the best possible. The Morrey-Besov norm is a fractional Morrey-type condition involving the -th difference quotients of a function, where . Thus, this concerns more exotic norms than the basic and standard ones that we treat. The authors of [2] mention the possibility that the ideas in their proof of [2, Theorem 3] could be extended from the case that they treat to the case (and in their paper). This is something that we have not explored. There could be the usual delicate issues taking limits of fractional integral norms as , or even simply the impossibility of taking this limit or adapting the proof for . However, if this could be done, it would show that actually is the largest possible exponent in (1.1). On the other hand, it is not clear at all if their example would allow to recover our result on the optimal exponent for the embedding (1.5) concerning the “triple” norm.
Among radial functions, the optimal ranges of exponents in inequalities (1.1) and (1.5) are strictly larger than those of Theorems 1.1 and 1.3. This is the content of the following result, where we show that the exponent can go up to . Interestingly, here the answer is different for the Morrey and the “triple” norms: we prove that (1.1) is false for while (1.5) holds for this exponent. Here we can include the exponent .
Theorem 1.5**.**
Let satisfy , and let .
- (a)
For every and all radially symmetric functions vanishing on , we have
[TABLE]
where is a constant depending only on , and . In addition, this embedding is false for . 2. (b)
For all radially symmetric functions with compact support in , we have
[TABLE]
where is a constant depending only on and . In addition, is the optimal exponent in this inequality.
The paper is organized as follows. In Section 2, we prove a monotonicity result, Lemma 2.1, that we will use several times throughout the paper to optimize the location of the “singularities” in the Morrey and “triple” norms, both in the radial and non-radial cases. In Section 3 we prove the embeddings for radial functions, Theorem 1.5. In Section 4 we provide for the reader’s convenience D. R. Adams’ [1] proof of Theorem 1.1 in the general case of non-radial functions. In Sections 5 and 6 we prove Theorem 1.3 on the optimality of the embeddings. We consider separately the case when is an integer in Section 5 (for its simplicity) and the case when is a non-integer in Section 6 (which is much more involved).
Notation. In the sequel denotes the open ball in of radius centered at . For simplicity, whenever or are omitted, we will consider and respectively. By , we denote constants that may change from line to line. For points in , we will write for a positive integer specified from the context. Given a function , is its positive part. As mentioned before, we will denote and . For convenience, we will use the following standard notation for intervals: . Finally, as usual.
2. On the location of the singularity in the “triple” norm
In this section we prove a monotonicity result that we will use several times in the sequel to study which locations of the “singularity” make larger the integral in the “triple norm”
[TABLE]
Lemma 2.1**.**
Consider a domain , convex in the direction, and symmetric with respect to . Let be given by
[TABLE]
with and a non-negative function in . Then:
- (a)
* is non-increasing with respect to in , and non-decreasing with respect to in .* 2. (b1)
Suppose that the non-negative function satisfies that, for some and every ,
[TABLE]
where is the reflection of with respect to the hyperplane . Then, is non-increasing with respect to in . 3. (b2)
On the other hand, if the non-negative function is such that, for some and every ,
[TABLE]
with as before, then is non-decreasing with respect to in .
Proof.
Observe first that for every , the quantity is increasing with respect to in , and decreasing with respect to in . Since and , we deduce that is non-increasing with respect to in , and non-decreasing with respect to in . This proves part (a).
Assume now that and compute
[TABLE]
For every , let be its reflection with respect to the hyperplane ; see Figure 1. Then, , while by hypothesis. Therefore, for every , we have
[TABLE]
and hence, using that ,
[TABLE]
Therefore, for all and the conclusion in part (b1) follows. The statement for in part (b2) follows from (b1) by reflection. ∎
3. The radial case: Proof of Theorem 1.5
In this section we establish Theorem 1.5 on the embeddings for radial functions. In the proof we apply Lemma 2.1 (the monotonicity result proved in Section 2), which will also be used for the non-radial case in Section 6. We point out that the Sobolev inequalities with monomial weights established in [8] by Ros-Oton and the first author will be of great use.
Proof of Theorem 1.5.
We structure the proof in four parts. In Part 1 we establish estimate (1.10), while in Part 2 we show that is the optimal range of exponents for this estimate. In Part 3a we prove (1.11); here we will use the results of [8]. Part 3b provides an alternative proof of (1.11). Finally, we show in Part 4 that is the largest exponent for which (1.11) holds.
Part 1. We proceed now to show estimate (1.10) for . All the constants will depend only on , and . On the one hand we have
[TABLE]
Now, Hölder’s inequality yields
[TABLE]
Therefore, we obtain
[TABLE]
and the series is convergent since .
Part 2. In order to show that is the optimal range of exponents in estimate (1.10), let and consider the function , extended by zero outside , with . Notice that vanishes on and that , since .
To show that is finite, let and . Observe that we can write instead of in the definition of the Morrey norm. Then,
[TABLE]
by the change of variables . Notice that, upon a rotation, we can assume with . Denote
[TABLE]
We can now apply Lemma 2.1 (with and ) and conclude that is non-increasing in . Therefore, for all .
As a consequence, we have that
[TABLE]
independently of , by our choice of .
Part 3a. We give here a first proof of estimate (1.11). Recall that has compact support. Since is radial, it suffices to show that
[TABLE]
In fact, we are going to prove (3.1) with the best constant. For this, we perform the change of variables with and in the integrals on both sides of (3.1). We get
[TABLE]
and
[TABLE]
Observe that after the change of variables, both integrals are weighted by the same power . In this way, (3.1) becomes a Bliss type inequality that was proved by Talenti [13]. From [13, Lemma 2] (or also from [8, Theorem 1.3] applied in dimension with ) we obtain that
[TABLE]
with an explicit value of its best constant . Inequality (3.1), and thus (1.11), is now established.
Moreover, it is also shown in [13, Lemma 2] (see also [8]) that when the constant is attained in , the closure of under the norm , by the functions
[TABLE]
where are arbitrary constants. On the other hand, when , the constant is not attained by any function in . Note however, that knowing the best constant for (3.1) does not ensure that we know the best constant for (1.11). Indeed, for
[TABLE]
we have seen that
[TABLE]
with the best constant , but on the other hand we do not know if the supremum in the “triple norm” is attained at . That is, we do not know if
[TABLE]
The point here is that is zero at the origin, instead of blowing up as in the other cases that we consider in the paper. Therefore,
[TABLE]
could perhaps be increasing in in an interval near the origin, and then decrease to 0 as . In this setting, the reflection argument in the proof of Lemma 2.1 does not work and we cannot conclude (3.2) as before.
Part 3b. We will provide here an alternative proof of estimate (1.11). First, we establish the case by proving
[TABLE]
for every . One can then deduce the general case applying (3.3) with instead of to the function with . Note that .
To show (3.3), notice that we can assume . Furthermore, we can also assume that is radially decreasing. This follows from [8, Proposition 4.2] (see also [14]) applied to inequality (3.3) after changing variables as in Part 3 in order to guarantee that both sides of the inequality are weighted by the same power. Now, on the one hand, the change of variables yields
[TABLE]
for \varphi(t)=\big{|}\{r:\ u(r)>t\}\big{|}^{n}. On the other hand, by Cavalieri’s principle
[TABLE]
We conclude by proving that
[TABLE]
for every non-increasing function and every . Consequently, (3.3) will follow from (3.4), (3.5), and (3.6). To prove inequality (3.6), denote
[TABLE]
and notice that , while
[TABLE]
This establishes (3.6) and hence concludes the proof of (1.11).
Part 4. Finally, we show that is the largest exponent for which (1.11) holds. Let and consider the function with . Notice that
[TABLE]
by our choice of .
On the other hand, we are going to see that , thus contradicting the inequality. To prove this, we claim that realizes the supremum in the definition of , and hence
[TABLE]
since .
We conclude proving the claim by monotonicity. For , we have that
[TABLE]
Notice that, upon a rotation, we can assume . Denote
[TABLE]
Since the function is under the hypotheses of Lemma 2.1 (with ), we conclude that is non-increasing in , and therefore that for all . ∎
4. Embeddings in the general case: Proof of Theorem 1.1
For the reader’s convenience, we provide in this section D. R. Adams’ proof of Theorem 1.1, see [1, Theorem 3.1]. Recall that we consider a Lipschitz function with in , so that integrals in and integrals in coincide.
Proof of Theorem 1.1.
The proof is based on the following two claims,
[TABLE]
and
[TABLE]
where
[TABLE]
is the Riesz potential of , and
[TABLE]
is the maximal function with parameter .
Once (4.1) and (4.2) are established, we can finish the proof as follows. By Hölder’s inequality, we have
[TABLE]
(recall that in ). Then, (4.1) and (4.2) give
[TABLE]
almost everywhere. It follows that
[TABLE]
where we have applied Hölder’s inequality with exponents and .
By the well-known estimate for the maximal function when , there exists a constant depending only on and such that
[TABLE]
and therefore
[TABLE]
with depending only on and as desired.
Therefore, it remains to prove claims (4.1) and (4.2).
Consider first estimate (4.1). To prove it, notice that for with
[TABLE]
Then, integrating on we get
[TABLE]
and (4.1) is proved.
Next, consider estimate (4.2). We reproduce the argument in [1] to show that for a given function with compact support in , we have
[TABLE]
where depends only on and .
For , let to be determined later and set
[TABLE]
Let
[TABLE]
Then,
[TABLE]
Similarly,
[TABLE]
since . The choice
[TABLE]
finally gives (4.3). ∎
5. Proof of Theorem 1.3 in the case when is an integer
In this section we prove Theorem 1.3 when is an integer. The argument is very simple. The case is the core of our paper and will be considered in Section 6.
As mentioned in the introduction, the choice of the counterexample when was hinted by the number , which can be thought of as the Sobolev exponent in dimension . Then, it is natural to choose a function that provides a counterexample for the Sobolev inequality in dimension and then look at this function embedded in the -dimensional space. Namely, we take
[TABLE]
where and is a cutoff function with in and in Note that clearly has support in .
The rest of the section is devoted to show the following result, which proves Theorem 1.3 when is an integer.
Proposition 5.1**.**
Let be an integer such that and assume that . Then, for given by (5.1), we have that and if
[TABLE]
This proves the optimality of the range for (1.5) when , and in turn also for (1.1).
Proof.
For every we have that
[TABLE]
for some constant independent of . The change of variables yields
[TABLE]
Therefore, we have
[TABLE]
We claim that the last integral is bounded uniformly in . To verify this, since for and , it suffices to control the integral over . But then, calling , the integral becomes with for . Now, since is non-negative and radially decreasing in , we can apply Lemma 2.1 with and conclude that the largest value of the integral corresponds to . But since we have assumed , the integral with is finite.
On the other hand,
[TABLE]
and the last integral is divergent since by hypothesis. ∎
6. Proof of Theorem 1.3 in the general case
In this section we conclude the proof of Theorem 1.3 by considering the case when is not an integer.
Let us motivate first the case . As we have seen in Section 5, when is equal to expression (5.1) provides a counterexample to the embedding (1.5) when , and therefore also to (1.1) in view of (1.4). On the other hand, when is equal to the Morrey and triple norms coincide with the Sobolev norm and provides a counterexample to embedding (1.5) for (in this case (1.5) is simply the Sobolev embedding). In both cases the function that yields the counterexample is basically a negative power of the distance function, either to the origin in the case , or to a line when . Therefore, when is strictly between and , a negative power of the distance to a fractal set of non-integer dimension is a natural candidate to be a counterexample to inequality (1.5).
Let us describe precisely the functions that provide the counterexample. When , we consider
[TABLE]
for , where is a generalized Cantor set with parameter
[TABLE]
The generalized Cantor set (see [9]) is obtained from the interval by removing at iteration the central interval of length from each remaining segment of length l_{j-1}=\big{(}(1-\gamma)/2\big{)}^{j-1}; see Figure 2. A precise expression for is given later in (6.8), (6.9), and (6.10). The usual Cantor set corresponds to .
The reason for our choice of in (6.2) is that the Hausdorff dimension of is
[TABLE]
(see [9, Theorem 9.3]). Thus, letting vary between and yields any fractal dimension between 0 and 1. In particular, (6.1) somehow interpolates the integer cases and .
Note that has support in . Indeed, if then , and thus if ; in particular and .
In the case when for some integer we embed into the counterexample in by means of an appropriate cutoff function (as we did in the previous section when ). In this way, we reduce the proof to the case . More precisely, we consider
[TABLE]
where , is given by (6.1) with replaced by , i.e.,
[TABLE]
and is a cutoff function with in and in Note that if then necessarily and ; thus .
The rest of the section is devoted to proving the following result, which together with Proposition 5.1 completes the proof of Theorem 1.3.
Theorem 6.1**.**
Let be such that , for some integer , and . Consider
[TABLE]
with , a cutoff function as described after (6.4), and a set of Hausdorff dimension given by
[TABLE]
where is a generalized Cantor set with parameter . Then,
[TABLE]
if
[TABLE]
This proves the optimality of the range for inequality (1.5), and in turn also for (1.1).
The proof of Theorem 6.1 is divided into two parts. In the first part we reduce the computations from dimension to dimension with a similar argument to the one in the proof of Proposition 5.1. More precisely we will show, for given by (6.4), that
[TABLE]
and
[TABLE]
for some constant , and hence that it is enough to study the case taking . In the second part of the proof we will show that (6.5) leads to
[TABLE]
as desired; this part is the content of the following two propositions.
Proposition 6.2**.**
Let be such that and . Consider given by (6.1) with such that . Then, .
Proposition 6.3**.**
Let be such that , and consider given by (6.1) with satisfying
[TABLE]
Then,
[TABLE]
Let us now prove Theorem 6.1 assuming Propositions 6.2 and 6.3, which will be established afterwards.
Proof of Theorem 6.1..
Since Propositions 6.2 and 6.3 yield the result when , let us assume . Let . By (6.3) and (6.4) we have
[TABLE]
for almost every , where we have used that the modulus of the gradient of a distance function is equal to a.e. Therefore,
[TABLE]
The change of variables yields
[TABLE]
independently of . Therefore,
[TABLE]
and Proposition 6.3 applied in , i.e., with replaced by , yields .
On the other hand,
[TABLE]
which is infinite by Proposition 6.2 applied with , since (as we pointed out) given by (6.4) has support in . ∎
We devote the rest of the section to the proofs of Propositions 6.2 and 6.3. In the sequel we assume
[TABLE]
Recall that
[TABLE]
for , where is the generalized Cantor set with parameter defined in the beginning of this section. We have
[TABLE]
where the union is disjoint and are the gap-intervals introduced in generation , namely222We will not need the following precise expression for the gaps, but only to understand their size and self-similar structure.
[TABLE]
where
[TABLE]
Here for all , and the index runs through all possible choices of the coefficients ; see Figure 2 above.
As a consequence of (6.8), we have that is a compact set of Lebesgue measure [math]. In addition, the set is self-similar, that is, where and . Finally, the Hausdorff dimension of is , see [9, Theorem 9.3]. Notice that we have chosen such that the Hausdorff dimension of is .
6.1. Proof of Proposition 6.2: Computation of the norm
In this subsection we provide the proof of Proposition 6.2.
Proof of Proposition 6.2.
Recall that We will denote . Since has zero Lebesgue measure, (6.8) leads to
[TABLE]
where are given by (6.9) and (6.10).
An affine change of variables , and the self-similarity of yield
[TABLE]
for each . Therefore, adding these integrals of generation , and then summing in , we have
[TABLE]
Since the integral on the right-hand side is positive, it is enough to show that the series diverges. This happens whenever
[TABLE]
which by our choice of is equivalent to
[TABLE]
This inequality holds by hypothesis. ∎
6.2. Proof of Proposition 6.3: Bound for the “triple norm”
The proof of Proposition 6.3 has two parts. The first one (Lemma 6.6 below) shows that in order to bound the triple norm of , it suffices to only consider points , instead of the full . More precisely, we prove that
[TABLE]
Since has zero Lebesgue measure, by (6.8) we can write the outer integral on the right-hand side of (6.11) as an infinite sum of integrals over the disjoint gap-intervals of decreasing size.
The second part of the proof of Proposition 6.3, and crucial point in the argument, is how to estimate these integrals in terms of the size of the gaps in such a way that the series converges. Here, there are two cases to be considered according to the position of the singularity relative to a given gap: the case when lies on the closure of a gap (and hence the function is singular), and the case when the gap is uniformly away from (and hence can be bounded above and factored out from the integral). We deal with these two cases in Lemmas 6.4 and 6.5 respectively.
Lemma 6.4**.**
Let for some and of the form (6.10) (i.e. is a gap-interval introduced in generation ). Assume and . Then, we have that
[TABLE]
for a constant depending only on and .
Proof.
Denote so that . To relate and we consider the midpoints between and , and between and . In this way, we have the bound
[TABLE]
Let us estimate first. For this, notice that whenever , we have
[TABLE]
Therefore,
[TABLE]
and a change to cylindrical coordinates and the change of variables yield
[TABLE]
Similarly,
[TABLE]
On the other hand, since , we have
[TABLE]
after applying a change to cylindrical coordinates and the change of variables .
Then, (6.13) and (6.15)–(6.17), and the change of variables , give
[TABLE]
for
[TABLE]
Here we can apply Lemma 2.1 in dimension 2, with , , , and . Therefore, is non-increasing with respect to in , and non-decreasing with respect to in . In particular, , with an equality for . We conclude
[TABLE]
independently of .
We estimate now the integral on the right-hand side of (6.18) by applying the change of variables ,
[TABLE]
Notice that , and therefore we can use to show that
[TABLE]
Assume first that and recall that by hypothesis. Then,
[TABLE]
On the other hand, if , then
[TABLE]
In both cases,
[TABLE]
and the lemma is proved. ∎
The following lemma will allow us to control the triple norm when belongs to a gap different from . Notice that the exponents on the right-hand side of the estimate are different in Lemmas 6.4 and 6.5.
Lemma 6.5**.**
Let for some and of the form (6.10) (i.e. is a gap-interval introduced in generation ). Assume . Then, we have that
[TABLE]
for a constant depending only on and .
Proof.
Let so that . Using cylindrical coordinates and (6.14), we have
[TABLE]
Notice that this integral is of the same type as the one in the right-hand side of (6.18), taking there. It is now easy to check that one can proceed as in the final part of Lemma 6.4 (taking there) and complete the proof. ∎
As mentioned before, the following lemma will also be used in the first part of the proof of Proposition 6.3 in order to show that to bound the supremum in the definition of , it suffices to take .
Lemma 6.6**.**
Let be given by (6.7). Then,
[TABLE]
for some constant depending only on , , and .
We postpone the proof of Lemma 6.6 until the end of the section and proceed instead with the proof of Proposition 6.3. The idea is to “cluster” the gaps according to their distance from , and then use Lemmas 6.4 and 6.5.
Proof of Proposition 6.3..
As a result of Lemma 6.6 we can assume that and . To simplify the argument below, by Fatou’s lemma we may assume that is not the midpoint of any gap given by (6.9) and (6.10).
Each generation introduces gaps , and we can write
[TABLE]
Recall that the length of the gap is .
We classify the gaps of generation according to their distance from as follows (see Figures 2 and 3):
- (1)
We split into two halves, and notice that there are exactly gaps of generation in each half. We denote the gaps on the half-interval which does not contain by , with . Since half of lies between any of these gaps and , and the length of is , we have that
[TABLE] 2. (2)
The gaps remaining from step 1 are contained in an interval of length . To this interval we apply the procedure in step 1, splitting into two halves. Notice that there are exactly gaps of generation in each half. We denote the gaps on the half-interval that is farthest from by (recall that is not the center of the full interval ), with . These gaps satisfy
[TABLE] 3. (3)
Iterating this procedure, at each step we find exactly gaps of generation , denoted by with . They satisfy
[TABLE] 4. (4)
We continue the iteration until , which starts with only two gaps of generation left. The farthest from , denoted by , satisfies (6.21) with . On the other hand, we denote the gap closest to by .
Summarizing, among the gaps of generation we have selected one, called , in step 4. The gap is the closest to among those in generation . The remaining gaps have been clustered into families , where the -th family contains gaps of generation which, in addition, satisfy (6.21).
With this classification, we have
[TABLE]
There are two cases to study in the sequel since integrals over and are qualitatively different. The key difference is that (6.21) allows us to control from below and the integrals over become independent of . Thus, we can apply Lemma 6.5 to them. This is not possible for integrals over the gaps .
For the integrals over a gap , if then we can apply Lemma 6.4 directly. Instead, if , we move to the closest boundary point of from , and with this procedure the integral becomes larger (since all the distances from points in decrease). With this new point the integral can be bounded using Lemma 6.4.
In fact, when we assume Lemma 6.4 yields
[TABLE]
uniformly in , since and by hypothesis (6.6).
On the other hand, given a gap , by (6.21) we have
[TABLE]
Then, Lemma 6.5 leads to
[TABLE]
uniformly in . Observe that by our choice of , we have and thus
[TABLE]
uniformly in , since , , and by hypothesis.
Then, (6.20), (6.22), (6.23), and (6.24) give
[TABLE]
uniformly in , and the proof is complete. ∎
We conclude the article with the proof of Lemma 6.6.
Proof of Lemma 6.6..
Note first that the support of , given by (6.7), is included in . Hence, for any given we have
[TABLE]
where we have used that the modulus of the gradient of a distance function is equal to a.e. Then, our goal is to show that
[TABLE]
from which (6.19) follows.
First we will prove that the supremum over is bounded by the supremum over the axis, i.e., . Then, that it actually suffices that instead of , and finally that it is enough to integrate over instead of the whole . In doing these we will use twice the monotonicity result in Lemma 2.1.
Therefore, consider , and let us show that
[TABLE]
where , and thus . In fact, upon a rotation in the variables, we can assume that with . Hence, we are under the hypotheses of Lemma 2.1 with , (which is non-increasing with respect to in ), , and . Therefore, Lemma 2.1 gives that is non-increasing with respect to in . Hence we conclude that , as desired.
A similar argument shows that we just need to consider the case instead of . In fact, define
[TABLE]
and assume . By symmetry, we can assume . In order to apply Lemma 2.1, we take as the direction which is “privileged” in the lemma, while the rest of the hypotheses are fulfilled for , (which is non-increasing with respect to in ), , and , since the set is contained in (see Figure 4). Then, Lemma 2.1 gives that is non-increasing with respect to in , and therefore it is enough to study the case . The case follows similarly by taking in the lemma.
Finally, let with . Notice that for every and its reflected with respect to , we have and , which give
[TABLE]
This leads to
[TABLE]
and similarly for the integral over . Therefore,
[TABLE]
which completes the proof of the lemma. ∎
Acknowledgements: The first author would like to thank Joan Orobitg and Joan Verdera for a stimulating discussion on the topic of this paper. The authors also thank Giuseppe Mingione for interesting comments and for bringing [2, 6, 10] to their attention after the completion of this manuscript, as well as the referee for some appropriate remarks and references [11, 13].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Adams, D. R.; A note on Riesz potentials , Duke Math. J. 42 (1975), 765–778.
- 2[2] Adams, D. R., Lewis, J. L.; On Morrey-Besov inequalities , Studia Math. 74 (1982), 169–182.
- 3[3] Adams, D. R., Xiao, J.; Morrey potentials and harmonic maps , Comm. Math. Phy. 308 (2011), 439–456.
- 4[4] Adams, D. R., Xiao, J.; Erratum to: Morrey potentials and harmonic maps , Comm. Math. Phys. 339 (2015), 769–771.
- 5[5] Adams, D. R., Xiao, J.; Restrictions of Riesz-Morrey potentials , Ark. Mat. 54 (2016), 201–231.
- 6[6] Bensoussan, A., Frehse, J.; Regularity results for nonlinear elliptic systems and applications , Applied Mathematical Sciences, vol. 151, Berlin: Springer, 2002.
- 7[7] Cabré, X., Figalli, A., Ros-Oton, X., Serra J.; Stable solutions to semilinear elliptic equations are smooth up to dimension 9 , preprint ar Xiv:1907.09403.
- 8[8] Cabré, X., Ros-Oton, X.; Sobolev and isoperimetric inequalities with monomial weights , J. Differential Equations 255 (2013), 4312–4336.
