1-Greedy renormings of Garling sequence spaces
Fernado Albiac, Jos\'e L. Ansorena, Ben Wallis

TL;DR
This paper demonstrates that Garling sequence spaces can be renormed to have a 1-greedy basis and explores their properties related to convexity and superreflexivity, using non-linear greedy approximation tools.
Contribution
It introduces a new renorming of Garling sequence spaces making their basis 1-greedy and applies non-linear methods to analyze their linear structure.
Findings
Garling sequence spaces admit a 1-greedy renorming
The spaces exhibit properties related to uniform convexity and superreflexivity
Non-linear tools from greedy approximation provide insights into their linear structure
Abstract
Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is 1-greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In particular, our approach to the study of the superreflexivity of Garling sequence space provides an example of how essentially non-linear tools from greedy approximation can be used to shed light into the linear structure of the spaces.
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 · Approximation Theory and Sequence Spaces · Optimization and Variational Analysis
-Greedy renormings of Garling sequence spaces
Fernando Albiac
Mathematics Department
Universidad Pública de Navarra
Campus de Arrosadía
Pamplona
31006 Spain
,
José L. Ansorena
Department of Mathematics and Computer Sciences
Universidad de La Rioja
Logroño
26004 Spain
and
Ben Wallis
University of North Illinois
USA
Abstract.
We show that all Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is -greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In particular, our approach to the study of the superreflexivity of Garling sequence space provides an example of how essentially non-linear tools from greedy approximation can be used to shed light into the linear structure of the spaces.
Key words and phrases:
subsymmetric basis, greedy basis, renorming, Property (A), sequence spaces, superreflexivity, uniform convexity
2010 Mathematics Subject Classification:
46B15, 41A65
Research partially supported by the Spanish Research Grant Análisis Vectorial, Multilineal y Aplicaciones, reference number MTM2014-53009-P. F. Albiac also acknowledges the support of Spanish Research Grant Operators, lattices, and structure of Banach spaces, with reference MTM2016-76808-P
1. Introduction and background
A semi-normalized basis of a Banach space is said to be -greedy under renorming (-GUR, for short) if there is an equivalent norm on (i.e., a renorming of ) with respect to which is -greedy, i.e.,
[TABLE]
for any , any finite such that whenever and , and any with .
A problem that goes back to [AW2006] is to determine if a given (greedy) basis is -GUR. For symmetric bases the answer to this problem is positive and quite simple because -symmetric bases are -greedy and every symmetric basis becomes -symmetric under a suitable renorming; thus any symmetric basis is -GUR.
For subsymmetric bases the situation is different. Taking into account the relation between the constants involved (see e.g. [AlbiacKalton2016]*Chapter 10) one immediately sees that -subsymmetric bases are always -greedy. Hence, since any subsymmetric basis becomes -subsymmetric under a suitable renorming, we have that any subsymmetric basis is -GUR.
Let us now put our problem into context by summarizing its backgroung. Albiac and Wojtaszczyk exhibited in [AW2006] an example of a -subsymmetric basis that is not -greedy. Later on, Dilworth et al. constructed in [DOSZ2011] an example of a subsymmetric basis which, in spite of not being symmetric, was -greedy. Therefore a natural question in the theory is to determine if a particular subsymmetric (and non-symmetric) basis is -GUR.
Recently, the authors have investigated in [Wallis2017] the geometric properties of a class of Banach spaces, called Garling sequence spaces, in which the canonical basis is subsymmetric but not symmetric. In this note we further the study of the greedy behavior of subsymmetric bases and investigate Garling sequence spaces from the point of view of the greedy algorithm. To be precise in Section 3 we prove that the canonical basis of Garling sequence spaces is -GUR. In Section 2 we use the properties of the democracy functions of these spaces to give a necessary condition for them to be super-reflexive. In addition, we prove that Garling sequence spaces are never uniformly convex.
It is worth pointing out that investigating greedy renormings of non-subsymmetric bases is also of interest. Indeed, the starting problem of this theory, posed in [AW2006] and as of today still unsolved, is to determine if the Haar system in , , is a -GUR basis. Recall that the Haar system in is greedy [Temlyakov1998] but it is not subsymmetric [KadetsPel1962]. The most significant advances in the study of greedy renormings of non-subsymmetric bases were also achieved in [DOSZ2011]. Here the authors found examples of non-subsymmetric greedy bases which are not -GUR (like the Haar basis in the dyadic Hardy space and the canonical basis of the Tsirelson space), and of a non-subsymmetric greedy basis which is -GUR (namely, the canonical basis of the space ).
Throughout this article we use standard facts and notation from Banach spaces and approximation theory. We refer the reader to e.g. [AlbiacKalton2016, LinTza1977, LinTza1979] for the necessary background. Next we single out the notation that it is more heavily employed. We will denote by the real or complex field. We denote by the canonical basis of , i.e., , were if and otherwise. The domain of a function will be denoted by , while denotes its range. Given families of positive real numbers and , the symbol for means that , while for means that and for .
2. Superreflexivity in Garling sequence spaces
Let us consider the set of weights
[TABLE]
Given and the Garling sequence space is defined as the Banach space consisting of all scalar sequences such that
[TABLE]
where denotes the set of all increasing functions from to . If and are clear from context, the norm of the space will be shortened to . The isomorphic structure of these Banach spaces, which generalize an example of Garling from [Garling1968], has been recently studied in [Wallis2017].
Theorem 2.1 below gathers a few properties of Garling sequence spaces that are of interest for the purposes of this paper.
Recall that given a basis for a Banach space , the lower democracy funtion and the upper democracy funtion of are defined, respectively, by
[TABLE]
and
[TABLE]
and that is -democratic if and only if for all .
Recall also that a weight is said to be regular if there is a constant such that
[TABLE]
Theorem 2.1** (see [Wallis2017]).**
Let and . Then:
- (i)
The canonical basis is a -subsymmetric basis of .
- (ii)
If both and are regular weights then is not symmetric in .
- (iii)
* for all .*
- (iv)
* is reflexive if and only if .*
- (v)
Any subsymmetric basis of is equivalent to its canonical basis.
- (vi)
For every there is a sublattice of that is -lattice isomorphic to and -lattice complemented in .
Let us get started by using the democracy functions to obtain some embedding results.
Proposition 2.2**.**
Let . Let , with regular. Then if and only if for .
Proof.
If the embedding is continuous and so
[TABLE]
Appealing to Theorem 2.1 (iii) we get
[TABLE]
The converse is obvious. ∎
Corollary 2.3**.**
Let . Let , .
- (i)
* if and only if .*
- (ii)
Assume that both and are regular and that . Then for .
Proof.
(i) is a consequence of Theorem 2.1 (v), and (ii) is straightforward from Proposition 2.2. ∎
Proposition 2.4**.**
The space fails to be uniformly convex for any and any .
Proof.
For put
[TABLE]
and consider the vectors
[TABLE]
and
[TABLE]
Observe that
[TABLE]
Since , to show that fails to be uniformly convex, it suffices to find an increasing sequence of integers such that and for all .
Due to we have
[TABLE]
Hence, we could find a subsequence such that
[TABLE]
Now, fix any . By definition of and due to , either , or else we could find with
[TABLE]
so that anyway. Observing that
[TABLE]
finishes the proof.∎
Enflo proved in [Enflo1973] that a Banach space is superreflexive if and only if it is uniformly convex under a suitable renorming. Having shown that is never uniformly convex, and in light of the above identification between superreflexivity and uniform convexifiability, the next natural question to ask is: Given , can we ever choose so that is superreflexive?
We tackle this issue by using well-known properties of the democracy functions of bases in Banach spaces. Following [DKKT2003] we say that a sequence of positive numbers has the lower regularity property (LRP for short) if there is an integer with
[TABLE]
Our next Proposition establishes the close relation between a weight being regular and its primitive weight given by having the LRP. Recall that is essentially decreasing if there is a constant with for .
Proposition 2.5**.**
Let be the primitive weight of an essentially decreasing weight . The following are equivalent.
- (a)
There is such that for all .
- (b)
For every there is with for all .
- (c)
* has the LRP.*
- (d)
There is and with for all .
- (e)
There exists such that is essentially increasing.
- (f)
* is a regular weight.*
- (g)
* is a regular weight.*
Proof.
Taking into account [Altshuler1975]*Theorem 1 and [AA2016]*Lemma 2.12, we must only prove (a) (g). Assume that for some , some and all . Let . We have
[TABLE]
for all . ∎
Lemma 2.6**.**
Let and . Then is -convex and it is not -convex for any .
Proof.
By Theorem 2.1 (vi), the space contains as a sublattice hence it is not -convex for any . Showing that is -convex is straightforward. ∎
Proposition 2.7**.**
Let and . The following are equivalent.
- (a)
* is superreflexive.*
- (b)
* has non-trivial cotype.*
- (c)
* has non-trivial cotype.*
Proof.
(b) (c) Assume that has cotype for some . Then, satisfies satisfies a lower -estimate. Since
[TABLE]
it follows that satisfies a lower -estimate. By [LinTza1979]*Proposition 1.f.3 and Theorem 1.f.7, has cotype whenever and .
(c) (a) Assume that has cotype . Arguing as before, we claim that satisfies a lower -estimate. Taking into account Lemma 2.6, we infer from [LinTza1979]*Theorem 1.f.10 that is superreflexive.
(a) (b) is a well known consequence of [MP1976]*Theorem 1.1. ∎
The key ingredient in the proof of the next theorem is the link between the (Rademacher) type/cotype of a space and the regularity properties of the democracy functions of its almost greedy bases (see [DKKT2003]).
Theorem 2.8**.**
Let and be such that is superreflexive. Then is a regular weight.
Proof.
The space has finite cotype by Proposition 2.7. Combining [DKKT2003]*Proposition 4.1 and Theorem 2.1 (c) yields that has the LRP. Then, by Proposition 2.5, is a regular weight. ∎
Corollary 2.9**.**
Let and be non-regular. Then is finitely representable in .
Proof.
By Corollary 2.8, is not superreflexive. Then, by Proposition 2.7, has trivial cotype. The proof is over by appealing to [MP1976]*Theorem 1.1. ∎
Remark 2.10*.*
Corollary 2.9 could alternatively be shown by following the steps of the proof from [Altshuler1975] that is not superreflexive if fails to be regular. Altshuler’s method leads to the following result: for each , each non-regular weight , each , and each there is a constant-coefficient finite block basic sequence of the canonical basis of that is -equivalent to the canonical basis of . We would also like to point out that the fact that is superreflexive only if is regular can be obtained using intrinsic ideas from this manuscript.
3. Greedy renormimgs of Garling sequence spaces
Given a basis for and , in we say that is a greedy permutation of if we can write
[TABLE]
for some , some sets of integers and of the same finite cardinality with , some signs and , and some scalar such that . If, in addition, , we say that is a disjoint greedy permutation of . In other words, is a disjoint greedy permutation of if is obtained from by moving those terms of (or some of them) whose coefficients are maximum in absolute value to gaps in the support of . We are also allowed to change the sign of (some of) the terms we move. Then, the basis is said to satisfy Property (A) if whenever is a disjoint greedy permutation of . Actually, has Property (A) if and only if whenever is a greedy permutation of then (which is the way Property (A) was originally defined in [AW2006]). Property (A) is stronger than democracy. Albiac and Wojtaszczyk [AW2006] proved that a basis is -greedy if and only if is -suppression unconditional and has Property (A).
As an immediate consequence of Theorem 2.1 (i) we obtain that the canonical basis of is -greedy. However, it is never -greedy as we see next.
Lemma 3.1**.**
The canonical basis of , and , is not -greedy.
Proof.
Choose and with for and . Pick and put and . Consider for each the translation map given by . Let
[TABLE]
and
[TABLE]
Notice that is a greedy rearrangement of . Hence, assuming that is -greedy, yields . We infer that and . Then we reach the absurdity . ∎
In order to give more relevance to Theorem 3.2, it would be convenient to recall that under a natural condition on the weight the canonical basis is not a symmetric basic sequence of (see Theorem 2.1 (ii)).
Theorem 3.2**.**
Let and be a regular weight. Then there is a renorming of with respect to which the canonical basis is -greedy and -subsymmetric.
Before proving Theorem 3.2 we shall introduce some additional notation. Suppose , and let be a family of positive scalars. Given a family of scalars , where , we put
[TABLE]
Given , denote by the set of all increasing functions from the integer interval into . Put and . Note that for all ,
[TABLE]
where . Let be the set of all increasing functions from a subset of into . Given consider the linear operator defined by , where, if ,
[TABLE]
Note that if the canonical basis of a sequence space is -unconditional and verifies then is a -subsymmetric basic sequence in .
Proof of Theorem 3.2.
Let and put
[TABLE]
For define
[TABLE]
We have that is non-increasing, that for , and that
Given , let us denote by the set of pairs , where and verify , , and .
Consider also the set of triads , where , for some , and . Note that the mapping where and are determined by
[TABLE]
is a bijection from onto .
Given and , we define
[TABLE]
Let be the element in that corresponds to by the relation (3.2). We have
[TABLE]
Put and define
[TABLE]
We have
[TABLE]
and
[TABLE]
Hence is a renorming of .
Next we go on to substantiate the following Claim:
Claim. Let and such that for every . Then
[TABLE]
Assume, without loss of generality that . Pick for some . Let and be the restriction of to . We have for some , that
[TABLE]
and that
[TABLE]
Hence .
If we are done. Assume that . Let and be the restriction of to . Notice that . If put
[TABLE]
and, otherwise, put . If there is a (unique) with , put
[TABLE]
and, otherwise, put . Taking into account that and that , and that ,
[TABLE]
as desired.
Now we are ready to prove that is -greedy with respect to the norm . Since it is -unconditional, we must only show that it has Property (A). To that end if suffices to see that
[TABLE]
for every with , every sign , and every with .
In order to compute , taking into account the Claim, we can and we do restrict our attention to with and . In particular, we have . Choose . We have and
[TABLE]
Hence,
[TABLE]
We obtain (3.3) by taking the supremum on .
Let us prove that the canonical basis is -subsymmetric with respect to the norm . Let , and . Since , we have . Moreover
[TABLE]
and
[TABLE]
so that Consequently, . ∎
Problem 3.3*.*
Does every Banach space with a subsymmetric basis admit a -greedy renorming?
{bibsection} AlbiacF.AnsorenaJ. L.Lorentz spaces and embeddings induced by almost greedy bases in banach spacesConstr. Approx.4320162197–215@article{AA2016, author = {Albiac, F.}, author = {Ansorena, J. L.}, title = {Lorentz spaces and embeddings induced by almost greedy bases in Banach spaces}, journal = {Constr. Approx.}, volume = {43}, date = {2016}, number = {2}, pages = {197–215}} AlbiacF.AnsorenaJ.L.WallisB.On garling sequence spacesarXiv:1703.07772 [math.FA]@article{Wallis2017, author = {Albiac, F.}, author = {Ansorena, J.L.}, author = {Wallis, B.}, title = {On Garling sequence spaces}, journal = {arXiv:1703.07772 [math.FA]}} AlbiacF.KaltonN. J.Topics in banach space theory, 2nd revised and updated editionGraduate Texts in Mathematics233Springer International Publishing2016xx+508@book{AlbiacKalton2016, author = {Albiac, F.}, author = {Kalton, N. J.}, title = {Topics in Banach space theory, 2nd revised and updated edition}, series = {Graduate Texts in Mathematics}, volume = {233}, publisher = {Springer International Publishing}, date = {2016}, pages = {xx+508}} AlbiacF.WojtaszczykP.Characterization of 1-greedy basesJ. Approx. Theory1382006165–86@article{AW2006, author = {Albiac, F.}, author = {Wojtaszczyk, P.}, title = {Characterization of 1-greedy bases}, journal = {J. Approx. Theory}, volume = {138}, date = {2006}, number = {1}, pages = {65–86}} AltshulerZ.Uniform convexity in lorentz sequence spacesIsrael J. Math.2019753-4260–274@article{Altshuler1975, author = {Altshuler, Z.}, title = {Uniform convexity in Lorentz sequence spaces}, journal = {Israel J. Math.}, volume = {20}, date = {1975}, number = {3-4}, pages = {260–274}} DilworthS. J.KaltonN. J.KutzarovaDenkaTemlyakovV. N.The thresholding greedy algorithm, greedy bases, and dualityConstr. Approx.1920034575–597@article{DKKT2003, author = {Dilworth, S. J.}, author = {Kalton, N. J.}, author = {Kutzarova, Denka}, author = {Temlyakov, V. N.}, title = {The thresholding greedy algorithm, greedy bases, and duality}, journal = {Constr. Approx.}, volume = {19}, date = {2003}, number = {4}, pages = {575–597}} DilworthS. J.OdellE.SchlumprechtTh.ZsákA.Renormings and symmetry properties of 1-greedy basesJ. Approx. Theory163201191049–1075@article{DOSZ2011, author = {Dilworth, S. J.}, author = {Odell, E.}, author = {Schlumprecht, Th.}, author = {Zs{'a}k, A.}, title = {Renormings and symmetry properties of 1-greedy bases}, journal = {J. Approx. Theory}, volume = {163}, date = {2011}, number = {9}, pages = {1049–1075}} EnfloP.Banach spaces which can be given an equivalent uniformly convex normProceedings of the International Symposium on Partial Differential Equations and the Geometry of Normed Linear Spaces (Jerusalem, 1972)Israel J. Math.131972281–288 (1973)@article{Enflo1973, author = {Enflo, P.}, title = {Banach spaces which can be given an equivalent uniformly convex norm}, booktitle = {Proceedings of the International Symposium on Partial Differential Equations and the Geometry of Normed Linear Spaces (Jerusalem, 1972)}, journal = {Israel J. Math.}, volume = {13}, date = {1972}, pages = {281–288 (1973)}} GarlingD. J. H.Symmetric bases of locally convex spacesStudia Math.301968163–181@article{Garling1968, author = {Garling, D. J. H.}, title = {Symmetric bases of locally convex spaces}, journal = {Studia Math.}, volume = {30}, date = {1968}, pages = {163–181}} KadecM.I.PełczyńskiA.Bases, lacunary sequences and complemented subspaces in the spaces Studia Math.211961/1962161–176@article{KadetsPel1962, author = {Kadec, M.I.}, author = {Pe{\l}czy{'n}ski, A.}, title = {Bases, lacunary sequences and complemented subspaces in the spaces }, journal = {Studia Math.}, volume = {21}, date = {1961/1962}, pages = {161–176}} LindenstraussJ.TzafririL.Classical banach spaces. iSequence spaces; Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 92Springer-Verlag, Berlin-New York1977xiii+188@book{LinTza1977, author = {Lindenstrauss, J.}, author = {Tzafriri, L.}, title = {Classical Banach spaces. I}, note = {Sequence spaces; Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 92}, publisher = {Springer-Verlag, Berlin-New York}, date = {1977}, pages = {xiii+188}} LindenstraussJ.TzafririL.Classical banach spaces. iiErgebnisse der Mathematik und ihrer Grenzgebiete [Results in Mathematics and Related Areas]97Function spacesSpringer-Verlag, Berlin-New York1979x+243@book{LinTza1979, author = {Lindenstrauss, J.}, author = {Tzafriri, L.}, title = {Classical Banach spaces. II}, series = {Ergebnisse der Mathematik und ihrer Grenzgebiete [Results in Mathematics and Related Areas]}, volume = {97}, note = {Function spaces}, publisher = {Springer-Verlag, Berlin-New York}, date = {1979}, pages = {x+243}} MaureyB.PisierG.Séries de variables aléatoires vectorielles indépendantes et propriétés géométriques des espaces de banachFrenchStudia Math.581976145–90@article{MP1976, author = {Maurey, B.}, author = {Pisier, G.}, title = {S'eries de variables al'eatoires vectorielles ind'ependantes et propri'et'es g'eom'etriques des espaces de Banach}, language = {French}, journal = {Studia Math.}, volume = {58}, date = {1976}, number = {1}, pages = {45–90}} TemlyakovV. N.The best -term approximation and greedy algorithmsAdv. Comput. Math.819983249–265@article{Temlyakov1998, author = {Temlyakov, V. N.}, title = {The best -term approximation and greedy algorithms}, journal = {Adv. Comput. Math.}, volume = {8}, date = {1998}, number = {3}, pages = {249–265}}
