Weighted and multivariate Johnson--Schechtman inequalities with application to interpolation theory
Maciej Rzeszut

TL;DR
This paper extends classical Johnson--Schechtman inequalities to weighted and multivariate cases, deriving new decomposition theorems for moments of generalized U-statistics and exploring their implications for interpolation theory.
Contribution
It introduces weighted and multivariate versions of Johnson--Schechtman inequalities, leading to new decomposition results for U-statistics and insights into interpolation properties of function spaces.
Findings
Weighted Johnson--Schechtman inequality established
Decomposition theorem for p-th moments of U-statistics derived
Interpolation properties of certain function spaces analyzed
Abstract
We prove a weighted version of a classical inequality of Johnson and Schechtman from which we derive a decomposition theorem for -th moments () of nonnegative generalized -statistics with constant not dependent on . In particular, for , the norm in the subspace of spanned by functions dependent on at most variables is equivalent to the norm in a suitable interpolation sum of spaces. As a consequence, we obtain some interpolation properties of that are known to imply cotype 2 of .
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.
Taxonomy
TopicsMathematical functions and polynomials · Mathematical Analysis and Transform Methods · Mathematical Inequalities and Applications
Weighted and multivariate Johnson–Schechtman inequalities with application to interpolation theory
Maciej Rzeszut
Institute of Mathematics of Polish Academy of Sciences
Śniadeckich 8
00-656 Warszawa
Abstract.
We prove a weighted version of a classical inequality of Johnson and Schechtman from which we derive a decomposition theorem for -th moments () of nonnegative generalized -statistics with constant not dependent on . In particular, for , the norm in the subspace of spanned by functions dependent on at most variables is equivalent to the norm in a suitable interpolation sum of spaces. As a consequence, we obtain some interpolation properties of that are known to imply cotype 2 of .
Key words and phrases:
U-statistics, real interpolation, weighted inequalities
2010 Mathematics Subject Classification:
60G50, 46E30, 46B70
Contents
1. Introduction
The well known inequality due to Rosenthal [28] states that for ,
[TABLE]
where are nonnegative independent random variables on . Originally, it was proved for the purpose of Banach space geometry. The precise growth of the constant as a function of was found in [19]. In the case of , it appears that there is no known expression for that would be as explicit as the right hand side of (1.1). Theorems providing two sided bounds for this quantity, valid for all , were proved by Johnson and Schechtman [18], Klass and Nowicki [21] and Latała [24]; see also [9]. All of them contain an Orlicz norm in some form. The most important for us is a special case of the main theorem from [18], namely the inequality
[TABLE]
valid for . It is a natural counterpart to (1.1) in the following sense. Suppose that are independent and is -measurable. Since the sequence carries the same information as a function on the disjoint union (which is now a sigma-finite measure space), the last two inequalities can be conveniently written as
[TABLE]
where denotes the interpolation sum and is an Orlicz function such that for and for . For more information about Orlicz norms in this context, we refer the reader to [10].
It is a common practice to search for analogues of classical theorems concerning independent random variables in the setting of -statistics, introduced by Hoeffding in [14]. This has been done for CLT (see e.g. [8], [16]), LIL (see e.g. [11], [2], [3]), SLLN (see e.g. [15]) just to name a few. A natural multivariate counterpart to for nonnegative and independent is the -th moment of a nonnegative generalized decoupled -statistic, i.e. the quantity
[TABLE]
where are independent random variables and are nonnegative functions on . By virtue of a decoupling inequality due to Zinn [31], if the distribution of is the same for all , then (1.4) is equivalent to its undecoupled version
[TABLE]
For , two-sided bounds for (1.4) in terms of mixed norms were developed in [12]. They were generalized to Banach space valued -statistics in [1], extending the inequalities of Rosenthal and of Klass and Nowicki. However, the authors indicated the lack of a satisfactory counterpart to these results for . For more information about -statistics and decoupling we refer to [13].
Let us shift our attention to the mean zero setting. Assuming that , for , by Marcinkiewicz and Zygmund inequality [25], we have
[TABLE]
which allows to directly translate (1.3) to the mean zero case. A usual multivariate counterpart of independent mean zero variables are generalized canonical -statistics, i.e. sums of the form
[TABLE]
where are independent and identically distributed, while are mean zero in each variable with respect to the law of . By an inequality due to Bourgain [7, Proposition 7], we get an analogous equivalence of -th moment of (1.7) to the -th moment of a square function
[TABLE]
Bourgain and Kwapień in [7] and [22] considered subspaces of spanned by random variables of the form
[TABLE]
for all mean zero in each argument with respect to the law of . The subspaces for form an orthogonal decomposition of and it turned out that is complemented in for , but not for . Moreover, by (1.6) and (1.3), is isomorphic to or when or , respectively. If , then is isomorphic to for , but not for , see [17]. This makes the case the most interesting to study.
Let us briefly introduce some aspects of inteprolation theory that will be of some importance to us. Let and . A desirable property of such a pair is -closedness in , from which one can derive real interpolation spaces between and , see Section 2 for details. It is trivially satisfied if the orthogonal projection on is bounded in . Bourgain proved in [6] that if this projection is a Calderón–Zygmund operator, then
[TABLE]
A little is known about possible weaker assumptions on the projection onto that would imply (1.10). It has been proved in [30] for an -fold tensor of Riesz projection. It has also been shown in [20] for a tensor of a Riesz projection and a Calderón–Zygmund projection for the usually more difficult side of the interpolation scale.
Another interesting inteprolation property of subspaces of is connected to work of Bourgain [5], Pisier [27] and Xu [30], resulting in a theorem that if is such that
[TABLE]
then is of cotype 2 and every operator is 1-summing. In fact, it was originally motivated by the question of cotype of answered by Bourgain [5]. Later, it was extended to in [30] and for in [6].
Let us turn to a detailed description of the main results of the paper. We are going to provide a weighted version of (1.2), which in particular shows that in this inequality the constant is independent of . Let us state a simplified version of Theorem 3.5.
Theorem A**.**
If , and are independent and are -valued weigths satisfying for some constant and all , then
[TABLE]
From this, we derive the following theorem (see Theorem 4.3).
Theorem B**.**
Let for and . Then
[TABLE]
with a constant not dependent on . In more explicit terms, the inequality ‘’ means that if
[TABLE]
then there is a decomposition
[TABLE]
such that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Moreover, it can be chosen in such a way that for each , supports of are disjoint.
This is easily seen to be equivalent to the following, see Corollary 4.4.
Theorem C**.**
For and such that ,
[TABLE]
Moreover, the decomposition can be chosen such that are mean zero in each variable.
Both Theorems B and C have natural -variable extensions (see Theorems 4.5 and 4.6 for details). Finally, Theorems A and C are later utilized by us to prove that Hoeffding subspaces enjoy the mentioned interpolation properties (1.10) and (1.11), compare Theorems 5.5 and 6.1.
Theorem D**.**
The couple is -closed in .
Theorem E**.**
The couple is -closed in .
The paper is organized as follows. In Section 2, we recall some definitions and tools to be used later. In Section 3, we prove a weighted generalization of the classical Johnson–Schechtman inequality, as a byproduct getting a new proof of the historic result with an absolute constant. This weighted inequality will be applied in Section 4 to remove the obstacles that arise while iterating one-variable results leading to a Johnson–Schechtman type decomposition for low moments of nonnegative -statistics. In Section 5, we apply the resulting decomposition theorems to obtain results about real interpolation of and spaces between and .
Acknowledgements
Most of results of this paper are taken from my doctoral thesis [29]. I am grateful to my advisors: Fedor Nazarov and Michał Wojciechowski for their mentorship and support, especially their unending willingness to discuss my research.
2. Overview of basic notions and facts
Notation. denote respectively up to a consatnt. The expression is defined as for all , which makes it a norm for and a quasinorm for .
Probability spaces and conditional expectations. In all of the text, will be a probability space. We will equip sets of the form , where is an at most countable index set, with the product measure defined on . In case we are only concerned with the cardinality of , we will write , where is a natural number or . By the natural filtration on we mean the filtration , where is generated by the coordinate projection and denote . In general, for a subset of the index set, will be the sigma algebra generated by the coordinate projection and . In more explicit terms, measurability with respect to is equivalent to being dependent only on variables with indices belonging to and the conditional expectation operator integrates away the dependence on all other variables, so that the formulas
[TABLE]
[TABLE]
are satisfied (with the convention that sequences indexed by and are merged in a natural way into a sequence indexed by ). It will often be convenient to identify a function defined on with an -measurable function . In order to save space, we will often write instead of whenever the measure is implied by context.
Tensor products. Let . For , we will denote by the function on satisfying
[TABLE]
Because of separation of variables, we have . This way we actually define an injection of the algebraic tensor product into , the image of which is dense.
Let be subspaces (by a subspace we always mean a closed linear subspace) of . By we will denote the subspace of spanned by functions of the form , where , and the norm is inherited from (care has to be taken, as is not determined solely by as Banach spaces, but rather by the particular way they are embedded in ). If are bounded operators, then we can define an operator by the formula
[TABLE]
and easily check that the property
[TABLE]
is satisfied. Indeed, , and any operator of the form has norm bounded by , because .
Khintchine’s and related inequalities. First, we recall the classical Khintchine-Kahane inequality.
Theorem 2.1** (Khintchine for , Kahane for Banach).**
Let be vectors in a Banach space and be Rademacher variables (i.e. independent random variables, each of them attaining with probability ). Then, for ,
[TABLE]
In particular, for . As a consequence we obtain the Marcinkiewicz-Zygmund moment inequality.
Lemma 2.2**.**
Let be a (not necessarily probability) measure space. If are independent -valued mean [math] random variables (), then
[TABLE]
Proof. If are mean [math] and independent, then by taking the conditional expectation with respect to (the sigma-algebra generated by) and because of triangle inequality. Thus and in particular . Hence, there is an equivalence , where are Rademacher variables independent of ’s, which is true a.e. on the space where ’s are defined. Let us distinguish the expectations on spaces on which ’s and ’s are defined by denoting them respectively by and . Then
[TABLE]
Vector-valued inequalities. For a Banach space , by we denote the Bochner space of strongly measurable -valued random variables equipped with the norm
[TABLE]
(or, equivalently, the closed span of functions of the form , where and , in the norm). For an operator between subspaces of and and a linear operator we can define on the algebraic tensor product by , but this construction does not necessarlily produce a bounded operator on the closure. The main tool for obtaining vector-vlaued extensions of inequalities will be the following lemma, which for being singletons is due to Marcinkiewicz and Zygmund [25] (in this case can be replaced with ).
Lemma 2.3**.**
Let for , be a Hilbert space and be bounded. Then , where is treated as a subspace of , is bounded with norm .
Proof.
Without loss of generality, is finite-dimensional, say for some finite . Let , so that . Let also for be Rademacher variables. Then, applying -valued Khintchine inequality,
[TABLE]
∎
Interpolation. Let us recall basic information about the real interpolation method. The standard reference is [4]. A couple of Banach spaces is called compatible if and are embedded in a linear topological space. For a compatible couple we define the -functional by the formula
[TABLE]
for . For , , we will say that the couple is -closed in if
[TABLE]
for any in the algebraic sum (the reverse inequality holds trivially). This is equivalent to the following property: for any and any decomposition , where , , there exists a decomposition such that , , , .
The -functional plays a crucial role in the real interpolation method. The norm in the real interpolation space , where and is defined by
[TABLE]
Operators bounded simultaneously on and are also bounded on . The canonical example is , where and, more generally, . If is -closed in , then it is easily seen that , which is particularly useful in case of couples -closed in Lebesgue spaces.
The algebraic sum becomes a Banach space when equipped with the norm
[TABLE]
The intersection will be equipped with the norm
[TABLE]
It is easily checked that the dual space can be isometrically identified with .
Hoeffding decomposition. In order to avoid technicalities with convergence in strong operator topology, we will work in a finite product of (all the results extend automatically to by density). We will see in a moment that any function can be decomposed in a unique way as
[TABLE]
where depends only on and is of mean [math] with respect to each of (equivalently, is -measurable and is orthogonal to all -measurable functions for ). This decomposition has been studied in [7], [22]. In particular, are pairwise orthogonal orthogonal projections. Let
[TABLE]
and be the range of . It is known [7], [22] that is bounded on , , with norm independent on , but this is not true for .
One of the possible ways to prove the existence of the above decomposition in is as follows. First we define the subspace
[TABLE]
for each . The sequence of subspaces is increasing, so by putting
[TABLE]
we obtain a decomposition
[TABLE]
into an orthogonal direct sum of . We will denote the orthogonal projection onto by and the closure of equipped with norm by .
A more explicit formula for can be obtained. For , let
[TABLE]
where and are understood to act on , and let be the range of the projection . It is easy to see that
[TABLE]
and, since the subspaces are mutually orthogonal,
[TABLE]
Moreover
[TABLE]
and consequently
[TABLE]
Decoupling inequalities. We are going to present a special case of a theorem of J. Zinn [31], which will be one of the most important tools.
Theorem 2.4** (Zinn).**
Let be independent random variables such that and have the same distribution for any . Let also be a nonnegative Borel function on and . Then
[TABLE]
Corollary 2.5**.**
For all such that , let be an -measurable nonnegative function on . Then, treating each as a function on ,
[TABLE]
where are variables in and .
Proof.
Let us fix and for each define a function on by the formula
[TABLE]
Then, for fixed ,
[TABLE]
Here, plays the role of and (2.32) is an application of Theorem 2.4 to functions . Integrating the resulting inequality with respect to , we get
[TABLE]
which by induction from to proves (2.28). ∎
3. Weighted inequalities
If are probability spaces, we can form a (no longer probability) measure space by considering the disjoint union of sets with a measure for . We will often write instead of if the choice of measure is clear.
Our main motivation is the following special case of a theorem due to Johnson and Schechtman.
Theorem 3.1** (Johnson, Schechtman [18]).**
Let for and . Then
[TABLE]
In more explicit terms, the inequality ‘’ means that if
[TABLE]
then there exists a decomposition such that
[TABLE]
Moreover, the decomposition can be chosen so that for any the supports of and are disjoint.
This can be use to expresses norm, (the case is handled by Rosenthal inequality), on as a rearrangement invariant norm on the disjoint union in the following way. For , we have
[TABLE]
for some of mean [math] and consequently
[TABLE]
by Marcinkiewicz-Zygmund inequality. Applying Theorem 3.1 with expontent to , we get an equivalent form of Theorem 3.1.
Corollary 3.2**.**
For and of mean zero,
[TABLE]
The building blocks , of in the above can be also chosen to be of mean [math], because
[TABLE]
In this section we will develop a weighted version of Theorem 3.1 (in particular producing a new proof with constant independent on ), which will be Theorem 3.5, which for a singleton, , and gives a constant .
We start with a calculation lemma.
Lemma 3.3**.**
Let be a function differentiable outside of [math] and satisfying for . Then
[TABLE]
Proof.
Let denote the Euclidean norm. By direct calculation we verify that
[TABLE]
Therefore
[TABLE]
Thus
[TABLE]
∎
The following inequality is useful for obtaining lower bounds for subspaces of vector valued .
Lemma 3.4**.**
*Let , be a finite probability space, be subspaces of , be the subspace of consisting of sequences of functions such that , , be orthogonal projections onto , respectively, be a random norm on differentiable outside of [math], be a norm on , be the dual norm on in the sense of the usual pairing. Then for any constants , , the following are equivalent:
(i) for any ,*
[TABLE]
(ii) for any not identically zero,
[TABLE]
where is extended to be equal to [math] in [math]. Moreover, if for any not identically zero,
[TABLE]
where , then
[TABLE]
for all .
Proof.
Let us start with . The implication (i)(ii) is true for each separately. Indeed, if (3.13) holds, then by self-adjointness of and Lemma 3.3 applied to pointwise to ,
[TABLE]
We will prove the implication (ii)(i) now. Let us assume first. We are in a fully finite-dimensional setting. It is enough to prove
[TABLE]
for any such that
[TABLE]
By homogeneity, we can set
[TABLE]
Since is a norm on , under the constraint (3.24) it is a convex function going to in infinity, so it attains a minimum. Let be a minimizer of . Suppose for a moment . For any such that we have
[TABLE]
In other words,
[TABLE]
when both are treated as functionals on . Therefore
[TABLE]
for some , which by (3.13) and (3.23) gives
[TABLE]
Ultimately, utilising Lemma 3.3 again,
[TABLE]
Therefore and thus as desired.
Now we will prove that (3.15) is sufficient for (3.16). We will proceed in an analogous manner, but we have to take care of nondifferentiability of in [math]. As previously, we pick such that
[TABLE]
and normalize to satisfy
[TABLE]
If is a minimizer of given (3.37), then for any , the function is in each point of either differentiable in [math] (when ) or identically [math] (when and consequently ). Thus, for any such that ,
[TABLE]
Therefore as functionals on , so
[TABLE]
in particular
[TABLE]
so . Thus
[TABLE]
∎
Now, we are ready for the main result of this section. The parameter is for technical reasons and we will make most use of the case and -valued , in which case the inequality is true with the constant . Also, as will be noted in the proof of Theorem 3.1, the decomposition in the interpolation norm on the right hand side may always be chosen to be of disjoint supports at the cost of constant 2. Sometimes we will use a weaker version of Theorem 3.5 with the norm on the right hand side replaced by a smaller norm of the sequence .
Theorem 3.5**.**
Let be a finite probability space, be finite sets, be an independent family of sigma-algebras, be -measurable, be -valued functions on and , . Then
[TABLE]
where . Moreover, if are -valued, the inequality holds with constant .
Proof.
Every time we encounter a fraction that can have [math] denominator, it will also have [math] numerator and it is to be treated as [math]. The notation stands for so that . For the inequality is elementary, so we assume . We may also assume and get by taking limits.
Let and . We can without loss of generality assume , because otherwise we replace by . We are now in the setting of Lemma 3.4, with and . For a given , we have
[TABLE]
therefore the projection is just
[TABLE]
because the projections onto adapted sequences and onto sequences supported on are respectively and multiplication by applied coordinatewise (in particular they commute). Moreover, is a contraction on . One easily calculates
[TABLE]
By Lemma 3.4, it is enough to prove
[TABLE]
because is already supported on . Let us fix for a moment. On each atom of contained in we have by Hölder the inequality
[TABLE]
By rearranging the terms and multiplying by ,
[TABLE]
This inequality has been proved on , but outside of it both sides are [math], so it is true everywhere. Moreover, on we have
[TABLE]
If additionally is -valued,
[TABLE]
Plugging bounds for the factor involving to (3.53) and then to (3.51), we see that it remains to prove
[TABLE]
We have
[TABLE]
so in (3.58) we can replace with a singleton and write in the place of , which transforms the inequality into
[TABLE]
for nonnegative and -measurable . Raising both sides to the power , we end up with
[TABLE]
Suppose
[TABLE]
Then for all ,
[TABLE]
so
[TABLE]
Ultimately,
[TABLE]
∎
As a byproduct, we obtain another proof of Theorem 3.1, which we present for the sake of completeness.
Proof of Theorem 3.1. For a fixed , both sides of (3.1) are norms of the vector-valued function , dominated by . We can assume that ’s attain finitely many values due to density of such in . Let be the sigma-algebra generated by , or equivalently by the partition of into intersections of their level sets. We can restrict the infimum on the right side of (3.1) to being -measurable, because for any decomposition , the decomposition produces a smaller result. Thus we can think of being a finite space, the atoms being elements of the partition. Since both sides of (3.1) are continuous in , we can assume that the atoms have measures being multiples of for some . This enables us to split each of them into atoms of size , getting a new probability space equipped with the normalized counting measure and a new sigma-algebra , with respect to which ’s are still measurable. By the same argument as before, we can extend the infimum to decompositions measurable with respect to . Therefore, we can assume without loss of generality that is finite with normalized counting measure.
The inequality of (3.1) is elementary and holds with constant , because for any decomposition we have
[TABLE]
The other inequality, is precisely Lemma 3.5 with being a singleton, , , and . It remains to prove that we can choose the desired decomposition so that the summands have disjoint supports. Without loss of generality, . Let be some decomposition satisfying . Then for any we have either or . In the former case we put , and in the latter , , choosing arbitrarily if . This way we have and and .
In the original version of Theorem 3.1, the decomposition was defined in terms of decreasing rearrangement of . There is also another way of constructing a more explicit decomposition. Define a function by
[TABLE]
and take
[TABLE]
By convexity of and the inequality ,
[TABLE]
as desired. ∎
4. Decomposition theorem for
We would like to extend Theorem 3.5 to moments of -th order -statistics, and as a result extend Corollary 3.2 to treat . Let us note the following theorem due to Bourgain [7], which generalizes Marcinkiewicz-Zygmund inequality and in particular implies that is complemented in for .
Theorem 4.1** (Bourgain).**
Let . Then
[TABLE]
Corollary 4.2**.**
Let and . Then
[TABLE]
Proof.
This is just a combination of Theorem 4.1 and Corollary 2.5. ∎
Again, for this has been handled by multivariate extension of Rosenthal inequality, see [12]. For , by calling the new and the new , we arrive at expressions of the form
[TABLE]
which the main object of our interest will be. For this, we can relax the condition on in (4.1) to and the sum may be run over instead of .
4.1. The case
We are going to single out the case , because we believe that it will significantly improve the legibility of the proof.
Theorem 4.3**.**
Let for and . Then
[TABLE]
with a constant not dependent on . In more explicit terms, the inequality ‘’ means that if
[TABLE]
then there is a decomposition
[TABLE]
such that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Moreover, it can be chosen in such a way that for any , supports of are disjoint.
From this, we immediately derive
Corollary 4.4**.**
For and such that ,
[TABLE]
Moreover, the decomposition can be chosen such that are mean zero in each variable.
Proof.
Just as indicated above, we use Corollary 4.2 and then, in a routine convexification argment, Theorem 4.3 for and to get the desired equivalence. The resulting decomposition is then improved by putting all summands to [math] for and replacing etc. by etc. (here, acts on functions on , namely ), which is legal because
[TABLE]
∎
Proof of Theorem 4.3..
Since all the norms involved, and consequently their interpolation sums, depend only on the modulus of a function, we may assume . By and we have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus, the inequality of (4.2) follows with constant and the only interesting part is the inequality, i.e. the existence of a decomposition satisfying (4.5)-(4.8).
We perform the discretization procedure as described in the proof of Theorem 3.1, with the only changes being that as the dense set we choose functions that attain finitely many values, each (possibly treated with repetitions) of them on a set of product form, and our atoms also have to be products of atoms in . This allows us to assume that is finite and equipped with the counting measure. Also, because both sides are lattice norms, we will be content with satisfying the desired ineqaulity and instead of .
Let be a function on defined by the formula
[TABLE]
We can write (4.3) in the form
[TABLE]
By fixing and applying Theorem 3.1 to the sequence of functions , we get a decomposition
[TABLE]
such that
[TABLE]
[TABLE]
Utilising the condition for all gives
[TABLE]
for some sequence of functions . Plugging into (4.15) and integrating with respect to we get
[TABLE]
Let us fix , and denote
[TABLE]
Applying Theorem 3.5 in a setting where ,
[TABLE]
Theorem 3.1 applied to functions for provides -valued functions such that
[TABLE]
[TABLE]
We may now put
[TABLE]
The desired inequality for is obtained by integrating (4.20) and (4.19) with respect to , summing over and plugging into (4.17), and analogously for .
By integrating (4.16) with respect to we get
[TABLE]
We may now incorporate and into one variable running through the space . Since was equipped with the counting measure, also is, up to a constant. This puts us in the setting of Theorem 3.5 and allows to split the sequence of functions into an part and an one. Bearing in mind that
[TABLE]
we may apply Theorem 3.5 to obtain functions such that
[TABLE]
This allows us to take
[TABLE]
The desired inequalities for and are directly verified. By definition of , we have . They are also disjointly supported due to being -valued, which ends the proof.∎
4.2. The general case
We will now prove Theorem 4.3 in full generality. For brevity, we will denote by , variables running through by and write . For example, if , then
[TABLE]
Theorem 4.5**.**
For , let . Suppose that
[TABLE]
Then, treating as a function on , we have
[TABLE]
and can be chosen such that for any , the supports of for different are disjoint.
Proof. As previously, is a finite set with counting measure and are nonnegative. In order to show the first inequality of (4.27), we just need to check that each of the norms on functions on dominates the norm on the left hand side of (4.26). Indeed, if ,
[TABLE]
Here, we used abbreviations , , ). The inequality (4.29) is with respect to , (4.30) is , and (4.31) comes from the fact that for fixed , the integrand depends on only through .
We will now prove the second inequality of (4.27) by induction with respect to . Let us assume that the theorem is true for some . The discretization procedure is performed as previously. Let us take for , . We define by
[TABLE]
for and . For a fixed , applying the induction hypothesis to the functions , yields a family of functions such that
[TABLE]
[TABLE]
(we just take , because without loss of generality for all if ). We used another abbreviation: . Let us define
[TABLE]
where is taken with respect to the second variable running through .
Denote , , . Applying (4.35) at each , and then Theorem 3.5 at each and (treating the integral over as summation over a finite set) we get
[TABLE]
where
[TABLE]
For each and , we can apply Theorem 3.1 to functions . This produces such that
[TABLE]
Plugging this into the previous inequality, we get
[TABLE]
where the functions for are defined by
[TABLE]
Let us recall that by (4.34),
[TABLE]
for all and consequently
[TABLE]
for any and , which by (4.36) implies
[TABLE]
Therefore
[TABLE]
Ultimately, using the fact that is a lattice, we get
[TABLE]
as desired, with for some numerical constant . Once we have a decomposition verifying (4.27), for each we select such that
[TABLE]
Now, the functions
[TABLE]
are dominated by up to the constant and their sum over is . ∎
By an identical reasoning as previously, we get
Corollary 4.6**.**
Let and have a representation
[TABLE]
Then
[TABLE]
where the infimum is taken over decompositions of into summands and
[TABLE]
5. Interpolation of
We can extend the definition of spaces to the vector-valued setting. Let be a Banach space. Then we define as the closure of in the Bochner space . In particular, consists of functions of the form , where and . By combining Corollary 4.2 with Lemma 2.3, we get
Corollary 5.1**.**
Let , where is a Hilbert space. Then
[TABLE]
Definition 5.2**.**
Let and be generated by in . The subspace is said to have Bourgain-Pisier-Xu (BPX) property if is -closed in for some .
The following is a result of Xu [30, Proposition 11], based on pieces of reasoning by Bourgain [5] and Pisier [27].
Theorem 5.3** (Bourgain, Pisier, Xu).**
If has BPX property, then is of cotype 2 and every operator is 1-summing.
5.1. The case
As previously, we single out .
Theorem 5.4**.**
The couple
[TABLE]
is -closed in
[TABLE]
with a constant independent of .
Proof. For and , let . To shorten the notation, we will denote the underlying couples by and . Since
[TABLE]
we have
[TABLE]
Analogously
[TABLE]
Therefore we only have to prove
[TABLE]
for .
For any such , the decomposition is unique, because . Let , be defined by
[TABLE]
Then and we can treat as and as , by identification of with . Using the trivial part of Theorem 3.1 at each separately, we get
[TABLE]
where the last equivalence is Lemma 2.2 applied at each to the sequence of -valued independent mean [math] functions . Let
[TABLE]
be the decomposition given by Theorem 4.3. We can ensure that are of mean [math] in the first variable, because are and subtracting the underlying conditional expectation preserves (4.5)-(4.8). Let
[TABLE]
We have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Ultimately, we put
[TABLE]
By definition of , we have . Combining the above inequalities,
[TABLE]
as desired.∎
5.2. The general case
We are now prepared for the proof of the following, which by [30], is going to imply that is of cotype 2. In this subsection, are understood to depend on or .
Theorem 5.5**.**
The couple
[TABLE]
is -closed in
[TABLE]
with a constant independent of .
Proof. Let us take with a decomposition
[TABLE]
where
[TABLE]
By density argument, we may assume that vanishes outside of , which allows to formally be treated as an element of . Just as in the proof of Theorem 5.4, we reduce the problem to
[TABLE]
Again, we denote the restriction of to in the variable running through by and an analogous restriction of by . As previously, we calculate the right hand side in preparation to use Theorem 4.5.
[TABLE]
Here, the ‘’ inequality is an application of Corollary 5.1 at every . Since the -functional
[TABLE]
is a norm, we can without loss of generality fix , assume that
[TABLE]
and aim at proving
[TABLE]
If we treat as the -th set of variables, Theorem 4.5 applied to the sequence of functions in (we take unless ) gives a decomposition
[TABLE]
such that
[TABLE]
where correspond to subsets of not containing and correspond to subsets of containing . Just as remarked after the formulation of Theorem 4.3, we can modify , by setting
[TABLE]
and replacing by and by , where acts on the first variables and acts on the last. This operation is legal, because is a finite combination of conditional expectations. Moreover, by (5.2) and (5.6) it produces a decomposition of into summands that are in with respect to the first variables. Also, due to boundedness of in all mixed norms, the left hand side of (5.7) gets smaller up to a constant. Therefore, we can without loss of generality assume (5.8) and
[TABLE]
making them suitable for forming
[TABLE]
[TABLE]
both of which are in with respect to the first variables thanks to (5.9) and satisfy
[TABLE]
because of (5.6). Now, making use of Corollary 4.2 in (5.11) and (4.33) in (5.2),
[TABLE]
Similarly, using Corollary 5.1 in (5.13) and (4.33) in (5.2),
[TABLE]
Summing up the last two inequalities and connecting them with (5.7), we see that (5.10) defines a decomposition of verifying (5.5), which ends the proof. ∎
6. Interpolation of
For , the projection is not a Calderón–Zygmund operator because its norm on behaves as for and we know of no way to represent as such an operator. Nonetheless, we are able to show that Bourgain’s result [6] about -closedness of an image of a C-Z projection in holds for as well. Here, we present only the case of , while for the general the proof is, as previously, analogous but more technical.
Theorem 6.1**.**
The couple
[TABLE]
is -closed in
[TABLE]
One can easily recover -closedness of respective scalar-valued spaces by restricting to the subspace consisting of functions with values in . It is of independent interest that the proof below will show that a sum of only 3 of 4 interpolation summands appearing in Theorem 4.3 for also has a natural interpretation.
Proof.
Let . Then , where . Denoting by the restriction of to , we can put . Our goal is to prove
[TABLE]
Just like in the proof of the theorem about inteprolation of , by means of scaling in we can without loss of generality assume that . Then the right hand side is the norm on the space , so by the trivial part of Johnson-Schechtman inequality
[TABLE]
Let us fix for a moment. The right hand side equals . Therefore, by Marcinkiewicz-Zygmund inequality, the sum over is unconditional, which allows us to write
[TABLE]
The variables are independent, so by Johnson-Schechtman inequality, there are such that
[TABLE]
By a standard application of Theorem 3.5 for the second summand and trivially for the first,
[TABLE]
[TABLE]
for , where is taken with respect to . Since
[TABLE]
the first summand no longer features integration over an infinite product. Applying -valued Johnson-Schechtman inequality to the second summand gives such that
[TABLE]
Ultimately, taking , , we get
[TABLE]
and
[TABLE]
In order to get a decomposition for the -functional of Hoeffding subspaces, we put , , where
[TABLE]
Obviously,
[TABLE]
because are orthogonal. Moreover, by the trivial part of Johnson-Schechtman inequality,
[TABLE]
which plugged into (6.13) proves that satisfies the desired inequality.∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Adamczak, Moment inequalities for U 𝑈 U -statistics , Annals of Probability 2006, Vol. 34, No. 6, 2288–2314
- 2[2] R. Adamczak, R. Latała, The LIL for canonical U 𝑈 U -statistics , Ann. Probab., Volume 36, Number 3 (2008), 1023-1058
- 3[3] R. Adamczak, R. Latała, The LIL for U 𝑈 U -Statistics in Hilbert Spaces , J Theor Probab (2008) 21: 704. https://doi.org/10.1007/s 10959-007-0134-6
- 4[4] C. Bennett, R.Sharpley, Interpolation of operators , Academic Press, 1988.
- 5[5] J. Bourgain, New Banach space properties of the disc algebra and H ∞ superscript 𝐻 H^{\infty} , Acta Math. 152 (1984) 1-48.
- 6[6] J. Bourgain, Some consequences of Pisier’s approach to interpolation , Israel Journal of Mathematics 77 (1992), 165-185
- 7[7] J. Bourgain, Walsh subspaces of L p superscript 𝐿 𝑝 L^{p} -product spaces , Séminaire Analyse fonctionnelle (dit ”Maurey-Schwartz”) (1979-1980): 1-14.
- 8[8] I. Devan, B. L. S. P. Rao, Central limit theorem for U-statistics of associated random variables , Statistics & Probability Letters Volume 57, Issue 1, 1 March 2002, Pages 9-15
