Endpoint L1 estimates for Hodge systems
Introduction
Let d ≥ 2 . In this paper we give a simple proof of the endpoint Besov-Lorentz estimate ‖ I α F ‖ B ˙ d / (d - α) , 1 0 , 1 (R d ; R k) ≤ C ‖ F ‖ L 1 (R d ; R k) for all F ∈ L 1 (R d ; R k) which satisfy a first order cocancelling differential constraint, where α ∈ (0 , d) and I α is a Riesz potential. We show how this implies endpoint Besov–Lorentz estimates for Hodge systems with L 1 data via fractional integration for exterior derivatives.
In the theory for linear elliptic systems it is quite difficult to obtain better than weak-type bounds. A program in this direction was pioneered in the seminal work of J. Bourgain and H. Brezis [[5]] (see also [[6], [29]]) and received remarkable contributions from Lanzani and Stein [[14]] and Van Schaftingen [[30]–[32]], while endpoint fine parameter improvements on the Lorentz [[10], [25]] and Besov-Lorentz [[28]] scales have only recently been obtained.
The purpose of this paper is to give a simple proof of the Besov-Lorentz estimates obtained in [[28]] for a restricted class of operators and to show how this estimate can be used to resolve several open questions in the theory, in particular estimates for Hodge systems [[31], Open Problems 1 & 2] and the endpoint extension of [[32], Propositions 8.8 & 8.10] in the case of first order operators. Our starting place is an estimate the first and third named authors proved in [[10]], that for and there exists a constant for which one has the inequality
1.1
Graph
for all such that . Here is a Lorentz space (see Sect. 2 for a precise definition) and denotes the Riesz potential of order , defined for by
1.2
Graph
where is the heat kernel in and
Graph
is a normalization constant (see, e.g. [[26], p. 117]).
The estimate (1.1) is a partial replacement for the failure of the Hardy–Littlewood–Sobolev embedding in the endpoint, cf. [[26], p. 119], while a comprehensive resolution of the question of a replacement has been given by D. Stolyarov, who in [[28]] (see also [[3], Conjecture 2] where such an inequality was conjectured to hold) establishes the sharper inequality
1.3
Graph
for a very general class of subspaces of that includes the kernels of J. Van Schaftingen's class of cocancelling operators [[32]] (see Definition 2.5 below where we recall this class). The argument in [[28]] is quite involved, and it is there commented by Stolyarov that whether the inequality (1.3) admits a simpler proof if one only seeks its validity for the more restrictive class of divergence free measures is unknown. We will shortly give such a proof, which benefited from several insights from his paper and the series of lectures[1] he gave on the topic.
To this end, let us recall the approach to (1.1) in [[10]]: For the space of divergence free measures one finds appropriate atoms, one demonstrates the sufficiency of an estimate on an atom, and one establishes the estimate for a single atom. The atoms in this case are oriented piecewise- loops which satisfy the uniform ball-growth condition: To any oriented piecewise- loop one associates the measure which is given by integration along the curve
1.4
Graph
for , where is the parametrization of by arclength. The atoms are then such piecewise- closed curves for which
1.5
Graph
for some universal constant , where is the total variation measure of . The sufficiency of an estimate on these atoms follows in two steps. First, by Smirnov's integral decomposition of divergence free measures [[21]] one has an approximation of such objects in the strict topology by convex combinations of oriented closed loops. Second, a surgery on such loops shows how any oriented closed loop admits a further decomposition into oriented piecewise- closed loops which satisfy (1.5) with some universal constant and whose total length is bounded by a constant times the length of this loop. This approximation/decomposition and the triangle inequality then yields that it suffices to prove the estimate for a single loop which satisfies the ball growth condition (1.5). Finally, the estimate (1.1) for a single loop was argued in [[10]] by a hands on interpolation that utilizes several pointwise estimates for Riesz potentials and bounds for various maximal functions.
While the argument of (1.1) in [[10]] for a single loop with a ball growth condition involves only estimates for various maximal functions, in this paper we observe that it can be further simplified by the consideration of a very natural stronger quantity that arises in Stolyarov's estimates:
Graph
In particular, in [[28]], Stolyarov shows how if one controls a discrete analogue of (1.6) this implies (1.3). As we will see below in Sect. 2, the continuous version (1.6) also controls the Besov-Lorentz norm and therefore, taking into account the reduction to atoms established in [[10]], for the demonstration of the Besov–Lorentz inequality for divergence free functions it suffices to prove the inequality
1.7
Graph
for all oriented piecewise- closed loops which satisfy (1.5). Let us remark that it is not difficult to see that (1.6) controls the Lorentz norm of the Riesz potential of a function, since this follows directly from the representation (1.2) and Minkowski's inequality for integrals. The argument for the Besov-Lorentz case is only slightly more complicated because of the more technical definition of the space.
We therefore proceed to argue the validity of the inequality (1.7). We claim this follows easily from the estimates
1.8
Graph
1.9
Graph
1.10
Graph
1.11
Graph
The former two are standard (linear) convolution inequalities for functions, while the latter two are nonlinear and only hold because we consider closed loops oriented by their tangent. Indeed, (1.10) follows from the fact such objects admit a generalized minimal surface spanning , while (1.11) utilizes the fact that we work with curves (and we later make use of the fact that they satisfy (1.5)). Note that if we only utilized (1.8) and (1.9) it would not be sufficient for our purposes, since for any interpolation would yield the estimate
Graph
where . In particular, when , using (1.8) and (1.9) we find
Graph
which is not good enough to get a finite upper bound, as if utilized to estimate the quantity (1.6) gives a logarithmic divergence at both zero and infinity and therefore cannot yield the inequality (1.7).
The subtlety is to notice that the combination of (1.8) and (1.11) gives an estimate with slightly better behavior at zero, while the combination of (1.9) and (1.10) gives an estimate with slightly better behavior at infinity, the inequalities
1.12
Graph
1.13
Graph
Indeed,
Graph
and therefore it remains to divide the integral so as to linearize the estimate, which follows from dividing at (alternatively, one may first reduce to the case by dilation, though we here avoided this argument because the nonlinearity of the estimates (1.10) and (1.11) becomes less clear).
We postpone further details until Sect. 2, including the proof of the slightly more technical Besov-Lorentz inequality, so that we can continue to a second purpose of this paper, which is to catalog some implications of the inequality (1.3) in the divergence free case. Indeed, a fundamental contribution of J. Van Schaftingen's paper [[32]] is that divergence free vector fields are generic in the class of vector fields which admit a first order cocanceling annihilator. In particular, following his argument we establish
Theorem 1.1
Let , , and suppose L(D) is a first order homogeneous linear partial differential operator acting on vector fields . Then the estimate
Graph
holds if and only if L(D) is cocanceling, see Definition 2.5.
We recall that the cocanceling assumption is very mild: As was observed in [[9], [18], [32]], failure of this assumption is equivalent to the existence of an unconstrained subspace of L(D)-free fields.
Beyond an intrinsic interest in the mapping properties of fractional integrals, the inequality given in Theorem 1.1 has implications for PDEs. For example, in [[10]] it was demonstrated how (1.1) implies a Lorentz space sharpening of an estimate of Bourgain and Brezis [[4]]: If is divergence free, the solution of the Div-Curl system
Graph
admits the estimate
Graph
for some .
Theorem 1.1 of course implies a similar improvement to this inequality, though in this form is useful for more general applications. For example, we immediately obtain
Corollary 1.2
Let , , and . There exists a constant such that for
1.14
Graph
while for
1.15
Graph
for all .
Here, for , denotes the vector space of k-forms, denotes the space of functions from to the space of k-forms with smooth coefficients,
Graph
are the exterior differential and exterior co-differential, respectively, and, with an overloading of notation, denote the Riesz potential acting on the -forms . Precisely, for any l-form , one can express Y in global coordinates as
Graph
where , cf. [[11], p. 237]. Then the Riesz potential of such a Y is given by the formula
1.16
Graph
where is as defined in (1.2). From this one sees is well-defined for for any , and in particular that all such Y are in the domain of for .
From Corollary 1.2 one not only obtains improvements to the left-hand-side of estimates for the Div-Curl system, but more generally the Hodge systems considered by Bourgain and Brezis in their paper [[5]] (see also Lanzani and Stein [[14]] for a slicing argument in the spirit of Van Schaftingen's simplification [[32]] of the original argument of Bourgain and Brezis). In particular, we give an affirmative answer to [[31], Open Problems 1 & 2], the following
Theorem 1.3
Let and . If and satisfy the compatibility conditions
Graph
then the function satisfies
Graph
and there exists a constant such that
Graph
where we additionally require in the case or in the case .
Note that the conditions are necessitated by properties of the exterior differential and exterior co-differential, and , while the fact that the expression is well-defined follows from the assumptions and the formula (1.16).
Finally, let us record the following duality estimates, which extend [[32], Propositions 8.8 & 8.10] to the endpoint .
Proposition 1.4
Let , , and suppose L(D) is a first order cocanceling operator on . Then the estimates for vector fields
Graph
hold if .
Here we use a slightly unusual notation for the Besov spaces , which is consistent with our earlier notation. In other words, .
The plan of the paper is as follows. In Sect. 2, we first recall the definition of the Lorentz spaces and several results concerning them before we prove Theorem 1.1. In Sect. 3 we prove Corollary 1.2, Theorem 1.3, and Proposition 1.4. In Sect. 4 we address an implicit claim in [[23]] that the estimate in the curl free case was optimal on the Lorentz scale. In particular, we here give a proof of this claim, which in turn, by J. Van Schaftingen's argument implies optimality of the result of the first and third named authors in [[10]] on the Lorentz scale. It is likely these results are optimal on the Besov-Lorentz scale, though we do not have an example which confirms this. Finally, in Sect. 5, we give direct proofs of several of the results for such that . Of course, this is not as general as the divergence free setting, though notably it does not require the surgery construction from [[10]] and therefore provides a streamlined proof for the Lorentz inequality that does not require anything beyond the coarea formula and basic interpolation of Lebesgue or Lorentz spaces.
Lorentz and Besov–Lorentz estimates
We begin by recalling some results concerning the Lorentz spaces , where we follow the development of R. O'Neil in [[15]].
Definition 2.1
For f a measurable function on , we define
Graph
As this is a non-increasing function of y, it admits a left-continuous inverse, called the non-negative rearrangement of f, and which we denote . Further, for we define
Graph
We can now give a definition of the Lorentz spaces .
Definition 2.2
Let and . We define
Graph
and for and
Graph
The Lorentz space is defined as
Graph
For such parameters q, r, these functionals can be shown to be norms and the associated spaces Banach spaces (see, e.g., [[27], Chapter V]). Concerning estimates involving the norm for functions in these spaces, a simpler quantity for our purposes is a quasi-norm which does not involve rearrangements:
2.1
Graph
In particular, one can show this is equivalent to the norm on (see, e.g. [[27], Theorem 3.21 on p. 204]):
Proposition 2.3
Let and . Then
Graph
Finally, we recall that these spaces support an analogue of Young's convolution inequality, see [[15], Theorem 3.1]:
Theorem 2.4
Let and , and suppose and satisfy
Graph
Then
Graph
We next give a few more details of the argument of Theorem 1.1 in the base case . Toward the inequality (1.1), as discussed in the introduction, the reduction argument given in [[10]] implies that it suffices to prove (1.7) for every oriented piecewise closed loop that satisfies (1.5). This inequality, in turn, will follow if we can establish the convolution inequalities (1.8), (1.9), (1.10), and (1.11).
For such curves, (1.8) and (1.9) follow from standard convolution inequalities, while we now explain in more detail the inequalities (1.10) and (1.11). The inequality (1.10) follows from the fact that in Euclidean space oriented piecewise closed loops can be identified with integral currents which admit spanning surfaces. In particular, by [[7], 4.2.10], given , there exists a (generalized) surface S which satisfies (in a generalized sense)
2.2
Graph
2.3
Graph
From this, one easily argues the estimate (1.10) by the computation
Graph
the identity
Graph
and the isoperimetric inequality (2.3).
Concerning the estimate (1.11), it can be argued even simpler than the duality utilized to estimate an analogous quantity in [[10]], as it follows from a simple expansion of the convolution on dyadic annuli, using (1.5): In particular,
Graph
where C is as in (1.5) and
Graph
This and the argument of the introduction completes the proof of the Lorentz inequality in the case .
Concerning the Besov-Lorentz inequality, we follow the work of Stolyarov [[28]] with a definition of the space through a minor modification of that for Besov spaces:
Graph
where
2.4
Graph
are dilates of some function which satisfies
Graph
One familiar with Besov spaces [[1], Definition 4.1.2] observes that Besov-Lorentz spaces are defined analogously, only with the replacement of Lebesgue norms in the definition with Lorentz norms. These spaces arise in the real interpolation of Besov spaces [[16]], and have also been called Lorentz-Besov spaces in the monograph of J. Peetre [[17]] (see Example 6 on p. 57 as well as p. 106, 232). While these references are classical, a systematic treatment of these spaces as well various relationships with Triebel-Lizorkin analogues seems to be a recent development: In [[20], equation (1) on p. 1018], A. Seeger and W. Trebels define an inhomogeneous version denoted by , while it is remarked in the comments at the end of the introduction there that the results in the paper hold for their homogeneous counterpart, which is denoted by . One can check that the only difference between the definition in [[20]] and ours is the choice of Littlewood-Paley decomposition, provided one utilizes the same norm on the Lorentz space .
When presented with the Lorentz embedding proved in [[10]] and the Besov-Lorentz embedding proved here, a natural question is whether one can deduce one from the other. From the results in [[20]] one understands that the latter is indeed stronger: First, one has the embedding
2.5
Graph
Indeed, with in equation (3) on p. 1018 one finds the identification
Graph
so that the claim follows by an application of the inhomogeneous variant of Theorem 1.1 (iv) with the choices
Graph
as one can check that they satisfy
Graph
Second, since and , Theorem 1.2 (iv) asserts the reverse inclusion can only hold if
Graph
which is not valid (and note here the subscripts are opposite those immediately preceding in the invocation of Theorem 1.1 (iv)).
With the definition we have introduced above, we find that we must estimate
Graph
In this form, an observation analogous to that of Stolyarov is that if we define the multiplier
Graph
then, with the use of the notation for scaling introduced in (2.4), one has
Graph
Here we use the fact that is a Schwartz function to write the expression as a convolution. In particular, the fact that and the invariance of the space with respect to the scaling (2.4) implies with
Graph
By Young's inequality on the Lorentz scale we obtain the bound
Graph
so that summation over gives the inequality
2.6
Graph
The right-hand-side of this inequality is (a constant multiple of) the discrete quantity that Stolyarov obtains an upper bound for in his paper to prove the Besov-Lorentz bound for the general class of subspaces. To pass to the continuous version, we use the semi-group property of the heat kernel and another application of Young's inequality on the Lorentz scale: For each and all ,
Graph
In particular, integration from to with respect to the measure ds/s gives the inequality
Graph
which in combination with (2.6) yields
Graph
By further manipulation we obtain
Graph
and thus
2.7
Graph
for
Graph
The inequality (2.7) is exactly the control of the Besov-Lorentz norm by the quantity (1.6) claimed in the introduction. In particular, by the argument of the introduction and that preceding in this Section, we have established the estimate claimed in Theorem 1.1 for such that .
To conclude the proof of Theorem 1.1, we follow the argument of J. Van Schaftingen in [[32]] that the general case follows by an algebraic reduction. To do this, we first recall a few facts on differential operators. We will work with first order homogeneous linear differential operators with constant coefficients, which can be written as
Graph
where . Due to the usefulness of Fourier transform for linear equations, it is natural to look at the symbol map
Graph
We make the simple observation that we can write
Graph
so . The divergence of a matrix field is considered row wise.
We recall the definition of cocancellation:
Definition 2.5
An operator L(D) as above is said to be cocanceling if and only if
Graph
We will show that cocancellation is equivalent with injectivity of the map T defined above. The following lemma should be compared with [[32], Prop. 2.5] and the proof of [[9], lem. 3.11].
Lemma 2.6
We have that
Graph
To prove this, note that a vector lies in the left hand side if and only if
Graph
which yields the conclusion.
In particular, L(D) is cocanceling if and only if T is left invertible. If this is the case, we can write an explicit left inverse in terms of the adjoint of T,
Graph
We can thus proceed with the proof of the main result.
Conclusion of the proof of Theorem 1.1
The necessity of cocancellation follows from by plugging in a Dirac mass in the estimate and noting that .
Conversely, we already proved the desired estimate for . We note that if , we can write and , so that
Graph
and using the inequality for divergence free measures and the fact that are bounded maps on finite dimensional spaces we obtain
Graph
which completes the proof.
Hodge systems and duality estimates
We first note that Corollary 1.2 follows from Theorem 1.1 since the vector fields du and satisfy the first order conditions and , which are cocanceling for the claimed ranges of k. This algebraic fact is elementary to check, see also [[32], Prop. 3.3] where the cocancellation of d on -forms is proved, . The claim for follows by duality.
Proof of Theorem 1.3
We first infer from Corollary 1.2 with that
3.1
Graph
3.2
Graph
where if and if . Next, we note that since the Hodge Laplacian coincides with the real variable Laplacian, we can express
3.3
Graph
where we used and the semigroup property of Riesz potentials. Note that give rise to a zero-homogeneous Fourier multiplier, hence can be represented as Calderón–Zygmund operators, and are therefore bounded on the Besov-Lorentz spaces (Here one should be careful to note that these operators are mappings from one exterior algebra into another.). It follows from (3.1), (3.2), and (3.3) that (and for the convenience of display we remove the notation in the norm which details the images of each map)
Graph
which completes the proof.
Proof of Proposition 1.4
Both inequalities follow from our main result, Theorem 1.1. To prove the first estimate, we observe that the semi-group property of the Riesz potentials and Hölder's inequality on the Lorentz scale implies
Graph
where we denote by the adjoint of the Riesz transforms, , which satisfies the identity . This inequality, Theorem 1.1, and the bound
Graph
then implies the desired result, the last inequality following from the fact that is bounded on the Lorentz spaces.
In a similar manner we argue the second inequality of the Proposition. First, by duality we have
Graph
Next, we observe that the definition of , in analogy with that of the Besov-Lorentz space utilized in Sect. 2, is
Graph
Therefore a slight modification of the argument of Theorem 1.1 in Sect. 2 leads to the estimate
Graph
which completes the proof of our second claim.
Optimality on the Lorentz scale
In a now classical paper on Sobolev embeddings, Alvino [[2]] proved (with sharp constant) that one has
Graph
Such an inequality extends to the case Du is a Radon measure, that is, by approximation.
The first result of this Section is a construction which will show the optimality of Alvino's result. Here we should clarify our meaning of optimality. This is the endpoint of where the Lorentz spaces are normable, so that on the scale of normable spaces it is clear this is optimal. We will now show that the result cannot hold for a smaller choice of second parameter in the quasi-norm introduced in (2.1), which is what we intend by the phrase optimality.
Lemma 4.1
For every , there exists a sequence with
Graph
independent of and
Graph
Proof
Define
4.1
Graph
where and will be chosen later such that
Graph
independent of N and
Graph
To this end, we define ,
Graph
and compute
Graph
Since , is decreasing and therefore
Graph
In particular, with a shift of indices we find
Graph
Therefore it remains to choose such that
Graph
and recall we must do so in a way the ensures
Graph
Choose , so that . Thus we now are left to choose such that
Graph
and
Graph
But then the choice is sufficient, as .
Observe that Lemma 4.1 implies the optimality on the Lorentz scale of Alvino's result [[2]], that the second parameter in the Lorentz estimate cannot be taken less than 1. In fact, taking in the previous proof, we can prove the non inclusion of BV in subcritical Lorentz spaces:
Corollary 4.2
For every , there exists .
Proof
Let be the sequence defined in (4.1). Note that
Graph
This immediately implies
Graph
so .
Note that since , weak-* compactness in BV implies that, on a subsequence, in . It follows that , which completes the proof.
For our purposes here it will be useful to observe another consequence of this construction, the following
Lemma 4.3
For every , there exists a sequence with
Graph
independent of and
Graph
Proof
We begin with an the inequality for u in terms of potentials and its gradient
Graph
We will estimate u by a standard potential estimate for . To this end, we recall an estimate of Hedberg, see e.g. [[1], Proposition 3.1.2 (a)] which asserts
Graph
The choice , , and yields
Graph
By the boundedness of the maximal function (see [[8], Theorem 1.4.19] for the case ) and properties of the Lorentz spaces, this shows that
Graph
By the embedding proved in [[19], [23]], this implies
Graph
But then for any we may choose
Graph
and the construction from Lemma 4.1 with this choice of q yields the desired sequence.
From this we obtain the optimality of Theorem 1.1 in [[23]]. Here we remark that while compactness properties of bounded sequences in BV again allows one to write down the limit
Graph
the fact that is not obvious in this case.
Simplifications in the curl free case
That one has Lorentz and Besov-Lorentz embeddings for such that is contained in Theorem 1.1. We here will give an even more direct proof, which improves upon those given in [[12], [22]] and in this less general setting even simplifies some of the argument from Sect. 2 above. In particular, the goal of this Section is to establish
Theorem 5.1
Let and . There exists a constant such that
Graph
for all such that .
Theorem 5.1 has an interesting history, as it was pointed out to us by D. Stolyarov that one can deduce it from Theorem 4 of V.I. Kolyada's paper [[12], Theorem 4]. The third named author was not aware of this during the writing of [[23]], which gives a different proof of what is unfortunately a slightly weaker result. We can here rectify this in giving a simpler proof of the same result.
Proof of Theorem 5.1
First we claim that it suffices to prove the estimate
Graph
for all , the space of functions of bounded variation. Indeed, in analogy with the argument in [[23]], for general one begins with the representation
Graph
where . With this representation, an application of Minkowski's inequality for integrals and Fubini's theorem yields
Graph
Therefore, if one has established the desired inequality for , the result for general follows from this chain of inequalities and the coarea formula
Graph
Notice that if one only wants to prove the Lorentz inequality (1.1), or the weaker Lebesgue inequality, the essential ingredients at the point are only Minkowski's inequality for integrals and the coarea formula.
Toward establishing the desired inequality for sets of finite perimeter, we recall again the classical convolution inequalities
5.1
Graph
5.2
Graph
Interpolation of these inequalities alone would not suffice, and so we require two additional inequalities which are special to characteristic functions of sets. It is here that the curl free case is much simpler than the divergence free case, as these two inequalities follow immediately from integration by parts and classical convolution estimates:
5.3
Graph
5.4
Graph
In particular, one does not need to perform surgery, consider a ball growth condition, maximal function estimates, or generalized minimal surfaces.
From here, one interpolates (5.1) and (5.4) to obtain
5.5
Graph
where we have used
Graph
In a similar manner, interpolation of (5.3) and (5.2) yields
5.6
Graph
where we have used
Graph
As before, we use the fact that in interpolation of Lebesgue spaces, one can improve the second parameter in the interpolation on the Lorentz scale. One can do even better here than one, though below one the estimate is no longer linear and so the result for the curl free case does not follow from the inequality for characteristics functions of sets. Notice that if one only wants the Lebesgue scale inequality, the interpolation is an exercise in Real Analysis.
Finally, we can make the estimate by splitting the integral in two pieces
Graph
For I, we use the interpolated inequality (5.5) with the choice of to obtain
Graph
while for II we use the interpolated inequality (5.6), with the same choice of p to obtain
Graph
The desired inequality then follows from optimizing in r and the isoperimetric inequality
Graph
This concludes the proof, the Section, and the paper.
Acknowledgements
The authors would like to thank Dima Stolyarov for his comments on an early draft of the manuscript, as well as the referees for their careful reading and comments. F.H. is supported by the Fannie & John Hertz Foundation. D. S. is supported by the Taiwan Ministry of Science and Technology under research Grant number 110-2115-M-003-020-MY3 and the Taiwan Ministry of Education under the Yushan Fellow Program. Part of this work was undertaken while D. S. was visiting the National Center for Theoretical Sciences in Taiwan. He would like to thank the NCTS for its support and warm hospitality during the visit.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
[
References
1
Adams, D.R, Hedberg, L.I: Function spaces and potential theory, series=Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 314. Springer, Berlin (1996). https://doi.org/10.1007/978-3-662-03282-4
2
Alvino, A: Sulla diseguaglianza di Sobolev in spazi di Lorentz. Boll. Un. Mat. Ital. A (5), 14, 148–156 (1977)
3
Ayoush, R, Stolyarov, D, Wojciechowski, M: Sobolev martingales, Rev. Mat. Iberoam. (to appear). https://doi.org/10.4171/rmi/1224
4
Bourgain J, Brezis H. New estimates for the Laplacian, the div-curl, and related Hodge systems. C. R. Math. Acad. Sci. Paris. 2004; 338; 7: 539-543. 2057026. 10.1016/j.crma.2003.12.031. 1101.35013
5
Bourgain J, Brezis H. New estimates for elliptic equations and Hodge type systems. J. Eur. Math. Soc. (JEMS). 2007; 9; 2: 277-315. 2293957. 10.4171/JEMS/80. 1176.35061
6
Bourgain J, Brezis H, Mironescu P. maps with values into the circle: minimal connections, lifting, and the Ginzburg-Landau equation. Publ. Math. Inst. Hautes Études Sci. 2004; 99: 1-115. 10.1007/s10240-004-0019-5. 1051.49030
7
Federer H. Geometric Measure Theory, Die Grundlehren der mathematischen Wissenschaften. 1969: New York; Springer
8
Grafakos L. Classical Fourier analysis, Graduate Texts in Mathematics. 20143: New York; Springer. 10.1007/978-1-4939-1194-3
9
Guerra, A, Raiţă, B: Quasiconvexity, null Lagrangians and Hardy space integrability under constant rank constraints, preprint. arXiv:1909.03923
Hernandez, F, Spector, D: Fractional Integration and Optimal Estimates for Elliptic Systems, preprint. arXiv:2008.05639
Iwaniec T, Martin G. Geometric Function Theory and Non-linear Analysis, Oxford Mathematical Monographs. 2001: New York; The Clarendon Press, Oxford University Press
Kolyada, V.I: On the embedding of Sobolev spaces, Russian, with Russian summary. Mat. Zametki, 54, 1993, 3, 48–71, 158, 0025-567X, Math. Notes, 54, 1993, 3–4, 908–922 (1994), 0001-4346. https://doi.org/10.1007/BF01209556
Krantz SG, Peloso MM, Spector D. Some remarks on embeddings in the subelliptic setting. Nonlinear Anal. 2021; 202. 10.1016/j.na.2020.112149. 1465.46033
Lanzani L, Stein EM. A note on div curl inequalities. Math. Res. Lett. 2005; 12: 57-61. 2122730. 10.4310/MRL.2005.v12.n1.a6. 1113.26015
O'Neil R. Convolution operators and spaces. Duke Math. J. 1963; 30: 129-142. 146673. 10.1215/S0012-7094-63-03015-1. 0178.47701
Peetre, J: Sur les espaces de Besov, language=French. C. R. Acad. Sci. Paris Sér. A-B, 264, A281–A283 (1967)
Peetre J. New Thoughts on Besov Spaces, Duke University Mathematics Series. 1976: Durham; Duke University. 0356.46038
Raiță, B, Spector, D: A note on estimates for elliptic systems with data. C. R. Math. Acad. Sci. Paris, 357, 11–12 (2019). https://doi.org/10.1016/j.crma.2019.11.007,
Schikorra A, Spector D, Van Schaftingen J. An -type estimate for Riesz potentials. Rev. Mat. Iberoam. 2017; 33: 291-303. 3615452. 10.4171/RMI/937. 1375.47039
Seeger A, Trebels W. Embeddings for spaces of Lorentz–Sobolev type. Math. Ann. 2019; 373: 3-4. 3953119. 10.1007/s00208-018-1730-8. 1420.46031
Smirnov, S.K: Decomposition of solenoidal vector charges into elementary solenoids, and the structure of normal one-dimensional flows. Russian, with Russian summary, Algebra i Analiz 5, 206–238 (1993). St. Petersburg Math. J, 5, 1994, 4, 841–867
Spector D. A noninequality for the fractional gradient. Port. Math. 2019; 76; 2: 153-168. 4065096. 10.4171/pm/2031. 1453.46035
Spector D. New directions in harmonic analysis on. Nonlinear Anal. 2020; 192: 111685. 4034690. 10.1016/j.na.2019.111685. 1437.42037
Spector D. An optimal Sobolev embedding for. J. Funct. Anal. 2020; 279: 108559. 4093790. 10.1016/j.jfa.2020.108559. 1455.46039
Spector, D, Van Schaftingen, J: Optimal embeddings into Lorentz spaces for some vector differential operators via Gagliardo's lemma. Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl, 30(3), 413–436 (2019). https://doi.org/10.4171/RLM/854
Stein EM. Singular Integrals and Differentiability Properties of Functions, Princeton Mathematical Series, No. 30. 1970: Princeton; Princeton University Press
Stein EM, Weiss G. Introduction to Fourier Analysis on Euclidean Spaces, Princeton Mathematical Series, No. 32. 1971: Princeton; Princeton University Press
Stolyarov, D: Hardy–Littlewood–Sobolev inequality for. arXiv:2010.05297
Van Schaftingen J. A simple proof of an inequality of Bourgain, Brezis and Mironescu. Comptes Rend. Math. 2004; 338; 1: 23-26. 2038078. 10.1016/j.crma.2003.10.036. 1188.26015
Van Schaftingen J. Estimates for L1-vector fields under higher-order differential conditions. J. Eur. Math. Soc. 2008; 10; 4: 867-882. 2443922. 10.4171/JEMS/133. 1228.46034
Van Schaftingen J. Limiting fractional and Lorentz space estimates of differential forms. Proc. Am. Math. Soc. 2010; 138: 235-240. 2550188. 10.1090/S0002-9939-09-10005-9. 1184.35012
Van Schaftingen J. Limiting Sobolev inequalities for vector fields and canceling linear differential operators. J. Eur. Math. Soc. (JEMS). 2013; 15: 877-921. 3085095. 10.4171/JEMS/380. 1284.46032
]
[
Footnotes
We are indebted to D. Stolyarov for the efforts he put into giving these lectures, which can be found at "https://vimeo.com/497090776".
]
By Felipe Hernandez; Bogdan Raiță and Daniel Spector
Reported by Author; Author; Author