The space $JN_p$: nontriviality and duality
Galia Dafni, Tuomas Hyt\"onen, Riikka Korte, Hong Yue

TL;DR
This paper investigates the properties of the function space $JN_p$, establishing its nontriviality, its relation to $L^p$, and its duality with a new Hardy-type space $HK_{p'}$, revealing its complex structure.
Contribution
The paper constructs a function in $JN_p$ not in $L^p$, shows $JN_p$ and $L^p$ coincide for monotone functions, and characterizes $JN_p$ as the dual of a new Hardy-like space.
Findings
$JN_p$ contains functions not in $L^p$
$JN_p$ and $L^p$ coincide for monotone functions
$JN_p$ is dual to a new Hardy-type space $HK_{p'}$
Abstract
We study a function space based on a condition introduced by John and Nirenberg as a variant of BMO. It is known that , but otherwise the structure of is largely a mystery. Our first main result is the construction of a function that belongs to but not , showing that the two spaces are not the same. Nevertheless, we prove that for monotone functions, the classes and do coincide. Our second main result describes as the dual of a new Hardy kind of space .
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 space : nontriviality and duality
Galia Dafni
(G.D.) Concordia University, Department of Mathematics and Statistics, Montreal, Quebec, H3G-1M8, Canada
,
Tuomas Hytönen
(T.H.) University of Helsinki, Department of Mathematics and Statistics, P.O.B. 68, FI-00014 Helsinki, Finland
,
Riikka Korte
(R.K.) Aalto University, Department of Mathematics and Systems Analysis, P.O.B. 11100, FI-00076 Aalto, Finland
and
Hong Yue
(H.Y.) Georgia College and State University, Department of Mathematics, Milledgeville, GA 31061, USA
Abstract.
We study a function space based on a condition introduced by John and Nirenberg as a variant of . It is known that , but otherwise the structure of is largely a mystery. Our first main result is the construction of a function that belongs to but not , showing that the two spaces are not the same. Nevertheless, we prove that for monotone functions, the classes and do coincide. Our second main result describes as the dual of a new Hardy kind of space .
Key words and phrases:
Bounded mean oscillation, John-Nirenberg inequality, atomic decomposition, duality
2010 Mathematics Subject Classification:
46E30, 42B35
G.D. was partially supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada, the Centre de recherches mathématiques (CRM) and the Fonds de recherche du Québec – Nature et technologies (FRQNT). T.H. was partially supported by the ERC Starting Grant “AnProb” (European Research Council grant no. 278558) and the Finnish Centre of Excellence in Analysis and Dynamics Research (Academy of Finland grant nos. 271983 and 307333). R.K. was supported by the Academy of Finland grant no. 308063. H.Y. was partially supported by GCSU Faculty Development Funds.
1. Introduction
Along with the well-known class of functions of bounded mean oscillation (), John and Nirenberg [15] also introduced the following variant of the condition, which was subsequently used to define what is called the John-Nirenberg space with exponent , denoted by . Throughout the paper, it is always understood that . Let be a cube. As usual we assume cubes have sides parallel to the axes and use and to denote the volume and sidelength of , respectively.
A function is in if
[TABLE]
for some , where the supremum is taken over all collections of pairwise disjoint cubes in , and is the mean of over . We denote the smallest such number by .
It is fairly immediate that , but the possibility of equality seems not to have been addressed in the literature. Starting with [15], several papers [1, 4, 10, 13, 16, 17, 19] prove the inclusion , for the space as just defined [15], and for several generalisations or variants of it in the subsequent papers. Such results would of course trivialise if it turned out that were just a reformulation of . Our first contribution is to show that this is not the case, but that is indeed a distinct space of its own. While this was probably expected, it does not seem to be completely obvious, even in the one-dimensional setting that we address:
1.1 Theorem**.**
Let and be an interval. Then
[TABLE]
and is incomparable with the Lorentz spaces for . However, the intersections of and with monotone functions coincide.
Theorem 1.1 indicates that the function space properties of cannot be immediately deduced from some known results for classical spaces, but require an independent study. Our second main result is the description of as the Banach space dual of a new “Hardy kind of” space . As the details of this duality are somewhat technical, we refer the reader to Section 6 for a precise statement. Roughly speaking, the space is defined as an analogue of the atomic description of the Hardy space , the well-known predual of ; however, reflecting the difference of a supremum over individual cubes in the definition of , and over collections of cubes in , the atoms of are replaced by more complicated structures that we call polymers in the definition of . Aside from such technicalities, the proof of our duality result essentially follows a known pattern from the - theory. In contrast to this, the proof of Theorem 1.1 features phenomena that are new compared to the standard theory, and we discuss this in some more detail next.
We already pointed out the classical inclusions [15]. It is also known [1] that , which also follows from the fact that and our result about monotone functions, to be proven in Section 2. The inequality is established in Section 3 by exhibiting a concrete example of a function . The result about monotone functions shows that such a function must necessarily be somewhat complicated. As we check in Remark 3.10, the same function also satisfies for every . On the other hand, the fact that again follows from the result about monotone functions and the fact that for .
Let us briefly compare Theorem 1.1 with the well-known limiting case corresponding to the space . The analogue of (1.2) is , where the second inclusion is the famous John-Nirenberg lemma from [15], and its strictness is seen e.g. by on . For the inequality , it suffices to consider the monotone function on , in contrast to the situation of Theorem 1.1.
For finite , the only previously available result related to is contained in [16]. (This paper, like [10], does not explicitly mention the space, but is seen as a special case of their more general functionals via the choice . This connection was observed in [4].) However, their counterexample is set on a special metric space (instead of a Euclidean space), which makes it essentially equivalent to a much simpler dyadic situation reproduced in Proposition 3.1 below.
Despite the number of papers investigating the space (op. cit.), its existing applications seem somewhat limited. After its introduction in [15], the early papers [7, 20] study these spaces in the context of interpolation of operators. In particular, Campanato [7] uses as a tool to deduce from the end-points and , when . This is a widely useful theorem, but its modern proofs do not depend on the space.
On the other hand, the recently introduced “-type norms related to the perimeter of sets” [2, 3, 5], while not exactly the same as the norm, have a close similarity, which might motivate a renewed interest in this type of spaces.
As a possible problem for further study, we mention the following: Is there a representation for functions analogous to the known representation [9] of functions in the from , where are constants, are positive measurable functions, is the Hardy-Littlewood maximal operator, and is a bounded function. Our present contribution does not shed much light on this question.
1.3 Remark*.*
The notation is borrowed from a number of recent papers, starting with [1], but it is not universal. Stampacchia [20] denotes these spaces by (as a special case of certain with a second parameter), whereas Herz [12] uses the notation for a different space (essentially, the -based in a non-classical setting, where the different norms are not necessarily equivalent).
Acknowledgements.
The authors would like to thank Juha Kinnunen for proposing to study the –space.
2. Monotone functions
Next we show that monotone functions are in if and only if they are in . We will first consider bounded intervals. See Remark 2.4 for unbounded intervals.
2.1 Theorem**.**
Let and be a monotone function with . Then there exists such that
[TABLE]
Proof.
We can prove the inequality for and extend it to any finite interval by using the fact that both sides have the same homogeneity with respect to dilations . Without loss of generality, we may assume that is an increasing function such that and that , where and are the positive and negative part of , respectively. Moreover, by changing on a countable set we can assume it is left-continuous.
We will first prove the result in the case where . As the constant in the estimate does not depend on , the result easily follows for unbounded functions as well. This can be seen by considering truncated functions . As the truncation may not increase the oscillation in any interval, for all . The claim now follows by either choosing large enough so that in case or by noticing that as if .
Let . The other values , or , will be a decreasing sequence of numbers, defined recursively below, along with sequences of intervals and . We start with and for any , define the following sets:
[TABLE]
[TABLE]
Let us divide the indices into two sets (“small”) and (“good”) by the following rule: if
[TABLE]
then we set , and otherwise .
If then we define , , and , i.e. .
If then we define
[TABLE]
where is the interval adjacent to on the left (i.e. is the left endpoint of ) with , and
[TABLE]
(the continuity of from the left guaranteeing that will not be of zero length), unless or , in which case we stop the process of constructing intervals. Let be the index where the construction stops.
If , then
[TABLE]
Thus if and , then
[TABLE]
If for all , then let be any index such that . Recall that always. Then by using the previous estimate, as well as the assumptions and , we see that
[TABLE]
Letting , we see that
[TABLE]
Since for and for , the estimates above give
[TABLE]
If (and and ), then and therefore . Notice that for any , , and therefore
[TABLE]
Now we can estimate
[TABLE]
Let us consider the last constructed interval in case the construction stops at some point. (It is also possible that the construction gives us infinitely many intervals.) Recall that we stop the construction when either or . If , then we can estimate the integrals on this interval in the same way as for other indices in .
If , then we have to consider a shorter interval , where is chosen as usual. In this case
[TABLE]
as and . Since in , we have
[TABLE]
If we include in , we can combine the two estimates above to get
[TABLE]
with .
Using (2.2) and (2.3), and noting that the intervals are pairwise disjoint and their union covers , we conclude that
[TABLE]
∎
2.4 Remark*.*
The result also holds for unbounded intervals. Indeed, let be such an interval (i.e., either the full line or a half-line), and be an increasing sequence of finite intervals converging to , say . By the result for bounded intervals and elementary monotonicity properties of the norms, we have
[TABLE]
for all . Here and below the symbol indicates the presence of constants in the inequality. Thus
[TABLE]
as . Hence converges to some limit . Hence by Fatou’s lemma
[TABLE]
so that indeed as claimed.
We note that the case when can be obtained by a more direct argument, which does not rely on the considerations in the case of finite intervals: Consider a monotone function . If is a constant function, then clearly and any other monotone functions are not -integrable. If is not constant, we may assume that it is increasing. Then there exists some and such that . Let . Now either in or . Thus for any ,
[TABLE]
Letting , we see that .
3. The counterexample
One can define a dyadic counterpart of the John-Nirenberg space in a natural way by taking the supremum over pairwise disjoint collections of dyadic cubes, see for example [4] for more details. It is rather easy to find an example of a function in in the dyadic case. We start with this easy example even though this idea does not work when the -norm is taken over all cubes. For another example with the same idea, see Section 5 in [16].
3.1 Proposition**.**
There exists
Proof.
Let be defined as follows:
[TABLE]
Now since
[TABLE]
Let be a dyadic interval. We see that is constant in unless for some . Thus there can be at most one non-zero term in the sum of -norm and
[TABLE]
Thus is in dyadic . ∎
Now we give an example in the general case.
3.2 Proposition**.**
There exists a function .
We construct a family of functions indexed by , the dyadic subintervals of . We want to point out that is not the mean value of (recall that for the mean value of on an interval we use the notation ); moreover, the functions are not supported in the intervals but rather in corresponding intervals which will be defined shortly, and are not in any way assumed to be dyadic. The structure of the dyadic intervals is used only in order to simplify the construction (for example instead of using indices , we index by the interval ). We denote the length of a generic interval by , without always mentioning this relation of and explicitly.
For every , we define the numbers
- •
(“length”) ,
- •
(“distance”) ,
- •
(“height”) .
For every , we define another interval recursively as follows:
- •
For , let be some interval of length .
- •
If is already defined and is the left (right) half of , let be the interval of length positioned on the left (right) side of in such a way that .
Finally, let
- •
,
- •
,
- •
.
We will use the word descendants of to refer to for any proper subinterval , and similarly for the corresponding functions .
See Figure 1 for the first steps in the construction. While the function is defined on the whole line, it is in fact supported in a finite interval of length , as will be seen in the following lemma.
3.3 Lemma**.**
Let be the left or right half of , and define the distances
[TABLE]
Then
[TABLE]
In particular, all the functions are disjointly supported.
Proof.
Note that is the union of all , where . Thus is the maximal (or supremal) distance of from any point of , among all dyadic descendants of . This maximal distance is achieved by considering descendants always on the same side of . With this in mind, let , and recursively be the left (right) half of if is the left (right) half of . Then the distance is formed by subsequently summing up the distance between two consecutive intervals and , and the length of the next interval . Thus
[TABLE]
Similarly, is the minimal (or infimal) distance of from any point of , among all dyadic descendants of . If we take, without loss of generality, to be the left half of , this minimal distance is achieved by always choosing the descendants of on the right, so that gets closer and closer to . From the computation above, the maximum distance that points in these lie to the right of is , and therefore, recalling that is the distance from to ,
[TABLE]
We finally come to the claim concerning disjoint supports of the . Since is the minimal distance of from any with , we see that each is disjointly supported from its descendants with . If, on the other hand, are two disjoint dyadic intervals, then we can find the smallest dyadic interval that contains both and , and thus (possibly after reindexing) must be contained in the left half of and in the right half. But then lies on the left side of and on the right side, so that clearly and are disjoint. Since any two dyadic intervals are either disjoint or one is a descendant of the other one, we have checked the disjointness of the supports in all cases. ∎
3.4 Lemma**.**
For all , we have
- •
, where , and
- •
, so in particular .
Proof.
Clearly
[TABLE]
Hence
[TABLE]
since there are intervals of length , and since
[TABLE]
On the other hand, since the functions are disjointly supported,
[TABLE]
∎
Next we start estimating the -norm of . From now on, let be a collection of pairwise disjoint intervals. Without loss of generality we may assume that does not contain any intervals where is constant, as such intervals do not contribute to the -norm.
3.5 Lemma**.**
For an interval , let
[TABLE]
If , there is a unique largest interval such that , and in this case must also intersect the boundary of .
In particular, for every , there are at most two intervals such that .
Proof.
Since is supported on the union of the intervals , if , clearly must intersect some . Suppose that intersects two intervals , of equal length. But then, by construction (see Figure 1), there is a bigger interval (where can be taken, as above, to be the smallest dyadic interval containing and ) lying between the intervals , and must also intersect . This shows that there is a unique interval of maximal length.
If , then , since is constant on . Thus must also intersect the complement of , and hence the boundary of . The boundary of has only two points, so a disjoint collection can contain at most two intervals like this. ∎
3.6 Lemma**.**
If and , then
[TABLE]
Proof.
Recall that on . Thus
[TABLE]
and
[TABLE]
Hence
[TABLE]
Let be an interval with , and . We say that is
- •
short, if ;
- •
medium, if ;
- •
long, if .
3.7 Lemma**.**
If is short and , then
[TABLE]
and
[TABLE]
Proof.
In this case is too small to reach the support of outside , and hence on . Thus only the second term from Lemma 3.6 contributes to . Thus
[TABLE]
Now
[TABLE]
since there are:
- •
exactly intervals of of length ;
- •
for each , at most two short intervals with ; and
- •
for each , we have the estimate for as written.
∎
3.8 Lemma**.**
If is medium and , then
[TABLE]
and
[TABLE]
Proof.
In this case, we need to consider both terms from Lemma 3.6. However, the estimate for the second term is exactly as in the case of short intervals, since , and we concentrate on the first term. Letting be the two halves of , we have
[TABLE]
Since and , we get
[TABLE]
Taking into account the second term from Lemma 3.6, which is the same as in the short case, we get
[TABLE]
As in the short case, this gives
[TABLE]
since . ∎
3.9 Lemma**.**
If is long and , then
[TABLE]
The corresponding intervals form a Carleson family, in the sense that
[TABLE]
and hence
[TABLE]
Proof.
If is long, then , and hence the part of on at least one side, say left (right), of is longer than . But this means that contains all the intervals , where is contained in the left (right) half of . Consequently, all dyadic subintervals of the form for some , must be contained in just one half of . Let us say that is long, if it is of the form for some long . Hence, if is long, all its long subintervals are contained in just one half of . If denotes the other half of , then clearly , and the intervals are pairwise disjoint for long intervals . This immediately implies the Carleson property by
[TABLE]
As for the estimate for , we note that the part corresponding to the first term of Lemma 3.6 is just the same as in the medium case: by the maximality of , we know that cannot meet any other parts of than , where is the left or right half of , and in addition to this observation, we only used that is big enough. And of course .
We turn to the second term in Lemma 3.6, which is estimated slightly differently from the previous cases. Namely, in the lack of a good bound for , we instead observe that , and hence
[TABLE]
as claimed. This would not be good enough to sum over all dyadic intervals, but instead the Carleson property comes to rescue:
[TABLE]
∎
Proof of Proposition 3.2.
Let be the function discussed above. We already checked that .
On the other hand, if is a disjoint family of intervals, we checked that
[TABLE]
By definition, this shows that
[TABLE]
3.10 Remark*.*
In fact, the same function also satisfies for every , proving that . This is seen as follows:
Recall that takes the value on disjoint intervals of length . Thus
[TABLE]
The norm in the Lorentz space is given by
[TABLE]
Since the th term of the series converges to (and not [math]) as , the series is clearly not summable.
4. A multidimensional counterexample
In this short section we show how to lift the one-dimensional counterexample to several variables. It turns out that this can be achieved in a soft way by simply using the previous result as a black box, without revisiting any of the technical details. This is thanks to the following simple extension result that might have some independent interest:
4.1 Proposition**.**
Let be a cube, , and its trivial extension to . Then if and only if , and
[TABLE]
Proof.
Let first , and let be any disjoint subcubes of . Since is constant in the -direction, we get and further
[TABLE]
For every fixed , the collection of cubes , such that , is disjoint. (In fact, if and , then , a contradiction with the disjointness of the cubes .) Thus
[TABLE]
and hence
[TABLE]
Since this is true for every collection of disjoint subcubes , we get the second claimed bound.
Let then , and let be disjoint subcubes. We consider the cubes , where , and is chosen so that . These are disjoint subcubes of , and
[TABLE]
Hence
[TABLE]
where we used Since this holds for all disjoint collections of cubes , we deduce the first claimed bound. ∎
4.2 Corollary**.**
For every integer , there is a function
[TABLE]
Proof.
We have previously constructed such a function when , with support in an interval of finite length. By rescaling, we can assume this function is supported in the interval . Suppose that the claim is true for some , and let be the corresponding function. Let us then consider its trivial extension for . By Proposition 4.1, we have , whereas clearly . ∎
5. Equivalent norms
It might occur to one to consider the following generalisation of the norm:
[TABLE]
where the supremum is as in the definition of . However, this would not yield anything new, as shown by the following:
5.1 Proposition**.**
Let be a cube. Then
[TABLE]
Proof.
By Hölder’s inequality it is clear that for . Let and consider disjoint cubes . Then
[TABLE]
by the embedding and the John–Nirenberg lemma for . If we now choose disjoint subcubes for which the norm of is almost achieved, we have
[TABLE]
since are disjoint subcubes of . This shows that for .
For , by considering the trivial partition consisting of the single cube , we find that
[TABLE]
so that . On the other hand, Jensen’s inequality (applied to the convex combination with coefficients ) shows that
[TABLE]
and hence as well. ∎
6. Duality
We now work on a fixed cube in . In analogy with the well-known - duality, one might expect to identify with the dual of some “Hardy kind of” space, say . Indeed, from standard duality arguments one can see that
[TABLE]
where indicates that holds in both directions, and the supremum is taken over all associated to sequences of functions defined on disjoint subcubes and satisfying
[TABLE]
Here , , denotes the space of functions on with mean zero. For such we can define
[TABLE]
whenever . This suggests that a predual of might be a linear space generated by all functions of this form. Note that each is (maybe up to scaling) an atom of the Hardy space . We shall refer to functions as above by the name polymers. (The word ‘molecule’ already has a different established usage in the theory of Hardy spaces.)
In analogy with the notion of Hardy space -atoms, , we make a slightly more general definition:
6.1 Definition**.**
Let . We say that is an -polymer if pointwise, where for disjoint cubes (note that the pointwise convergence of such a series is trivial by disjointness), and
[TABLE]
with the usual reinterpretation for . We define as the infimum of over all such representations of as . The functions making up will be called -atoms.
We say that if there is a representation, convergent in norm in ,
[TABLE]
where each is an -polymer (thus in as we check in Remark 6.2 below), and . We define as the infimum of such sums over all such representations.
6.2 Remark*.*
It is immediate from Jensen’s inequality that any -polymer satisfies
[TABLE]
Taking the infimum over all representations, it follows that . Thus, if , its polymeric representation converges in , and .
Moreover, is a dense subspace of : note that every is an -polymer with a trivial expansion consisting of one -atom, and hence with a continuous embedding. The convergence of the -polymeric expansion and the atomic expansions in the norm of shows that the finite sums are dense in , and these finite sums belong to , since each -atom belongs to this space.
6.3 Remark*.*
One may find a certain analogy between Definition 6.1 and the atomic description of on the bi-disc by Chang and Fefferman [8]. Namely, a generic function in the bi-disc- is expressed as a sum of certain bi-disc atoms, each of which is further decomposed into pieces called ‘elementary particles’, just like our functions are sums of polymers, each of which is a sum of (usual -)atoms. Aside from the two levels of the expansion, however, Definition 6.1 has not much in common with the Chang–Fefferman atoms, so that copying their nomenclature (atoms and elementary particles instead of polymers and atoms) would seem more misleading than useful in our context. The functions in Definition 6.1, are precisely classical atoms, so it seems natural to adopt the name polymer for the larger structures built from them. In contrast, the Chang–Fefferman atoms, while being the larger structures in their expansion, have properties closely analogous to those of classical atoms, whereas their elementary particles have additional smoothness properties, which are neither present in the classical theory nor in our new spaces. Altogether, our spaces should be seen as a closer relative of the classical than its bi-disc version.
Our duality results for will ultimately rely on the well-known duality of the spaces. In order to have an access to the simple duality of the reflexive spaces (in contrast to the more complicated situation of ), we first establish the following reduction to finite indices in our candidate predual space:
6.4 Proposition**.**
We have the coincidence of spaces with equivalence of norms for all .
Hence we can define with just one index. We begin with a convenient decomposition lemma for a single atom; this is essentially known from the theory of the Hardy space (cf. [11], Theorems III.3.6 and III.3.7), but we provide the details in a form convenient for our needs.
6.5 Lemma**.**
Fix a constant . Let and . Then
[TABLE]
where for cubes such that for and
[TABLE]
where is the maximal function related to the dyadic subcubes of the cube , and
[TABLE]
Proof.
For each , let be the maximal dyadic subcubes of such that . By maximality and doubling, we also have
[TABLE]
since , so that any given cube can appear in at most one “level” . We also define .
We can then write
[TABLE]
In fact, this is a basic telescoping identity when there exists a maximal with (and hence for any ). On the other hand, if there are arbitrary large with , then , and the set of such points has measure zero, hence is of no concern to us.
It is straightforward that and . Moreover, is supported on , and these cubes are disjoint for fixed with . ∎
Proof of Proposition 6.4.
Since every -polymer is a fortiori an -polymer, it is enough to prove that every -polymer can be decomposed into -polymers, namely , with .
By definition, we have , with atoms supported on disjoint cubes and such that .
For each , we apply the decomposition of the previous lemma to in place of , with . This leads to
[TABLE]
where for disjoint (in ) cubes such that
[TABLE]
and . Since the cubes are disjoint, it follows that the cubes are disjoint when both and are allowed to vary, for each fixed . Thus the following function, defined pointwise by
[TABLE]
satisfies the atomic structure requirements for an -polymer, and it remains to check the relevant norm estimates. That is, we need to estimate
[TABLE]
where we separated the easier term corresponding to . Note that this last term is , so it remains to estimate the sum over .
Exploiting the fact that , we write , where . Then repeated use of Hölder’s inequality gives
[TABLE]
This completes the proof. ∎
Now we are ready for our main result about duality:
6.6 Theorem**.**
Let . Then in the sense that:
- (1)
Every induces a linear functional of norm
[TABLE]
by
[TABLE]
whenever
[TABLE]
where are -polymers for some and for disjoint cubes are -atoms such that
[TABLE]
The value of above is independent of the chosen representation of as a series of polymers, and their representations as series of atoms, as long as the finiteness condition above is satisfied. In fact, an alternative way of computing is also given by
[TABLE]
where the integrals and the limit exists for all and . 2. (2)
Every continuous linear functional on has the form for some .
The argument below will follow the broad outline of the proof of the - duality as given in [18], Section 5.6. See also Theorem 1 in Ch. IV of [21]. It might be noted that the question of well-definedness of the expression in (6.7) is somewhat serious in view of the examples given in [6] in the context of .
Proof.
(a) Let first be an -polymer for . Then and . Let with , where and the cubes are disjoint. Then , where the sum converges absolutely and
[TABLE]
If is a sum of -polymers , with , the estimate above applied to each gives the absolute convergence of the series with the bound
[TABLE]
(b) To show that is independent of the expansion of and thus well-defined, we derive an alternative representation for . For a function and a number , let
[TABLE]
Then a well-known estimate from the standard theory says that
[TABLE]
which implies that uniformly in . On the other hand, it is clear that . From Remark 6.2, we see that the polymeric expansion converges in and hence in . Thus the product is integrable, and
[TABLE]
where is a disjoint atomic expansion of the polymer . Here , while since . Hence as by dominated convergence. On the other hand, we have
[TABLE]
where the right side is independent of and summable over with a bound that is a constant multiple of . Thus
[TABLE]
again by dominated convergence (of the sum). Since further is summable over by assumption, yet another application of dominated convergence proves that
[TABLE]
But here the right side makes no reference to any expansion (either of in terms of polymers, or their expansion in terms of atoms), so that this quantity is manifestly independent of any such representation.
(c) Let finally be given, and fix some . Since , Remark 6.2 shows is a dense subspace of . Let be the restriction of to . Then , and hence (by the well-known duality of the spaces) has a representation
[TABLE]
for some .
We check that . Let be a finite sequence of disjoint subcubes . For every , we have
[TABLE]
For every , we pick some that almost achieves the supremum. Set , where the positive numbers are chosen so that and
[TABLE]
Note that each , and hence . Moreover, is an -polymer with
[TABLE]
Hence also , and therefore . This gives
[TABLE]
for all finite families of disjoint cubes , from which the same estimate for countable families is immediate. Thus and
[TABLE]
(d) By parts (a) and (b) of the proof, we know that the above induces a functional on . If then is an -polymer consisting of one atom and so by definition . But, for such functions, we also have . Hence the functionals and agree on the subspace of . As noted above, this subspace is dense in . Since the continuous linear functionals and agree on a dense subspace, they must be equal. Combining the bounds (6.8) and (6.9), we also see that
[TABLE]
so that the two norms are equivalent. ∎
6.10 Remark*.*
The only place in the above argument where the properties of real numbers beyond their Banach space structure were used was the representation of by a function . For functions taking values in a Banach space , the duality , for , remains valid under the assumption that has the so-called Radon–Nikodým property (see [14], Definitions 1.3.9, 1.3.27 and Theorems 1.3.10, 1.3.26). By the proof above, the duality , for , remains valid under the same assumption.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. Aalto, L. Berkovits, O. E. Kansanen, and H. Yue. John-Nirenberg lemmas for a doubling measure. Studia Math. , 204(1):21–37, 2011.
- 2[2] L. Ambrosio, J. Bourgain, H. Brezis, and A. Figalli. Perimeter of sets and B M O 𝐵 𝑀 𝑂 BMO -type norms. C. R. Math. Acad. Sci. Paris , 352(9):697–698, 2014.
- 3[3] L. Ambrosio, J. Bourgain, H. Brezis, and A. Figalli. BMO-type norms related to the perimeter of sets. Comm. Pure Appl. Math. , 69(6):1062–1086, 2016.
- 4[4] L. Berkovits, J. Kinnunen, and J. M. Martell. Oscillation estimates, self-improving results and good- λ 𝜆 \lambda inequalities. J. Funct. Anal. , 270(9):3559–3590, 2016.
- 5[5] J. Bourgain, H. Brezis, and P. Mironescu. A new function space and applications. J. Eur. Math. Soc. (JEMS) , 17(9):2083–2101, 2015.
- 6[6] M. Bownik. Boundedness of operators on Hardy spaces via atomic decompositions. Proc. Amer. Math. Soc. , 133(12):3535–3542 (electronic), 2005.
- 7[7] S. Campanato. Su un teorema di interpolazione di G. Stampacchia. Ann. Scuola Norm. Sup. Pisa (3) , 20:649–652, 1966.
- 8[8] S.-Y. A. Chang and R. Fefferman. A continuous version of duality of H 1 superscript 𝐻 1 H^{1} with BMO on the bidisc. Ann. of Math. (2) , 112(1):179–201, 1980.
