Two Remarks on Primary Spaces
Paul F.X. Mueller

TL;DR
This paper investigates the factorization properties of operators on certain Banach spaces, proving that the identity operator factors through any operator or its complement, and offers combinatorial proofs replacing previous reliance on Szemeredi's theorem.
Contribution
It extends factorization results to spaces (H^p(T)) for 1<p<, using combinatorics of dyadic intervals instead of Szemeredi's theorem.
Findings
Identity factors through any operator or its complement on (H^1(T)).
Analogous results are established for (H^p(T))) spaces for 1<p<.
Combinatorial methods replace the dependence on Szemeredi's theorem.
Abstract
We prove that for any operator on , the identity factores through or . We re-prove analogous results of H.M. Wark for the spaces , . In the present paper direct combinatorics of colored dyadic intervals replaces the dependence on Szemeredi's theorem in the work of H. M. Wark.
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
TopicsAdvanced Banach Space Theory · Advanced Harmonic Analysis Research · Mathematical Analysis and Transform Methods
Two Remarks on Primary Spaces
Paul F. X . Müller 111Partly supported by FWF -project P 20166-N18
(October 2009.)
Abstract
We prove that for any operator on the identity factores through or
We re-prove analogous results of H.M. Wark for the spaces In the present paper direct combinatorics of colored dyadic intervals replaces the dependence on Szemeredi’s theorem in [8].
MSC 2000: 46B25, 46E40
Key words: Primary Spaces, Factorization of Operators, Haar System.
Contents
- 1 Introduction
- 2 Notation and Preliminaries
- 3 Factorization through Operators on .
- 4 Factorization through Operators on
1 Introduction
Consider consisting of bounded valued sequences, and let be a continuous linear operator acting on that space. The identity on factores then through or This assertion holds true for the range and also when is replaced by the dual space See J. Bourgain [2], H.M. Wark [8] and [6, 5]. As a consequence for each the space is primary. When this class of spaces arises when the Pelczynski decomposition method is applied to or its complemented subspaces.
The conceptual framework for proving these results was introduced by J . Bourgain [2]. It consists of two basic steps and aims at replacing the factorization problem on by its localized, finite dimensional counterpart. The first step is to show that general operators on can be replaced by diagonal operators on
[TABLE]
The second (and often harder) part of the argument is to verify the following property for operators acting on finite dimensional spaces. To each and there exists so that for any linar operator on , the identity on can be well-factored through or through That is,
[TABLE]
where or and
The methods yielding (LABEL:factorization) fall roughly into two classes. The first one works is by restriction: One selects a large subset of a basis in on which the operator acts as a multiplier. The second method uses averaging or blocking : One attempts to find *block bases * forming a set of approximate eigenvectors. The three cases and were treated by separate techniques as summarized below:
The case By harmonic analysis J. Bourgain [2] proves that there exists and an arithmetic progression of length in so that the restriction of to the exponentials satisfies
[TABLE] 2. 2.
The case As an application of Szemeredi’s theorem [7], H.M. Wark [8] obtains and an arithmetic progression of length in so that the restriction of to the exponentials satisfies similarly with Here the error is small in
The boundedness of the Hilbert transform [12] allows us to replace in (LABEL:factorization) the spaces of analytic polynomials respectively finite dimensional Minkowski spaces of the corresponding dimensions. Now apply J. Bourgain’s and L. Tzafriri’s results on restricted invertibility. To any linear operator there exist [3] random subsets of of cardinality so that the restriction of to the corresponding unit vectors satisfies
[TABLE] 3. 3.
The case of By Bochkarev’s theorem [1, Section 4], the spaces admit an unconditional basis that is equivalent to the Haar basis in dyadic Exploiting this connection [5], yields a block basis in well-equivalent to the Bochkarev basis in on which the given operator acts as
[TABLE]
In this note we adapt the blocking of the Haar basis to the spaces First we settle the case of left open in [8]. After the reduction to diagonal operators, this is obtained with Bochkarev’s theorem [1, Section 4], and reduction to [5, Theorem 2]. Second, we re-prove results of H. M. Wark [8]. We find our block bases directly, working with the Haar system; thus we provide an alternative to the method based on Szemeredi’s theorem, and also to the restricted invertibility methods.
2 Notation and Preliminaries
The Haar System.
We let denote the collection of (half-open) dyadic intervals contained in the unit interval
[TABLE]
For write Denote by the normalized Haar system, where is supported on and
[TABLE]
The Haar system is a Schauder basis in and an unconditional Schauder basis when For define its dyadic square function as
[TABLE]
Then, where and see e.g., [6, Chapter 1].
To and we denote by the linear span of equipped with the norm in
spaces.
Dyadic is defined by the relation if and its norm is
[TABLE]
Let We denote by the subspace of that is spanned by endowed with the norm in
Let For let denote the norm closure in of The space is the weak closure in of As a consequence of the boundedness of the Hilbert transform [12] the spaces and are isomorphic. By B. Maurey’s theorem [4] the spaces and dyadic are isomorphic.
For we denote by the subspace of that is spanned by the polynomials The norm on is the one induced by
The Theorem of Bochkarev.
The trigonometric system does not form a Schauder basis in with basis constant independent of see [12]. Nevertheless the theorem of S.V. Bochkarev [1] asserts that the spaces admit an unconditional basis well equivalent to the Haar basis in That is, there exists a system of functions so that the linear extension of the operator
[TABLE]
is bijective and defines an isomorphism with norm (and norm of the inverse) bounded independent of Thus
[TABLE]
Diagonal operators.
Let We say that is a diagonal operator if there exists a sequence of opertors so that
[TABLE]
Dyadic Trees.
Let We say that is a dyadic tree of sets if, the following conditions hold for every If is the left half of and then
[TABLE]
Lower estimates.
[6, Chapter 5] Let , and suppose that the sequence is disjointly supported over the Haar system. Then
[TABLE]
The Carleson Constant.
Let and a dyadic tree. The Carleson constant of is defined as
[TABLE]
Projections and Large Carleson Constants.
See [6, Chapter 1, 3]. Fix and let for be pairwise disjoint collections consisting of pairwise disjoint dyadic intervals, so that
[TABLE]
satisfy the following conditions:
The collection is a dyadic tree satisfying
[TABLE] 2. 2.
For each
[TABLE]
where is the left half of and
Then [6, Chapter 1] the orthogonal projection
[TABLE]
is a bounded operator on and on with norm respectively
Let next and
[TABLE]
By the condensation lemma in combination with the Gamlen-Gaudet theorem the following implication holds true, see [6, Chapter 3]. If is such that then there exist linear operators and so that
[TABLE]
3 Factorization through Operators on
.
In this section we prove that for any operator on the identity factores through or
Theorem 3.1
Let be a bounded operator on with Then there exist an embedding and a projection so that
[TABLE]
where or and
Infer from Maurey’s theorem [4] that can be replaced by dyadic and from Wojtaszczyk’s theorem [10, 11] that is isomorphic to
First we give the reduction of Theorem LABEL:27okt1 to diagonal operators on
[TABLE]
Theorem 3.2
Let be a bounded operator on with Then there exist an embedding a projection and a diagonal operator satisfying and
[TABLE]
where
It is well known that the diagonal operator together with its embedding and projection can be constructed in straightforward manner from the assertions of the following proposition.
Proposition 3.3
To and there exists with the following property: To each dimensional subspace there exist pairwise disjount collections of dyadic intervals so that
The sets form a dyadic tree satisfying 2. 2.
The orthogonal projection
[TABLE]
satisfies 3. 3.
For each
[TABLE]
Proof. Let and be an net in This can be done with
Fix and put Apply (LABEL:lowerl2) to obtain an upper estimate for the cardinality of
[TABLE]
for some Hence the union is of cardinality Put Its Carleson constant is bounded from below as
[TABLE]
In the next steps we select a subcollection with the following two properties
2. 2.
For
[TABLE]
The construction of is done inductively over steps. In the first step we fix and let with be an enumeration of the intervals in Define inductively a stopping time sequence as follows. Put and
[TABLE]
Assume that have been determined and that Then define
[TABLE]
Finally define
[TABLE]
We use again (LABEL:lowerl2). Split along the Haar basis as Note that are disjointly supported over the Haar system so that the lower estimate (LABEL:lowerl2) gives
[TABLE]
Hence Define next the partition of as where Consequently there exists so that Put Summing up the first step, we obtained so that
[TABLE]
and
[TABLE]
This completes the first step. In the second step we repeat the argument of the first step with replaced by and replaced by This implies the existence of so that
[TABLE]
and
[TABLE]
Iterating times we obtain a decreasing chain of collections so that
[TABLE]
and
[TABLE]
We specify now so that Consequently there exists so that
[TABLE]
Next we apply the condensation lemma and the Gamlen-Gaudet selection process [6, Chapter 3] to
This implies that there exist so that and satisfy the following conditions:
is a dyadic tree and
[TABLE] 2. 2.
and where is the left half of and
Next we claim that moreover
[TABLE]
To see this fix with Choose so that and estimate using the defining properties of
[TABLE]
It remains to verify that for Using the above coefficient estimate and triangle inequality we get,
[TABLE]
We have now reduced the problem of factoring the identity on to its finite dimensional counterpart. The next step in the proof is factorization of the identity on The following theorem settles a point left open in [8].
Theorem 3.4
For any there exists such that for any linear operator the identity on factores through or as
[TABLE]
where and are bounded linear operators saitsfying
[TABLE]
Proof. Apply the theorem of S.V. Bochkarev [1, Section 4], and dualize [5, Theorem 2].
4 Factorization through Operators on
In this section we re-prove the theorem of H.M. Wark [8] that for any bounded operator on the identity factores through or
Theorem 4.1
Let be a bounded operator on with Then there exist an embedding and a projection so that
[TABLE]
where or and
It is well known that Theorem LABEL:37okt1 follows from the next theorem.
Theorem 4.2
For any and any there exists so that for any linear operator the identity on factores through or as
[TABLE]
where and are bounded linear operators satisfying
We obtain the finite dimensional factorization of Theorem LABEL:Lp by exhibiting a block-basis of the Haar system on which acts as a multiplier. We use combinatorics of colored dyadic intervals as in [6]. (For an alternative derivation see the appendix.) The desired block bases are constructed below.
Theorem 4.3
For every and there exists so that the following holds true: To every linear operator bounded by there exist pairewise disjoint collections
[TABLE]
consisting of pairwise disjoint intervals so that
[TABLE]
satisfy the following conditions:
The collection is a dyadic tree satisfying
[TABLE] 2. 2.
For each
[TABLE]
where is the left half of and 3. 3.
For each
[TABLE]
The following Lemma LABEL:thin is the main component in the proof of Theorem LABEL:gg. Fix and Let and so that
[TABLE]
Define to be the collection of dyadic intervals for which the Haar coefficients of resectively are above the critical threshold thus
[TABLE]
Lemma 4.4
Let and put
[TABLE]
There exists so that the collection satisfies
[TABLE]
Proof. Assume that the lemma is false. That is, for each we have
[TABLE]
For there holds Hence by summing the lower estimate (LABEL:16okt2) we obtain
[TABLE]
On the other hand it follows from the unconditionality of the Haar system in that for any choice of
[TABLE]
Invoking the assumptions that and , the unconditionality of the Haar system (LABEL:16okt4) yields the following upper estimate for the Haar coefficients competing with (LABEL:16okt3),
[TABLE]
Comparison of (LABEL:16okt3) with (LABEL:16okt5) gives an upper estimate for as follows,
[TABLE]
By cancellation and arithmetic we get contradicting the initial choice of
Proof of Theorem LABEL:gg.
Put and At stage we are given pairwise disjoint collections of dyadic intervals in and functions so that
[TABLE]
Fix and Put
[TABLE]
and define the collections of good intervals as follows
[TABLE]
By Lemma LABEL:thin there exists
[TABLE]
so that the collection of dyadic intervals
[TABLE]
satisfies the lower estimate
[TABLE]
Next we define the collection of dyadic intervals and the associated function using to the well known Gamlen Gaudet construction. In case is even we put
[TABLE]
Similarly if is odd, we put
[TABLE]
Since our construction so far, implies that satisfies the almost orthogonality relation
[TABLE]
In view of (LABEL:16okt6) and (LABEL:16okt7) we may now repeat the induction step. Taking into account the (cummulative effect of) the lower estimate (LABEL:16okt8) and (LABEL:27okt11) it is easy to see that we may choose large enough so that we may continue iterating until we reach step The system satisfies then the full set of almost orthogonalty relations
[TABLE]
It remains to relabel the collections and functions appropriately. Since and define uniquely
[TABLE]
we obtain a canonical bijection between and We relabel accordingly using this correspondence,
[TABLE]
As a result of the Gamlen Gaudet construction the sets
[TABLE]
form a dyadic tree, and the conditions (LABEL:16okt8) translate into a measure estimate
[TABLE]
By (LABEL:22okt1)—(LABEL:22okt3), the orthogonal projection
[TABLE]
is bounded operator on with norm
Proof of Theorem LABEL:Lp.
Fix and put Determine so that the conclusion of Theorem LABEL:gg holds true. Accordingly we may select pairewise disjoint collections consisting of pairwise disjoint intervals so that conditions (LABEL:22okt11)–(LABEL:22okt14) hold true.
Next define the collections
[TABLE]
and Clearly, then and hence, one of these collections satisfies a lower estimate for its Carleson Constant,
[TABLE]
We continue under the assumption that the first alternative holds and remark that otherwise we would replace by and continue with the argument given below. Define, then, the space
[TABLE]
Since , (LABEL:22okt1)–(LABEL:22okt4) imply that there exist linear operators
[TABLE]
so that and On define the operator
[TABLE]
By choice of we get with (LABEL:22okt1)–(LABEL:22okt3) that
[TABLE]
We will verify next that for
[TABLE]
To this end fix and expand as
[TABLE]
Next let hence Put
[TABLE]
and define the error term
[TABLE]
Then, by arithmetic we get
[TABLE]
Since and whenever we obtain with triangle inequality, the following estimate for the off-diagonal term,
[TABLE]
which gives (LABEL:22okt21).
Appendix: Reviewing restricted invertibility.
A proof of Theorem LABEL:Lp follows directly from the random methods of J. Bourgain and L. Tzafriri [3] on restricted invertibility of matrices.
Theorem 4.5
For any and any there exists so that for any linear operator the identity on factores through or as
[TABLE]
where and are bounded linear operators satisfying
[TABLE]
Proof. The operator has matrix representation with respect to , the unit vector basis of Define and Thus the cardinality of or is at least Assume without loss of generality that (Otherwise replace by and proceed as below.) Put Clearly, there exist now linear operators and and an operator satisfying the following conditions: First, factores through as
[TABLE]
and, second,
[TABLE]
Now we apply the theorem of J. Bourgain and L. Tzafriri [3] on restricted invertibility to the operator To each given it yields the existence of a constant and subset so that and is invertible (on its range) and satisfies
[TABLE]
(Here denotes the operator of restriction to basis vectors ) Now put By restricted invertibility there are now operators and so that the identity on factores through as
[TABLE]
In summary, we obtained the factorization through
[TABLE]
Address:
Institut für Analysis
J. Kepler Universität
A-4040 Linz
Austria.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. V. Bochkarev. Construction of polynomial bases in finite-dimensional spaces of functions analytic in the disk. Trudy Mat. Inst. Steklov. , 164:49–74, 1983. Orthogonal series and approximations of functions.
- 2[2] J. Bourgain. On the primarity of H ∞ superscript 𝐻 H^{\infty} -spaces. Israel J. Math. , 45(4):329–336, 1983.
- 3[3] J. Bourgain and L. Tzafriri. Invertibility of “large” submatrices with applications to the geometry of Banach spaces and harmonic analysis. Israel J. Math. , 57(2):137–224, 1987.
- 4[4] B. Maurey. Isomorphismes entre espaces H 1 superscript 𝐻 1 H^{1} . Acta Math. , 145(1-2):79–120, 1980.
- 5[5] P. F. X. Müller. On projections in H 1 superscript 𝐻 1 H^{1} and BMO. Studia Math. , 89(2):145–158, 1988.
- 6[6] P. F. X. Müller. Isomorphisms between H 1 superscript 𝐻 1 H^{1} spaces , volume 66 of Mathematics Institute of the Polish Academy of Sciences. Mathematical Monographs (New Series) . Birkhäuser Verlag, Basel, 2005.
- 7[7] E. Szemerédi. On sets of integers containing no k 𝑘 k elements in arithmetic progression. Acta Arith. , 27:199–245, 1975. Collection of articles in memory of Juri Vladimirovic Linnik.
- 8[8] H. M. Wark. The l ∞ superscript 𝑙 l^{\infty} direct sum of L p superscript 𝐿 𝑝 L^{p} ( 1 < p < ∞ ) 1 𝑝 (1<p<\infty) is primary. J. Lond. Math. Soc. (2) , 75(1):176–186, 2007.
