Advanced Courses in Mathematics CRM Barcelona Centre de Recerca Matemàtica
Managing Editor: Manuel Castellet
Spiros A. Argyros Stevo Todorcevic
Ramsey Methods in Analysis
Birkhäuser Verlag Basel • Boston • Berlin
Authors: Spiros A. Argyros National Technical University Department of Mathematics Zografou Campus 157 80 Athens Greece
[email protected]
Stevo Todorcevic Université Paris 7 – C.N.R.S. U.M.R. 7057 2, Place Jussieu – Case 7012 75251 Paris Cedex 05 France and Department of Mathematics University of Toronto Toronto, Ontario M5S 3G3, Canada
[email protected]
2000 Mathematical Subject Classification 46B20, 05D10, 03E75
A CIP catalogue record for this book is available from the Library of Congress, Washington D.C., USA
Bibliografische Information Der Deutschen Bibliothek Die Deutsche Bibliothek verzeichnet diese Publikation in der Deutschen Nationalbibliografie; detaillierte bibliografische Daten sind im Internet über
abrufbar.
ISBN 3-7643-7264-8 Birkhäuser Verlag, Basel – Boston – Berlin This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in other ways, and storage in data banks. For any kind of use permission of the copyright owner must be obtained.
© 2005 Birkhäuser Verlag, P.O. Box 133, CH-4010 Basel, Switzerland Part of Springer Science+Business Media Cover design: Micha Lotrovsky, 4106 Therwil, Switzerland Printed on acid-free paper produced from chlorine-free pulp. TCF ºº Printed in Germany ISBN-10: 3-7643-7264-8 ISBN-13: 978-3-7643-7264-4 987654321
www.birkhauser.ch
Contents
Foreword
A
Saturated and Conditional Structures in Banach Spaces Spiros A. Argyros
vii
1
Introduction
3
I. Tsirelson and Mixed Tsirelson Spaces
7
II. Tree Complete Extensions of a Ground Norm II.1 Mixed Tsirelson Extension of a Ground Norm . . . . . . . . . . . . II.2 R.I.S. Sequences and the Basic Inequality . . . . . . . . . . . . . .
21 21 26
III. Hereditarily Indecomposable Extensions with a Schauder Basis III.1 The HI Property in X[G, σ] . . . . . . . . . . . . . . . . . . . . . . III.2 The HI Property in X[G, σ]∗ . . . . . . . . . . . . . . . . . . . . . .
39 39 43
IV. The Space of the Operators for HI Banach Spaces IV.1 Some General Properties of HI Spaces . . . . . . . . . . . . . . . . IV.2 The Space of Operators L(X[G, σ]), L(X[G, σ]∗ ) . . . . . . . . . . .
47 47 52
V. Examples of Hereditarily Indecomposable Extensions V.1 A Quasi-reflexive HI Space . . . . . . . . . . . . . . . . . . . . . . V.2 The Spaces p , 1 < p < ∞, are Quotients of HI Spaces . . . . . . . V.3 A Non Separable HI Space . . . . . . . . . . . . . . . . . . . . . . .
57 57 58 62
VI. The Space Xω1
71
VII. Finite Representability of JT0 and the Diagonal Space D(Xγ )
81
VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
87
Appendix A. Transfinite Schauder Basic Sequences
99
Appendix B. The Proof of the Finite Representability of JT0
105
Bibliography
117
vi
B
Contents
High-Dimensional Ramsey Theory and Banach Space Geometry Stevo Todorcevic
121
Introduction
123
I. Finite-Dimensional Ramsey Theory 127 I.1 Finite-Dimensional Ramsey Theorem . . . . . . . . . . . . . . . . . 127 I.2 Spreading Models of Banach Spaces . . . . . . . . . . . . . . . . . 130 I.3 Finite Representability of Banach Spaces . . . . . . . . . . . . . . . 135 II. Ramsey Theory of Finite and Infinite Sequences II.1 The Theory of Well-Quasi-Ordered Sets . . . . . . . . . . . . . . II.2 Nash–Williams’ Theory of Fronts and Barriers . . . . . . . . . . II.3 Uniform Fronts and Barriers . . . . . . . . . . . . . . . . . . . . . II.4 Canonical Equivalence Relations on Uniform Fronts and Barriers II.5 Unconditional Subsequences of Weakly Null Sequences . . . . . . II.6 Topological Ramsey Theory . . . . . . . . . . . . . . . . . . . . . II.7 The Theory of Better-Quasi-Orderings . . . . . . . . . . . . . . . II.8 Ellentuck’s Theorem . . . . . . . . . . . . . . . . . . . . . . . . . II.9 Summability in Banach Spaces . . . . . . . . . . . . . . . . . . . II.10 Summability in Topological Abelian Groups . . . . . . . . . . . .
. . . . . . . . . .
143 143 147 153 165 169 177 180 185 188 192
III. Ramsey Theory of Finite and Infinite Block Sequences III.1 Hindman’s Theorem . . . . . . . . . . . . . . . . . III.2 Canonical Equivalence Relations on FIN . . . . . . III.3 Fronts and Barriers on FIN[<∞] . . . . . . . . . . . III.4 Milliken’s Theorem . . . . . . . . . . . . . . . . . . III.5 An Approximate Ramsey Theorem . . . . . . . . .
. . . . .
197 197 200 201 205 209
IV. Approximate and Strategic Ramsey Theory of Banach Spaces IV.1 Gowers’ Dichotomy . . . . . . . . . . . . . . . . . . . . . . . . . . . IV.2 Approximate and Strategic Ramsey Sets . . . . . . . . . . . . . . . IV.3 Combinatorial Forcing on Block Sequences in Banach Spaces . . . IV.4 Coding into Approximate and Strategic Ramsey Sets . . . . . . . . IV.5 Topological Ramsey Theory of Block Sequences in Banach Spaces . IV.6 An Application to Rough Classification of Banach Spaces . . . . . IV.7 An Analytic Set whose Complement is not Approximately Ramsey
217 217 220 224 229 233 240 243
Bibliography
247
Index
253
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
Foreword This book contains two sets of notes prepared for the Advanced Course on Ramsey Methods in Analysis given at the Centre de Recerca Matem`atica in January 2004, as part of its year-long research programme on Set Theory and its Applications. The common goal of the two sets of notes is to help young mathematicians enter a very active area of research lying on the borderline between analysis and combinatorics. The solution of the distortion problem for the Hilbert space, the unconditional basic sequence problem for Banach spaces, and the Banach homogeneous space problem are samples of the most important recent advances in this area, and our two sets of notes will give some account of this. But our main goal was to try to expose the general principles and methods that lie hidden behind and are most likely useful for further developments. The goal of the first set of notes is to describe a general method of building norms with desired properties, a method that is clearly relevant when testing any sort of intuition about the infinite-dimensional geometry of Banach spaces. The goal of the second set of notes is to expose Ramsey-theoretic methods relevant for describing the rough structure present in this sort of geometry. We would like to thank the coordinator of the Advanced Course, Joan Bagaria, and the director of the CRM, Manuel Castellet, for giving us this challenging but rewarding opportunity.
Part A
Saturated and Conditional Structures in Banach Spaces Spiros A. Argyros
Introduction In 1991, W.T. Gowers and B. Maurey [33], independently, constructed examples of reflexive Banach spaces with no unconditional basis. It is remarkable that, working completely separately, they arrived at the same space. This result is a fundamental discovery with important consequences. Thus, today we have a theory, or at least the beginning of a theory, initializing from Gowers–Maurey paper. Let us recall the basic ingredients of this theory. As it was noticed by W. Johnson the Gowers– Maurey example is a Hereditarily Indecomposable (HI) space. This means that no infinite dimensional closed subspace is the topological direct sum of two further infinite dimensional closed subspaces of it. This is equivalent to the following remarkable geometric property: For any two infinite dimensional subspaces the distance between their unit spheres is zero (sometimes this property is called “the angle zero property”). This is a new concept, defining a new class of Banach spaces, which has good stability properties; for example it is closed in taking subspaces of its members. Also HI spaces have some contradictory properties, resulting from the tightness of their structure. Thus no HI space is isomorphic to any proper subspace, answering in negative the long standing hyperplane problem [31], [33]. On the other side every two closed infinite dimensional subspaces have further subspaces which are almost isometric. The new concept stands in the opposite of the unconditional basic sequence and W.T. Gowers’ famous dichotomy ([30], [32]) has provided the first sufficient classification of Banach spaces. Namely, every Banach space either is unconditionally saturated or contains an HI space. Unexpectedly this classification provides a positive solution of the homogenous problem that yields a new characterization of Hilbert spaces. Another important discovery of Gowers and Maurey concerns the Banach spaces with few operators. As they have shown [33] every bounded linear operator on a complex HI space is of the form λI + S with S strictly singular. This has as consequence that every Fredholm operator on a HI (real or complex) space is of index zero, which yields the aforementioned property that such a space is not isomorphic to any proper subspace. The structure of L(X) for real HI spaces is studied in [25]. The problem of the existence of a Banach space with very few operators (i.e. every T ∈ L(X) is of the form λI + K with K a compact operator) remains open and if such a space existed it should be connected to the methods
4
Introduction
of HI constructions. Recently it has been shown that there exist spaces with few operators not containing any HI space ([14], [15]). The third important contribution of Gowers–Maurey discovery concerns the generic character of their method. This is a powerful method of constructing Banach spaces using saturated norms and delicate codings. This method is not related exclusively to HI spaces. As Gowers has shown [31] one can also obtain new spaces with an unconditional basis resulting from variants of Gowers–Maurey method. The recent paper of J. Lopez-Abad, S. Todorcevic and the present author [12], [13] extends this method to reflexive Banach spaces with transfinite Schauder basis where new phenomena concerning the operator spaces occur. I must admit that constructing such spaces requires several steps and although each one is not so difficult putting everything together makes the understanding not easy. In particular dealing with these spaces, one faces three main parts. The first is how we define such spaces. The definition of saturated norms uses induction and additional one has also to involve the special functionals resulting from the coding. The second concerns the form of vectors of which we compute the norms. In order to show the non-existence of unconditional basic sequences we have to compute the norms of certain vectors. To locate these vectors we have to follow several steps. Finally to compute the norms requires some new techniques which have been developed for this purpose. The goal of the present notes is, on the one hand, to develop the method of strictly singular HI extensions of a ground norm and, on the other hand, to apply this method in specific constructions of HI Banach spaces. In the later part we are mainly interested in two non separable constructions. The first concerns a non separable HI space, such an example appeared in [16], and the second a non separable reflexive space containing no unconditional basic sequence [12], [13]. The method of strictly singular extensions is related to the following problem. Given Y a Banach space with a Schauder basis (yn )n and not containing 1 , we are interested in finding a HI space X with a Schauder basis (en )n such that the correspondence en → yn is extended to a bounded linear operator T : X → Y . This problem has been answered affirmatively in [16] with the use of a transfinite hierarchy of saturation methods. In the same paper the strictly singular extensions were introduced and studied although not named there. In these notes we discuss a part missing from [16], namely the extensions with low complexity saturation methods. This does not answer the above stated problem in its complete generality, however it permits some of the main constructions to be carried out and moreover, extending with the methods (Anj , m1j )j , we deal exclusively with averages, as in [33], making our approach easier. The interest for the HI extensions arises from the fact that in some cases specific features of the space Y are preserved in the HI extension of it. For example if Y is c0 (N) and the basis (yn )n is the summing basis of c0 (N), then independently of the saturation method we use, the resulting space is a quasi-reflexive HI space. A remarkable consequence of the extension method is a dichotomy contained in
Introduction
5
[16], not discussed here, that every separable Banach space either contains 1 or it is a quotient of a HI space. To some extend the HI extensions, thinking of the specific Y as a model of Banach space theory, attempt to do a work similar to the forcing method in set theory. Namely, they create a new model with a desired property (HI) and in some cases phenomena of absoluteness also occur, preserving properties of the initial space. The HI extensions are presented in Chapters II–IV. Chapter I is devoted to an introduction to Tsirelson type and Mixed Tsirelson spaces. The content of this chapter is not directly related to the HI extensions, thus the familiar reader could skip it. However we recommend to study the proof of Theorem I.4, where important ingredients, like the tree analysis and their usage, appear in a simple setting. Chapter V contains examples of HI extensions. Thus it is shown the existence of a quasi-reflexive HI space, that every p , 1 < p < +∞, is a quotient of a HI space and a non separable HI space Xns which is the dual as well as the second dual of a separable HI space. Chapter VI concerns the construction of Xω1 , a non separable reflexive space with no unconditional basic sequence, or according to Gowers’ dichotomy, HI saturated (i.e. every infinite dimensional subspace contains a further HI subspace). The dimension of Xω1 is ω1 and it is unknown if there exists a space with the same properties and higher dimension. The main obstacle for non separable reflexive constructions with no unconditional basic sequence, concerns the definition of the conditional structure realized by the special functionals. The key ingredient for this is the coding function σ used by Gowers and Maurey and having its roots in the classical Maurey–Rosenthal construction [48]. The basic characteristic of σ, in the separable constructions, is that it is injective (one-toone), a property not extendable to the non separable setting. Thus the really new ingredient in the definition of Xω1 is the coding function σρ defined with the use of Todorcevic’s ρ function [60],[61] . The ρ function is acting on the doubletons of ω1 , taking values in N and, although not injective, permits a definition of the special functionals sharing similar properties with the corresponding in the separable case. Chapter VII is devoted to the study of the space of diagonal non strictly singular operators of Xω1 . Let us mention that Xω1 , being a non separable reflexive space, admits many non trivial projections [40]. Therefore there exists a large portion of operators which are different from the identity and non strictly singular. The space D(Xγ ) has a very precise representation, as a Banach space which is related to a long James like space. Chapter VIII is a continuation of Chapter VII in the study of the spaces of operators for subspaces of Xω1 . We have included two appendices. The first concerns transfinite basic sequences and the second is devoted to a unified approach of the basic inequality and the finite block representability of the James like space JT0 . The present notes are based on a series of lectures delivered by the author in CRM Barcelona. The principal aim was to introduce the audience to the theory of HI Banach spaces. Thus there are directions of the theory not discussed here. One of them is the method developed by W.T. Gowers and B. Maurey [34] for constructing Banach spaces with selected a priori algebra of non strictly singu-
6
Introduction
lar operators. As consequence they provide a separable Banach space Xs with a Schauder basis (xn )n such that the space Xs does not contain an unconditional basic sequence and also the shift operator is an isometry. A second direction concerns the use of interpolation methods in HI constructions, as appeared in [10, 3, 27]. Recently has been studied the problem of the existence of Banach spaces with few operators (i.e. every T ∈ L(X) is of the form T = λI + S with S strictly singular) and not containing a HI subspace. The existence of few operators yields that the space X is indecomposable. Related to this type of questions are the papers [14], [15], [17]. Finally we recommend the two survey papers by W.T. Gowers [32] and B. Maurey [46] for results related to HI Banach spaces. In particular Maurey’s survey includes a beautiful presentation of some of the aforementioned methods and results not included in these notes. We extend our warm thanks to A. Arvanitakis, P. Dodos, A. Manoussakis, and A. Tolias for their valuable help during the preparation of the notes.
Chapter I
Tsirelson and Mixed Tsirelson Spaces The Gowers–Maurey example and all the subsequent constructions have their roots in B.S. Tsirelson’s fundamental discovery of a reflexive space with an unconditional basis not containing any p with 1 < p < ∞. Tsirelson’s space appeared in 1972. Almost twenty years later (1991) Th. Schlumprecht presented his space as an example of an arbitrarily distortable space. This is the unconditional frame for the Gowers–Maurey construction. The two norms share common features and our aim is to explain their generic character, their relation with the classical p norms and their differences.
Glossary For κ an ordinal we denote by c00 (κ) the vector space of all x : κ → R such that the set supp x = {α < κ : x(α) = 0} is finite. For x ∈ c00 (κ) we denote by ran x the minimal interval of κ containing supp x. We also denote by (eα )α<κ the natural basis of c00 (κ). For the special case of c00 (ω) we shall use the notation c00 . For E1 , E2 ⊂ κ we denote by E1 < E2 the property that sup E1 < min E2 . Further for x1 , x2 elements of c00 (κ) we denote by x1 < x2 the property that supp x1 < supp x2 . In most cases we shall use c00 (κ) as a vector space on which we shall define certain norms. These norms will be induced by an appropriate subset W of c00 (κ) and will be defined as " # f (α)x(α)| : f ∈ W . xW = sup |f (x)| = | α<κ
Thus in some cases we shall denote the elements of c00 (κ) as f, g, etc. while its Hamel basis as (e∗α )α<κ meaning that we concern ourselves with the functionals of
8
Chapter I. Tsirelson and Mixed Tsirelson Spaces
the norming set. Finally for x ∈ c00 (κ) and E ⊂ κ we denote by Ex the restriction of x on E or equivalently the function xχE . We refer the reader to [24] and [41] for the fundamental background of the theory of Banach spaces. Tsirelson space Tsirelson’s norm is the first norm defined by induction. It satisfies a fixed point property and it is implicitly defined as follows. For x ∈ c00 , n # " 1 sup xT = max x0 , Ei xT . 2 n≤E1 <E2 <···<En i=1
(I.1)
The space T is the completion of c00 endowed with · T . The above definition is due to T. Figiel and W. Johnson [28]. Tsirelson’s original definition [63] was concerning the norm of the dual space. Notice that the norm of T ∗ does not admit any explicit or implicit description. Thus Tsirelson actually defined the unit ball of T ∗ . Remarks I.1. (a) The existence of a norm satisfying the above implicit formula is established by induction. Namely we inductively define an increasing sequence of norms ( · n )n≥0 such that x0 = x∞ and n # " 1 xn+1 = max x0 , sup Ei xn . 2 n≤E1 <E2 <···<En i=1
Then xT = limn xn . (b) An important feature of Tsirelson’s norm is that it provides a method to saturate the structure of a Banach space with a property (P). For example the space T has the property that every normalized weakly null sequence contains no Cesaro summable subsequence, which actually shows that no p , 1 < p < ∞ is embedded in T . The existence of a weakly null normalized basic sequence with no Cesaro summable subsequence was a fundamental discovery of J. Schreier in the early 1930s. (c) Observe that in the definition of (I.1) appears the number 1/2 and the constrain n ≤ E1 < E2 < · · · < En . The number 1/2 could be substituted by any 0 < θ < 1 and the space retains all its properties. If θ = 1, then the space becomes isomorphic to 1 . The same will happen if we allow arbitrary families E1 < E2 < · · · < En . Tsirelson type norms In the sequel we shall denote by M a compact family (in the topology of pointwise convergence) of finite subsets of N which includes all singletons.
Chapter I. Tsirelson and Mixed Tsirelson Spaces
9
Definition I.2. A finite family E1 < E2 < · · · < En of subsets of N is said to be M-admissible if there exists M = {mi }ni=1 in M such that m1 ≤ E1 < m2 ≤ E2 < · · · < mn ≤ En . Next for M a compact family of subsets of N and 0 < θ < 1 we define the · (M,θ) as follows. For x ∈ c00 , n # " Ei x(M,θ) x(M,θ) = max x0 , θ sup i=1
where the above sup is taken over all M-admissible families E1 < E2 < · · · < En . Finally we denote by T (M, θ) the completion of (c00 , · (M,θ) ). It is easy to see that Tsirelson’s space T is the space T (S, 1/2), where S = {F ⊆ N : #F ≤ min F } is the Schreier family used by J. Schreier in the definition of his space [56]. The structure of T (M, θ) depends on the complexity of the underlying compact family M. In particular the structure of T (M, θ) is strongly related to the Cantor–Bendixson index of the family M denoted by i(M). We shall present later some results explaining the interference between i(M) and T (M, θ). Now we present an alternative description of the norm of T (M, θ) closer to the spirit of Tsirelson’s original definition. Let us denote by W (M, θ) the minimal subset of c00 containing ±e∗n , n ∈ N, and which is closed under the (M, θ)-operation; i.e. for every f1 < f2 < · · · < fn in W (M, θ) with supp f1 , supp f2 ,. . . , supp fn M-admissible, then θ(f1 + · · · + fn ) ∈ W (M, θ) (we shall call such f1 < f2 < · · · < fn an M-admissible family of functionals). The norm induced by W (M, θ) (i.e. for x ∈ c00 , xW (M,θ) = sup{f (x) : f ∈ W (M, θ)}) is exactly the norm x(M,θ) defined above. Definition I.3. Let f ∈ W (M, θ). For a finite tree T , a family (ft )t∈T is said to be a tree analysis of f if the following are satisfied: (i) T has a unique root denoted by 0 and f0 = f . (ii) For every t ∈ T maximal (or terminal) ft = εt e∗k where εt = ±1 and k ∈ N. (iii) For every t ∈ T which is not maximal we have that {fs }s∈St is M-admissible and ft = θ s∈St fs (here St denotes the immediate successors of t). The tree analysis is a key ingredient which will follow us throughout these notes. Later we shall see some variants of it. Most of the estimations will be based on the tree analysis. It is not difficult to see that every f ∈ W (M, θ) admits a tree analysis. Indeed we could consider the set W (M, θ) that contains ±e∗k , k ∈ N, and every f ∈ W (M, θ) satisfies f ∈ W (M, θ) and f admits a tree analysis. Then we show that W (M, θ) is closed under the (M, θ)-operation and from the minimality of W (M, θ) we obtain that W (M, θ) = W (M, θ). Among all possible compact families M there are two hierarchies that we are mainly concerned about. The first is the low complexity hierarchy {An }n with An = {F ⊆ N : #F ≤ n} and the second is the family {Sξ }ξ<ω1 of Schreier
10
Chapter I. Tsirelson and Mixed Tsirelson Spaces
" # families. Each Sξ is defined recursively as follows. We set S0 = {n} : n ∈ N ∪{∅}. For ξ = ζ + 1 we set Sξ
= {F ⊆ N : there exists k ≤ F1 < F2 < · · · < Fk k
with each Fi ∈ Sζ and F =
Fi } ∪ {∅}.
i=1
For ξ limit we choose ξn $ ξ and we set Sξ = {F : ∃n ≤ F with F ∈ Sξn } ∪ {∅}. It is quite possible, and partially proved, that the spaces T (M, θ) where M ∈ {An }n or M ∈ {Sξ }ξ<ω1 , describe the structure of T (M , θ) where M is an arbitrary family. The following theorem is quite remarkable showing that the classical p spaces admit an equivalent Tsirelson type norm. Theorem I.4. For every 0 < θ < 1 and every n ∈ N the space T (An , θ) is isomorphic to c0 or to some p with 1 < p < ∞. In particular: (i) If
1 n
≥ θ, then T (An , θ) is isomorphic to c0 .
(ii) If
1 n
< θ, then T (An , θ) ∼ = p , where θ =
Proof. (i) Let
1 n
1 n1/q
and
1 p
+
1 q
= 1.
≥ θ. It is enough to show that for all f ∈ W it holds f(
an en ) ≤ max |an | for all coefficients (an )n .
n
n
Let f ∈ W and (ft )t∈T be a tree analysis of f . An easy inductive argument gives us that ak ek ) ≤ max |ak | , ft ( k
k
for all t ∈ T , and this inequality yields that the space T (An , θ) is isomorphic to c0 . (ii) Let n1 < θ. Let p, q be as in the assumption. We prove that the basis (en )n of T (An , θ) is equivalent to the standard basis of p . The proof goes through the following four steps. Step 1. For every x ∈ c00 ,
x ≤ xp .
Proof. It is enough to show that for every f ∈ W (M, θ) it holds |f (x)| ≤ xp .
(I.2)
Let (ft )t∈T be a tree analysis of f . It is trivial that for a terminal node t ∈ T , ft satisfies (I.2).
Chapter I. Tsirelson and Mixed Tsirelson Spaces
11
1 Let t ∈ T , ft = θ s∈St fs where θ = n1/q and (fs )s∈St is An -admissible. Assume that for every s ∈ St we have that for all y ∈ c00 , |fs (y)| ≤ yp . Let x ∈ c00 . Then, setting xi = (supp(fi ))(x) we have
|ft (x)| ≤θ
|fs (x)| =
s∈St
≤
1 1
nq
1
xi p ≤
s∈St
1
nq
|fs (xi )|
s∈St
d $ #St % q1 1 ( xi pp ) p ≤ xp , n i=i
where in the previous inequality we use the inductive assumption and H¨ older’s inequality. 1 m 1 p ≤ Step 2. For all m ∈ N, 1 m i=1 ei . np
1 Proof. Suppose first that m = ns for some s ∈ N. The functional f= ns/q clearly belongs to W (M, θ). So s
n
s
ei ≥ f
n % $ ei =
i=1
i=1
$ ns
i=1 ei
%
1 s n = ns(1−1/q) = ns/p = m1/p . ns/q
Now let m ∈ N and find s such that ns ≤ m ≤ ns+1 . Then
m
s
ei ≥
i=1
n
ei = ns/p =
i=1
1 n1/p
n(s+1)/p ≥
1 n1/p
m1/p .
∞ Step 3. For every normalized block sequence (xk )∞ k=1 of the basis (en )n=1 we have
a k xk ≤
2 ak ek θ
for all coefficients (ak ) . Proof. It is enough to show that for every f ∈ W one gets 2 f( a k xk ) ≤ ak ek . θ For the proof we shall need the following definition. Definition I.5. Let f ∈ W (M, θ), (ft )t∈T be a tree analysis of f and let (xk )k be a finite block sequence. a) For every k ∈ N we consider the set of nodes Tk = {t ∈ T
:
(i) ran ft ∩ ran xk = ∅ for all s t if s ∈ Su (ii) ran fs ∩ ran xk = ran fu ∩ ran xk (iii) for all s ∈ St ran fs ∩ ran xk ran ft ∩ ran xk }
12
Chapter I. Tsirelson and Mixed Tsirelson Spaces
b) For every t ∈ T we set Dt =
st {k
: s ∈ Tk }.
It is easy to see that for every k ∈ N, #Tk ≤ 1. Also a t ∈ T could belong to more than one Tk . The proof of Step 3 will be an immediate consequence of the following two lemmas. Lemma I.6. Let f ∈ W (M, θ) with a tree analysis (ft )t∈T and (xk )k be a finite normalized block sequence. Assume that for all t ∈ T it holds that # ({s ∈ St : Ds = ∅} ∪ {k : Tk = {t}}) ≤ n . Then there exists g ∈ W (M, θ) such that for all k it holds that 1 g(ek ) . θ Proof. For every t ∈ T we set K = Dt \ s∈St Ds = {k : Tk = {t}}. We also set E = {s ∈ St : Ds = ∅}. It follows from the hypothesis that #(K ∪ E) ≤ n. We shall prove by induction that for every t ∈ T there exists gt ∈ W (M, θ) such that f (xk ) ≤
supp gt ⊂ Dt and ft (xk ) ≤ Indeed let t ∈ T and ft = θ ft (
s∈St
a k xk ) = θ
fs . We have that
fs (
s∈St
k
1 gt (ek ) for every k ∈ Dt . θ
We set gt = θ(
a k xk ) + ( fs )(ak xk )
s∈E
gs +
.
k∈K s∈St
k∈Ds
e∗k ) .
k∈K
e∗k , gs
Since ∈ W (M, θ) for every k ∈ K, s ∈ E and #(K ∪ E) ≤ n, it follows that gt ∈ W (M, θ). From the fact that for every k s∈St
fs (xk ) ≤
1 1 xk = e∗k (ek ), θ θ
we get, ft (xk ) ≤ 1θ gt (ek ) for every k ∈ K. If k ∈ Ds for some s ∈ E, from the inductive hypothesis we get ft (xk ) = θfs (xk ) ≤ gs (ek ) =
1 gt (ek ) . θ
In order to complete the proof of Step 3, we show that there exists a partition of xk such that the assumptions of the previous lemma are satisfied.
Chapter I. Tsirelson and Mixed Tsirelson Spaces
13
Lemma I.7. Let f ∈ W with a tree analysis (ft )t∈T and (xk )k be a finite block sequence. Then there exists a partition of xk , xk = xk + xk such that (ft )t∈T , (xk )k and (ft )t∈T , (xk )k satisfy the assumptions of the previous lemma. Proof. Let f , (xk )k=1 be as above. Let (ft )t∈T be a fixed analysis of f . For k = 1, . . . , we set sk to be the minimum of n ∈ N ∪ {0} such that there exist two t1 , t2 ∈ T with (i) |t1 | = |t2 | = n, (ii) ran ftj ∩ ran xk = ∅ for j = 1, 2 if such an n exists. Otherwise we set sk to be the maximum of all n ∈ N such that there exists t ∈ T with (i) |t| = n, (ii) if supp(xk ) is a singleton ran ft ∩ ran xk = ∅. For every k, let {ft : t ∈ T , |t| = sk and ran ft ∩ ran xk = ∅} = {f1 < · · · < fd }. We define xk = xk |supp f1 and xk = xk | d supp fi . i=2
Then the pairs (ft )t∈T , (xk )k and (ft )t∈T , (xk )k satisfies the conclusion. Indeed, for t ∈ T let K = {k : Tk = {t}} and E = {s ∈ St : Ds = ∅}. For k ∈ K there exists tk ∈ St with ran ftk ∩ ran xk = ∅ and max supp ftk = max supp xk . It follows that tk ∈ E. Therefore we can define a one-to-one map G : K → St \ E, hence #K + #E ≤ #St = n. The proof for the pair (ft )t∈T , (xk )k is similar. The previous two lemmas completes the proof of Step 3.
Step 4. For all and all rational non-negative (rj )j=1 ,
1/p
rj ej ≥
j=1
Proof. sj Write rj = i=sj−1 +1 ei ,
kj k
, kj , k ∈ N. Set s0 = 0 , sj = k1 + · · · + kj and uj = 1/p
j = 1, . . . , . By Step 1, uj ≤ kj
by unconditionality.
1
1/p
rj ej =
j=1
1 1/p ( rj ) . 2n j=1
k
1/p
. So
j=1
1
1/p
kj ej ≥
k
1/p
j=1
uj ej
14
Chapter I. Tsirelson and Mixed Tsirelson Spaces By Step 3, 1
k =
1/p
uj ej ≥
j=1
θ 1 uj uj 2 k1/p j=1 uj
sj s θ 1 θ 1 e = ei . i 2 k1/p j=1 i=s +1 2 k1/p i=1 j−1
By Step 2,
s
i=1 ei
≥
1/p 1 s n1/p
; so using that θ =
s 1/p 1 s 1 $ θ 1 e ≥ = i 1/p 1/p 2 k 2n k 2n i=1
j=1
kj %1/p
k
1 n1/q
we get
1 $ %1/p rj . 2n j=1
=
Step 4 and the unconditionality of (en )n∈N imply that ak ek ≥ 1 |ak |p )1/p for all coefficients (ak ) . This fact combined with Step 1 completes 2n ( the proof of the Theorem. Remark. The result of the Theorem can also be deduced by Steps 1, 2 and 3 using a well known theorem of Zippin [65]. This is a significant result permitting a unified approach of Tsirelson’s space and the classical p spaces. Hence the saturated norms enable us to extend the class of the classical sequence spaces. Next we state the following result without proof. Theorem I.8. Let M be a compact family of finite subsets of N containing the subsets of its elements and all singletons. Let also 0 < θ < 1. Then the following hold: (i) If i(M) < ω and
1 i(M)
≥ θ, then T (M, θ) ∼ = c0 .
(ii) If i(M) < ω and
1 i(M)
< θ, then T (M, θ) ∼ = p , for some 1 < p < ∞.
(iii) If i(M) ≥ ω, then T (M, θ) is reflexive with an unconditional basis not containing any p , 1 < p < ∞. (iv) If i(M) = ω, then there exists a normalized sequence (xn )n in T (M, θ) and a subsequence (enk )k in Tsirelson’s space T (S, θ) which are equivalent. # " Here i(M) = min α < ω1 : M(α) ⊂ {∅} and M(α) is the usual α-Cantor– Bendixson derivative of the countable compact space {χF : F ∈ M} ∪ {∅}. It is open whether or not for M as in the theorem with i(M) > ω there exists some ξ < ω1 such that for the spaces T (M, θ) and T (Sξ , θ) the corresponding conclusion (iv) holds. For results related to this problem we refer the reader to [42]. A proof of the above theorem can be found in [20].
Chapter I. Tsirelson and Mixed Tsirelson Spaces
15
Mixed Tsirelson norms Schlumprecht space S is the completion of c00 endowed with the following norm. For x ∈ c00 , " xS = max x0 , sup sup n
# 1 Ei xS , log2 (n + 1) i=1 n
where the inside sup is taken over all choices E1 < E2 < · · · < En of subsets of N. The motivation for the construction of such a space was to provide an example of an arbitrarily distortable Banach space. The space S appeared as an ad hoc construction. However the next definition makes the relation of S with the Tsirelson type spaces more transparent. Let (Mn )n , (θn )n be two sequences with each Mn a compact family of finite subsets of N, 0 < θn < 1 and limn θn = 0. The mixed Tsirelson space T [(Mn , θn )n ] is the completion of c00 endowed with the norm k # " x∗ = max x0 , sup sup θn Ei x∗ , n
i=1
where the inside sup is taken over all choices E1 < E2 < · · · < Ek of Mn admissible families. Remark I.9. (a) In the above notation the Schlumprecht space S is the mixed 1 )n ], where An = {F ⊆ N : #F ≤ n}. Tsirelson space T [(An , log (n+1) 2
(b) The mixed Tsirelson space T [(Mk , θk )nk=1 ] defined by a finite family (Mk , θk )nk=1 is isomorphic to T (Mk0 , θk0 ) for some 1 ≤ k0 ≤ n. Thus in order to obtain really new spaces we need to use infinite sequences (Mn , θn )n . As in the case of Tsirelson spaces there is an alternative definition of the norm of mixed Tsirelson spaces resulting from a norming set W [(Mn , θn )n ]. This set is defined as the minimal subset of c00 satisfying the following properties. (i) W [(Mn , θn )n ] contains all ±e∗k , k ∈ N. (ii) It is closed under the operations (Mn , θn )n . It follows that for an f ∈ W [(Mn , θn )n ] the tree analysis (ft )t∈T is also defined, taking into account the necessary modifications. We shall discuss this topic more extensively in the next chapter. The main property of mixed Tsirelson spaces is that for appropriate choices (Mn , θn )n , they provide countable many equivalent norms ( · n )n such that for each (xk )k block sequence in T [(Mn , θn )n ] and every n ∈ N there exists a vector yn ∈ (xk )k such that yn = yn n and for m = n yn m ≤ εm where εm → 0. In other words, the sequence (·n )n has the property that in every block subspace none of them dominates the rest but also it is not dominated by the rest.
16
Chapter I. Tsirelson and Mixed Tsirelson Spaces
Theorem I.10. Let X = T [(Mn , θn )n ]. If for some n ∈ N it holds that i(Mn ) ≥ ω or i(Mn ) = r < ω and θn > 1r , then X is reflexive. Moreover if the first alternative holds, then X does not contain isomorphically any of the spaces p , 1 ≤ p < ∞, c0 . Proof. The proof of the reflexivity is similar to the original proof of Tsirelson [T]. According to a classical result of R.C. James [35], it is enough to show that the basis of X is boundedly complete and shrinking. (i) The basis (en )n of T [(Mn , θn )n ] is boundedly complete. On the contrary, assume n that there exist ε > 0 and a block sequence (xk )k of (en )n such that supn k=1 xk ≤ 1 and xk ≥ ε for all k = 1, 2, . . .. Since the basis is unconditional it is enough to find a finite subset A of N such that k∈A xk > 1. According to the assumption there exist n, r ∈ N such that i(Mn ) ≥ r (r−1) and θn > 1r . Therefore there exists n0 ∈ Mn . It follows that if (yk )k is a block sequence of (en )n there exist a sequence (nt )t∈N of positive integers and a subsequence (ykt )t∈N of (yk )k such that nt ≤ supp ykt+1 < nt+1 and for every l = 0, 1, . . . it holds {n0 , nlr+1 , . . . , nlr+(r−1) } ∈ Mn . It follows that the sequence (ylr+1 , . . . , y(l+1)r ) is Mn -admissible. Let s ∈ N be such that (θn r)s > 1ε . From the previous observation, we can choose a subsequence (xt )t of (xk )k such that for every l = 0, 1, . . . the rsequence (xlr+1 , . . . , x(l+1)r ) is Mn -admissible. For l = 0, 1, . . . , we set x(1,l) = i=1 xlr+i . It follows that r x(1,l) ≥ θn xlr+i ≥ θn rε . i=1
We repeat the same procedure for the sequence (x(1,l) )l∈N and we get a block sequence (x(2,l) )l∈N of (xn )n such that x(2,l) ≥ (θn r)2 ε. Repeating this procedure s times we get a block sequence (x(s,l) )l , where xs,l is sum of terms of the sequence (xn )n , such that x(s,l) ≥ (θn r)s ε > 1, a contradiction. (ii) The basis {en }∞ n=1 is a shrinking. Let θ = maxk θk < 1. For f ∈ X ∗ and m ∈ N, denote by Qm (f ) the restriction of f to the space generated by {ek }k≥m . It suffices to prove the following: For every f ∈ BX ∗ there is m ∈ N such that Qm (f ) ∈ θBX ∗ . Recall that BX ∗ = co(W ), where the closure is in the topology of pointwise convergence. We shall first prove the following: Claim. For every f ∈ W there is m such that Qm (f ) ∈ θ co(W ). To prove this, let f ∈ W and let {f n }∞ n=1 be a sequence in W converging pointwise to f . If f n = e∗kn for an infinite number of n, we have nothing to prove. So suppose that for every n there are kn ∈ N, a set {mn1 , . . . , mndn } ∈ Mkn and vectors fin ∈ W , i = 1, . . . , dn such that mn1 ≤ supp f1n < mn2 ≤ supp f2n < · · · < mndn ≤ supp fdnn and f n = θkn (f1n + · · · + fdnn ). If there is a subsequence of {θkn } converging to 0,
Chapter I. Tsirelson and Mixed Tsirelson Spaces
17
then f = 0. So we may suppose that there is a k such that kn = k for all n, i.e. θkn = θk and {mn1 , . . . , mndn } ∈ Mk . Since Mk is compact, if we substitute {f n } with a subsequence we get that there is a set {m1 , . . . , md } ∈ Mk such that the sequence of indicator functions of the sets {mn1 , . . . , mndn } converges to the indicator function of {m1 , . . . , md }. So, for large n, mni = mi , i = 1, . . . , d, and mnd+1 → ∞ as n → ∞. Passing to a further subsequence of (f n )∞ n=1 , we get that there exist fi ∈ W , i = 1, . . . , d, with supp fi ⊂ [mi , mi+1 ), i = 1, . . . , d − 1, and supp fd ⊂ [md , ∞) such that fjn → fj pointwise for j = 1, . . . , d. We conclude that f = θk (f1 + · · · + fd ), so Qmd (f ) = θk fd ∈ θ co(W ). The proof of the claim is complete. In particular we get that W is a weakly compact subset of c0 . Consider now an f ∈ BX ∗ = co(W ). In the set BX ∗ = co(W ) the pointwise topology coincides with the restriction of the w∗ topology of ∞ onto co(W ). According to Choquet’s theorem there exists a measure µ1 ∈ M1 (W ) such that Gdµ = G(f0 ) W ∗
for every linear w -continuous function G. Consider the sets Am = {f ∈ W , Qm (f ) ∈ θ 2 co(W )}, m ∈ N . The sequence (Am )m is an increasing sequence of closed sets converging to W , and hence there exists m0 such that |µ|(Am0 ) > 1 − θ(1 − θ). We claim that 1 θ Qm0 (f0 ) ∈ co(W ). Indeed if not, then by the Hahn–Banach theorem there exists a linear w∗ -continuous function G such that sup{G(f ) : f ∈ co(W )} = 1 <
1 G(Qm0 (f0 )) . θ
On the other hand, 1 1 G(Qm0 (f0 )) = (G ◦ Qm0 )dµ θ θ W 1 1 = (G ◦ Qm0 )dµ + (G ◦ Qm0 )dµ θ A m0 θ W \Am0 ≤
1 1 2 θ |µ|(Am0 ) + |µ|(W \ Am0 ) = θ + 1 − θ = 1 , θ θ
a contradiction. Hence Qm0 (f0 ) ∈ θco(W ). This completes the proof that the basis is shrinking and hence it follows that X is reflexive. For the remaining part, since X is reflexive it follows that 1 and c0 do not embed in X. Assume that for some p, 1 < p < ∞,p , embeds in X. By standard arguments, there exists a block sequence (xn )n∈N of (en )n equivalent
18
Chapter I. Tsirelson and Mixed Tsirelson Spaces
to the standard basis of p . Hence there exists C > 0 such that n an xn ≤ 1 1 C( n |an |p ) p for all coefficients (an )n . Choose m ∈ N such that m1− p > θCn . Since i(Mn ) ≥ ω, there exist n1 , . . . , nm ∈ N such that the sequence (xn1 , . . . , xnm ) is Mn -admissible. It follows θn m ≤
m
1
xi ≤ Cm p ,
i=1
a contradiction.
Notes and Remarks. Tsirelson space is an important discovery in Banach space theory. It is the “first truly non-classical space” according to E. Odell and Th. Schlumprecht [53]. It is the first space with its norm inductively defined, and, more important, it introduces a fundamental method for saturating the structure of a Banach space with a property (P). To illustrate this we recall that J. Schreier [56] provided the first example of a weakly null sequence (xn )n with no norm Cesaro summable subsequence. Tsirelson space retains this property for all seminormalized weakly null sequences and it remains reflexive. Let us mention that Tsirelson’s initial construction used the forcing method and he actually defined the dual of what we call Tsirelson space. The implicit form is due to T. Figiel and W.B. Johnson [28]. We recommend the interested reader Tsirelson’s web page where it is explained how he discovered his space. A tentative study followed Tsirelson’s discovery. Thus T. Fiegel and W.B. Johnson [28], introduced the p-convexification of T and W.B. Johnson [39], defined the modified version of T spaces with remarkable properties. We refer the reader to [21] for a comprehensive presentation of the results concerning Tsirelson space. Tsirelson-type spaces of the form T (M, θ) were introduced in an unpublished paper [5], where also the proof of Theorem I.4 was presented. The later result was initially proved in [18] with a different proof. It is worth noticing that Lemmas I.6, I.7 are the simplest approach of the basic inequality, which will be discussed in the following chapters. The first mixed Tsirelson space is Schlumprecht’s space [55]. This space was the decisive ingredient for Gowers–Maurey example [33]. The concept of Mixed Tsirelson space was introduced in [6]. The modified versions of mixed Tsirelson spaces are discussed in [8] and [9]. It is interesting that while Tsirelson space is isomorphic to its modified version, genuine mixed Tsirelson spaces are totally incomparable to their modified version. A. Manoussakis in [43] introduced and studied a class of mixed Tsirelson defined as p-spaces. These are spaces of the form T [(Anj , θj )j ] satisfying the following property: For j ∈ N we denote by Tj = T [(Ani , θi )ji=1 ]. Then Tj is isomorphic to pj with 1 < pj ≤ ∞, [20]. A p-space is a space of the above such that the sequence (pj )j strictly decreases to p. Under this consideration Schlumprecht space S is an 1-space.
Chapter I. Tsirelson and Mixed Tsirelson Spaces
19
Theorem I.10 is proved in [6] and Theorem I.8 which is stated with no proof can be found in [20]. We refer the reader to survey papers [11] and [51] for related results to the content of the present section. The hierarchy of Schreier families (Sξ )ξ<ω was introduced in [1]. We refer the reader to S. Todorcevic’s part of this book for a systematic presentation of the compact families of finite subsets of N and their remarkable Ramsey properties.
Chapter II
Tree Complete Extensions of a Ground Norm In this chapter we start the novel construction of HI extensions of a ground norm. Our approach shares some common metamathematical ideas with the extension of models in set theory. Namely, one may think of a ground norm as an initial model, and the HI extension of it, being a new Banach space, which is HI and at the same time preserves some of the properties of the initial space. In this part we shall discuss the mixed Tsirelson extensions which correspond to the unconditional extensions.
II.1
Mixed Tsirelson Extension of a Ground Norm
We fix two sequences of integers (mj )j and (nj )j such that m1 = 2, mj+1 = m5j and n1 = 4, nj+1 = (5nj )sj where sj = log2 m3j+1 . These sequences will follow us throughout these notes. Definition II.1. Let κ be an ordinal and G ⊂ c00 (κ). The set G is said to be a ground set provided the following are fulfilled: (i) For α < κ, e∗α ∈ G, the set G is symmetric (i.e. g ∈ G iff −g ∈ G) and closed in the restriction of its elements on intervals of κ (i.e. for E ⊂ κ interval and g ∈ G, Eg = g · χE ∈ G). (ii) For g ∈ G, g∞ ≤ 1 and g(α) ∈ Q for α < κ. A ground norm is the norm induced on c00 (κ) by a ground set G. Namely for x ∈ c00 (κ) xG = sup{g(x) : g ∈ G}. We shall denote by YG the completion of (c00 (κ), · G ).
22
Chapter II. Tree Complete Extensions of a Ground Norm
A property of YG is that the natural Hamel basis (eα )α<κ of c00 (κ) defines a normalized bimonotone transfinite Schauder basis of YG . This is a consequence of the fact that the norming set is closed in the interval projections and also the property that g∞ ≤ 1 for all g ∈ G. In the opposite, for every Banach space Z with a transfinite Schauder basis (zα )α<κ there exists a ground set G such that the natural correspondence eα → zα from YG to Z defines an isomorphism. The mixed Tsirelson extension of the ground norm · G is defined on c00 (κ) by the next formula. For x ∈ c00 (κ) we set d " # 1 x∗ = max xG , sup sup{ Ei ∗ , E1 < · · · < Ed , d ≤ nj } . mj i=1 j
The space Tκ [G] is the completion of (c00 (κ), · ∗ ). Observe that the above defined norm is greater than or equal to · G and its difference from the usual mixed Tsirelson norms is that we have substituted x0 by xG . Definition II.2. Let · G be a ground norm in c00 (κ). The mixed Tsirelson extension Tκ [G] is said to be a strictly singular extension of YG if the identity map I : Tκ [G] → YG is a strictly singular operator. We remind the reader that an operator T : X → Y is strictly singular if its restriction to any infinite dimensional closed subspace of X is not an isomorphism. The following is a well known result from the theory of strictly singular operators [41]. Theorem II.3. Let T : X → Y be a strictly singular operator. Then for every infinite dimensional subspace Z of X and every ε > 0 there exists an infinite dimensional subspace W of Z such that T |W < ε. If moreover X has a transfinite Schauder basis and Z is a block subspace of X then W may be selected as a block subspace of Z. The norming sets Wκ [G], Wκ [G] As in the case of mixed Tsirelson spaces there is an alternative definition of the norm of the space Tκ [G] through employing a norming set of functionals as follows. Definition II.4. We shall denote by Wκ [G] the minimal subset of c00 (κ) satisfying the following conditions: (i) It contains the ground set G. (ii) It is closed in the (Anj , m1j ) operations. (iii) It is rationally convex. It is easy to check that the set Wκ [G] is symmetric and closed in the restriction of its elements on the intervals of κ.
II.1. Mixed Tsirelson Extension of a Ground Norm
23
We shall also denote by Wκ [G] the minimal subset of c00 (κ) satisfying the above (i) and (ii) (i.e. we do not require the set Wκ [G] to be closed in rational convex combinations). The tree analysis of f ∈ Wκ [G], f ∈ Wκ [G] and their relation In the sequel for f ∈ Wκ [G] (f ∈ Wκ [G]) resulting from the operation (Anj , m1j ) for some j ∈ N we shall denote by w(f ) the weight of f which is equal to mj . The weight w(f ) is not necessarily uniquely determined. Also for f ∈ Wκ [G] we say that f is of type 0 if f ∈ G, f is of type I if w(f ) exists and f is of type II if it is a rational convex combination. It is easy to show that every f ∈ Wκ [G] is of one of the above defined types. For f ∈ Wκ [G] there are only two possibilities, namely type 0 and type I. As it happens with the weight of f the type of f is not necessarily unique. Definition II.5. Let f ∈ Wκ [G]. A family (ft )t∈T with T a rooted finite tree, is a tree analysis of f if the following hold: (i) The functional f0 equals to f where 0 denotes the root of T . (ii) Each ft belongs to Wκ [G] and if t ≺ s then ran(fs ) ⊂ ran(ft ). (iii) If t is a maximal element of T then ft ∈ G. (iv) For t ∈ T which is not maximal, denoting by St the set of 1immediate sucfs as a result of an (Anj , mj ) operation of cessors of t, either ft = m1j s∈St rs fs as a rational convex combination the functionals (fs )s∈St , or ft = s∈St
of the functionals (fs )s∈St and each fs is not a convex combination of its immediate successors. Proposition II.6. Every f ∈ Wκ [G] admits a tree analysis. The proof is easy. We simply consider all f ∈ Wκ [G] admitting a tree analysis and then we show that this set satisfies (i), (ii) and (iii) of Definition II.5. The result follows from the minimality of the set Wκ [G]. Remark II.7. For f ∈ Wκ [G] the tree analysis (ft )t∈T is defined in the same manner. The only difference concerns condition (iv) in the above definition where the second alternative does not occur. The conclusion of the above proposition remains valid for f ∈ Wκ [G]. The next proposition connects the sets Wκ [G], Wκ [G].
24
Chapter II. Tree Complete Extensions of a Ground Norm
Proposition II.8. Let G be a ground subset of c00 (κ). (i) If f ∈ Wκ [G] is of type I with w(f ) = mj then there exist (fi )ni=1 in Wκ [G] with w(fi ) = mj such that f is a rational convex combination of (fi )ni=1 . Moreover, if f admits a tree analysis (ft )t∈T such that for every t ∈ T with ft of type I, w(ft ) = mj0 then each fi admits a tree analysis with the same property. (ii) If f ∈ Wκ [G] is of type II then f is a rational convex combination of a family (fi )ni=1 of elements of Wκ [G]. (iii) Wκ [G] = convQ (Wκ [G]). (iv) The sets Wκ [G], Wκ [G] induce the same norm on c00 (κ) which is the mixed Tsirelson extension defined above. The proof is easy and we leave it to the reader. The auxiliary space T [(A5nj , m1j )j ] and the norm of the averages of its basis We consider the mixed Tsirelson space T [(A5nj , m1j )j ] and we denote by W0 , W0 the norming sets corresponding to the norm of this space where W0 is closed in the (A5nj , m1j ) operations and the rational convex combinations while W is closed only in the corresponding operations. We shall prove the following lemma. Lemma II.9. Let j0 ∈ N and f ∈ W0 . Then for every k1 < k2 < . . . < knj0 we have that nj0 2 , if w(f ) = mi , i < j0 1 ekl )| ≤ m1i ·mj0 (II.1) |f ( n j0 if w(f ) = mi , i ≥ j0 . mi , l=1 The same estimates hold for f ∈ W0 with w(f ) = mi . If we additionally assume that the functional f admits a tree (ft )t∈T such that w(ft ) = mj0 for all t ∈ T , then we have that nj0 1 ekl )| ≤ |f ( n j0
l=1
In particular |f ( n1j
0
nj0
l=1
ekl )| ≤
1 m2j
2 mi ·m2j 0 1 mi ,
,
if w(f ) = mi , i < j0
(II.2)
if w(f ) = mi , i > j0 .
. The same estimates remain valid for f ∈ W0
0
with w(f ) = mi admitting a tree (ft )t∈T such that w(ft ) = mj0 for all t ∈ T . Proof. We first prove the following claim. Claim. Let h ∈ W0 . Then (i) #{k : |h(ek )| >
1 mj0
} ≤ (5nj0 −1 )log2 (mj0 )−1 .
II.1. Mixed Tsirelson Extension of a Ground Norm
25
(ii) If the functional h admits a tree (ha )a∈A with w(ha ) = mj0 for each a ∈ A then #{k : |h(ek )| > m12 } ≤ (5nj0 −1 )2 log2 (mj0 )−1 . j0
Proof of the claim. We shall prove only part (i) of the claim, as the proof of (ii) is similar. Let (ha )a∈A be a tree of h and let n be its height (i.e. the maximal length of its branches). We may assume that |h(ek )| > m1j for all k ∈ supp h. 0 Let h = (h0 , h1 , . . . , hn ) be a branch (then hn = ±e∗p ) and let k ∈ supp hn . Then n−1 & 1 1 1 mj < |h(ek )| = w(hl ) ≤ 2n , hence n < log2 (mj0 ). 0
l=0
On the other hand, since |h(ek )| >
1 mj0
for all k ∈ supp h, each hα with
α non maximal node is a result of an (A5nj , m1j ) operation for j ≤ j0 − 1. An inductive argument yields that for i ≤ n the cardinality of the set {ht : |t| = i} is less or equal to (5nj0 −1 )i . The fact that n < log2 (mj0 ) yields that #(supp(h)) ≤ (5nj0 −1 )log2 (mj0 )−1 . The proof of the claim is complete. We pass to the proof the lemma. The case w(f ) = mi , i ≥ j0 is straightford ward. Let f ∈ W0 with w(f ) = mi , i < j. Then f = m1i fl where f1 < · · · < fd belong to W0 and d ≤ ni . For p = 1, . . . , d we set Hp = {k : |fp (ek )| >
l=1
}. Part (i) of the claim d yields that #(Hp ) < (5nj0 −1 )log2 (mj0 ) . Thus, setting H = Hp , we get that 1 mj0
p=1
#(H) ≤ d(5nj0 −1 )log2 (mj0 )−1 ≤ (5nj0 −1 )log2 (mj0 ) . Therefore nj0 nj0 nj0 d d
( 1 1 '
1 1
( |f ( ekl )| ≤ fp )|H ( ekl ) + ( fp )|(N\H) ( ekl ) n j0 mi p=1 n j0 n j0 p=1 l=1
l=1
l=1
1 1 1 2 ≤ (#(H) + )< . mi n j0 m j0 m i m j0 The result for f ∈ W0 follows from Proposition II.8(i) and the above estimates. The second part is proved similarly by using part (ii) of the claim. Notes and Remarks. The space Tκ [G] is the frame for the HI extensions which will be presented in the next chapter. As we will see the norming set DG of the HI extensions will be a subset of the norming set W [G]. This actually means that the HI space X[G, σ] is interpolated between T [G] and YG . The results of the next section yield that if Tκ [G] is a strictly singular extension of YG , then it is reflexive and unconditionally saturated. Moreover Tκ [G] does not contain any p , 1 ≤ p < ∞. The transfinite basis of Tκ [G] is boundedly complete (for the definition we refer to Appendix A) hence Tκ [G] is the dual of the space generated by the biorthogonals of the basis (eα )α<κ .
26
Chapter II. Tree Complete Extensions of a Ground Norm
The auxiliary space T [(A5nj , m1j )j ] will be used in the estimates of the norm of certain block averages. For this reason we compute the norm of the averages of the basis in this space. The tool to reduce from the block averages to the averages of the basis of the auxiliary space, is the basic inequality stated and proved in the next section and also in Appendix B.
II.2
R.I.S. Sequences and the Basic Inequality
The tree complete extension DG of a ground set is a subset of Wk [G] which satisfies certain properties. The most important one is that DG is closed in the even operations (An2j , m12j ) while the behavior of DG with respect to the odd operations 1 ) is left open. We shall obtain some properties of the spaces Xk [DG ] (An2j+1 , m2j+1 in this section. In the next chapter we shall be more specific for the behavior of the DG with respect to the odd operations in order to obtain HI extensions of the ground norm. The main result of this part concerns the basic inequality and its applications. Definition II.10. Let G be a ground set. A subset DG of Wκ [G] is said to be a tree complete extension of G if the following are fulfilled. (i) The ground set G is a subset of DG . (ii) DG is symmetric, closed in the restrictions of its elements on intervals of κ and closed in the (An2j , m12j )j operations. (iii) Every f ∈ DG admits a tree analysis (ft )t∈T with ft ∈ DG for all t ∈ T . We shall denote by Xκ [DG ] the completion of (c00 (κ), · DG ) and for κ = ω we write X[DG ]. Remark II.11. Let’s observe that the difference between Wκ [G] and DG concerns 1 that in the later set the behavior of the odd operations (An2j+1 , m2j+1 )j is remaining undefined. Actually we shall use the odd operations in order to impose the conditional structure on the space normed by the set DG . The complete definition of the set DG will be given in the next chapter. Definition II.12. The tree complete extension is said to be strictly singular if the identity operator I : Xκ [DG ] → YG is strictly singular. For f ∈ DG we say that is of type I (or II) if it is a result of an (Anj , m1j ) operation (or a rational convex combination) of a family (ft )t with ft ∈ DG . Definition II.13 (R.I.S.). A block sequence (xk )k in Xκ [DG ] is said to be a (C, ε) rapidly increasing sequence (R.I.S.), if xk ≤ C, and there exists a strictly increasing sequence (jk ) of positive integers such that (a) mj1 · # supp xk < ε. k+1
(b) For every k = 1, 2, . . . and every f ∈ DG with w(f ) = mi , i < jk we have C . that |f (xk )| ≤ m i
II.2. R.I.S. Sequences and the Basic Inequality
27
The next proposition is the fundamental tool for the computation of the norm for certain vectors in Xκ [DG ]. Proposition II.14 (The basic inequality). Let (xk )k be a (C, ε) R.I.S. in Xκ [DG ] such that for every g ∈ G we have that |g(xk )| > ε for at most one k. Let also (λk )k ∈ c00 be a sequence of scalars. Then for every f ∈ DG of type I we can find g1 , such that either g1 = h1 or g1 = e∗t + h1 with t ∈ supp h1 where h1 ∈ W0 with w(h1 ) = w(f ) and g2 ∈ c00 (N) with g2 ∞ ≤ ε with g1 , g2 having nonnegative coordinates and such that |λk |ek ). (II.3) |f ( λk xk )| ≤ C(g1 + g2 )( If we additionally assume that there exists j0 ∈ N such that for every h ∈ DG with w(h) = mj0 and every interval E of the natural numbers we have that λk xk )| ≤ C(max |λk | + ε |λk |), (II.4) |h( k∈E
k∈E
k∈E
then, if w(f ) = mj0 , we may select h1 to have a tree analysis (ht )t∈T with w(ht ) = mj0 for all t ∈ T with ht of type I. Proof. The proof in the general case (where (II.4) is not assumed) and in the special case (where we assume (II.4)) is actually the same. We shall give the proof only in the special case. The proof in the general case arises by omitting any reference to distinguishing cases whether a functional has weight mj0 or not and treating the functionals with w(f ) = mj0 as for any other j. We fix a tree analysis (ft )t∈T of f . Before passing to the proof we adopt some useful notation and state two lemmas. Definition II.15. For each k we define the set Tk as follows: ) Tk = t ∈ T such that ft is of type 0 or I and (i) ran ft ∩ ran xk = ∅ (ii) ∀ u < t, if fu is of type I, then w(fu ) = mj0 (iii) ∀ s ≤ t if s ∈ Su and fu is of type I, then ran fs ∩ ran xk = ran fu ∩ ran xk (iv) if w(ft ) = mj0 , then for all s ∈ St * ran fs ∩ ran xk ran ft ∩ ran xk The next lemma describes the properties of the set Tk . Lemma II.16. For every k we have the following: (i) If t ∈ T and ft is of type II then t ∈ Tk . (ii) If t ∈ Tk , then for every s < t: if fs is of type I, then w(fs ) = mj0 .
28
Chapter II. Tree Complete Extensions of a Ground Norm
(iii) If Tk is not a singleton, then its members are incomparable members of the tree T . Moreover if t1 , t2 are two different elements of Tk and s is the (necessarily uniquely determined) maximal element of T satisfying s < t1 and s < t2 then fs is of type II. (iv) If t ∈ T is such that supp ft ∩ ran xk = ∅ and u ∈ Tk for all u < t, then there exists s ∈ Tk with t ≤ s. In particular if supp f ∩ ran xk = ∅, then Tk = ∅. {k : s ∈ Tk }. Definition II.17. For every t ∈ T we define Dt = s≥t
Lemma II.18. According to the notation above we have the following: (i) If supp f ∩ ran xk = ∅, then k∈ D0 (remember that 0 denotes the unique root of T and f = f0 ). Hence f ( λk xk ) = f ( λk xk ). k∈D0
(ii) If ft is of type I with w(ft ) = mj0 , then Dt is an interval of N. (iii) If ft is of type I with w(ft ) = mj0 , then Ds ∪ {Ds : s ∈ St } {k} : k ∈ Dt \ s∈St
is a family of successive subsets of N. Moreover for every k ∈ Dt \
Ds
s∈St
(i.e. for k such that t ∈ Tk ) such that supp ft ∩ran xk = ∅ there exists a s ∈ St such that either min supp xk ≤ max supp fs < max supp xk or min supp xk < min supp fs ≤ max supp xk . (iv) If ft is of type II, s ∈ St and k ∈ Dt \ Ds , then supp fs ∩ ran xk = ∅ and hence fs (xk ) = 0. Recall that we have fixed a tree analysis (ft )t∈T for the given f . We shall construct two families (gt1 )t∈T and (gt2 )t∈T such that the following conditions are fulfilled. (i) For every t ∈ T such that ft is not of type II, gt1 = ht or gt1 = e∗kt + ht with kt ∈ supp ht , where ht ∈ W0 and gt2 ∈ c00 (N) with gt2 ∞ ≤ ε. (ii) For every t ∈ T , supp gt1 ⊂ Dt and supp gt2 ⊂ Dt and the functionals gt1 , gt2 have nonnegative coordinates. (iii) For t ∈ T with ft ∈ G and Dt = ∅ we have that gt1 = e∗p . rs fs (where rs ∈ Q+ for every s ∈ St and (iv) For ft of type II with f = s∈St rs = 1) we have gt1 = rs gs1 and gt2 = rs gs2 . s∈St
s∈St
s∈St
(v) For ft of type I with w(f ) = mj we have gt1 = e∗kt where kt ∈ Dt is such 0 2 εe∗k . that |λkt | = max |λk | and gt = k∈Dt
k∈Dt
II.2. R.I.S. Sequences and the Basic Inequality
29
(vi) For ft of type I with w(f ) = mj for j = j0 we have gt1 = ht or gt1 = e∗kt + ht where ht ∈ W0 with w(ht ) = mj and kt ∈ supp ht . (vii) For every t ∈ T the following inequality holds: |ft (
λk xk )| ≤ C(gt1 + gt2 )(
k∈Dt
|λk |ek ).
k∈Dt
When the construction of (gt1 )t∈T and (gt2 )t∈T has been accomplished, we set g1 = g01 and g2 = g02 (where 0 is the root of T and f = f0 ) and we observe that these are the desired functionals. To show that such (gt1 )t∈T and (gt2 )t∈T exist we use finite induction starting with those t ∈ T which are maximal and in the general inductive step we assume that gs1 , gs2 have been defined for all s > t satisfying the inductive assumptions and we define gt1 and gt2 . 1st inductive step Let t ∈ T be maximal; then ft ∈ G. If Dt = ∅, we define gt1 = 0 and gt2 = 0. If Dt = ∅, we set Et = {k ∈ Dt : |ft (xk )| > ε} and Ft = Dt \ Et . If Et = ∅, then from our assumption in the statement of the proposition we have that Et = {kt }. We define gt1 =
k∈Et
e∗k . gt2 =
εe∗k ,
k∈Ft
and gt2 ∞ ≤ ε. Inequality (vii) is easily checked. General inductive step Let t ∈ T and suppose that gu1 and gu2 have been defined for every u > t satisfying the inductive assumptions. If Dt = ∅, we set gt1 = 0 and gt2 = 0. In the remainder of the proof we assume that Dt = ∅. We consider the following three cases: 1st case: The functional ft is of +type II. rs fs where rs ∈ Q are such that rs = 1. In this case, we have Let ft = s∈S s∈St t Ds . We define that Dt = s∈St
gt1 =
s∈St
rs gs1 and gt2 =
rs gs2 .
s∈St
Inequality (vii) is easily verified. 2nd case: The functional ft is of type I with w(f ) = mj0 . In this case Dt is an interval of the natural numbers (Lemma II.18(ii)). Let kt ∈ Dt
30
Chapter II. Tree Complete Extensions of a Ground Norm
be such that |λkt | = max |λk |. We define k∈Dt
gt1 = e∗kt and gt2 =
εe∗k .
k∈Dt
Inequality (vii) is easily established. 3rd case: The functional ft is of type I with w(f ) = mj for j = j0 . fs and the family {fs : s ∈ St } is a family of successive Then ft = m1j s∈St
functionals with #(St ) ≤ nj . We set Et
{k : t ∈ Tk and supp ft ∩ ran xk = ∅} (= {k ∈ Dt \ Ds : supp ft ∩ ran xk = ∅}). =
s∈St
We consider the following partition of Et . Et2 = {k ∈ Et : mjk+1 ≤ mj } and Et1 = Et \ Et2 . We define gt2 =
k∈Et2
εe∗k +
gs2 .
s∈St
Observe that gt2 ∞ ≤ ε. Let Et1 = {k1 < k2 < · · · < kl }. From the definition of Et1 we get that mj < mjk2 < · · · < mjkl . We set kt = k1 and gt1 = e∗kt + ht where ht =
l 1 ∗ ( eki + gs1 ). mj i=2 s∈St
(The term e∗kt does not appear if Et1 = ∅.) It is easy to verify that inequality (vii) holds. By the second part of Lemma II.18(iii), for every k ∈ Et there exists an element of the set N = {min supp fs , max supp fs : s ∈ St } belonging to ran xk . Hence #(Et1 ) ≤ #(Et ) ≤ 2nj . We next show that ht ∈ W0 with w(ft ) = mj . We first examine the case that for every s ∈ St the functional fs is not of type II. Then for every s ∈ St one of the following holds: (i) fs ∈ G. In this case gs1 = e∗ks ∈ W0 (by the first inductive step). (ii) fs is of type I with w(fs ) = mj0 . In this case gs1 = e∗ks ∈ W0 . (iii) fs is of type I with w(fs ) = mj for j = j0 . In this case gs1 = e∗ks + hs (or gs1 = hs ) where hs ∈ W0 and ks ∈ supp hs . We set Es1 = {n ∈ N : n < ks }, Es2 = {n ∈ N : n > ks } and h1s = Es1 hs , h2s = Es2 hs . The functionals h1s , e∗ts , h2s are successive and belong to W0 .
II.2. R.I.S. Sequences and the Basic Inequality
31
We set Tt1 Tt2 Tt3
= {s ∈ St : fs ∈ G} = {s ∈ St : fs of type I and w(fs ) = mj0 } = {s ∈ St : fs of type I and w(fs ) = mj0 }.
The family of successive (see Lemma II.18(iii)) functionals of W0 , {e∗ki : i = 2, . . . , l} ∪ {gs1 : s ∈ Tt1 } ∪ {gs1 : s ∈ Tt2 } ∪{h1s : s ∈ Tt3 } ∪ {e∗ks : s ∈ Tt3 } ∪ {h2s : s ∈ Tt3 } has cardinality ≤ 5nj , thus we get that ht ∈ W0 with w(ht ) = mj . For the case that for some s ∈ St the functional fs is of type II, the conclusion follows from the previous case and Lemma II.8. n
j0 be a (C, ε) R.I.S. with ε ≤ Proposition II.19. Let (xk )k=1
2 m2j
such that for every
0
g ∈ G, |g(xk )| > ε for at most one k. Then: 1) For every f ∈ D with w(f ) = mi ,
nj0 1 |f ( xk )| ≤ n j0 k=1
In particular n1j
0
nj0
xk ≤
k=1
2C mj0
3C mj0 mi , C C nj0 + mi
if i < j0 + Cε ,
if i ≥ j0 .
.
n
j0 2) If (bk )k=1 are scalars with |bk | ≤ 1 such that
|h(
bk xk )| ≤ C(max |bk | + ε k∈E
k∈E
|bk |)
(II.5)
k∈E
for every interval E of positive integers and every h ∈ D with w(h) = mj0 , then nj0 4C 1 bk xk ≤ 2 . n j0 m j0 k=1
Proof. The proof is an application of the basic inequality (Proposition II.14) and Lemma II.9. Indeed, let f ∈ D with w(f ) = mi . Proposition II.14 yields the existence of an h1 ∈ W0 with w(h1 ) = mi , a t ∈ N and an h2 ∈ c00 (N) with h2 ∞ ≤ ε, such that nj0 nj0 % $ 1 1 ∗ |f ( xk )| ≤ C(et + h1 + h2 ) ek . n j0 n j0 k=1
k=1
32
Chapter II. Tree Complete Extensions of a Ground Norm If i ≥ j0 , we get that |f ( n1j
0
nj0
k=1
xk )| ≤ C( n1j + 0
If i < j0 , using Lemma II.9 we get that |f ( n1j
0
3C mi ·mj0
nj0
k=1
1 mi
+ ε) <
C nj0
xk )| ≤ C( n1j + 0
+
C mi
2 mi ·mj0
+ Cε. + ε) <
. n
j0 In order to prove 2) let (bk )k=1 be scalars with |bk | ≤ 1 such that (II.5) is satisfied. Then condition (II.4) of the basic inequality is satisfied for the linear nj0 combination n1j bk xk . Thus for every f ∈ D with w(f ) = mi , i = j0 there 0
k=1
exist t ∈ N, h1 ∈ W0 , h2 ∈ c00 (N) with h1 , h2 having nonnegative coordinates, h2 ∞ ≤ ε and h1 admitting a tree (ht )t∈T with w(ht ) = mj0 for every t ∈ T with ht of type I, such that nj0 nj0 nj0 % % $ 1 $ 1 1 bk xk )| ≤ C(e∗t + h1 + h2 ) |bk |ek ≤ C(e∗t + h1 + h2 ) ek n j0 n j0 n j0 k=1 k=1 k=1 (II.6) Using the second part of Lemma II.9 we deduce that
|f (
nj0 1 1 4C 1 bk xk )| ≤ C( + 2 + ε) < 2 . |f ( n j0 n j0 m j0 m j0 k=1
For f ∈ D with w(f ) = mj0 , from condition (II.5) we get that |f ( n1j
0
C nj0
(1 +
2 m2j
n j0 ) <
0
4C m2j
.
nj0
k=1
bk xk )| ≤
0
Proposition II.20. Suppose that there exists a universal constant C > 0 such that for every (xk )k block sequence in Xκ [DG ] and every j ∈ N there exists a (C, m21 ) 2j+1
R.I.S. y1 , y2 , . . . , yn2j+1 in span{xk : k ∈ N} such that 1 (i) n2j+1
n2j+1 k=1
yk ≥
1 m2j+1 .
1 (ii) For every f ∈ DG with w(f ) = m2j+1 we have |f ( n2j+1
n2j+1
(−1)k+1 yk )| <
k=1
C . m22j+1
Then the space Xκ [DG ] contains no unconditional basic sequence. Proof. Proposition II.19 yields that + + +
1 n2j+1
n2j+1
k=1
+ + (−1)k+1 yk + <
4C . m22j+1
This and assumption (i) of the statement yield that for every block sequence (xk )k∈N is not unconditional.
II.2. R.I.S. Sequences and the Basic Inequality
33
The result follows from the fact that every subspace of Xκ [DG ] contains a further subspace isomorphic to a subspace generated by a block sequence (xk )k∈N (Proposition A.3). Definition II.21 (k1 -averages). Let k ∈ N. A finitely supported vector x ∈ Xκ [DG ] is said to be a C − k1 average if x > 1 and there exist x1 < . . . < xk with k xi ≤ C such that x = k1 xi . i=1
Lemma II.22. Let k ∈ N and ε > 0. Then every block subspace of Xκ [DG ] contains a vector x which is a 2 − k1 average. If Xκ [DG ] is a strictly singular extension of YG then we may select x satisfying additionally xG < ε. Proof. If Xκ [DG ] is a strictly singular extension of YG we may pass to a further subspace Z on which the restriction of the identity map I : Xκ [DG ] → YG has norm less than 2ε . We choose j, s ∈ N such that ks ≤ n2j and 2s > m2j . Such a choice is possible from the definition of the sequences (mj )j , (nj )j . Let (xi )i be a normalized block p k q xl for p = 0, 1, 2, . . . sequence in the block subspace Z. We set xp,q = l=kp (q−1)+1
and q = 1, 2, . . .. Assume that the conclusion of the lemma fails. Then an easy inductive argument yields that xp,q < ( k2 )p for all p, q ≥ 1. In particular xs,1 < ( k2 )s . Since ks ≤ n2j , using the fact that the set DG is closed in the (An2j , m12j ) ks s xl = mk2j . Thus 2s < m2j , a contradicoperations we get that xs,1 ≥ m12j l=1
tion. Therefore there exists a 2 − k1 average z in Z, while our choice of Z yields that zG < ε. Lemma II.23. Let x be a C − k1 average. Then for every n ≤ k and every sequence n of intervals E1 < . . . < En , we have that El x ≤ C(1 + 2n k ). In particular if l=1
n
x is an C − 1 j average, then for every f ∈ D with w(f ) = mi , i < j, we have 2n 1 |f (x)| ≤ m1i C(1 + nj−1 ) ≤ 3C 2 mi . j Proof. Let x =
1 k
k
xi be a C − k1 average. Let also E1 < E2 < · · · < En be a
i=1
sequence of intervals, where n ≤ k. For l = 1, . . . , n, let Il (Jl resp.) be the set of n all i such that supp xi is contained in (resp. intersects) El . Clearly #Il ≤ k, l=1 El xi ≤ k1 C(#Il + 2). Therefore while for each l we have that El x ≤ k1 n l=1
El x ≤
C k1 (
n l=1
i∈Jl
#Il + 2n) ≤ C(1 +
2n k ).
34
Chapter II. Tree Complete Extensions of a Ground Norm
Lemma II.24. Let (xk )k∈N be a block sequence in Xκ [DG ] such that each xk is a C − l1k average, where (lk )k∈N is a strictly increasing sequence of integers, and let ε > 0. Then there exists a subsequence of (xk )k∈N which is a ( 3C 2 , ε) R.I.S. Proof. For each k we set jk = max{j : nj ≤ lk }. There exists a subsequence of (xk )k∈N (we denote this subsequence again by (xk )k∈N ) such that (jk )k∈N is a strictly increasing sequence and mjk+1 > 1ε # supp(xk ) for all k. From Lemma II.23 we also get that for each k and every f ∈ DG with w(f ) = mi , i < jk , we 1 have that |f (xk )| ≤ 3C 2 mi . Therefore this subsequence is a ( 3C 2 , ε) R.I.S. Proposition II.25 (Existence of R.I.S.). If Xκ [DG ] is a strictly singular extension of YG , then for every ε > 0 and every block subspace Z of Xκ [DG ] there exists a (3, ε) R.I.S. (xk )k in Z with xk > 1 and xk G < ε.
Proof. It follows from Lemma II.22 and Lemma II.24.
Proposition II.26. Let G be a ground subset of c00 (ω). If X[DG ] is a strictly singular extension of YG , then the dual space X[DG ]∗ of X[DG ] is the norm closed linear span of the w∗ closure of G. w∗
X[DG ]∗ = span(G
). w∗
Proof. Assume the contrary. Then setting Z = span(G ) there exists ∗∗ such that Z ⊂ Kerx∗∗ , x∗∗ = 2 x∗ ∈ Xκ [DG ]∗ \ Z with x∗ = 1 and x∗∗ ∈ XG ∗∗ ∗ and x (x ) = 2. First we observe that the space X[DG ] contains no isomorphic copy of 1 . Indeed, if not, then there exists a normalized block sequence (zn )n∈N equivalent to the usual 1 basis. But from Propositions II.19 and II.25 for every n2j all j there exist (yi )i=1 normalized block sequence block sequence (un )n∈N and for n2j 1 6 of (un )n∈N such that n2j i=1 yi ≤ m2j . This leads to a contradiction. From Odell–Rosenthal’s theorem there exists a sequence (xk )k∈N in X[DG ] w∗
with xk ≤ 2 such that xk −→ x∗∗ . Since each e∗n belongs to Z we get that lim e∗n (xk ) = 0 for all n, thus, using a sliding hump argument, we may assume k
that (xk )k∈N is a block sequence. Since also x∗ (xk ) → x∗∗ (x∗ ) = 2 we may also assume that 1 < x∗ (xk ) for all k. Let’s observe that every convex combination of (xk )k∈N has norm greater than 1. w∗
Considering each xk as a continuous function xk : G → R we have that the sequence (xk )k∈N is uniformly bounded and tends pointwise to 0, hence it is w∗
w∗
a weakly null sequence in C(G ). Since YG is isometric to a subspace of C(G ) w we get that xk −→ 0 in YG , thus there exists a convex block sequence (yk )k∈N of (xk )k∈N with yk G → 0. We may thus assume that yk G < 2ε for all k, where ε = n14 . We may construct a block sequence (zk )k∈N of (yk )k∈N such that (zk )k∈N is a (3, ε) R.I.S. of 1 averages and each zk is an average of (yk )k∈N with zk < ε.
II.2. R.I.S. Sequences and the Basic Inequality Proposition II.19 yields that the vector z =
1 n4
35 n4
zk satisfies z ≤
k=1
2·3 m4
< 1.
On the other hand, the vector z, being a convex combination of (xk )k∈N , satisfies z < 1. This contradiction completes the proof of the proposition. Remark II.27. The content of the above proposition is that the strictly singular w∗ extension X[DG ] of the space YG is actually a reflexive extension. Namely if G is a subset of c00 (N) then a consequence of Proposition II.26 is that the space X[DG ] is reflexive. Furthermore, if X[DG ] is nonreflexive then the quotient space X[DG ]∗ /X[DG ]∗ is norm generated by the classes of the elements of the set G
w∗
.
We denote by G0 (κ) the ground set {±eα : α < κ}. Proposition II.28. For every ordinal κ and every DG0 (κ) tree complete extension of G0 (κ) the bimonotone transfinite basis (eα )α<κ of X[DG0 (κ) ] is boundedly complete and shrinking, hence the space X[DG0 (κ) ] is reflexive. We refer the reader to Appendix A for the definitions of boundedly complete and shrinking transfinite bases and the proof that this properties yield the reflexivity of the space. Proof. We prove it for the case κ = ω. The general case is reduced to this one. The fact that the norming set DG0 (κ) is closed in the (An2j , m12j ) operations implies that for every j ∈ N and every sequence of finite intervals E1 < E2 < n 2j · · · < En2j we have that for every x ∈ c00 , x ≥ m12j Ei x. Thus, since the i=1
n
)j increases to infinity, it follows that the basis (en )n is boundedly sequence ( m2j 2j complete. We next show that the basis (en )n is shrinking. Assume the contrary. Then ∞ bn en . We may there exists a x∗ ∈ X[DG0 (κ) ]∗ \span{e∗n : n ∈ N}. Let x∗ = w∗ − n=1
choose an ε > 0 and a sequence of successive intervals (En )n with En x∗ > ε. We choose j ∈ N with m2j > 3ε . Pick (xn )n a sequence in X[DG0 (κ) ] such that supp xn ⊂ En , xn = 1ε and ∗ x (xn ) > 1. The action of x∗ yields that every convex combination of (xn )n has norm greater than 1. 3 On the other hand we may select a ( 2ε , m12j ) R.I.S. of 1 averages y1 , y2 , . . . , yn2j such that each yl is an average of (xn )n . Proposition II.19 yields that the n 2j vector y = n12j yl satisfies y < εm32j . But since y is a convex combination of l=1
(xn )n we also have that y > 1, a contradiction.
Remark II.29. It is easy to see that similar arguments yield that the basis (eα )α<κ of X[DG ] is boundedly complete for an arbitrary ground subset G of c00 (κ) and any tree complete extension DG .
36
Chapter II. Tree Complete Extensions of a Ground Norm
Proposition II.30. Let G be a ground subset of c00 (ω). If X[DG ] is a strictly singular extension of YG , then X[DG ] is reflexive saturated (or somewhat reflexive). Proof. Let Z be a block subspace of X[DG ]. From the fact that the identity operator I : X[DG ] → YG is strictly singular we may choose a normalized block sequence ∞ zn G < 12 . We claim that the space Z = span{zn n ∈ N} (zn )n∈N in Z, with n=1
is a reflexive subspace of Z. It is enough to show that the Schauder basis (zn )n∈N of Z is boundedly complete and shrinking. The first follows from the fact that (zn )n∈N is a block sequence of the boundedly complete basis (en )n∈N of X[DG ]. To see that (zn )n∈N n→∞ ∗ is shrinking it is enough to show that f |span{zi i≥n} −→ 0 for every f ∈ XG . ∞ w∗ 1 zn G < 2 From Proposition II.26 it is enough to prove it for f ∈ G . Since n=1
the conclusion follows.
Definition II.31 (exact pair). A pair (x, φ) with x ∈ Xκ [DG ] and φ ∈ DG is said to be a (θ, C, j) exact pair (where θ ∈ {0, 1}, C ≥ 1, j ∈ N) if the following conditions are satisfied: (i) 1 ≤ x ≤ C, for every ψ ∈ DG of type I with w(ψ) = mi , i = j we have 3C that |ψ(x)| ≤ m if i < j, while |ψ(x)| ≤ mC2 if i > j. i j
(ii) φ is of type I with w(φ) = mj . (iii) φ(x) = θ and ran x = ran φ. Proposition II.32. If Xκ [DG ] is a strictly singular extension of YG , then for every block subspace Z of Xκ [DG ], every ε > 0 and j ∈ N there exists a (1, 6, 2j) exact pair (x, φ) with x ∈ Z and xG < ε. n
2j Proof. From Proposition II.25 there exists (xk )k=1 a (3, ε)-R.I.S. with ε ≤ 1/m32j . ∗ ∗ ∗ Choose xk ∈ DG with xk (xk ) = 1 and ran xk ⊂ ran xk . Then Proposition II.19 yields that n2j n2j 1 ∗ m2j xk , xk ) ( n2j m2j
k=1
k=1
is a (1, 6, 2j) exact pair.
Definition II.33. Let (X, · ) be a Banach space. X is said to be λ-distortable, λ > 1, if there exists an equivalent norm | · | on X such that, ,
|x| inf sup : x, y ∈ Y and x = y = 1 ≥ λ . Y ⊂X |y| X is said to be arbitrarily distortable if it is λ-distortable for every λ > 1. Theorem II.34. If Xω [DG ] is a strictly singular extension of YG , then Xω [DG ] is arbitrarily distortable.
II.2. R.I.S. Sequences and the Basic Inequality
37
Proof. Let λ > 1 and choose j0 ∈ N such that m2j0 /144 > λ. Define |x| =
1 x + sup{|φ(x)| : φ ∈ DG and w(φ) = m2j0 } . m2j0
Then | · | is an equivalent norm . Let Y be a subspace of Xω [DG ]. By standard arguments we may assume that Y is a block subspace. By Proposition II.32 there exists a (1, 6, 2j0 ) exact pair (x1 , φ1 ) with x1 ∈ Y and w(φ1 ) = m2j0 . It follows that (II.7) |x1 | ≥ φ1 (x1 ) = 1 . Also by Proposition II.32 there exists a (1, 6, 2j0 + 2) exact pair (x2 , φ2 ) with x2 ∈ Y . From the properties of the exact pairs, in particular from Definition II.31(i), it follows that 6 18 24 + = . (II.8) |x2 | ≤ m2j0 m2j0 m2j0 Setting x =
x1 x1
and y =
x2 x2 ,
it follows from (II.7) and (II.8) that
|x| ≥ m2j0 /144 > λ . |y| Since Y was arbitrary chosen we have that Xω [DG ] is arbitrarily distortable.
Remark II.35. For a transfinite ordinal κ and every λ > 1 it can be shown, using the previous method, that there exists an equivalent norm which λ-distorts every block subspace of Xκ [DG ]. Since the block subspaces do not describe all subspaces of Xκ [DG ], κ > ω, it remains unknown if the previous result holds in full generality. Notes and Remarks. As we have mentioned in the introduction, strictly singular extensions were introduced in [16], for higher complexity saturation methods. In the present form they are contained in [4]. The tree complete extensions and the basic inequality were also introduced and studied in [16]. With the tree complete extensions we attempt to isolate the results obtained from the unconditional part of the definition of the norming set DG . Thus, independently of the definition of the special functions, resulting from (An2j+1 , m12j )j operations which act on special sequences, one can have seminormalized 1 averages and from these the exact pairs. As we will see in the next chapter exact pairs are the key component in the n2j+1 -dependent sequences. There is a very interesting interference of the distortion of Banach spaces with the discovery of HI spaces, that we would like to present. R.C. James proved that the spaces c0 and 1 are not distortable [37]. In the late 60’s V. Milman [49] proved the following. If X is a Banach space with the property that for every equivalent norm on X and every subspace Y of X and > 0 there exists a subspace Z of Y such that the initial and the new norm are (1 + ) equivalent, then either some p or c0 is isomorphic to a subspace of X. When Tsirelson discovered his space it became clear that there are Banach spaces not satisfying Milman’s condition.
38
Chapter II. Tree Complete Extensions of a Ground Norm
In the early 1990s E. Odell constructed a norm on Tsirelson space which (2 − ) distorts the original norm. After this, Schlumprecht presented his space as the first example of an arbitrarily distortable Banach space, and based on this, Gowers and Maurey proceeded to the construction of their space. Subsequently Odell and Schlumprecht [52], [53], showed that p , 1 < p < ∞ are arbitrarily distortable and B. Maurey extended this to Banach spaces not containing uniformly n1 [45]. Finally N. Tomczack [63], proved that every HI space is arbitrarily distortable. It remains open whether or not the notions of distortable and arbitrarily distortable are equivalent. In particular we do not know if Tsirelson space is arbitrarily distortable. Notice that the p-convexification (1 < p < ∞) of Tsirelson space is arbitrarily distortable. This is a consequence of the aforementioned Maurey theorem. The key role of the Tsirelson space in the study of the above problem arises from a result of V. Milman and N. Tomczak [50] that asserts the following. If X is a Banach space with no arbitrarily distortable subspace, then X contains an asymptotic p (or c0 ) space. Results related to the distortion of asymptotic 1 spaces are contained in [9] and [44].
Chapter III
Hereditarily Indecomposable Extensions with a Schauder Basis III.1 The HI Property in X[G, σ] In this chapter we make the final step in the definition of HI extensions for spaces with a Schauder basis. Thus we introduce a coding σ and then we define the n2j+1 1 ) special sequences. The tree complete norming set is closed for all (An2j+1 , m2j+1 operations acting on n2j+1 -special sequences. We also provide sufficient conditions for the HI property of the predual X[G, σ]∗ . Definition III.1. A Banach space X is said to be Hereditarily Indecomposable (HI) if for every infinite dimensional closed subspace Y of X there is no nontrivial projection P : Y → Y . (A projection is said to be trivial if either the dimension or the codimension of its kernel is finite). For equivalent reformulations of the above definition we refer to Proposition IV.4. Throughout this section we shall work in c00 (i.e. κ = ω). Given G a ground set we define a tree complete set DG as follows. Definition III.2. The set DG is the minimal subset of c00 satisfying the following conditions. (i) G ⊂ DG . (ii) DG is symmetric (i.e. if f ∈ DG then −f ∈ DG ). (iii) DG is closed under the restriction of its elements on intervals of N (i.e. if f ∈ DG and E is an interval of N, then Ef ∈ DG ).
40 Chapter III. Hereditarily Indecomposable Extensions with a Schauder Basis (iv) DG is closed under the (An2j , m12j ) operations, i.e. if f1 < f2 < · · · < fn2j belong to DG , then the functional f = m12j (f1 + f2 + · · · + fn2j ) belongs also to DG . 1 ) operations on special sequences i.e. (v) DG is closed under the (An2j−1 , m2j−1 for every n2j−1 -special sequence (f1 , f2 , . . . , fn2j−1 ) of length n2j−1 the func1 tional f = m2j−1 (f1 + f2 + · · · + fn2j−1 ) belongs to DG .
(vi) The set DG is rationally convex. Next we define the n2j−1 -special sequences. For this we shall use a coding function σ defined as follows. The coding function σ Let Qs denote the set of all finite sequences (φ1 , φ2 , . . . , φd ) such that φi ∈ c00 (N) , φi = 0 with φi (n) ∈ Q for all i, n and φ1 < φ2 < · · · < φd . We fix a pair Ω1 , Ω2 of disjoint infinite subsets of N. From the fact that Qs is countable we are able to define an injective coding function σ : Qs → {2j : j ∈ Ω2 } such that 1 : l ∈ supp φi , i = 1, . . . , d} · max supp φd . mσ(φ1 ,φ2 ,...,φd ) > max{ |φi (e l )| The n2j−1 -special sequences n
2j−1 A finite sequence (fi )i=1 is said to be a n2j−1 -special sequence provided that
(i) (f1 , f2 , . . . , fn2j−1 ) ∈ Qs and fi ∈ DG for i = 1, 2, . . . , n2j−1 . 1/2
(ii) w(f1 ) = m2k with k ∈ Ω1 , m2k > n2j−1 and w(fi+1 ) = mσ(f1 ,...,fi ) for each 1 ≤ i < n2j−1 . This completes the definition of DG and it is easy to check that the set DG , the definition of which depends on the coding function σ, is a tree complete extension of G. We denote by X[G, σ] the Banach space X[DG ]. As we have mentioned the weight w(f ) of a functional f ∈ DG of type I is n2j−1 not unique. However when we refer to a n2j−1 -special sequence (fi )i=1 by w(fi ) for 2 ≤ i ≤ n2j−1 we shall always mean w(fi ) = mσ(f1 ,...,fi−1 ) (∈ Ω2 ). Proposition III.3 (The tree-like property of n2j−1 -special sequences). Let Φ = n2j−1 n2j−1 , Ψ = (ψ)i=1 be two distinct n2j−1 -special sequences. Then (φ)i=1 (i) For 1 ≤ i < j ≤ n2j−1 we have that w(φi ) = w(ψj ). (ii) There exists kΦ,Ψ such that φi = ψi for i < kΦ,Ψ and w(φi ) = w(ψi ) for i > kΦ,Ψ . We leave the easy proof to the reader.
III.1. The HI Property in X[G, σ]
41 n
2j−1 Definition III.4 (dependent sequences). A double sequence (xk , x∗k )k=1 with xk ∈ ∗ X[G, σ] and xk ∈ DG is said to be a (θ, C, 2j−1) dependent sequence (for θ ∈ {0, 1}, n2j−1 of even integers such that C > 1 and j ∈ N) if there exists a sequence (2jk )k=1 the following conditions are fulfilled:
n
2j−1 is a n2j−1 -special sequence with w(x∗k ) = m2jk for all k ≤ n2j−1 . (i) (x∗k )k=1
(ii) Each (xk , x∗k ) is a (θ, C, 2jk ) exact pair. Proposition III.5. Suppose that X[G, σ] is a strictly singular extension of YG and let ε > 0, j ∈ N. Then for every pair of block subspaces Z, W of X[G, σ] there n2j−1 with xk G < ε, x2k−1 ∈ Z exists a (1, 6, 2j − 1) dependent sequence (xk , x∗k )k=1 and x2k ∈ W for all k.
Proof. It follows easily from an inductive application of Proposition II.32. n
2j−1 be a (θ, C, 2j − 1) dependent sequence such Proposition III.6. Let (xk , x∗k )k=1 2 for all k. Then that xk G < m2 2j−1
a) If θ = 1, it holds
n2j−1
1 n2j−1
(−1)k+1 xk ≤
k=1
8C . m22j−1
b) If θ = 0, it holds
1 n2j−1
n2j−1
xk ≤
k=1
8C . m22j−1 n
2j−1 Proof. a) It is easy to see that the sequence (xk )k=1 is a (2C, n21 ) R.I.S. 2j−1
The conclusion will follow from Proposition II.19 2) after showing that for every f ∈ D with w(f ) = m2j−1 and every interval E of positive integers we have that $ % 2 |f (−1)k+1 xk | ≤ 2C(1 + 2 #(E)). m2j−1 k∈E
1 Such an f is of the form f = m2j−1 (F x∗t−1 + x∗t + · · · + x∗r + fr+1 + · · · + fd ) ∗ ∗ for some special sequence (x1 , x2 , . . . , x∗r , fr+1 , . . . , fn2j−1 ) of length n2j−1 with x∗r+1 = fr+1 and w(x∗r+1 ) = w(fr+1 ), d ≤ n2j−1 and F an interval of the form [m, max supp x∗t−1 ] (see Proposition III.3). We estimate the quantity f (xk ) for each k.
• If k < t − 1, we have that f (xk ) = 0. • If k = t − 1, we get |f (xt−1 )| =
1 ∗ m2j−1 |F xt−1 (xt−1 )|
• If k ∈ {t, . . . , r}, we have that f (xk ) =
≤
1 ∗ m2j−1 xk (xk )
=
1 m2j−1 xt−1 1 m2j−1 .
≤
C m2j−1 .
42 Chapter III. Hereditarily Indecomposable Extensions with a Schauder Basis • If k > r + 1, Proposition III.3 yields that w(fi ) = m2jk for all i > r. Using the fact that (xk , x∗k ) is a (C, 2jk ) exact pair and taking in account that n22j−1 < m2j1 ≤ m2jk we get |f (xk )| = 1 |(fr + . . . + fd )(xk )| = m2j−1 1 ' |fi (xk )|+ ≤ m2j−1 '
1
≤
m2j−1
w(fi )<m2jk
2j−1
|fi (xk )|+
( |f2i (x2k−1 )|
2r+2≤2i≤d
w(fi )>m2jk
3C C C +n2j−1 2 ) ≤ 2 . ml m2jk m2j−1
• For k = r + 1, the same argument as in the previous case yields that C |f (xr+1 )| ≤ m2j−1 + m21 < mC+1 . 2j−1 2j−1
Let now E be an interval. From the previous estimates we get that
% $ 1 (−1)k+1 xk | ≤ |f (xt−1 )| + (−1)k+1 |f m2j−1 k∈E k∈E∩[t,r] |f (xk )| +|f (xr+1 )| + k∈E∩[r+2,n2j−1 ]
C 1 C +1 C + + + 2 #(E) m2j−1 m2j−1 m2j−1 m2j−1 2 < 2C(1 + 2 #(E)). m2j−1 ≤
This completes the proof of the first part. b) The proof of b) follows using similar arguments.
Theorem III.7. Every X[G, σ] which is a strictly singular extension of YG is a HI space. In other words, strictly singular extensions are HI extensions. Proof. Let Z, W be infinite dimensional subspaces of X[G, σ]. We shall show that for every ε > 0 there exist z ∈ Z, w ∈ W with z − w < εz + w. It is easy to check that this yields the HI property of X[G, σ]. From the well known gliding hump argument we may assume that Z, W are block subspaces. Then for n2j−1 a (6, 2j − 1) dependent j ∈ N, using Proposition III.5, we select (xk , x∗k )k=1 2 sequence with xk G < m2 , x2k−1 ∈ Z and x2k−1 ∈ W for all k. Observe that n2j−1 1
n2j−1
2j−1
xk ≥
k=1
Thus setting z = z − w ≤
1 m2j−1
n2j−1 /2 k=1
48 m2j−1 z
1 and n2j−1
n2j−1
(−1)k+1 xk ≤
k=1 n2j−1 /2
x2k−1 and w =
48 m22j−1
(Proposition III.6).
x2k we get that z ∈ Z, w ∈ W and
k=1
+ w which for sufficiently large j yields the desired result.
III.2. The HI Property in X[G, σ]∗
43
Therefore the space X[G, σ] is HI.
The space X[G0 , σ] where G0 = {±e∗n : n < ω} is an example of a reflexive HI space. Theorem III.8. The space X[G0 , σ] where G0 = {±e∗n : n ∈ ω} is a reflexive HI space. Proof. It is easy to check that YG0 is the space c0 . Hence X[G0 , σ] is a strictly singular extension of YG0 and therefore HI. The reflexivity of X[G0 , σ] follows from Proposition II.28.
III.2 The HI Property in X[G, σ]∗ In this section we study the HI property of the predual X[G, σ]∗ . We are not able to establish this property for all strictly singular extensions. Actually we require an additional property of the space YG defined as uniformly bounded averages (definition III.13). The HI property X[G, σ]∗ is basic for the existence of a non separable HI space. Notation III.9. We shall denote by X[G, σ]∗ the subspace of the dual space X[G, σ]∗ generated by the biorthogonal functionals (e∗n )n∈N of the Schauder basis (en )n∈N of the space X[G, σ]. Notice that the basis (en )n of X[G, σ] is boundedly complete hence X[G, σ] is the dual of X[G, σ]∗ . Proposition III.10. Assume that there exists a constant C > 0 such that for every infinite dimensional subspace Z of X[G, σ]∗ , every ε > 0 and every j ∈ N there 5m 5m exists a (C, 2j) exact pair (x, φ) with dist(φ, Z) ≤ n2j2j and xG ≤ n2j2j . Then the space X[G, σ]∗ is HI. Proof. Let Z, W be a pair of infinite dimensional subspaces of X[G, σ]∗ and let δ > 0. We shall find fZ ∈ Z and fW ∈ W such that fZ + fW < δfZ − fW . For j ∈ N , using our assumption, we may inductively select a (C, 2j − 1) de5m n2j−1 m2j−1 pendent sequence (xk , x∗k )k=1 such that xk G < n2j2jk < n2j−1 , dist(x∗2k−1 , Z) <
5m2jk m2j−1 n2j2k n2j−1
and dist(x∗2k , W ) <
k
5m2j2k m2j−1 n2j2k n2j−1
for all k (where w(x∗k ) = m2jk ). n2j−1 1 (−1)k+1 xk satisfies x ≤ From Proposition III.6 the vector x = n2j−1 k=1
8C . m22j−1
We set hZ =
1 m2j−1
n2j−1 k=1
x∗2k−1 and hW =
1 m2j−1
n2j−1 k=1
x∗2k . The functional
1 ) hZ + hW belongs to the norming set DG , as it is the result of an (An2j−1 , m2j−1 ∗ ∗ ∗ operation on the n2j−1 −special sequence (x1 , x2 , . . . , xn2j−1 ). Hence hZ + hW ≤
1. On the other hand hZ − hW ≥
(hZ −hW )(x) x
≥
1 m2j−1 8C m2 2j−1
=
m2j−1 8C .
44 Chapter III. Hereditarily Indecomposable Extensions with a Schauder Basis n
2j−1 From our choice of the dependent sequence (xk , x∗k )k=1 we also get that 1 1 dist(hZ , Z) < 2 and dist(hW , W ) < 2 . We may thus select fZ ∈ Z and fW ∈ W such that fZ +fW < hZ +hW + 12 + 12 ≤ 2 and fZ −fW > hZ −hW − 12 − 12 ≥ m2j−1 8C − 1. m2j−1 Hence fZ − fW > ( 16C − 2)fZ + fW which for large j yields the desired result, therefore the space X[G, σ]∗ is HI.
Definition III.11. Let k ∈ N. A finitely supported vector x∗ ∈ X[G, σ]∗ is said to be a C −ck0 vector if there exist x∗1 < · · · < x∗k such that x∗i > C −1 , x∗ = x∗1 +· · ·+x∗k and x∗ ≤ 1. Lemma III.12. Let Z be a block subspace of X[G, σ]∗ and let k ∈ N. Then there exists a block sequence (zi∗ )i∈N in Z such that for every i1 < i2 < · · · < ik the vector zi∗1 + zi∗2 + · · · + zi∗k is a 2 − ck0 vector. Proof. Assume that the conclusion of the lemma fails. We choose j, s ∈ N with ks ≤ n2j and 2s > m2j . Let (fi )i∈N be a normalized block sequence in Z. We set " # B1 = {l1 < l2 < · · · < lk } : fl1 + fl2 + · · · + flk > 2 . The Ramsey theorem yields that there exists L1 ∈ [N] such that either [L1 ]k ⊂ B1 or [L1 ]k ∩ B1 = ∅. From our assumption on the failure of the lemma the second alternative can not hold thus [L1 ]k ⊂ B1 . We may assume that L1 = N. We lk set f1,l = fl for l = 1, 2, . . .. As above we may assume, passing to a i=(l−1)k+1
subsequence, that f1,l1 + f1,l2 + · · · + f1,lk > 22 for every l1 < · · · < lk . After s steps, using the same argument, we arrive at a functional f ∈ Z which is of the ks fli with f > 2s . Since ks ≤ n2j we get that the functional m12j f is form f = i=1
the result of a (An2j , m12j ) on norm 1 functionals and hence f ≤ m2j . Therefore m2j < 2s , a contradiction which completes the proof of the lemma. Definition III.13. Let G be a ground set. The space YG has uniformly bounded averages if 1 → YG and for every ε > 0 and n0 ∈ N there exists k ∈ N such that for every weakly null block sequence (zn )n∈N in YG with zn G ≤ 1 there exist i1 < i2 < · · · < ik such that for every g ∈ G with min supp g < n0 we have that z +z +···+zik |g( i1 i2k )| < ε. Proposition III.14. Assume that YG has uniformly bounded averages and X[G, σ] is a strictly singular extension of YG . Let Z be an infinite dimensional subspace of X[G, σ]∗ and j ∈ N. Then there exists (1, 12, 2j) exact pair (y, φ) with dist(φ, Z) < 5m2j 5m2j n2j and yG < n2j . Proof. We may assume that Z is a block subspace of X[G, σ]∗ . We select 0 < ε < 1 n2j .
III.2. The HI Property in X[G, σ]∗
45
∗ ∗ Let k1 ∈ N. We choose a 2 − ck01 vector f1 = z1,1 + · · · + z1,k in Z and 1 k1 1 x1 = k1 (z1,1 + · · · + z1,k1 ) a 21 with ran f1 = ran x1 and f1 (x1 ) > 1. We set t1 = max supp f1 . Since YG has uniformly bounded averages there exists k2 = k( 4ε , t1 ) satisfying the property of Definition III.13; we may also as∗ ∗ )l in Z with min supp z2,1 > sume that k2 > k1 . We choose a block sequence (z2,l k2 ∗ ∗ max supp f1 such that z2,l > 12 and z2,i ≤ 2 for every i1 < · · · < ik2 in l l=1
∗ N. For each l we select z2,l ∈ X[G, σ] such that ran z2,l = ran z2,l , z2,l < 2 and ∗ z2,l (z2,l ) > 1. Since 1 → YG and (z2,l )l is a bounded sequence (in X[G, σ] and thus) in YG , we may assume that (z2,l )l is a weakly Cauchy sequence in YG . Thus the sequence (w2,l )l defined by w2,l = z2,2l−1 −z2,2l is a weakly null sequence in YG with w2,l ≤ 4. From our choice of k2 we may assume, passing to a subsequence k2 of (w2,l )l that |g( k12 w2,l )| < ε for every g ∈ G with min supp g ≤ t1 .
We set x2 =
1 k2
l=1 k2
w2,l and f2 =
k2
∗ z2l−1 . Observe that f2 ∈ Z with f2 ≤ 1
l=1
l=1
x2 ≥ f2 (x2 ) =
k2 1 ∗ z2l−1 (z2l−1 ) > 1 k2
while
l=1
which, in particular yields that x2 is a 4 − k12 average. We select k3 = k(ε, t2 ) with k3 > k2 satisfying the property of Definition III.13 where t2 = max supp f2 and we define x3 ∈ X[G, σ] and f3 ∈ Z similarly to the second step. Following this procedure we may construct a block sequence (xr )r∈N in X[G, σ] and a sequence (fr )r∈N in Z such that the following conditions are satisfied. (i) Each xr is a 4 − k1r average and each fr is a 4 − ck0r vector with fr (xr ) > 1 and ran ff = ran xr . (ii) For every g ∈ G with min supp g ≤ max supp xr−1 we have that |g(xr )| < ε. Thus for every g ∈ G we have that |g(xr )| > ε for at most one r. Passing to a subsequence we may additionally assume (Lemma II.24) that (xr )r∈N is a (6, ε) R.I.S. We set φ=
n2j n2j m2j 1 fr and x = xr . m2j r=1 n2j r=1
We have that f ∈ Z with w(f ) = m2j . Proposition II.19 yields that x ≤ 2·6 1 = 12. Thus 1 ≤ φ(x) ≤ x ≤ 12 hence we may select θ with 12 ≤θ≤1 m2j · m 2j such that φ(θx) = 1. We set y = θx. Using Proposition II.19 we easily get that (y, φ) is a (12, 2j) exact pair.
46 Chapter III. Hereditarily Indecomposable Extensions with a Schauder Basis It only remains to show that yG ≤ at most one r we get that |g(y)| ≤
5m2j n2j .
Let g ∈ G. Since |g(xr )| > ε for
m2j m2j (|g(x1 )| + · · · + |g(xn2j )|) ≤ (max xr + (n2j − 1)ε) n2j n2j r 5m2j 4m2j + 4ε < . < n2j n2j
Theorem III.15. If YG has uniformly bounded averages and X[G, σ] is a strictly singular extension of YG , then the space X[G, σ]∗ is HI. Proof. It follows from Proposition III.10 and III.14.
Definition III.16. Let G be a ground set. The space YG has the uniform weak Banach–Saks property if 1 → YG and for every ε > 0 there exists k ∈ N such that for every normalized weakly null block sequence (zn )n∈N in YG there exist z +z +···+zik i1 < i2 < · · · < ik such that i1 i2k G < ε. Corollary III.17. If YG has the uniform weak Banach–Saks property, then X[G, σ] is a strictly singular HI extension of YG and the space X[G, σ]∗ is HI. Notes and Remarks. There exists the unconditional counterpart of the reflexive HI space X[G0 , σ] (Theorem III.8). This space is a variation of the space presented by W.T. Gowers in [31]. To define this space we modify (v) of Definition III.2 by adding that for each spacial functional f and each E subset (not necessarily interval) of N, Ef ∈ DG . Then the resulting space denoted as Xu [G0 , σ] has an unconditional basis and it has a remarkable space of operators. Namely as it is shown in [34] every T ∈ L(Xu [G0 , σ]) is of the form D + S with D a diagonal operator and S strictly singular. This property yields that Xu [G0 , σ] is not isomorphic to any of its proper subspaces and every bounded linear projection is a strictly singular perturbation of a diagonal one. Other variants of the special sequences lead to indecomposable and unconditionally saturated Banach spaces (e.g. [14], [15]). The dual of a HI space X, even if X is reflexive, does not need to be HI. For example there exists a reflexive HI space X such that 2 is isomorphic to a subspace of X ∗ (e.g. [10]). More extreme is a recent result of a reflexive HI space X with X ∗ unconditionally saturated [17]. It is not known if such a divergent could be preserved in the subspaces of X. The following is open. Assume that X is a reflexive HI space. Does there exist a subspace Y of X such that Y ∗ is also HI? The HI constructions with the use of higher complexity saturation methods which appeared in [6] and [16] yield asymptotic 1 HI spaces. Variants of them could derive asymptotic p HI spaces for 1 < p < +∞ (e.g. [22]).
Chapter IV
The Space of the Operators for Hereditarily Indecomposable Banach Spaces IV.1
Some General Properties of HI Spaces
An important property of the HI spaces concerns the structure of the spaces of their operators. As we will see these spaces have few operators and also remarkable properties of the spaces itself are obtained as consequence of the structure of their operators. We start with the following fundamental results due to Gowers and Maurey [33]. Theorem IV.1. Every bounded linear operator T : X → X with X a complex HI space, is of the form T = λI + S with S a strictly singular operator. This result is not extendable in real HI spaces. However, as we will see, in the case of the HI extensions X[G, σ] the above property remains valid. For an arbitrary HI space the following holds. Theorem IV.2. Let X be a HI space (real or complex). Then every Fredholm operator is of index zero. For complex HI this is a consequence of the above Theorem and Fredholm’s theory. For real HI spaces X it uses the complexification of X. Corollary IV.3. Let X be a HI space. Then X is not isomorphic to any proper subspace of it. In particular X is not isomorphic to its hyperplanes. For the proof of the above results we refer the reader to the Gowers–Maurey paper and also to Maurey’s survey in the Handbook of the Geometry of Banach spaces [46]
48
Chapter IV. The Space of the Operators for HI Banach Spaces
This rest of the section contains some results obtained from the definition of HI Banach spaces and equivalent reformulations on it. Corollary IV.8 describes the frame on which we shall build the non separable HI space which will be presented in the next chapters. Also, Theorem IV.6 shows that every HI space is a subspace of ∞ (N). The next proposition summarizes the equivalent reformulations of the definition of HI Banach spaces. Proposition IV.4. Let X be a Banach space. The following assertions are equivalent: (1) The space X is HI. (2) For every pair of infinite dimensional closed subspaces Y ,Z of X, dist(SY , SZ ) = 0. (3) For every pair of infinite dimensional closed subspaces Y ,Z of X and δ > 0 there exist y ∈ Y and z ∈ Z such that y − z ≤ δy + z. (4) [V.D. Milman] For every infinite dimensional closed subspace Y of X, ε > 0 and W ⊂ BX ∗ such that W ε-norms Y , the space W⊥ = {x ∈ X : f (x) = 0 for every f ∈ W } is a finite dimensional subspace of X. Proof. The assertions (1), (2) and (3) are trivially equivalent by the open mapping theorem and the triangle inequality. We first show that (1) implies (4). If Y is an infinite dimensional closed subspace of X, ε > 0 and W ⊂ BX ∗ are such that W ε-norms Y then Y ∩ W⊥ = {0} and Y ⊕ W⊥ is a closed subspace of X. The HI property of X yields that W⊥ is necessarily finite dimensional. It remains to show that (4) implies (1). Suppose that the space X is not HI Then X has two infinite dimensional closed subspaces Y, Z such that Y ∩ Z = {0} and Y + Z is a closed subspace of X. Then the projection P : Y + Z −→ Y is continuous; set ε = P1 . For every y ∗ ∈ εBY ∗ we may select, by the Hahn– Banach theorem, a functional y∗ ∈ BX ∗ such that y∗ extends y ∗ ◦ P and y ∗ X ∗ = y ∗ : y ∗ ∈ εBY ∗ }. Then W ε-norms Y thus by y ∗ ◦ P (Y +Z)∗ . We set W = { (4) the space W⊥ should be finite dimensional. This leads to a contradiction since clearly W⊥ contains the infinite dimensional space Z. Therefore X is HI. Proposition IV.5. Let X be a HI Banach space, and let T : X −→ Y be a bounded linear operator where Y is any Banach space. Then exactly one of the following two holds: (i) The operator T is strictly singular. (ii) Ker T is a finite dimensional subspace of X and X can be written as the direct sum of Ker T and a subspace Z of X such that T|Z is an isomorphism. If Y = X and T is one-to-one, then either T is strictly singular or T is an onto isomorphism.
IV.1. Some General Properties of HI Spaces
49
Proof. Assume that T = 1. Suppose that (i) does not hold. Then there exists an infinite dimensional closed subspace W of X and an ε > 0 such that T w ≥ ε for every w ∈ SW . Suppose also that (ii) does not hold. Then the restriction of T to any subspace of X of finite codimension is not an isomorphism, thus, by Proposition II.3 there ε exists an infinite dimensional subspace Z of X such that T|Z ≤ . 2 Then for every z ∈ SZ and w ∈ SW we have that z − w ≥ T z − T w ≥ T w − T z ≥ ε −
ε ε = , 2 2
ε so we get that dist(SZ , SW ) ≥ which contradicts the HI property of X. Hence 2 Ker T is finite dimensional and has a complement Z such that T|Z is an isomorphism. If Y = X and T is one-to-one and not strictly singular, then T is an isomorphism. As we will see later no HI space is isomorphic to any proper subspace of it. Therefore T is onto. Theorem IV.6. Every HI Banach space X embeds into ∞ . Proof. Let Y be any separable infinite dimensional closed subspace of X and select a countable subset D of the unit ball of X ∗ such that D 12 norms Y . Since X is HI Proposition IV.4 yields that D⊥ is finite dimensional. We enlarge D by a finite set F such that (D ∪ F )⊥ = {0}. Let D ∪ F = {x∗n : n ∈ N}. We define the operator T : X −→ ∞ by the rule T (x) = (x∗n (x))n∈N . Observe that T is one-toone and T restricted to Y is an isomorphism. Proposition IV.5 yields that T is an isomorphism. Theorem IV.7. Let X be a Banach space and let Z be an infinite dimensional closed subspace of X such that Z is HI and the quotient map Q : X −→ X/Z is strictly singular. Then the space X is HI. Proof. We begin the proof with the next two claims. Claim 1. If Z0 is a finite dimensional subspace of Z, Y is an infinite dimensional closed subspace of X and δ > 0, then there exist y ∈ SY and z ∈ SZ with y − z < δ such that z0 < (1 + δ)z0 + λz for every z0 ∈ Z0 and every scalar λ. Proof of Claim 1. We may assume that δ < 1. Let {x1 , x2 , . . . , xk } be a SZ0 and pick for each i = 1, 2, . . . , k an fi ∈ SX ∗ with fi (xi ) = 1. Then finite codimensional in X, thus the subspace Y ∩(
k i=1
k
δ net in 4 Ker fi is
i=1
Ker fi ) is infinite dimensional.
From the fact that the operator Q : X −→ X/Z is strictly singular, we may choose
50
Chapter IV. The Space of the Operators for HI Banach Spaces k
δ δ . If z ∈ Z with y − z < 16 16 i=1 z δ then setting z = we get that z ∈ SZ and y − z < . z 8 1 To finish the proof of the claim it is enough to show that z0 +λz > for 1+δ every z0 ∈ SZ0 and every scalar λ. It is also enough to consider only λ with |λ| < 2. δ Let z0 ∈ SZ0 and |λ| < 2. We choose i ∈ {1, 2, . . . , k} such that z0 − xi < . 4 Then
a y ∈ Y ∩(
Ker fi ) with y = 1 and Qy <
z0 + λz
≥ xi + λz − z0 − xi > |fi (xi + λz)| −
δ 4
δ δ > 1 − |λ| · (|fi (y)| + y − z) − 4 4 δ δ 1 δ . > 1 − 2(0 + ) − = 1 − > 8 4 2 1+δ ≥ 1 − |λ| · |fi (z)| −
Claim 2. For every infinite dimensional closed subspace Y of X and every ε > 0 there exists an infinite dimensional closed subspace W of Z such that dist(w, SY ) < ε for every w ∈ SW . Proof of Claim 2. Let (εn )n∈N be a sequence of positive reals with and SY
∞
∞ &
(1 + εn ) ≤ 2
n=1
ε . From Claim 1 we may inductively select a sequence (yn )n∈N in 8 n=1 n and a sequence (zn )n∈N in SZ such that yn − zn < εn and ai zi < εn <
(1 + εn+1 )
n+1
i=1
ai zi for every choice of scalars (ai )i∈N and all n. Then (zn )n∈N
i=1
is a Schauder basic sequence with basis constant less or equal to 2. We set W = span{zn : n ∈ N}. The space W satisfies the conclusion of the claim. Indeed, let w ∈ SW , ∞ ∞ an zn . Then |an | ≤ 4 for all n. The series an yn converges to some w = n=1
y ∈ Y and w − y ≤
∞ n=1
|an |yn − zn ≤ 4
∞
n=1
εn <
n=1
y ε . Setting y = we 2 y
obtain that dist(w, SY ) ≤ w − y ≤ w − y + y − y ≤
ε + | y − 1| < ε. 2
We pass now to the proof that the space X is HI. Let Y1 , Y2 be a pair of infinite dimensional closed subspaces of X ∗ and we will show that dist(SY1 , SY2 ) = 0. Let ε > 0. From Claim 2, there exist two infinite dimensional closed subspaces ε W1 , W2 of Z such that for every w1 ∈ SW1 we have that dist(w1 , SY1 ) < and 3
IV.1. Some General Properties of HI Spaces
51
ε . Since the space Z is HI we 3 ε may choose w1 ∈ SW1 and w2 ∈ SW2 with w1 − w2 < . Let y1 ∈ SY1 such that 3 ε ε w1 − y1 < and w2 ∈ SW1 such that w2 − y2 < . We deduce that 3 3
for every w2 ∈ SW2 we have that dist(w2 , SY2 ) <
dist(SY1 , SY2 )
≤ y1 − y2 ≤ y1 − z1 + z1 − z2 + z2 − y2 ε ε ε < + + = ε. 3 3 3
Thus dist(SY1 , SY2 ) = 0. Therefore the space X is HI.
With the next result we provide some sufficient conditions yielding the HI property for dual Banach spaces. Corollary IV.8. Let X be a Banach space and let Z a subspace of X ∗ such that the following conditions are fulfilled. (i) The space X contains no isomorphic copy of 1 . (ii) The space Z is HI. (iii) The space X ∗ /Z is isomorphic to c0 (Γ) for some set Γ. Then the space X ∗ is HI. Proof. From Theorem IV.7 it is enough to observe that the quotient map Q : X ∗ −→ X ∗ /Z is strictly singular. If Γ is finite there is nothing to be proved. Let Γ be infinite and suppose that Q is not strictly singular. Let Y be an infinite dimensional subspace of X ∗ such that Q restricted to Y is an isomorphism. Since X ∗ /Z is isomorphic to c0 (Γ) for an infinite set Γ we may assume, passing to a subspace, that Q(Y ) is isomorphic to c0 . It follows that X ∗ contains isomorphically c0 , thus, by Bessaga Pelczynski’s Theorem, the space X contains isomorphically 1 , a contradiction. Similar arguments also yield the next. Corollary IV.9. Let X be a Banach space and Y a closed subspace of X. If the spaces Y and X/Y are HI saturated, then the same holds for the space X. A similar result also holds for somewhat reflexive (or reflexive saturated) Banach spaces. Proposition IV.10. Let X be a Banach space such that (i) X does not contain isomorphically 1 . (ii) X ∗∗ is isomorphic to X ⊕ 1 (Γ) for some infinite set Γ. Then every bounded linear operator T : X ∗ −→ X ∗ is of the form T = Q∗ + K where Q is an operator on X and K is a compact operator on X ∗ .
52
Chapter IV. The Space of the Operators for HI Banach Spaces
Proof. Let T : X ∗ −→ X ∗ be a bounded linear operator. Consider the conjugate operator T ∗ : X ∗∗ −→ X ∗∗ and the projections P1 : X ⊕ 1 (Γ) −→ X and P2 : X ⊕ 1 (Γ) −→ 1 (Γ). Let Q : X −→ X be the operator defined as Q = P1 ◦ (T ∗ |X) and S : X −→ X ∗∗ defined by S = P2 ◦ (T ∗ |X). Observe that S(X) ⊂ 1 (Γ). The operator S is compact. Indeed, if S was not compact we could construct an operator from a subspace of X onto 1 , thus by the lifting property of 1 , X contains isomorphically 1 , a contradiction. It follows that the operator S ∗ : X ∗∗∗ −→ X ∗ is compact so the same holds for the operator K = S ∗ |X ∗ . An easy computation yields that T = Q∗ + K.
IV.2
The Space of Operators L(X[G, σ]), L(X[G, σ]∗ )
We pass now to discuss the structure of L(X[G, σ]) when X[G, σ] is a HI extension of a ground norm. We begin with the following. Lemma IV.11. Let Y be a subspace of X[G, σ] and let T : Y → X[G, σ] be a bounded linear operator. Let (yl )l∈N be a block sequence of 2 − n1 l averages with increasing lengths in Y such that (T yl )l∈N is also a block sequence and lim yl G = 0. Then l
lim dist(T yl , Ryl ) = 0. l
Proof. Assume on the contrary that there exist δ > 0 and L ∈ [N] such that dist(T yl , Ryl ) > δ for all l ∈ L. The Hahn–Banach theorem yields that there exists φl ∈ BX[G,σ]∗ such that a) φl (yl ) = 0, φl (T yl ) > δ and b) ran φl ⊂ ran(supp yl ∪ supp T yl ). For simplicity we may assume that φl ∈ DG (the precise argument asserts that we can choose φl ∈ DG such that φl (yl ) ≥ δ and |φl (yl )| being as small as we wish). First we observe that for every ε > 0 and every j ∈ N there exist l1 < . . . < lnj ∈ L such that setting x=
yl1 +...+yln
j
nj
and φ =
φl1 +...+φln
j
m2j
gives (m2j x, φ) is a (0, 3C, 2j) exact pair such that m2j xG < ε (Lemmas II.22– n2j−1 II.24, Proposition II.25). Then for a given j ∈ N we may define {(xk , x∗k )}k=1 to 2 ∗ be (0, 18C, 2j − 1)-dependent sequence with xk G < 1/m2j−1 and xk (T xk ) ≥ δ for k = 1, . . . , n2j−1 . Proposition III.6 yields that
1 n2j−1
n2j−1
k=1
xk ≤
104C . m22j−1
(IV.1)
IV.2. The Space of Operators L(X[G, σ]), L(X[G, σ]∗ ) On the other hand setting x∗ =
1 n2j−1
1 m2j−1
n2j−1 k=1
n2j−1
k=1
1
∗
T xk ≥ x (
n2j−1
53
x∗k we get,
n2j−1
k=1
xk ) ≥
δ m2j−1
For sufficiently large j, (IV.1) and (IV.2) derive a contradiction.
.
(IV.2)
Theorem IV.12. Let Y be an infinite dimensional closed subspace of X[G, σ]. Every bounded linear operator T : Y → X[G, σ] takes the form T = λIY + S with λ ∈ R and S a strictly singular operator (IY denotes the inclusion map from Y to X[G, σ]). Proof. Assume that T is not strictly singular. We shall determine a λ = 0 such that T − λIY is strictly singular. Let Y be an infinite dimensional closed subspace of Y such that T : Y → T (Y ) is an isomorphism. By standard perturbation arguments and the fact that X[G, σ] is a strictly singular extension of YG , we may assume, passing to a subspace, that Y is a block subspace of X[G, σ] spanned by a normalized block sequence ∞ yn G < 1. From (yn )n∈N such that (T yn )n∈N is also a block sequence and n=1
Lemma II.22 we may choose a block sequence (yn )n∈N of 2 − n1 i averages of increasing lengths in span{yn : n ∈ N} with yn G → 0. Lemma IV.11 yields that lim dist(T yn , Ryn ) = 0. Thus there exists a λ = 0 such that lim T yn − λyn = 0. n
n
Since the restriction of T − λIY to any finite codimensional subspace of span{yn : n ∈ N} is clearly not an isomorphism and since also Y is a HI space, it follows from Proposition IV.5 that the operator T − λIY is strictly singular. Theorem IV.13. Let YG have uniformly bounded averages and X[G, σ] be the strictly singular extension of YG . Then every T ∈ L(X[G, σ]∗ ) is of the form T = λI + S with S strictly singular operator. We start with the following lemma. Lemma IV.14. Let X be an HI space with a Schauder basis (en )n . Assume that T : X → X is a bounded linear operator not of the form T = λI + S with S strictly singular. Then there exists n0 and δ > 0 such that for every z ∈ Xn0 = span{en : n ≥ n0 }, dist(T z, Rz) ≥ δz. Proof. If not, then there exists a normalized block sequence (zn )n such that dist(T zn , Rzn ) ≤ n1 . Choose λ ∈ R such that T zn − λzn n∈L → 0 for a subsequence (zn )n∈L . Then for a further subsequence (zn )n∈M , M ∈ [L], T − λI|span{zn : n∈N} is a compact operator. The HI property of X easily yields that T − λI is a strictly singular operator, contradicting our assumption. In the following lemma we assume that YG and X[G, σ] are as in the statement of the theorem.
54
Chapter IV. The Space of the Operators for HI Banach Spaces
Lemma IV.15. Let T : X[G, σ]∗ → X[G, σ]∗ , Z be a block subspace of X[G, σ]∗ such ∗ ∗ that Z = < (zn∗ )n > and for each n < m ran zn∗ ∪ ran T zn∗ < ran zm ∪ ran T zm . ∗ ∗ ∗ ∗ ∗ Assume further that for each z ∈ Z , with z = 1, dist(T z , Rz ) > δ. Then the following holds: (i) For each k ∈ N there exists a normalized block sequence (wl∗ )l∈N in Z satisfying the following properties: k ∗ ∗ For every l1 < . . . < lk setting w∗ = q=1 wlq we have that w ≤ 2. Further there exists an 2−k1 -average w ∈ X[G, σ] such that w∗ (w) = 0, T w∗ (w) > 1 and ran(w) ⊂ ran(supp w∗ ∪ supp T w∗ ). (ii) For every j ∈ N there exists (0, 18 δ , 2j) exact pair (x, φ) with φ ∈ Z, 18m x ∈ X[G, σ] and T φ(x) > 1, xG < δn2j2j . Proof. (i) The proof follows the arguments of Lemma III.12 using the following observation: Assume that w1∗ , . . . , wk∗ is a 2 − ck0 -vector. Our assumptions for the operator T yield that for q = 1, . . . , k there exists wq ∈ X[G, σ] such that wq∗ (wq ) = 0, T wq∗ (wq ) > 1 and wq < 1δ. Now using this and the arguments of Lemma III.12 we obtain the desired sequence. (ii) It only requires the adaptation described before the proof of Proposition III.14. Proof of Theorem IV.13. On the contrary assume that there exists T ∈ L(X[G, σ]∗) not of the desired form. Assume further that T = 1 and T e∗n is finitely supported with lim inf min supp T e∗n = ∞. (We may assume the later conditions from the fact that the basis (e∗n )n of (XG )∗ is weakly null.) In particular for every (zn∗ )n block sequence in X[G, σ]∗ there exists a subsequence (zn∗ )n∈L such that (ran zn∗ ∪ ran T zn∗ )n is a sequence of successive subsets of N. Let δ > 0 and n0 ∈ N as in Lemma IV.14. n2j−1 Then Lemma IV.15 yields that for every j ∈ N there exists (zk , zk∗ )k=1 ,a ∗ ∗ , 2j − 1) dependent sequence such that z (z ) = 0, T z (z ) > 1, ran z ⊂ (0, 18 k k k k k δ n2j−1 successive subsets of N and zk G ≤ m21 . ran zk∗ ∪ran T zk∗ , (ran zk∗ ∪ran T zk )k=1 2j−1
Proposition III.6 yields that
1 Finally m2j−1
1≥
1 m2j−1
n2j−1 k=1
1 n2j−1
k=1
zk ≤
144 . m22j−1 δ
T zk∗ ≤ 1 (since T ≤ 1 ) and also
n2j−1
k=1
n2j−1
T zk∗
n2j−1 m22j−1 δ 1 m2j−1 δ . ≥ T zk∗ (zk ) ≥ 144m2j−1 n2j−1 144 k=1
This yields a contradiction for sufficiently large j ∈ N.
IV.2. The Space of Operators L(X[G, σ]), L(X[G, σ]∗ )
55
Notes and Remarks. Our approach showing that the spaces X[G, σ] have few operators follows the lines of Gowers and Maurey [34]. In a recent paper ([4]) is shown that there exists a HI space with no reflexive subspace such that every operator T is of the form λI + W with W a weakly compact operator. The central remaining open problem is the existence of a Banach space with very few operators (i.e. T = λI + K with K compact). The recent results [14], [15] show that a Banach space X could admit few operators and also could have rich unconditional structure. It is not known if there exists a subspace Y of a space X with an unconditional basis, such that Y admits few operators. Actually it is unknown if there exists such a Y which is indecomposable.
Chapter V
Examples of Hereditarily Indecomposable Extensions In the present chapter we shall present HI extensions of YG when G is of specific form. Thus we shall show how we can obtain a quasi-reflexive HI space Xqr , a HI space Xp which has p as a quotient (1 < p < ∞) and also a non-separable HI space.
V.1
A Quasi-reflexive HI Space
We start with the quasi-reflexive HI space. We recall that a Banach space X is said to be quasi-reflexive if dim(X ∗∗ /X) < ∞. The set Gqr We consider the set Gqr = {±I ∗ : I is a finite interval of N}. Here we denote by I ∗ the function χI ∈ c00 . It follows readily that Gqr is a ground set. Moreover the basis of YGqr is equivalent to the summing basis of c0 , hence YGqr is c0 saturated and X[Gqr , σ] is a HI reflexive extension of YGqr . Theorem V.1. The space X[Gqr , σ] is a quasi-reflexive and HI space. Proof. Since X[Gqr , σ] is a reflexive extension of YGqr it follows that X[Gqr , σ]∗ = p span(Gqr ) (Proposition II.26). This yields that X[Gqr , σ]∗ = span({e∗n }n ∪ {N∗ }) from which we obtain that X[Gqr , σ]∗ /X[Gqr , σ]∗ ∼ = R. Since the basis of X[Gqr , σ] is boundedly complete we obtain that X[Gqr , σ]∗∗ /X[Gqr , σ] ∼ = R.
58
Chapter V. Examples of Hereditarily Indecomposable Extensions
Remark. Since every normalized weakly null sequence in YGqr contains a subsequence equivalent to the c0 basis, we conclude that YGqr has the uniform weak Banach–Saks property which yields that the predual of X[Gqr , σ] is also HI.
V.2
The Spaces p , 1 < p < ∞, are Quotients of HI Spaces
Next we define the HI space Xp which has p (1 < p < +∞) as a quotient. Let {Mi }i∈N be a disjoint partition of N into infinite sets, Mi = {mi1 < mi2 < · · · < min < · · · }. We consider the partially ordered set (L, ≺) where L = N and l ≺ d iff l < d and there exists i ∈ N such that l, d ∈ Mi . Clearly (L, ≺) is a tree. A segment s of L has the property that it is a segment of Mi for some i ∈ N. The set Gp is defined as follows. Gp =
n ) i=1
ai s∗i :
n
* |ai |q ≤ 1 and each si is a finite segment of L .
i=1
Here q is the conjugate of p. Clearly Gp is a ground set and the space YGp has the following properties. Proposition V.2. Let Z be a closed infinite dimensional subspace of YGp . Then either c0 → Z or p → Z. Moreover the space YGp has the uniform weak Banach– Saks property. Proof. It follows easily from the definition of YGp that YGp = ( ⊕Yi )p where Yi = < en >n∈Mi and (en )n∈Mi is equivalent to the summing basis of c0 . In particular n each Yi is isomorphic to c0 . Clearly for each n ∈ N, ( ⊕Yi )p remains isomorphic i=1
to c0 hence it is c0 saturated. Let Z be a subspace of YGp . Then one of the following two alternatives holds: 0 (a) There exists n0 ∈ N such that Pn0 |Z : Z → ni=1 ⊕Yi is not strictly singular. (b) For every n ∈ N, Pn |Z is a strictly singular operator. The preceding remarks immediately yield that in the first case c0 is isomorphic to a subspace of Z. If (b) occurs then a “sliding hump” argument derives a normalized sequence (z ) in Z of finite supported vectors and a sequence (wn )n∈N in YGp such that n n z n − wn < 1, and if we denote In = {i ∈ N : supp wn ∩ Mi = ∅}, then (In )n n consists of successive finite subsets of N. The later property yield that (wn )n is equivalent to the usual p basis and hence, (zn )n is equivalent to the p basis. This completes the proof of the first part. Next we show that YGp satisfies the uniform weak Banach–Saks property (Definition III.16). First we prove the following:
V.2. The Spaces p , 1 < p < ∞, are Quotients of HI Spaces
59
Claim. Let (yn )n be a normalized weakly null block sequence in YGp . Then for every ε > 0 and every M ∈ [N] there exists L ∈ [M ] such that the following holds: For every s segment of the tree L, #{ ∈ L : |s∗ (y )| ≥ ε} ≤ 2 . Proof of the claim. Assume on the contrary that for some M no such L exists. Then applying the classical Ramsey theorem for triples we obtain an L ∈ [M ] such that for 1 < 2 < 3 in L there exists a segment s of L with |s∗ (yi )| ≥ ε for i = 1, 2, 3. Let L = {1 < 2 < . . .}. For each n ∈ N and 1 < k < n choose s∗k,n with |s∗k,n (i )| ≥ ε for i = 1, . . . , n. Observe that there exists n0 ∈ N such that for each n ∈ N and each k < n, sk,n ⊂ Mi for some i < n0 . Indeed, sk,n ∩ supp y1 = ∅; now choose n0 such that for every i > n0 , max supp x1 < min Mi . To finish the proof, passing if required to a subsequence, we may assume that for every n ∈ N, w∗ − limn s∗k,n = s∗k with min sk < max supp x1 . Clearly sk is an infinite segment and sk ⊂ Min for some i ≤ n0 . Hence there exists Q ∈ [N] and i < n0 such that for each k ∈ Q, |Mi∗ (yk )| > ε, a contradiction since (y ) is weakly null. The uniform weak Banach–Saks property of YGp is obtained by the above claim in a similar manner as this property is established in p . As consequence we obtain the following. Proposition V.3. (i) The space X[Gp , σ] is a HI reflexive extension of YGp . (ii) The predual of X[Gp , σ]∗ is also HI. The next theorem describes the basic properties of X[Gp , σ]. Theorem V.4. There exists a surjective bounded linear operator Q : X[Gp , σ] → p . Additionally Q∗ [q ] is a complemented subspace of X[Gp , σ]∗ . In particular the quotient map Q is described by the rule Q(emik ) = ei for all i, k ∈ N. Also Q∗ (e∗i ) = Mi∗ and X[Gp , σ]∗ ∼ = X[Gp , σ]∗ ⊕ q . Proof. The proof follows easily from the next equation. For all {ai }ni=1 the following holds: n n + + ' (1/q + + (∗) ai Ii∗ + = |ai |q , + i=1
{Ii }ni=1
where next lemma.
i=1
are infinite subsegments of {Mi }ni=1 . This is a consequence of the
n Lemma V.5. For all {ai }ni=1 , ε > 0, n0 ∈ N there exist {Ji }i=1 finite segments of 1 (L, ≺) such that n0 < Ji ⊂ Mi , and setting xi = #Ji m∈Ji em , we have that d + + + + a i xi + + i=1
[Gp ,σ]
≤ (1 + ε)
d ' i=1
|ai |p
(1/p .
60
Chapter V. Examples of Hereditarily Indecomposable Extensions
Let us see how we finish the proof of the theorem. First we establish the equality (∗). Indeed the definition of Gp yields that d d + + ' (1/q + + ai Ii∗ + ≤ |ai |q . + i=1
i=1
The inverse inequality is obtained by the lemma and a simple duality argument. As consequence we have that span{Mi∗ : i ∈ N} is isometric to q and further X[Gp , σ]∗ /X[Gp , σ]∗ = q . This yields the proof of the theorem. d Proof of Lemma V.5. Assume that i=1 api = 1 and ε, n0 ∈ N are given. Choose j ∈ N such that (i)
1 mj
<
ε 2d
and
log (m −1)
(ii)
nj−12 j nj
<
ε 2d .
Next for i ≤ d choose n0 ≤ i1 < . . . < inj with (iii) Ji = {i1 , . . . , inj } ⊂ Mi (iv) 1t < 2t < . . . < dt < 1t+1 < . . ., t = 1, . . . , nj . nj eik and we show that We set xi = n1j k=1
d
a i xi ≤ 1 + ε .
i=1
Since the norming set D of the space X[Gp , σ] is a subset of the set Wp = d 1 ] it suffices to show that f ( ai xi ) ≤ 1 + ε for every f ∈ Wp W [Gp , Anj , mj j i=1 of type I. Let f ∈ Wp of type I. Using similar arguments as in Lemma II.9 we may assume that there exists a tree Tf = (fa )a∈A of f such that each fa is not 0 be the functionals corresponding to the of type II (Definition II.12). Let (gas )ss=1 maximal elements of the tree A. We denote by the ordering of the tree A. Let 1 1 ≤ A = s ∈ {1, 2, . . . , s0 } : w(fγ ) mj γ≺a s
B = {1, 2, . . . , s0 } \ A and set fA = f |
s∈A
supp gas ,
fB = f |
s∈B
supp gas .
V.2. The Spaces p , 1 < p < ∞, are Quotients of HI Spaces We have fA (xi ) ≤
61
1 for each i thus mj d
d 1 1 ε fA ( a i xi ) ≤ |ai | ≤ ·d< . m m 2 j i=1 j i=1
It remains to estimate the value fB (
d
(V.1)
ai xi ). We observe that
i=1 d
a i xi =
i=1
Set
d
ai (
i=1
nj eli
nj d 1 )= ( ai elti ). nj n t=1 j i=1 t
t=1
) t ∈ {1, 2, . . . , n} : the set {lt1 , lt2 , . . . , ltd } is contained in ran gas for * some s ∈ B or does not intersect any ran gas , s ∈ B
E1
=
E2
= {1, 2, . . . , n} \ E1 .
For each s = 1, 2, . . . , s0 set θs = that θs ≤ 1.
)
1 nj
: {lt1 , lt2 , . . . , ltd } ⊂ ran gas
* and observe
s∈B
d 1 We first estimate the quantity gas ( ( ai elti )) for s ∈ B. We may nj t∈E1 ∗ i=1 ci,j si,j where {si,j : i, j} is a family of assume that gas is of the form gas = i j |ci,j |q ≤ 1. For each i = pairwise disjoint segments with each si,j ⊂ bi and i
1, 2, . . . , d we get that (
j
ci ,j s∗i ,j )(
t∈E1
≤ |ai | max |ci ,j |θs . Thus
1 nj (
d i=1
j
ai elti )) = ai (
j
ci ,j s∗i ,j )(
t∈E1
1 nj elti )
j
gas (
d d d d 1 1 1 ( ai elti )) ≤ θs (max |ci,j |)|ai | ≤ θs ( max |ci,j |q ) q ( |ai |p ) p ≤ θs . j j nj i=1 i=1 i=1 i=1
t∈E1
Therefore d d 1 1 i fB ( ( ai elt )) ≤ ( gas )( ( ai elti )) ≤ θs ≤ 1. nj i=1 nj i=1 t∈E1
s∈B
t∈E1
(V.2)
s∈B
By the definition of the set B we may prove, as in the proof of Lemma II.9, that the family of functionals {gas : s ∈ B} has cardinality less or equal log (m −1) nj−12 j . By the definition of the set E2 for t ∈ E2 the set {lt1 , lt2 , . . . , ltd }
62
Chapter V. Examples of Hereditarily Indecomposable Extensions
intersects at least one but is not contained in any ran gas , s ∈ B. This easily yields that log (m −1) #{lt1 : t ∈ E2 } ≤ nj−12 j and thus
log (m −1) 1 nj−12 j ε . < < nj nj 2d
t∈E2
Therefore fB (
d d 1 1 ε ε ·d= . ( ai elti )) ≤ ( )( |ai |) < nj i=1 nj i=1 2d 2
t∈E2
(V.3)
t∈E2
From (V.1),(V.2) and (V.3), we conclude that f(
d
a i xi ) ≤
i=1
d d 1 1 i fA ( ai xi ) + fB ( ( ai elt )) + fB ( ( ai elti )) nj i=1 nj i=1 i=1 d
t∈E1
≤
t∈E2
ε ε + 1 + = 1 + ε. 2 2
Remark. In a similar manner we could show that c0 is a quotient of a HI space. The corresponding ground set GL 0 is defined as ∗ GL 0 = {±s : s is a segment of (L, ≺)} ∗ L L ∼ and X[GL 0 , σ] has as quotient c0 and also X [G0 , σ] = X∗ [G0 , σ] ⊕ 1 . The wellknown lifting property of 1 does not permit us to have a similar result for 1 .
V.3
A Non Separable HI Space
In this part we shall provide a ground set Gns with the property that X[Gns , σ]∗ is a non separable HI space. This requires more effort than the previous examples. The ground set Gns and the space X[Gns , σ] Let (D, ≺) denote a reorder of N as a dyadic tree with the property n ≺ m implies that n < m. We shall denote by s the segments of (D, ≺). We define Gns =
d ) i=1
εi s∗i : (εi )di=1 ∈ {−1, 1}d and {si }di=1 are pairwise disjoint * finite segments of (D, ≺) and min{min si : i = 1, . . . , d} ≤ d .
The set Gns is a ground set. The following theorem describes the properties of YGns .
V.3. A Non Separable HI Space
63
Theorem V.6. (i) The space YGns is c0 saturated. (ii) The space YGns has uniformly bounded averages. The proof of this theorem requires some steps described by the next lemmas. Lemma V.7. The closure of the set Gns in the topology of pointwise convergence is Gns
p
=
d )
εi s∗i : (ε)di=1 ∈ {−1, 1}d , (si )di=1 are pairwise disjoint
i=1
* segments with {min s1 , min s2 , . . . , min sd } ∈ S, d ∈ N . p
Proof. Let g ∈ Gns and we show that it is of the form described above (the other p inclusion is trivial). Let (gk )k∈N be a sequence in Gns such that gk −→ g. Set k→∞
k→∞
d = min supp g. Since gk (n) −→ 0 for n = 1, . . . , d − 1 and gk (d) −→ g(d) = 0 and from the fact that each gk (n) belongs to {−1, 0, 1} we may assume, passing d to a subsequence, that min supp gk = d for all k ∈ N. Let gk = εki (ski )∗ for i=1
k = 1, 2, . . .. Observe that the limit of a sequence of finite segments in the pointwise topology is a segment which can be either finite or infinite. We thus may select L1 ∈ [N], ε1 ∈ {−1, 1} and a segment s1 such that ε1 s∗1 is the pointwise limit of the sequence (εk1 (sk1 )∗ )k∈L1 . After d consecutive applications of the same argument we may select infinite sets of natural numbers L1 ⊃ L2 ⊃ · · · ⊃ Ld , ε1 , ε2 , . . . εd ∈ {−1, 1} and p disjoint segments s1 , s2 , . . . , sd such that (εki (ski )∗ )k∈Li −→ εi s∗i for i = 1, 2, . . . , d. d We deduce that g = εi s∗i . i=1
We remind the reader at this point that YGns denotes the completion of the space (c00 , Gns ). Proposition V.8. The space YGns does not contain isomorphically 1 . Proof. It is enough to show that every bounded sequence in YGns has a weakly Cauchy subsequence. Let (xn )n∈N be a bounded sequence in YGns . By Rainwater’s Theorem [54] is enough to find a subsequence (xn )n∈M such that (f (xn ))n∈M is w∗
convergent for every f ∈ Ext(BYG∗ns ). Since BYG∗ns = conv(Gns ) Theorem we get that Ext(BYG∗ns ) ⊂ Gns
w∗
by Milman’s
. Therefore, by the form of elements of
w∗
Gns it is enough to show that there exists M ∈ [N] such that (s∗ (xn ))n∈M is convergent for every segment s. This is done in the following two lemmas. Lemma V.9. Let (xn )n∈N be a bounded sequence in YGns and ε > 0. Then there exists a finite set {s1 , s2 , . . . , sk } of pairwise disjoint segments and an L ∈ [N] such
64
Chapter V. Examples of Hereditarily Indecomposable Extensions
that
lim sup |s∗ (xn )| ≤ ε n∈L
for every segment s with s ∩ (
k
si ) = ∅.
i=1
Proof. Assume the contrary. Then for every finite set {t1 , t2 , . . . , tm } of pairwise m disjoint segments and every L ∈ [N] there exists a segment t with t ∩ ( ti ) = ∅ i=1
such that lim sup |t∗ (xn )| > ε. n∈L
Using this fact we may inductively construct a sequence (sj )j∈N of pairwise disjoint segments of D and a decreasing sequence (Lj )j∈N of infinite subsets of the natural numbers such that |s∗j (xn )| > ε
∀j ∈ N
∀n ∈ Lj .
r . Since the ε segments s1 , s2 , s3 , . . . are pairwise disjoint we may choose an i0 ∈ N such that min si ≥ k for every i > i0 . Let n ∈ Li0 +k . Then n ∈ Li0 +t for each t ∈ {1, 2, . . . , k} i.e. |s∗i0 +t (xn )| > ε for each t ∈ {1, 2, . . . , k}. Setting εt = sgn(s∗i0 +t (xn )) we have that We set r = sup{xn : n ∈ N} and choose k ∈ N with k >
f=
k
εt s∗i0 +t ∈ Gns
w∗
t=1
thus f ∈ BYG∗ns . It follows that r ≥ xn ≥ f (xn ) =
k
εt s∗i0 +t (xn ) =
t=1
k
|s∗io +t (xn )| > kε,
t=1
a contradiction of the choice of k.
Lemma V.10. Let (xn )n∈N be a bounded sequence in YGns . There exists a subsequence (xn )n∈M of (xn )n∈N such that for every segment s the sequence (s∗ (xn ))n∈M is convergent. Proof. From Lemma V.9 we may inductively construct a decreasing sequence (Lk )k∈N of infinite subsets of the natural numbers and a sequence (Fk )k∈N of finite sets of pairwise disjoint segments, Fk = {sk1 , sk2 , . . . , skmk }, such that for each m k k ∈ N and segment s with s ∩ ( ski ) = ∅ we have that i=1
lim sup |s∗ (xn )| < n∈Lk
1 . k
V.3. A Non Separable HI Space
65
Let F be the countable set consisting of all the finite segments of D and all ∞ Fk . We choose a diagonal set L of the subsegments of segments contained in k=1
decreasing sequence (Lk )k∈N . Since {s∗ : s ∈ F } is a countable subset of BYG∗ns and the sequence (xn )n∈L is bounded we may choose, by a diagonal argument, an M ∈ [L] such that the sequence (s∗ (xn ))n∈M is convergent for every s ∈ F . It remains to show that the sequence (s∗ (xn ))n∈M is convergent for every segment s. Let s be a segment. We show that (s∗ (xn ))n∈M is a Cauchy sequence. Let 1 ε ε > 0 and choose k ∈ N with < . We have k 4 s=
m k
(ski ∩ s) ∪ (s \
i=1
and s \
m k i=1
m k
ski )
i=1
ski can be written as the finite union of pairwise disjoint segments with
at most one of them being infinite. We assume that one of them is infinite and let s\
m k i=1
ski
=(
nk
tj ) ∪ t
j=1
where t1 , t2 , . . . , tnk , t are pairwise disjoint segments, t is infinite while t1 , t2 , . . . , tnk are finite. m k 1 It is clear that t ∩ ( ski ) = ∅ thus lim sup |t∗ (xn )| < and by the construck n∈Lk i=1 1 tion of M as a (subset of a) diagonal set we have that lim sup |t∗ (xn )| < . Thus k n∈M we may choose an ma ∈ M such that |t∗ (xn )| <
1 k
∀n ∈ M with n ≥ ma .
Since ski ∩ s ∈$ F for each i %= 1, 2, . . . ,$mk and % tj ∈ F for each j = 1, 2, . . . , nk , the sequences (ski ∩ s)∗ (xn ) n∈M and t∗j (xn ) n∈M are convergent. Thus we may select an mb ∈ M such that mk
|(ski ∩ s)∗ (xm ) − (ski ∩ s)∗ (xn )| +
i=1
nk
|t∗j (xm ) − t∗j (xn )| <
j=1
ε 2
for each m, n ∈ M with m > n ≥ mb . Therefore for each m, n ∈ M with m > n ≥ max{ma , mb } we have that |s∗ (xm ) − s∗ (xn )| <
2 ε + < ε. 2 k
Thus (s∗ (xn ))n∈M is a Cauchy, and hence convergent, sequence.
66
Chapter V. Examples of Hereditarily Indecomposable Extensions
y ] + 1. If ε∗ s1 , s2 , . . . , st are pairwise disjoint segments such that si ⊂ ran y and |si (y)| > ε y . for each i = 1, 2, . . . , t then t ≤ ε y y Proof. Suppose that t > and choose A ⊂ {1, 2, . . . , t} with #A = [ ] + 1. ε ε p Set εj = sgn(s∗j (y)) for each j ∈ A and f = εj s∗j . We have f ∈ Gns ⊂ BYG∗ns .
Lemma V.11. Let ε > 0 and y ∈ YGns such that min supp y ≥ [
j∈A
Indeed, the segments sj , j ∈ A are pairwise disjoint and min sj ≥ min supp y ≥ y ] + 1 = #A. Thus [ ε y ] + 1) > y, y ≥ f (y) = εj s∗j (y) = |s∗j (y)| > ε(#A) = ε([ ε j∈A
j∈A
a contradiction.
y . ε The following also holds. Therefore t ≤
Lemma V.12. Let (xn )n be a bounded block sequence such that b∗ (xn ) → 0 for every b branch of D. Then for every ε > 0 there exists L ∈ [N] such that for every segment s of D the following holds: #{n ∈ L : |s∗ (xn )| ≥ ε} ≤ 2. Proof. We set A
) =
{k1 , k2 , k3 } ∈ [N]3 : there exists a segment s * such that |s∗ (ykl )| > ε for l = 1, 2, 3
and B = [N]3 \ A. It follows from Ramsey’s theorem that there exists an L ∈ [N] such that [L]3 ⊂ A or [L]3 ⊂ B. The conclusion of the lemma is exactly that there exists an L ∈ [N] such that [L]3 ⊂ B. Therefore it is enough to exclude the possibility of existing a L ∈ [N] with [L]3 ⊂ A. Suppose that there exists an L ∈ [N], L = {l1 < l2 < l3 < · · · } such that 2r 3 [L] ⊂ A. We set r = sup yn . We may assume that min L > . ε n For each k ≥ 3 we apply the following procedure. We consider the set ) Tk = ran(yl2 + ylk−1 ) ∩ s : s is a segment , such that |s∗ (yl1 )| > ε, * |s∗ (ylk )| > ε, and there exists a t ∈ {2, . . . , k−1} such that |s∗ (ylt )| > ε .
V.3. A Non Separable HI Space
67
r . Indeed, let t1 , t2 , . . . , tm be pairwise different eleε ments of Tk and for each i = 1, 2, . . . , m let si be a segment such that ran(yl2 + ylk−1 ) ∩ si = ti and |si (ylk )| > ε. The segments ri = (ran ylk ) ∩ si i = 1, 2, . . . , m are pairwise disjoint. We also have that |ri∗ (ylk )| > ε and ri ⊂ ran ylk for each i = 1, 2, . . . , m. From the fact that ylk ≥ |ri∗ (ylk )| > ε we get that We claim that #Tk ≤
min supp ylk ≥ lk > l1 > We easily get that m ≤ r m0 = [ ]. Then ε
2ylk yl 2r ≥ > [ k ] + 1. ε ε ε
ylk r r , thus m ≤ . We conclude that #Tk ≤ . We set ε ε ε Tk = {sk1 , sk2 , . . . , sktk }
for some tk ≤ m0 . For k ≥ 3 and i = 1, 2, . . . , tk we set ) * Aki = j ∈ {2, . . . , k − 1} : |(ski )∗ (ylj )| > ε while for tk < i ≤ m0 we set Aki = ∅. Hence {2, . . . , k − 1} =
m0
Aki .
(V.4)
i=1
We consider the following partition of [N \ {1}]2 . For j = 1, 2, . . . , m0 we set ) * Bj = {p, q} ∈ [N \ {1}]2 : p < q and p ∈ Aqj . Observe that (V.4) yields that [N \ {1}]2 =
m 0
Bj ; thus by Ramsey’s theorem
j=1
there exist an M ∈ [N \ {1}] and a j0 ∈ {1, 2, . . . , m0 } such that [M ]2 ⊂ Bj0 . Let M = {m1 < m2 < m3 < · · · }. Then for each t ∈ N and i ≤ t we have m that {mi , mt+1 } ∈ Bj0 , thus mi ∈ Aj0 t+1 . So there exists a segment st such that |s∗t (ymi )| > ε
∀i = 1, 2, . . . , t.
The sequence (s∗t )t∈N has a w∗ convergent subsequence; its w∗ limit is of the form s∗ for some infinite segment s. We deduce that |s∗ (ymi )| > ε for all i which contradicts to the assumption that the sequence (yn )n∈N is weakly null. The next result uses the above lemmas. Lemma V.13. For every Z block subspace of YGns and every ε > 0 there exists z ∈ Z with z = 1 and |s∗ (z)| < ε for every s segment of (D, ≺).
68
Chapter V. Examples of Hereditarily Indecomposable Extensions
Proof. Assume that the conclusion fails. Then there exists a Z block subspace of YGns and ε0 > 0 such that for every z ∈ Z there exists a segment s of D with s∗ (z) ≥ ε0 z. Choose n0 > 4/e0 and let (yn )n∈N be a normalized weakly null block sequence in Z. Lemma V.12 yields that we may assume that for every segment s of D ε0 (V.5) #{n ∈ N : s∗ (xn ) ≥ } ≤ 2 . n Select ym , . . . , ym+n0 with n0 < ym . Further for every m ≤ k ≤ m+n0 choose a segs∗k } > ment sk of D with supp sk ⊂ ran(yk ) and s∗k (yk ) ≥ ε0 . Since min{min n0 supp ∗ 0 is Schreier admissible, hence s ∈ Gns . n0 the family {min supp s∗k }nk=1 k=1 k Therefore n n0 n0 0 ∗ ym+k ≥ ( sk ) ym+k ≥ n0 ε0 > 4 . (V.6) k=1
k=1
k=1
Also from (V.5) for a segment s of D |s∗ (
n0
ym+n )| ≤ 3ε0 .
(V.7)
k=1
(V.6) and (V.7) derive a contradiction completing the proof.
Proof of Theorem V.6. (i) Let Z be a block subspace of YGns and let ε > 0. Using Lemma V.13 we may inductively select a normalized block sequence (yn )n∈N in Y such that, setting dn = max supp yn for each n and d0 = 1, |x∗ (yn )| < 2n dεn−1 for every σF special functional x∗ . We claim that (yn )n∈N is 1 + ε isomorphic to the standard basis of c0 . Indeed, let (βn )N n=1 be a sequence of scalars. We shall show that max |βn | ≤ 1≤n≤N
N n=1
βn yn Gns ≤ (1+ε) max |βn |. We may assume that max |βn | = 1. The left 1≤n≤N
1≤n≤N
inequality follows directly from the bimonotonicity of the Schauder basis (en )n∈N d of YGns . To see the right inequality we consider a g ∈ Gns , g = ai s∗i , where i=1
(si )di=1 are finite segments with min supp si ≥ d. Let n0 be the minimum integer n such that d ≤ dn . Since min supp g ≥ d > dn0 −1 we get that g(yn ) = 0 for n < n0 . Therefore g(
N
βn yn )
N
≤ |g(yn0 )| +
N d
|g(yn )| ≤ 1 +
n=n0 +1
n=1
< 1+
N n=n0 +1
d
|s∗i (yn )|
n=n0 +1 i=1 N
ε < 1+ 2n dn−1 n=n
0
ε < 1 + ε. n 2 +1
(ii) We pass now to show that YGns has uniformly bounded averages. Let 0 < ε < 1 and n ∈ N. We set k0 = k(n, ε) > 3n/ε and we claim that k0 satisfies the requirements of Definition III.13.
V.3. A Non Separable HI Space
69
Indeed, let (yl )l be a normalized weakly null block sequence in YGns . It follows from Lemma V.12 that we can assume the following: For every segment s of D, #{l : |s∗ (yl )| >
ε } ≤ 2. k02
Consider g ∈ Gns , g = dj=1 s∗j with min g < n. This yields that d < n. Consider 0 yli , l1 < . . . < lk0 . Then also x = k10 ki=1 |g(x)| ≤
d j=1
|s∗j (x)| ≤
d 3 3d 3n = < < ε, k k k0 0 i=1 0
and this completes the proof of (ii) and the entire proof of the theorem.
Proposition V.14. Let B denote the set of all branches of the binary tree D. Then we have the following: (i) X[Gns , σ]∗ = span({e∗n : n ∈ N} ∪ {b∗ : b ∈ B}). (ii) X[Gns , σ]∗ /X[Gns , σ]∗ = span{b∗ + X[Gns , σ]∗ : b ∈ B} = c0 (B). (iii) The space X[Gns , σ]∗∗ is isomorphic to X[Gns , σ] ⊕ 1 (B). Proof. (i) It is easy to see that the set Gns Gns
p
=
d "
w∗
is equal to the set
εi s∗i : εi ∈ {−1, 1}, i = 1, 2, . . . , d, (si )di=1 are pairwise
i=1
# disjoint segments and {min s1 , min s2 , . . . , min sd } ∈ S1 , d ∈ N . Therefore, from Proposition II.26 we get that X[Gns , σ]∗ = span({e∗n : n ∈ N} ∪ {b∗ : b ∈ B}). (ii) By Remark II.29 the basis (en )n∈N is boundedly complete and the space X[Gns , σ]∗ = span{e∗n : n ∈ N} is the predual of X[Gns , σ]. It follows from (i) that X[Gns , σ]∗ /X[Gns , σ]∗ = span{b∗ + X[Gns , σ]∗ : b ∈ B} so it remains to show that span{b∗ + (X[Gns , σ])∗ : b ∈ B} = c0 (B). It is enough to show that if b1 , b2 , . . . , bn are pairwise different elements of B and ε1 , ε2 , . . . , εn ∈ {−1, 1} then ε1 (b∗1 + X[Gns , σ]∗ ) + ε2 (b∗2 + X[Gns , σ]∗ ) + · · · + εn (b∗n + X[Gns , σ]∗ ) = 1.
70
Chapter V. Examples of Hereditarily Indecomposable Extensions
For k = 1, 2, . . . we denote by Ek the interval Ek = {n ∈ N : n ≥ 2k }. Since b1 , b2 , . . . , bn are pairwise different we may select a k0 ≥ n such that b1 ∩ Ek , b2 ∩ Ek , . . . , bn ∩ Ek are incomparable segments for all k ≥ k0 . Thus ε1 (b∗1 + X[Gns , σ]∗ ) + · · · + εn (b∗n + X[Gns , σ]∗ ) = dist(ε1 b∗1 + · · · + εn b∗n , X[Gns , σ]∗ ) = dist(ε1 b∗1 + · · · + εn b∗n , span{e∗j : j ∈ N}) = dist(ε1 b∗1 + · · · + εn b∗n , span{e∗j : j ∈ N}) = lim dist(ε1 b∗1 + · · · + εn b∗n , span{e∗j : j ≤ 2k − 1}) k
= lim ε1 (b1 ∩ Ek )∗ + · · · + εn (bn ∩ Ek )∗ k
= 1. The last equality holds since for every k ≥ k0 the functional gk =
n
εi (bi ∩ Ek )∗
i=1
belongs to Gns , thus gk ≤ 1, while for n ∈ b1 ∩ Ek we have that |gk (en )| = 1. (iii) As is well known, for every Banach space Z the space Z ∗∗∗ is isomorphic to Z ∗ ⊕(Z ∗∗ /Z)∗ . For Z = X[Gns , σ]∗ we get that the space X[Gns , σ]∗∗ is isomorphic to the space X[Gns , σ] ⊕ (X[Gns , σ]∗ /X[Gns , σ]∗ )∗ = X[Gns , σ] ⊕ (c0 (B))∗ = X[Gns , σ] ⊕ 1 (B). Theorem V.15. The space X[Gns , σ]∗ is a non separable HI Banach space. Proof. The space X[Gns , σ], being HI, contains no isomorphic copy of 1 , the space X[Gns , σ]∗ = span{e∗n : n ∈ N} is HI and the quotient space X[Gns , σ]∗ /X[Gns , σ]∗ is isometric to c0 (B). From Corollary IV.8 we deduce that X[Gns , σ]∗ is HI while it is clear that X[Gns , σ]∗ is non separable. Remark. The three examples presented in this chapter are from [16] where they have been constructed with the use of higher complexity saturation methods and have the additional property that they are asymptotic 1 spaces. In particular for the space corresponding to X[Gns , σ]∗ , it is shown that every bounded linear operator is of the form λI +W with W weakly compact. Since the space X[Gns , σ]∗ is the dual of a separable space we conclude that the weakly non-compact operator W has separable range. We do not include this property here as it requires much more efforts.
Chapter VI
The Space Xω1 In this part we present a reflexive Banach space Xω1 with a transfinite basis (eα )α<ω1 not containing any unconditional basic sequence. As it is well known every non separable reflexive Banach space is decomposable. In particular it admits a resolution of the identity. Hence any non separable reflexive space not containing an unconditional basic sequence is not HI. On the other side Gowers dichotomy yields that such a space is HI saturated. Constructing the space Xω1 we shall follow the general approach we have developed in the previous parts, namely Xω1 will be Xω1 [DG0 ], where G0 = {±eα : α < ω1 }, DG0 is a tree complete set and it 1 will be closed for all (An2j+1 , m2j+1 ) operations acting on n2j+1 -special sequences. The main difficulty that we have to overcome is that defining the n2j+1 -special sequences we are not able to use a one-to-one coding σ, a crucial property for the ω constructions. To solve this problem we employ Todorcevic’s ρ-function. Thus changing one of the fundamental ingredients of the ω-construction (i.e. the injection of the coding σ) we arrive to a non separable reflexive space where we control the structure of all separable subspaces of it. The norming set Kω1 The space Xω1 will be defined as the completion of (c00 (ω1 ), · ∗ ) under the norm · ∗ induced by a set of functionals Kω1 ⊆ c00 (ω1 ). The set Kω1 is the minimal subset of c00 (ω1 ) satisfying that: (1) It contains (e∗γ )γ<ω1 , is symmetric (i.e., φ ∈ K implies −φ ∈ K) and is closed under the restriction on intervals of ω1 . , n2j } ⊆ Kω1 with supp φ1 < · · · < supp φn2j , (2) For every {φi : i = 1, . . . n2j φi ∈ Kω1 . We say that φ is a result of a it holds that φ = (1/m2j ) i=1 (An2j , m12j )-operation. (3) For every special sequence (φ1 , . . . , φn2j+1 ) (see later for the definition), the
Chapter VI. The Space Xω1
72
n2j+1 functional φ = (1/m2j+1 ) i=1 φi is in Kω1 . We call such a φ special func1 tional and say that φ is a result of a (An2j+1 , m2j+1 )-operation. (4) It is rationally convex. Remark VI.1. From the definition of the norming set Kω1 it follows easily that (eα )α<ω1 is a bimonotone basis of Xω1 . Also, it is not difficult to see using (2) from the definition of Kω1 that the basis (eα )α<ω1 is boundedly complete. Indeed, for intervals of ω1 , property (2) of the norming set x ∈ c00 (ω1 ) and E1 < · · · < En 2j n2j Kω1 yields that x ≥ (1/m2j ) i=1 Ei x. Also, from the choice of the sequence (mj )j , (nj )j , it follows that n2j /m2j increases to infinity. From these observations it follows that the basis (eα )α<ω1 is boundedly complete. To prove that the space Xω1 is reflexive we need to show that the basis is shrinking. The definition of the special sequences, as in the spaces X[G, σ], depends crucially on a certain coding σ . The essential difference is that now σ is not an injection, a crucial property on which the proofs in the case of X[G, σ] rely (the injectivity of σ is required for the proof of Proposition III.3). Our proofs on the other hand will rely on a “tree-like property” of our coding which we now describe. First we notice that each 2j + 1-special sequence Φ = (φ1 , φ2 , . . . , φn2j+1 ) is of the form supp φ1 < · · · < supp φn2j+1 with each φi of type I. The tree-like property is the following: For any pair of 2j + 1-special sequences Φ = (φ1 , φ2 , . . . , φn2j+1 ), Ψ = (ψ1 , ψ2 , . . . , ψn2j+1 ) there exist 1 ≤ κΦ,Ψ ≤ λΦ,Ψ ≤ n2j+1 such that (i) If 1 ≤ k < κΦ,Ψ then φk = ψk and if κΦ,Ψ < k < λΦ,Ψ , then w(φk ) = w(ψk ). (ii) (∪κΦ,Ψ
Chapter VI. The Space Xω1
73
Definition VI.2. Recall that given a finite set F ⊆ ω1 , we let pF = p (F ) = maxα,β∈F (α, β). For a finite set F ⊆ ω1 and p ∈ N, let p
F = {α ≤ max F : there is β ∈ F s.t. α ≤ β and (α, β) ≤ p}. p
Notice that by condition 3., F is a finite set of countable ordinals. We say that p F is p-closed iff F = F , and that F is -closed iff it is pF -closed. Remark VI.3. 1. Note that ·p is a monotone and idempotent operator and so, in p p p particular, every F is a p-closed set: It is clear that if F ⊆ G, then F ⊆ G . pp p pp Let us show now that F = F . Let α ∈ F . This implies that (α, α0 ) ≤ p, for p some α0 ∈ F , α ≤ α0 . Choose α1 ≥ α0 , α1 ∈ F such that (α0 , α1 ) ≤ p. Then, (α, α1 ) ≤ max{(α, α0 ), (α0 , α1 )} ≤ p. 2. Suppose that F ⊆ ω1 is finite and suppose that p ≥ pF . Then pF p ≤ p: Fix F p finite, and p ≥ pF . Suppose that α < β are both in F . Let α ≥ α, β ≥ β such that α, β ∈ F and (α, α ), (β, β ) ≤ p. Then one of the following cases occurs: (a) If α ≤ α ≤ β ≤ β , then (α, β) ≤ max{(α, α ), (α , β)} ≤ max{(α, α ), (α , β ), (β, β )} ≤ p. (b) If α ≤ β ≤ α ≤ β , then (α, β) ≤ max{(α, α ), (β, α )} ≤ max{(α, α ), (β, β ), (α , β )} ≤ p. (c) If α ≤ β ≤ β ≤ α , use a similar proof to case (a). Proposition VI.4. Let F, G ⊆ ω1 be two finite sets and p ≥ pF , pG . Then: p
p
p
1. For every ordinal α ≤ ω1 , F ∩ α = F ∩ α and F ∩ α is an initial part of p F . Therefore, if F is p-closed, so is F ∩ α. p
p
2. For every α ∈ F ∩ G, we have that F ∩ (α + 1) = G ∩ (α + 1) . Hence, if F and G are in addition p-closed, then F ∩ (α + 1) = G ∩ (α + 1). p
p
p
3. F ∩ G = F ∩ G . Therefore, if F and G are p-closed then F ∩ G is also p-closed and it is an initial part of both F and G. p
p
p
Proof. 1. Since F ∩ α ⊆ F, α, it follows that F ∩ α ⊆ F ∩ α. Now let β ∈ F ∩ α. Then there is some γ ∈ F , γ ≥ be such that (β, γ) ≤ p. If γ < α, then we are done. If not, let δ = max F ∩ α ∈ F and since β ≤ δ < γ we have that (β, δ) ≤ max{(β, γ), (δ, γ)} ≤ max{p, pF } = p,
(VI.1) p
the last equality using our assumption that p ≥ pF . (VI.1) shows that β ∈ F ∩ α . p p Suppose now that F is p-closed. Then we have just shown that F ∩ α = F ∩ α = F ∩ α, and we are done.
Chapter VI. The Space Xω1
74 p
p
2. Fix α ∈ F ∩G. Let β ∈ F ∩ (α + 1) = F ∩(α+1). Let γ ∈ F ∩(α+1), γ ≥ β be such that (β, γ) ≤ p. Then (β, α) ≤ max{(β, γ), (γ, α)} ≤ max{p, pF } = p p. Since G is p-closed, and α ∈ G, we can conclude that β ∈ G ∩ (α + 1) . This p p shows that F ∩ (α + 1) ⊆ G ∩ (α + 1) . The other inclusion follows by symmetry. The last part of 2. follows easily. p p p 3. Let α = max F ∩G. Then by 2., F ∩ G = F ∩ G ∩ (α + 1) = F ∩ (α + 1) p p p = F ∩ (α + 1) and F ∩ G = G ∩ (α + 1). Combining the above equalities we p p p p p p p get F ∩ G = F ∩ G ∩ (α + 1) = F ∩ G , the last equality because F ∩ G ⊆ F ∩ G ⊆ max(F ∩ G) + 1 = α + 1. The σ -coding and the special sequences We denote by Qs (ω1 ) the set of finite sequences (φ1 ,w1 , p1 ,φ2 ,w2 ,p2 , . . . , φd , wd ,pd ) such that 1. for all i ≤ d, φi ∈ c00 (ω1 ) and φ1 < φ2 < · · · < φd , 2. (wi )di=1 , (pi )di=1 ∈ Nd are strictly increasing, and 3. pi ≥ p(∪ik=1 supp φk ) for every i ≤ d. Let Qs be the set of finite sequences (φ1 , w1 , p1 , φ2 , w2 , p2 , . . . , φd , wd , pd ) satisfying 1., and 2. above and in addition for every i ≤ d, φi ∈ c00 (N). Notice that Qs is a countable set. Fix a one-to-one function σ : Qs → {2j : j odd} such that σ(φ1 , w1 , p1 , φ2 , w2 , p2 , . . . , φd , wd , pd ) > max{p2d , ε12 , max supp φd }, where ε = min{|φk (eα )| : α ∈ supp φk , k = 1, . . . , d}. Given a finite subset F of ω1 , we denote by πF : {1, 2, . . . , #F } → F the natural order preserving map. Given Φ = (φ1 , w1 , p1 , φ2 , w2 , p2 , . . . , φd , wd , pd ) ∈ Qs (ω1 ) we denote GΦ = ∪di=1 supp φi
pd
and then we consider the family
πGΦ (Φ) = (πG (φ1 ), w1 , p1 , πG (φ2 ), w2 , p2 , . . . , πG (φd ), wd , pd ) ∈ Qs , where
πG (φk )(n) =
φk (πGΦ (n)) if n ∈ GΦ 0 otherwise.
Finally, σ : Qs (ω1 ) → {2j : j odd} is defined as σ (Φ) = σ(πG (Φ)). A sequence Φ = (φ1 , . . . , φn2j+1 ) of functionals of Kω1 is said to be a 2j + 1special sequence if: (1) supp φ1 < supp φ2 < · · · < supp φn2j+1 , each φk is of type I, w(φk ) = m2jk and w(φ1 ) = m2j1 with j1 even and satisfying m2j1 > n22j+1 .
Chapter VI. The Space Xω1
75
Φ (2) There exists a strictly increasing sequence (pΦ 1 , . . . , pn2j+1 −1 ) of natural numbers such that for all 1 ≤ i ≤ n2j+1 − 1 we have that w(φi+1 ) = mσ (Φi ) where Φ Φ Φi = (φ1 , w(φ1 ), pΦ 1 , φ2 , w(φ2 ), p2 , . . . , φi , w(φi ), pi ).
Notice that for a given 2j + 1-special sequence Φ, both sequences (pΦ i )i and (w(φi ))i above are uniquely determined, and that w(φ1 ) = m2j1 with j1 even, while for every i > 1, w(φi ) = m2ji is such that ji is odd. Lemma VI.5 (Tree-like interference of a pair of special sequences). Let Φ = (φ1 , . . . , φn2j+1 ) and Ψ = (ψ1 , . . . , ψn2j+1 ) be two 2j + 1-special sequences. Then there are two numbers 0 ≤ κΦ,Ψ ≤ λΦ,Ψ ≤ n2j+1 such that the following conditions hold: Ψ TP.1 For all i ≤ λΦ,Ψ , w(φi ) = w(ψi ) and pΦ i = pi .
TP.2 For all i < κΦ,Ψ , it holds that φi = ψi , TP.3 For all κΦ,Ψ < i < λΦ,Ψ , it holds that pλΦ,Ψ −1
=∅
pλΦ,Ψ −1
= ∅.
supp φi ∩ supp ψ1 ∪ · · · ∪ supp ψλΦ,Ψ −1 supp ψi ∩ supp φ1 ∪ · · · ∪ supp φλΦ,Ψ −1
TP.4 {w(φi ) : λΦ,Ψ < i ≤ n2j+1 } ∩ {w(ψi ) : i ≤ n2j+1 } = ∅ and {w(ψi ) : λΦ,Ψ < i ≤ n2j+1 } ∩ {w(φi ) : i ≤ n2j+1 } = ∅. Proof. Let λΦ,Ψ be the maximum of all i ≤ n2j+1 such that w(φi ) = w(ψi ) if defined. If not, we set λΦ,Ψ = κΦ,Ψ = 0. Notice that for every i > 1, w(φi ) = w(ψi ), and that for every 1 < i = j, w(φi ) = w(ψj ) since they are coding sequences of different length. But w(φ1 ) = mj1 and w(ψ1 ) = mj1 are such that j1 , j1 are even, so w(φ1 ) = w(ψj ) and w(ψ1 ) = w(φj ) for every j > 1. Suppose now that λΦ,Ψ > 0. Define κΦ,Ψ by κΦ,Ψ = min{i < λΦ,Ψ : φi = ψi }, if defined and κΦ,Ψ = 0 if not. For this last case it is trivial to check our requirements. So assume that κΦ,Ψ > 0. (TP.2) and (TP.4) follow easily from the properties of the coding σ . Let us show now (TP.3). Let G=
λΦ,Ψ −1 i=1
supp φi
pλΦ,Ψ −1
and G =
λΦ,Ψ −1 i=1
supp ψi
pλΦ,Ψ −1
,
: G → {1, . . . , #G} be the unique orderand let πG : G → {1, . . . , #G} and πG preserving bijections.
Claim.
1. #G = #G .
2. πG |(G ∩ G ) = πG |(G ∩ G ) and (G ∩ G )φκΦ,Ψ = (G ∩ G )ψκΦ,Ψ .
Chapter VI. The Space Xω1
76
3. max(G ∩ G ) < min{max supp φκΦ,Ψ , max supp ψκΦ,Ψ } Proof. 1: Notice that #G = max supp πG (φλΦ,Ψ −1 ) and #G = max supp πG (ψλΦ,Ψ −1 ). λ
−1
λ
(VI.2)
−1
Φ,Ψ Φ,Ψ ) = σ ((ψi , w(ψi ), pi )i=1 ), we have πG (φλΦ,Ψ −1 ) = Since σ ((φi , w(φi ), pi )i=1 πG (ψλΦ,Ψ −1 ) and hence #G = #G , as desired. 2: It follows from the properties of that πG |(G ∩ G ) = πG |(G ∩ G ). Fix now α ∈ G ∩ G . Since πG (α) = πG (α) we have that
φκΦ,Ψ (eα ) = ψκΦ,Ψ (eπG (π−1 α) ) = ψκΦ,Ψ (eα ),
(VI.3)
G
as desired. 3: W.l.o.g we assume that max G ∩ G ≥ max supp φκΦ,Ψ . Property 2. yields that (VI.4) φκΦ,Ψ = (G ∩ G )φκΦ,Ψ = (G ∩ G )ψκΦ,Ψ , and since # supp φκΦ,Ψ = # supp ψκΦ,Ψ we obtain that φκΦ,Ψ = ψκΦ,Ψ , a contradiction. To complete the proof choose κΦ,Ψ < i < λΦ,Ψ . Then previous Claim yields that supp φi ⊆ G \ (G ∩ G ) and hence supp φi ∩ G = ∅. The space Xω1 has no unconditional basic sequence Definition VI.6. Let j ∈ N. A sequence (x1 , φ1 , . . . , xn2j+1 , φn2j+1 ) is said to be a (1, j)-dependent sequence if: DS.1 supp x1 ∪ supp φ1 < · · · < supp xn2j+1 ∪ supp φn2j+1 . DS.2 The sequence Φ = (φ1 , . . . , φn2j+1 ) is a 2j + 1-special sequence. DS.3 (xi , φi ) is a (6, 2ji )-exact pair for 1 ≤ i ≤ n2j+1 , with # supp xi ≤ m2ji+1 /n22j+1 for every 1 ≤ i ≤ n2j+1 . DS.4 For every Ψ = (ψ1 , . . . , ψn2j+1 ) (2j + 1)-special sequence we have that (VI.5) κΦ,Ψ
2j+1 as follows. Proof. Let (yn )n and j be given. We inductively produce {(xi , φi )}i=1 For i = 1 we choose a (6, 2j1 )-exact pair (x1 , φ1 ) such that m2j1 > m22j+1 , j1 even (see the definition of special sequences) and x1 ∈ yn n . Assume that {(xl , φl )}i−1 l=1 has been chosen such that there exists (pl )i−2 l=1 satisfying
Chapter VI. The Space Xω1
77
(a) supp x1 ∪ supp φ1 < · · · < supp xi−1 ∪ supp φi−1 , each xl ∈ yn n and (xl , φl ) being a (6, 2jl )-exact pair. (b) For 1 < l ≤ i − 1, w(φl ) = σ (φ1 , w(φ1 ), p1 , . . . ., φl−1 , w(φl−1 ), pl−1 ) l (c) For 1 ≤ l < i − 1, pl ≥ max{pl−1 , pFl }, where Fl = k=1 supp φk ∪ supp xk . To define (xi , φi ) we choose pi−1 ≥ max{pi−2 , pFi−1 , n22j+1 · # supp xi } and we set 2ji = σ (φ1 , w(φ1 ), p1 , . . . ., φi−1 , w(φi−1 ), pi−1 ). Choose a (6, 2ji )-exact pair (xi , φi ) such that xi ∈ yn n and supp xi−1 ∪supp φi−1 < supp xi ∪ supp φi . This completes the inductive construction. (DS.1)–(DS.3) easily holds, while (DS.4) follows from (c) and (TP.3) of Lemma VI.5. Remark VI.8. Suppose that (yn )n and (zn )n are block sequences such that supn max supp yn = supn max supp zn . Then for every j ∈ N there is a (1, j)dependent sequence (x1 , φ1 , . . . , xn2j+1 , φn2j+1 ) with the property that x2i−1 ∈ yn n and x2i ∈ zn n for every i = 1, . . . , n2j+1 /2. Lemma VI.9. Fix a (1, j)-dependent sequence (x1 , φ1 , . . . , xn2j+1 , φn2j+1 ), and a n2j+1 of scalars such that maxi |λi | ≤ 1. Suppose that for every ψ ∈ sequence (λi )i=1 Kω1 with w(ψ) = m2j+1 , and every interval of integers E ⊆ [1, n2j+1 ] it holds that ). (VI.6) |ψ( i∈E λi xi )| ≤ 12(1 + n#E 2 2j+1
Then, 1 n2j+1
n2j+1 i=1
λ i xi ≤
1 . m22j+1
(VI.7)
Proposition VI.10. If (x1 , φ1 , . . . , xn2j+1 , φn2j+1 ) is a (1, j)-dependent sequence, then n2j+1 n2j+1 1 1 1 i+1 xi ≤ m21 . (VI.8) n2j+1 i=1 xi ≥ m2j+1 and n2j+1 i=1 (−1) 2j+1
n2j+1 Proof. The first estimation is clear since the functional ψ = (1/m2j+1 ) i=1 φi ∈ n2j+1 Kω1 and ψ((1/n2j+1 ) i=1 xi ) = 1/m2j+1 . For the second, we use Lemma VI.9 applied to the sequence of scalars ((−1)i+1 )i , and the desired estimation will follow from (VI.7). Fix ψ ∈ Kω1 with w(ψ) = m2j+1 , and an interval E ⊆ [1, n2j+1 ]. Set Ψ = (ψ1 , . . . , ψn2j+1 ) and x = i∈E (−1)i+1 xi , where ψ = (1/m2j+1 ) i∈E ψi . Notice that |ψ(x)| = | ≤
1 m2j+1 1
m2j+1
κΦ,Ψ −1
φi (x) +
i=1
+|
1 m2j+1
We shall show that the following hold:
1 m2j+1
n2j+1
i=κΦ,Ψ
n2j+1
i=κΦ,Ψ
ψi (x)|.
ψi (x)| ≤
(VI.9)
Chapter VI. The Space Xω1
78 (a) |ψκΦ,Ψ (
i∈E (−1)
i+1
xi )| ≤ 1 + 12(#E − 1)/n22j+1 ,
(b) |ψλΦ,Ψ |( i∈E (−1)i+1 xi ) ≤ 1 + 12(#E − 1)/n22j+1 , and (c) |( l>κΦ,Ψ ,l=λΦ,Ψ ψl )(xi )| ≤ 12/n2j+1 for every 1 ≤ i ≤ n2j+1 . Let us show first (a). Let 2ji be such that w(φi ) = m2ji . Notice that for i = κΦ,Ψ we have that 12 if i > κΦ,Ψ w(ψκΦ,Ψ ) |ψκΦ,Ψ (xi )| ≤ (VI.10) 6 if i < κΦ,Ψ . m2 2ji
By the properties of the sequences (ml )l , (nl )l and the fact that n22j+1 < w(ψκΦ,Ψ ), m2ji , (VI.10) yields that |ψκΦ,Ψ (xi )| ≤ n212 for i = κΦ,Ψ . Hence 2j+1
|ψκΦ,Ψ (
i∈E
xi )| ≤ |ψκΦ,Ψ (xκΦ,Ψ )| + |ψκΦ,Ψ (
i∈E, i=κΦ,Ψ
xi )| ≤ 1 +
12(#E−1) . n22j+1
(VI.11) (b) has a proof similar to the one of (a). We check now (c). Fix l > κΦ,Ψ , l = λΦ,Ψ . Suppose that l > λΦ,Ψ . Since w(ψl ) = w(φi ) for all i ≤ n2j+1 , we obtain that |ψl (xi )| ≤ n212 . Now suppose that κΦ,Ψ < l < λΦ,Ψ . By (DS.4) we have 2j+1
/ (κΦ,Ψ , λΦ,Ψ ), using that ψl (xi ) = 0 for every κΦ,Ψ < i < λΦ,Ψ . And for i ∈ the fact that w(ψ ) = w(φ ), we can conclude that |ψ (x )| ≤ 12/n22j+1 . Hence, l i l i ( l>κΦ,Ψ ,l=λΦ,Ψ ψl )(xi ) ≤ 12/n2j+1 for every 1 ≤ i ≤ n2j+1 , as desired. Combining (a), (b) and (c) we obtain that 1 | m2j+1
n2j+1 i=κΦ,Ψ
ψi (x)| ≤ 1 +
#E . n22j+1
(VI.12)
From (VI.9) and (VI.12) we conclude that |ψ(x)| ≤ 12(1 + #E/n22j+1 ), as desired. Proposition VI.11. Let (yn )n be a block sequence of vectors of Xω1 . Then the closed linear span of (yn )n is hereditarily indecomposable. Proof. Fix a block sequence (yn )n of Xω1 , two block subsequences (zn )n and (wn )n of (yn )n and ε > 0. Let j be large enough such that m2j+1 ε > 1. By Proposition VI.7 we can choose a (1, j)-dependent sequence (x1 , φ1 , . . . , xn2j+1 , φn2j+1 ) such n2j+1 that x2i−1 ∈ zn n , and x2i ∈ wn n . Set z = (1/n2j+1 ) i=1,i odd xi and w = n2j+1 (1/n2j+1 ) i=1,i even xi . Notice that z ∈ zn n and w ∈ wn n . By Proposition VI.9, we know that z + w ≥ 1/m2j+1 and z − w ≤ 1/m22j+1 . Hence z − w ≤ εz + w. Corollary VI.12. (a) The distance between the unit spheres of every two normalized block sequences (xn ) and (yn ) in Xω1 such that supn max supp xn = supn max supp yn is 0. (b) There is no unconditional basic sequence in Xω1 .
Chapter VI. The Space Xω1
79
(c) Every infinite dimensional closed subspace of Xω1 contains a hereditarily indecomposable subspace. (d) The distance between the unit spheres of two non separable subspaces of Xω1 is equal to 0. Proof. (b) follows from Proposition VI.11 and 4. of Proposition A.3. (c) This result follows from the previous corollary and Gowers’ dichotomy. Moreover, every subspace of Xω1 isomorphic to the closed linear span of a block sequence with respect to the basis (eα )α<ω1 is hereditarily indecomposable. (d) Fix two non separable closed subspaces X and Y of Xω1 . Now we can find a sequence (zn )n of normalized vectors such that for every n (a) z2n−1 ∈ X, z2n ∈ Y and (b) supp zn < supp zn+1 . Notice that the supports supp zn are not necessarily finite. Now approximate (zn )n by a normalized block sequence (wn )n as closed as needed and we are done.
Chapter VII
The Finite Representability of JT0 and the Diagonal Space D(Xγ ) Since the space Xω1 has a transfinite basis (eα )α<ω1 it also admits a transfinite family of naturally defined projections. Thus we could not expect that the operators on Xω1 or on the spaces Xγ , γ < ω1 , have small spaces of non-strictly singular operators. In this part we shall discuss the structure of the step diagonal operators which are the non strictly singular diagonal operators and we shall show that for all infinite γ < ω1 , D(Xγ ) is isomorphic to JT∗0 (Aγ ), where Aγ is a closed subset of γ. This result, quite unexpectedly, is a consequence of the finite interval representability of JT0 in the transfinite block subspaces of Xω1 . James-like spaces Definition VII.1. Let X be a reflexive space with a 1-subsymmetric basis (xn )n , and let A be a set of ordinals. JX (A) is the completion of (c00 (A), · JX (A) ), where for x ∈ c00 (A), % l $ xJX (A) = sup{ n=1 i∈In x(i) xn X : I1 < · · · < In intervals of A}. The natural Hamel basis (vα )α∈A of c00 (A) is a bimonotone 1-subsymmetric transinterval I of A the functional I ∗ : JX (A) → R, finite basis of JX (A). Also, for every ∗ ∗ I (x) = α∈A x(α) belongs to JX (A) and I ∗ = 1. Remark VII.2. Spaces of the above form for A = N, have been introduced in [19]. The transfinite analogue of James quasi-reflexive space was defined by G.A. Edgar in [23]. As we shall see next 1 does no embed into JX (A) hence the basis (vα )α∈A is not unconditional.
82
Chapter VII. Finite Representability of JT0 and the Diagonal Space D(Xγ )
Proposition VII.3. Let (yn )n be a semi-normalized block sequence in JX (A) with α∈A yn (α) = 0 for every n. Then (yn )n is equivalent to the basis (xn )n of X. Proof. Let 0 < c < C be such that c ≤ yn ≤ C for all n. It is easy to see that l−1 c an xn X ≤ n an yn JX (A) ≤ supi1 ≤i2 ≤···≤il q=1 (|aiq | n
+ |aiq+1 |)xq X ≤ (2CK)
n
an xn X ,
(VII.1)
where K is the unconditional constant of (xn )n . The first inequality holds for any block sequence and the second uses our assumptions. Corollary VII.4. The space 1 does not embed into JX (A). Proof. Assume the contrary, then from Proposition A.3 we could find a seminormalized block sequence (yn )n equivalent to the 1 -basis. Therefore, passing if necessary to a further block sequence, we may assume that for all n ∈ N, α∈A yn (α) = 0. Hence Proposition VII.3 yields that (yn )n is equivalent to (xn )n , a contradiction. Remark VII.5. Suppose that A and B are two sets of ordinals with the same order type. Then the unique order-preserving mapping defines naturally an f : A → B isometry between f : JT0 (A) → JT0 (B) by f( α∈H rα vα ) = α∈H rα vf (α) . ∗ Proposition VII.6. For every ordinal γ the space JX (γ) is generated in norm by ∗ {[0, α) }α<γ+1 .
Proof. We proceed by induction. It is clear that the successor ordinal case follows immediately from the inductive assumption. So we assume that γ is limit ordinal and for all λ < γ the conclusion holds. Assume on the contrary that ·
∗ ∗ Y = [0, α)∗ α<γ+1 JX (γ), then there exists x∗ ∈ JX (γ) with x∗ = 1 and ∗ ε > 0 such that d(x , Y ) > ε. Observe also that the inductive assumption yields that for all α < γ if x∗α denotes the functional defined by
0 if β < α x∗α (vβ ) = x∗ (vβ ) if β ≥ α
satisfies that x∗α ≤ 1 and d(x∗α , Y ) > ε. In particular for all α < γ, d(x∗α , [α, γ)∗ ) > ε and from the Hahn–Banach and Goldstime theorems there exists a finitely supyα ≤ 1, α ≤ min supp y˜α , x∗ (˜ yα ) > ε and | β<γ y˜α (β)| ≤ ported y˜α ∈ JX (γ), ˜ ε/4. Assuming further that α is a successor ordinal we consider the vector yα = y˜α − ( β≥α y˜α (β))vα− . Observe that α− ≤ min supp yα , x∗ (yα ) > ε − ε/4 > ε/2 and β<γ yα (β) = 0. Hence we may inductively choose a block sequence (zn )n such that ε/2 ≤ zn ≤ 1, α<γ zn (α) = 0 and x∗ (zn ) > ε/2. Observe that (zn )n is unconditional (Proposition VII.3) therefore equivalent to 1 -basis which yields a contradiction. ∗ Corollary VII.7. For every set of ordinals A we have that dim JX (A) = #A.
Chapter VII. Finite Representability of JT0 and the Diagonal Space D(Xγ )
83
Finite interval representability of JT0 and the space of diagonal operators Definition VII.8. Let X and Y be Banach spaces and let (xα )α<γ and (yn )n be a transfinite basis for X and a Schauder basis of Y respectively. We say that Y is finitely interval representable in X if there exists a constant C > 0 such that for every integer n and intervals I1 ≤ I2 ≤ · · · ≤ In successive, not necessarily distinct, intervals of γ there exists zi ∈ (xα )α∈Ii (i = 1, . . . , n) with supp z1 < supp z2 < · · · < supp zn and such that the natural order preserving isomorphism H : (yi )ni=1 → (zi )ni=1 satisfies H · H −1 ≤ C. Theorem VII.9. Let (yα )α<γ be a normalized transfinite block sequence in Xω1 , and Y its closed linear span. Then JT0 is finitely interval representable in the space Y , where T0 is the mixed Tsirelson space T [(An2j , m12j )j ]. We present the proof in Appendix B. Throughout all this section C will denote the finitely block representability constant of JT0 in Xω1 . We will see in Appendix B that C < 121. Remark VII.10. 1. Let us observe that since, as we will show, the basis of JT0 is not unconditional and it is finitely block representable in any block subsequence of the basis (eα )α<ω1 , Xω1 cannot have any unconditional basic sequence. In other words the finite interval representability of JT0 in the block subsequences of Xω1 must make use of the conditional structure of Xω1 . Indeed we get more. Suppose that X has a transfinite basis, and suppose that a Banach space Y with a conditional basis (yn )n is finite block representable in every block sequence of X. Then X does not contain unconditional basic sequences and from Gowers dichotomy, X is HI saturated. 2. The James like space JT0 has the following alternative description. It is the mixed Tsirelson extension T [G, (An2j , m12j )j ], where G = {I ∗ : I ⊆ N interval}. We recall that the norming set of this space is the minimal subset K0 of c00 (N) which is symmetric, contains G, and is closed under the (An2j , m12j )j -operations. Proposition VII.11. Let x1 < · · · < xnbe finitely supported, φ ∈ Kω1 and set n ri = φ(xi ) for each i = 1, . . . , n. Then i=1 ri vi JT0 ≤ x1 + · · · + xn . Proof. Fix a functional f of K0 with support contained in {1, . . . , n}, and a tree-analysis (ft )t∈T of f . We show by induction n over the tree T that for every t ∈ T there issome φt ∈ Kω1 such that ft ( i=1 ri vi ) = φt (x1 + · · · + xn ). In particular f0 ( i ri vi ) = φ0 (x1 + · · · + xn ), and hence the desired result holds. If t ∈ T is a terminal node, then ft = ±I ∗ , I ⊆ {1, . . . , n} interval. We set φt = ±φ|[min supp xmin I , max supp xmax I ]. It is clear that φt ∈ Kω1 , and (VII.2) φt (x1 + · · · + xn ) = ± i∈I φxi = ± i∈I ri = ft ( i ri vi ). If t ∈ T is not a terminal node, then ft = (1/m2j ) di=1 fsi , where St = {s1 , . . . , sd } d is ordered by fs1 < · · · < fsd . Then φt = (1/m2j ) i=1 φsi clearly satisfies our inductive requirements.
84
Chapter VII. Finite Representability of JT0 and the Diagonal Space D(Xγ ) The next result shows that JT0 is minimal in a precise sense.
Corollary VII.12. Suppose that X is a Banach space with a normalized Schauder basis (xn )n which dominates the summing basis of c0 and finitely block represented in Xω1 . Then (xn )n also dominates the basis (vn )n of JT0 . Proof. Fix scalars (ai )ni=1 . Choose a normalized block sequence (wi )ni of Xω1 , Ca tree-analysis equivalent to (xi )ni=1 . Fix f ∈ K0 with supp f ⊆ {1, . . . , n} and n of it. We are going to find φ ∈ K such that |f ( (ft )t∈T t ω t 1 i=1 ai vi )| ≤ C|φt ( ai wi )|, for each t ∈ T . This will show that n n n i=1 ai vi JT0 ≤ C i=1 ai wi Xω1 ≤ C 2 i=1 ai wi X , (VII.3) as desired. If t ∈ T is a terminal node, then ft = ±I ∗ , I ⊆ [1, n] an interval. Since (xn )n dominates the summing basis of c0 , we can find φt ∈ Kω1 such that φt (
n i=1
a i wi ) =
n i=1
ai wi Xω1
≥
n 1 ai xi X ≥ C i=1
≥
n 1 | ai | = |ft ( ai vi )|. C i=1
(VII.4)
i∈I
If t is not terminal node, then we use the appropriate (An2j , m12j )-operation.
Definition VII.13. Let (xα )α<γ be a normalized transfinite block sequence, X its closed linear span. We denote by D(X) the space of all bounded diagonal operators D : X → X satisfying the property that for all α < γ limit there exists some λα ∈ R such that D(xβ ) = λα xβ for every β ∈ [α, α + ω). We also denote by D(X) the space of all diagonal operators (not necessarily bounded) satisfying the above condition acting on xα α<γ . Notice the following (linear) decomposition of xα α<γ , . xα α<γ = α∈Λ(γ) xβ β∈[α,α+ω) . (VII.5) The canonical decomposition of y ∈ xα α<γ in X is y = y1 + · · · + yn given by (VII.5). Remark VII.14. D(X) is a closed subalgebra of L(X). For an ordinal µ we denote by Λ(µ)(0) the set of limit ordinals α < µ such that α = β +ω for a limit ordinal β. We denote this β by α− . For technical reasons, we assume that 0 is a limit ordinal. Remark VII.15. Notice that for γ limit, Λ(γ + 1)(0) is order isomorphic to Λ(γ) considering the predecessor map. Definition VII.16. Let D ∈ D(X). We define the map ξD : Λ(γ + 1)(0) → R via D(xα− ) = ξD (α)xα− . Namely, ξD (α) is the eigenvalue of D associated to the eigenvectors (xβ )β∈[α− ,α) .
Chapter VII. Finite Representability of JT0 and the Diagonal Space D(Xγ )
85
We consider the linear map Ξ : D(X) → c00 (Λ(γ + 1)(0) )# defined by Ξ(D)(vα ) = ξD (α),
(VII.6)
where c00 (Λ(γ + 1)(0) )# denotes the algebraic conjugate of c00 (Λ(γ + 1)(0) . The main goal here is to show that Ξ defines an isomorphism between D(X) and let us denote JT∗0 (Λ(γ + 1)(0) ). For D ∈ D(X), D = sup{DxXω1 : x ∈ xα α<γ , xXω1 ≤ 1} ≤ ∞, and for f ∈ c00 (Λ(γ + 1)(0) )# , f = sup{f (x) : x ∈ c00 (λ(γ + 1)(0) ), xJT0 ≤ 1} ≤ ∞. Proposition VII.17. D ≤ Ξ(D) ≤ CD for every D ∈ D(X). Proof. Fix D ∈ D(X), and ε > 0. Let y ∈ xα α<γ with y ≤ 1 be such that |D − Dy| < ε. Let y = y1 + · · · + yn be the canonical decomposition of y in X, and α1 , . . . , αn be such that yi ∈ xβ β∈[α− ,αi ) for every 1 ≤ i ≤ n. Let φ ∈ K i be such that Dy = φ(Dy), and set r = φy i i for i = 1, . . . , n. By Proposition n VII.11, i=1 ri vi JT0 ≤ x, and since (vα )α is 1-subsymmetric we have that ni=1 ri vαi JT0 ≤ y ≤ 1. Hence Ξ(D) ≥
Ξ(D)(
n
ri vαi )JT0 =
i=1
≥
n
n
ξD (αi )ri vαi JT0
(VII.7)
i=1
ξD (αi ) = φ(Dy) ≥ D − ε.
i=1
n This shows that D ≤ Ξ(D). Fix v = i=1 ai vαi ∈ JT0 with vJT0 ≤ 1, and choose a finite normalized block sequence (wi )ni=1 C-equivalent to (vαi )ni=1 with wi ∈ xβ β∈[α− ,αi ) for every i = 1, . . . , n (indeed we may assume that the i natural isomorphism F : wi ni=1 → vi ni=1 satisfies that F ≤ 1, F −1 ≤ C; see Corollary B.15). Then, Ξ(D)(v)JT0 = ni=1 ξD (αi )ai vαi JT0 ≤ ni=1 ξD (αi )ai wi Xω1 = D(
n
ai wi )Xω1 ≤ D
n i=1
ai wi Xω1 ≤ CD.
i=1
(VII.8)
Theorem VII.18. The spaces D(X) and JT∗0 (Λ(γ + 1)(0) ) are isomorphic. Proof. By Proposition VII.17, Ξ|D(X) : D(X) → JT∗0 (Λ(γ + 1)(0) ) is an isomorphism. To see that it is also onto consider f ∈ JT∗0 (Λ(γ + 1)(0) ) and define Df ∈ D(X) as follows. For β ∈ [α− , α) set Df (xβ ) = f (vα )xβ . It is easy to check that Ξ(Df ) = f . This completes the proof.
86
Chapter VII. Finite Representability of JT0 and the Diagonal Space D(Xγ )
Corollary VII.19. Let X and Y be the closed linear span of two transfinite block sequences of the same length γ. Then the natural mapping ψγ : D(X) → D(Y ) defined by ψγ (D) = DξD is an isomorphism. Our intention now is to compare D(X) and D(Xω1 ). A (Xω ) be the subalgebra Definition VII.20. 1. Given a closed A ⊆ Λ(ω1 +1), let D 1 of D(Xω1 ) consisting on all D ∈ D(Xω1 ) satisfying that for every α ∈ A(0) , there is some λα such that D|X[α− ,α) = λα iX[α− ,α),Xω and D|X[max A,ω1 ) = 0. Let DA (Xω1 ) 1 A (Xω ). be the subalgebra of bounded operators of D 1 2. Given a transfinite block sequence (xα )α<γ , let ΓX ⊆ Λ(ω1 + 1) be defined as follows. Let (VII.9) Γ = {supn→∞ max supp xαn : (αn )n ↑, αn < γ}, and let ΓX = Γ ∪ {0, sup Γ }. Another interpretation of ΓX is to consider the map fX : Λ(γ + 1) → ω1 defined by fX (α) = supβ<α max supp xβ and ΓX is nothing else but the image f (Λ(γ + 1)), and hence ΓX \ max{ΓX } and Λ(γ + 1)(0) are order isomorphic. Γ (Xω ) be the unique extension of D. 3. Given D ∈ D(X), let E(D) ∈ D X 1 Notice that D|X ∈ D(X) for every D ∈ DΓX (Xω1 ). Proposition VII.21. ED ≤ CD for every D ∈ D(X). Moreover the restriction DΓX (Xω1 ) → D(X), D → D|X is an isomorphism onto with inverse E : D(X) → DΓX (Xω1 ). Proof. We show that E(D) ≤ CD for every D ∈ D(X). Fix a finitely supported y ∈ Xω1 such that y ≤ 1 and E(D) = E(D)(y). Since I = (0) {[αΓ−X , α) : α ∈ ΓX } ∪ {[max ΓX , ω1 )} is a partition of ω1 , y has a unique decomposition y = y1 + · · · + yn for I1 < · · · < In in I and yi ∈ eα α∈Ii . Notice that E(D)|X[max ΓX ,ω1 ) = 0, so we may assume that In = [max ΓX , ω1 ). By definition −1 (αi ) for every of E(D) we have that E(D)(y) = ni=1 ξD (βi )yi where βi = fX i = 1, . . . , n. Choose φ ∈ Kω1 such that E(D)(y) = φ(E(D)(y)). By Proposition VII.17, E(D) =φ( ni=1 ξD (βi )yi ) = ni=1 ξD (βi )φ(yi ) = Ξ(D)( ni=1 φ(yi )vβi ) ≤Ξ(D)JT∗
0
(Λ(γ+1)(0) )
n i=1
(VII.10) φ(yi )vi JT0 ≤ CD.
(VII.11)
Chapter VIII
The Spaces of Operators L(Xγ ), L(X, Xω1 ) This is a continuation of the previous part, and the main result is that for every subspace X of Xω1 there exists a closed subset ΓX of ω1 such that L(Xω1 ) is isomorphic to JT∗0 (ΓX ) ⊕ S(X, Xω1 ). This representation yields some further properties for the space Xω1 , for example for I, J disjoint intervals of ω1 , the corresponding spaces XI , XJ are totally incomparable, which yields that Xω1 is arbitrarily distortable. The spaces L(Xγ ) Definition VIII.1. A sequence (x1 , φ1 , . . . , xn2j+1 , φn2j+1 ) is called a (0, j)-dependent sequence if the following conditions are fulfilled: DS0.1 Φ = (φ1 , . . . , φn2j+1 ) is a 2j + 1-special sequence and φi (xi ) = 0 for every 1 ≤ i, i ≤ n2j+1 . DS0.2 There exists {ψ1 , . . . , ψn2j+1 } such that w(ψi ) = w(φi ), # supp xi ≤ ≤ w(φi+1 )/n22j+1 and (xi , ψi ) is a (6, 2ji )-exact pair for every 1 ≤ i ≤ n2j+1 . DS0.3 If H = (h1 , . . . , hn2j+1 ) is an arbitrary 2j + 1-special sequence, then ' κΦ,H
( ' ( supp xi ∩ κΦ,H
(VIII.1)
Proposition VIII.2. For every (0, j)-dependent sequence (x1 , φ1 , . . . , xn2j+1 , φn2j+1 ) we have that 1 1 (x1 + · · · + xn2j+1 ) ≤ 2 . n2j+1 m2j+1
88
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
Proof. The proof is rather similar to the proof of Proposition VI.9. One first shows that xi )| ≤ 12(1 + #E/n22j+1 ) |ψ(1/n2j+1 i∈E
for every special functional ψ with w(ψ) = m2j+1 , and then the result follows n2j+1 is a (12, 1/n22j+1 )from the basic inequality, since, by condition (DS0.2), (xi )i=1 RIS. Proposition VIII.3. Suppose that (yk )k is a (C, ε)-RIS, and suppose that T : yk k → Xω1 is a linear function (not necessarily bounded) such that limn→∞ d(T yn , Ryn ) = 0. Then for every ε > 0 there is some z ∈ yk k such that z < εT z. Proof. We may assume that there is some δ > 0 such that inf n d(T yn , Ryn ) > δ > 0, and also that (T yn )n is a block sequence (hint: consider the following limit ordinal γ0 = min{γ < ω1 : ∃A ∈ [N]∞ inf n∈A d(Pγ T yn , Ryn ) > 0}, and pass, if necessary, to a subsequence of (yn )n and replace T by Pγ0 T ). Claim. There exist an infinite set A ⊆ N and a block sequence (fn )n∈A of functionals in K such that: (a) For every n ∈ A, fn T yn ≥ δ, fn yn = 0, ran fn ⊆ ran T yn and supp fn ∩ supp ym = ∅ for every m = n. (b) Either for every n ∈ A, max supp yn ≥ max supp fn or for every n ∈ A, max supp yn ≤ max supp fn . Proof of the claim. By the Hahn–Banach theorem, for each n ∈ N we can find a functional fn of norm 1 such that fn (T yn ) ≥ δ and fn (yn ) = 0. Since the w∗ closure of K is BX∗ω1 (notice that K by definition is closed under rational convex combinations) and K is closed under intervals, we may assume that fn ∈ K and ran fn ⊆ ran T yn . Let α = maxn supp yn and β = maxn supp fn . If α = β, it is rather easy to achieve the desired result. If α = β, then we can pass to a subsequence A and distort fn such that for every n ∈ A, max supp fn ≥ max supp yn . So, we may assume that (fn )n≥1 satisfies the requirements of the previous claim. Fix now j such that m2j+1 > 12/(εδ). Claim. There is a (0, j)-dependent sequence (z1 , φ1 , . . . , zn2j+1 , φn2j+1 ) such that for every k ≤ n2j+1 , zk ∈ X, ran φk ⊆ ran T zk and φk T zk > δ. Proof of the claim. Choose j1 even such that m2j1 > n22j+1 , and choose F1 ⊆ N of size n2j1 such that (yk )k∈F1 is a (3, 1/n22j1 )-RIS (going to a subsequence of (yk )k if necessary). Set φ1 = m12j
1
i∈F1
fi ∈ Kω1 and z1 =
m2j1 n2j1
k∈F1
yk .
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
89
Note that φ1 T z1 = (1/n2j1 ) k∈F1 fk T yk > δ and by (a) from the above claim, we have that φ1 z1 = (1/n2j1 ) k∈F1 l∈F1 fk (yl ) = 0. Pick p1 ≥ max{p (supp z1 ∪ supp T z1 ∪ supp φ1 ), # supp z1 ·n22j+1 } and set 2j2 = σ (Φ1 , m2j1 , p1 ). Now choose finite of length n2j2 such that (xk )k∈F2is a (3, 1/n22j2 )-RIS. Set φ2 = F2 > F1 (1/m2j2 ) k∈F2 fk ∈ Kω1 and z2 = (m2j2 /n2j2 ) k∈F2 yk . Notice that φ2 > φ1 , φ2 T z2 > δ and φ2 z2 = 0. Pick p2 ≥ max{p1 , p (supp z1 ∪ supp z2 ∪ supp T z1 ∪ supp T z2 ∪supp Φ1 ∪supp Φ2 ), # supp z2 ·n22j+1 }} and set 2j3 = σ (φ1 , m2j1 , p1 , φ2 , m2j2 , p2 ), and so on. Let us check that (z1 , φ1 , . . . , zn2j+1 , φn2j+1 ) is a (0, j)-dependent sequence: Conditions (DS0.1) and (DS0.2) are rather easy to check from the definition of this sequence. Let us check (DS0.3). There are two cases: (a) Suppose that max supp zk ≤ max supp φk for every 1 ≤ k ≤ n2j+1 . Then supp zk ⊆ pλ −1 supp φλΦ,H −1 Φ,H for every κΦ,H < k < λΦ,H . Then part 2 of (TP.3) gives the desired result. (b) Suppose that max supp φk ≤ max supp zk for every 1 ≤ k ≤ n2j+1 , then supp φk ⊆ supp zλΦ,H −1 pλΦ,H −1 for every κΦ,H < k < λΦ,H , and we are done by part 1 of (TP.3). Fix a (0, j)-dependent sequence (z1 , φ1 , . . . , zn , φn2j+1 ) as in the claim, and set z=
1 n2j+1
n2j+1 k=1
(−1)k+1 zk and φ =
1 m2j+1
n2j+1 k=1
φk .
n2j+1 Then φT z = 1/n2j+1 k=1 (−1)k+1 φT zk ≥ δ/m2j+1 and z ≤ 12/m22j+1 . So, T (z) ≥ δ/m2j+1 ≥ δm2j+1 z/12 > εz as desired. Corollary VIII.4. Let (yk )k be a (C, ε)-RIS, Y its closed linear span and T : Y → Xω1 be a bounded operator. Then limn→∞ d(T yk , Ryk ) = 0. Proof. If not, by previous Proposition VIII.3, we can find a vector z ∈ yk k such that z < (1/T )T z which is impossible if T is bounded. Lemma VIII.5. Let (xn )n be a (C, ε)-RIS, X its closed span and T : X → Xω1 be a bounded operator. Then λT : N → R defined by d(T xn , Rxn ) = T xn − λT (n)xn is a convergent sequence. Proof. Fix any two strictly increasing sequences (αn )n and (βn )n with supn αn = supn βn , and suppose that λT (αn ) →n λ1 , λT (βn ) →n λ2 . By going to a subsequences, we can assume that xαn < xβn for every n. Since the closed linear span of {xαn }n ∪ {xβn }n is an HI space, we can find for every ε two normalized vectors w1 ∈ xαn n and w2 ∈ xβn n such that T w1 −λ1 w1 ≤ ε/3, T w2 −λ2 w2 ≤ ε/3 and w1 − w2 ≤ ε/3T . Then we have that λ1 w1 − λ2 w2 ≤ T w1 − λ1 w1 + T w1 − T w2 + T w2 − λ2 w2 ≤ ε, (VIII.2) and hence, ε ≥ λ1 w1 − λ2 w2 ≥ |λ1 − λ2 |w1 − |λ2 |w1 − w2 ≥ |λ1 − λ2 | − |λ2 |ε. (VIII.3) So, |λ1 − λ2 | ≤ ε(1 + |λ2 |) for every ε. This implies that λ1 = λ2 .
90
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
Definition VIII.6. Recall that for a set A of ordinals, A(0) is the set of isolated points of A. Fix a transfinite block sequence (xα )α<γ , let X be the closed linear span of it and let T : X → Xω1 be a bounded operator. We define the step function ξT of T , ξT : Λ(γ +1)(0) → R as follows: Let γ be a successor limit ordinal less than γ. Let ξT (γ) = ξ ∈ R be such that limn→∞ T yn − ξyn = 0 for every (3, ε)-RIS (yn )n satisfying that supn max supp yn = γ. Lemma VIII.5 shows that ξ exists and is unique, and that ξT can be extended to a continuous ξT : Λ(γ + 1) → R. Given a mapping ξ : Λ(γ + 1)(0) → R we define the diagonal, not necessarily bounded, operator Dξ : X → X in the natural way by Dξ (xα ) = ξ(α+ω)xα . Given a bounded T : X → Xω1 we define the diagonal step operator DT : xα α<γ → Xω1 of T as DT = DξT . Remark VIII.7. ξT has only countable many values, since it can be extended to a continuous mapping ξT defined in Λ(γ + 1). Proposition VIII.8. The sequence ((T − DT )(yn ))α<γ belongs to c0 (N) for every RIS (yn )n in X. Proof. This is just a consequence of the definition of DT .
Proposition VIII.9. A bounded operator T : X → Xω1 is strictly singular iff ξT = 0. Proof. Suppose that T is not strictly singular. Then there is a block sequence (yn )n such that T is an isomorphism restricted to the closed linear span Y of (yn )n . Going to a block subsequence if necessary we assume that (yn )n is a RIS. Since T |Y is an isomorphism, limn→∞ T yn > 0. This implies that ξT |Λ(α + 1)(0) = 0, since otherwise ξT (α) = 0, contradicting the above inequality. Suppose now that ξT = 0. Choose some successor limit γ such that ξT (γ) = 0. Then we can find a block sequence (yn )n ⊆ Xγ such that T is close enough to ξT (γ)iY,Xω1 , where Y is the closed linear span of (yn )n . Hence, T is not strictly singular. Proposition VIII.10. Let (xα )α<γ be a transfinite block sequence, X its closed linear span of (xα )α<γ and a bounded operator T : X → Xω1 . Then DT ≤ CT and hence DT ∈ D(X). Proof. Fix a normalized y ∈ xα α<γ , let y = y1 + · · · + yn be its decomposition in X, yi ∈ xβ β∈[α− ,αi ) for i = 1, . . . , n. Choose φ ∈ Kω1 such that φ(D(y)) = i D(y). Then, n n n n D(y) = i=1 ξT (αi )φ(yi ) = ( i=1 ξT (αi )vi∗ )( i=1 φ(yi )vi ) ≤ i=1 ξT (αi )vi , (VIII.4) the last inequality because ni=1 φ(yi )vαi JT0 ≤ yXω1 ≤ 1. We finish with the next claim. n Claim. i=1 ξT (αi )vi∗ JT∗ ≤ CT . 0
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
91
Proof of the claim. Fix ε > 0. By the finite block representability of JT0 in Xω1 and Proposition VIII.8 we can produce inductively w1 , . . . , wn such that (1) wi ∈ xβ β∈[α− ,αi ) , i (2) the natural isomorphism F : wi ni=1 → vi ni=1 is such that F ≤ 1 and F −1 ≤ C, and (3) ni=1 ξT (αi )wi − T wi < ε. n n ∗ ∗ Choose x = i=1 ri vi ∈ JT0 of norm 1 such that i=1 ξT (αi )vi JT0 = n n i=1 ξT (αi )ri . Then i=1 ri wi Xω1 ≤ C and hence DT (
n
i=1 ri wi ) ≥
≥ Hence ε.
n
∗ ∗ i=1 ξT (αi )vi JT0
≤ T (
n
ri ξT (αi )vi JT0
i=1 n
n
i=1
i=1
ξT (αi )ri =
n
(VIII.5) ξT (αi )vi∗ JT∗ . 0
i=1 ri wi )+(T −DT )(
n
i=1 ri wi )
≤ CT +
Theorem VIII.11. Let (xα )α<γ be a normalized block sequence of Xω1 , X its closed linear span. Then, for every bounded operator T : X → Xω1 , DT : X → Xω1 is bounded and T − DT is strictly singular. Proof. It follows from Proposition VIII.9 and Proposition VIII.10.
Corollary VIII.12. Any bounded operator from the closed linear span X of a transfinite block sequence into the space Xω1 is the sum of the restriction of a unique diagonal operator D ∈ DX (Xω1 ) and an strictly singular operator. Proof. This follows from previous theorem and Proposition VII.21.
Corollary VIII.13. (a) For T : X → Xω1 bounded TFAE: (i) T is strictly singular, (ii) ξT = 0, and (iii) DT = 0. (b) The transformation T → DT is a projection in the operator algebra L(X) of norm ≤ C. Proposition VIII.14. Let X → Xω1 , I ⊆ ω1 an interval such that PI |X is not strictly singular. Then for every ε > 0 there exist a normalized sequence (xn )n in X and a normalized block sequence (zn )n in XI such that n yz − zn < ε. Proof. Set I = [α, β] and suppose that PI |X is not strictly singular. Let γ0 = {γ ∈ (α, β] : Pγ |X is not strictly singular}. We can find for every ε > 0, (yn )n ⊆ X and a block sequence (wn )n ⊆ Xγ0 such that Pγ0 is an isomorphism when restricted to the closed linear span of (yn )n ,
92
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
supn max supp wn = γ0 and n wn − Pγ0 yn ≤ ε/2. Consider U : wn n → X[γ0 ,ω1 ) defined by U wn = P[γ0 ,ω1 ) yn . Notice that U is bounded. Since ξU = 0, U is strictly singular. Hence we can find a block sequence (zn )n of (wn )n such that n+1 and hence the corresponding block sequence (xn )n of for all n, U zn ≤ ε/2 (yn )n satisfies that n zn − xn ≤ ε. Finally, notice that for n0 large enough, (zn )n≥n0 ⊆ XI . Corollary VIII.15. Xω1 is arbitrarily distortable. Proof. For j ∈ N, and x ∈ Xω1 , let x2j = sup{φ(x) : w(φ) = m2j }. Let X → by a Schauder Xω1 . Since for every ε > 0 we can find a subspace of X generated basis (yn )n and a normalized block sequence (zn )n of Xω1 such that n yn −zn ≤ ε, without loss of generality we can assume that X is generated by a block sequence (zn )n . Now, we can find an (6, j)-exact pair (x, φ), with x ∈ zn n and hence 1 ≤ x2j ≤ x ≤ 6. And for any other j > j, a (6, 2j )-exact pair (x , φ ) with x ∈ zn n and hence 1 ≤ x ≤ 6 and x 2j ≤ 12/m2j . So, x/x2j x /x 2j
≥
1/6 12/m2j+1
=
m2j+1 72 .
(VIII.6)
Definition VIII.16. Two Banach spaces X and Y are called totally incomparable if and only if no infinite dimensional closed X1 → X is isomorphic to Y1 → Y . Corollary VIII.17. XI and XJ are totally incomparable for disjoint infinite intervals I and J. Proof. Suppose not, and let X → XI , and Y → XJ such that T : X → Y is an isomorphism onto. By previous Proposition VIII.14, we can assume that X is generated by a block sequence. But since ξT = 0, T cannot be an isomorphism, a contradiction. Another consequence of the representability of JT0 on each transfinite block sequence is that we can identify the space D(X) of diagonal step operators on X and hence L(X)/S(X) for every closed span X of a transfinite block sequence. (0) Corollary VIII.18. L(X)/S(X) ∼ = JT∗0 (ΓX ) for every = L(X, Xω1 )/S(X, Xω1 ) ∼ X → Xω1 generated by a transfinite block sequence. (0)
Proof. This follows from Lemma VII.18, since Λ(γ + 1)(0) and ΓX are orderisomorphic. Remark VIII.19. Note that L(X)/S(X) ∼ = JT∗0 (ΓX ) if ΓX is infinite. To see this, fix a transfinite block sequence (xα )α<γ generating X such that γ ≥ ω 2 . Then ΓX \ {max ΓX } and Λ(γ + 1)(0) \ {ω} are order-isomorphic. Theorem VIII.20. Every projection P of Xω1 is of the form P = PI1 +· · ·+PIn +S, where Ii are intervals of ordinals, Ii < Ii+1 and S is strictly singular.
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
93
Proof. Suppose that P : Xω1 → Xω1 is a projection, P = DP + S. Since P 2 = P , we obtain that DP2 − DP is also strictly singular and therefore (ξP (α)2 − ξP (α))iX[α− ,α) ,Xω1 is strictly singular for every successor limit α. This implies that ξP : Λ(ω1 + 1)(0) → {0, 1}. And since ξP has the continuous extension property, there is no strictly increasing sequence {αn }n ⊆ Λ(ω1 +1)(0) such that ξP (α2n ) = 1 and ξP (α2n+1 ) = 0 for every n. Corollary VIII.21. For every n ∈ N there is some m ∈ N such that for every projection P of Xω1 with P ≤ n, P can be written as P = PI1 + · · · + PIk + S such that k ≤ m and I1 << I2 << · · · << Ik , where A << B denotes that the interval (sup A, inf B) is infinite. Proof. Fix n, and let P : Xω1 → Xω1 be a projection such that P ≤ n. Let j be the first integer such that m2j > 2nC. We claim that m = n2j works. For suppose that P = PI1 + · · · + PIk + S with I1 << · · · << Ik and k > n2j . Fix ε > 0. Find a normalized block sequence (x1 , y1 , . . . , xn2j /2 , yn2j /2 ) such that (a) xi ∈ XIi , yi ∈ X(sup Ii ,min Ii+1 ) for 1 ≤ i ≤ n2j /2 − 1, and yn2j /2 > xn2j /2 , n2j (b) (x1 , y1 , . . . , xn2j /2 , yn2j /2 ) is C-equivalent to (vi )i=1 , and (c) S|F ≤ ε where F = (x1 , , y1 , . . . , xn2j /2 , yn2j /2 ). Set x = x1 − y1 + · · · + xn2j /2 − yn2j /2 . Then, x ≤ C
n2j
i=1 (−1)
i+1
vi JT0 ≤ C
n2j
i=1 ti T0
= Cn2j /m2j ,
(VIII.7)
vi JT0 − ε = n2j /2 − ε.
(VIII.8)
and P (x) ≥
n2j /2 i=1
xi − ε ≥
n2j /2 i=1
(VIII.7) and (VIII.8) imply that P ≥ (m2j /2 − εm2j /n2j )/C. Hence, P > n, a contradiction. Asymptotically equivalent subspaces and L(X, Xω1 ) Our aim here is to extend the results about operators on subspaces generated by a transfinite block sequence to arbitrary subspaces. Definition VIII.22. Let X be a subspace of Xω1 . A subset Γ of ω1 + 1 is said to be a critical set of X if the following hold: (CS1) Γ is closed of limit ordinals, and 0 ∈ Γ. (CS2) For all γ ∈ Γ, γ < Ω, P(γ,γ + ) |X is not strictly singular and for all α ∈ (γ, γ + ), P(γ,α) |X is strictly singular, where γ + is the successor of γ in Γ and Ω = max Γ. (CS3) P[Ω,ω1 ) |X is strictly singular (we use P∅ = 0).
94
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
Notice that from the above definition, it follows easily that if Γ is a critical set of X, then max Γ = min{γ ≤ ω1 : P[γ,ω1 ) |X is strictly singular}. Proposition VIII.23. For every X → Xω1 a critical set Γ is uniquely defined, denoted by ΓX . Proof. Fix X → Xω1 . We show first that a critical set X exists. We proceed by induction defining an increasing sequence (γα )α<ω1 as follows: We set γ0 = 0. Suppose defined (γβ )β<α satisfying conditions (CS1) and (CS2). If α is limit, then we set γα = supβ<α γβ . Suppose now that α is successor. If P[γα− ,ω1 ) |X is strictly singular, then we set γα = γα− . If not, let γα = min{γ ∈ (γα− , ω1 ) : P[γα− ,γ) |X is not strictly singular}. Let us observe that if X is separable, then the sequence (γα )α<ω1 is eventually constant and we set ΓX = {γα }α<ω1 . If X is non separable, then the sequence (γα )α<ω1 is strictly increasing and ΓX = {γα }α<ω1 ∪ {ω1 }. Next we prove the uniqueness of ΓX . Suppose the opposite, and fix Γ = Γ two different critical sets. Set γ = max(Γ ∩ Γ ). First notice that max Γ = max Γ . So, either γΓ+ < γΓ+ or γΓ+ < γΓ+ . This leads to a contradiction using the fact that both Γ and Γ satisfy (CS2). Remark VIII.24. 1. The critical set ΓX provides information concerning the structure of the space X. For example the space X is HI if and only if ΓX = {0, ΩX }. Also, two subspaces X, Y → Xω1 are totally incomparable if and only if ΓX ∩ΓY = {0}. 2. For a transfinite block sequence (xα )α<γ its critical set is nothing else but the set introduced from Definition VII.20 (2). Proposition VIII.25. For every Y → X, the corresponding critical set ΓY is a subset of ΓX . Proof. It follows by an easy inductive argument.
Proposition VIII.26. For every separable X → Xω1 and for every ε > 0 there exist an ordinal γ < ω1 , a normalized sequence (y α )α<γ in X and a normalized transfinite block sequence (zα )α<γ such that (a) α<γ zα − xα < ε and (b) ΓX = ΓZ where Z is the closed linear span of (zα )α<γ . Proof. Use Proposition VIII.14, and a standard gliding hump argument.
Definition VIII.27. Let X, Y → Xω1 . (i) We say that X is asymptotically finer to Y , X ≤a Y , if and only if ΓX ⊆ ΓY . (ii) We say that X is asymptotically equivalent to Y , X ≡a Y , if and only if Γ X = ΓY .
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
95
It follows easily from the above definition that the relation ≤a is a quasiordering in the class of the subspaces of Xω1 which from Proposition VIII.25 extends the natural inclusion. Notice also that ≡a is an equivalence relation. We now give two alternative formulation of these notions. Proposition VIII.28. For X, Y → Xω1 the following are equivalent: (1) X ≤a Y , (2) if PI |X is not strictly singular, then PI |Y is not strictly singular, for every interval I ⊆ ω1 , and (3) d(SX , SY ) = 0 for every X → X. Proof. Let us observe that for a closed infinite interval I, PI |X is not strictly singular iff there is some γΓ+X ∈ ΓX with min ΓX < γΓ+X ≤ max I. The inverse direction follows immediately from the definition of the critical sets. So assume now that PI |X is not strictly singular. Set γ0 = max{γ ∈ ΓX : γ ≤ min I}. Observe that γ0 ≤ min I < ΩX , hence min ΓX < γΓ+X ≤ max I by minimality of γΓ+X (Property (CS2)). It is easy to see that the above observation implies easily the equivalence (1) ⇔ (2). (1) ⇒ (3): Suppose that X → X. Then by Proposition VIII.25 and our assumption, ΓX ⊆ ΓY . By Proposition VIII.26, we can find two block sequences (zn )n and (wn )n in X0+ such that Γ
X
(a) supn max supp zn = supn max supp wn = 0+ ΓX , and (b) d(SZ , SX ) = d(SW , SY ) = 0 where Z and W are the closed linear span of (zn )n and (wn )n respectively. By Corollary VI.12, d(Z, W ) = 0 and we are done. (3) ⇒ (2): Since for every X → X, d(SX , SY ) = 0, we obtain that for every ε > 0, and every X → X there exists two basic sequences (zn )n and (wn )n such that zn ∈ SX and wn ∈ SY for all n and n zn − wn < ε. Assume now that PI |X is not strictly singular. Choose X → X such that PI |X is isomorphism. Let (zn )n ⊆ X and (wn )n ⊆ Y as above. Then PI |W is isomorphism and hence PI |Y is not strictly singular. Proposition VIII.29. For X, Y → Xω1 the following are equivalent: (1) X ≡a Y , (2) PI |X is not strictly singular if and only if PI |Y is not strictly singular, for every interval I ⊆ ω1 , and (3) d(SX , SY ) = d(SY , SX ) = 0 for every X → X, Y → Y . Corollary VIII.30. 1. For every X → Xω1 and every A ⊆ ΓX there is XA → X such that ΓXA = A. 2. For every non separable X, Y → Xω1 there are non separable X1 → X, Y1 → Y such that X1 ≡a Y1 . We also need the following well known result. Lemma VIII.31. For every Z → X → Xω1 with Z separable there exist W → Z and γ < ω1 such that Pγ |X is a projection onto W . Remark VIII.32. Notice that for W and X as in the lemma, ΓW is an initial part of ΓX .
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
96
Proposition VIII.33. Let X be a subspace of Xω1 and T : X → Xω1 a bounded operator. Then there exists a unique DT ∈ DΓX (Xω1 ) such that (a) DT ≤ 2C 2 T and (b) T − DT |X is strictly singular. Proof. Fix X → Xω1 and a bounded operator T : X → Xω1 . First suppose that X is separable. Then we can find a transfinite basic sequence (yα )α<γ ⊆ X and a transfinite block sequence (zα )α<γ of Xω1 such that α<γ yα − zα < 1 and X ≡a Z, where Z denotes the closed linear span of (zα )α<γ . Consider now T : U
T |Y
Z → Y → Xω1 where Y is the closed linear span of (yα )α<γ and U : Y → Z is the isomorphism defined by U ( α<γ aα zα ) = α<γ aα yα . Notice that U ≤ 2. Then there is a unique D ∈ D(Y ) such that T − D is strictly singular, or equivalently there is unique DT ∈ DΓZ (Xω1 ) such that T − DT |Z is strictly singular. Notice that DT ≤ CD ≤ C 2 T ≤ C 2 U T ≤ 2C 2 T . Let us show that T − DT is strictly singular. Let X → X and ε > 0. Choose Z → Z such that (ΓZ \ {0}) ∩ (ΓX \ {0}) = ∅, U |Z − iZ ,Xω1 ≤ ε/(4T ) and (T −DT )|Z ≤ ε/4. Pick z ∈ Z and x ∈ X such that z −x ≤ ε/(2(DT + T )). Then (T − DT )x ≤(T − DT )x − (T − DT )z + (T − DT )z ε ≤T x − U z + DT x − z + 4 ε (VIII.9) ≤(T + DT )x − z + ≤ ε. 2 Now suppose that X is non separable. By Lemma VIII.31, we can find a sequence (Xγ )γ<ω1 of separable complemented subspaces of X such that ΓXγ is an initial part of ΓX for every γ < ω1 . Now the result for X easy follows from the result for the corresponding Tγ = T |Xγ and the fact that DT ∈ DΓX (Xω1 ) and DTγ ∈ DΓXγ (Xω1 ) are unique. The uniqueness of DT ∈ DΓX (Xω1 ) is clear from the analogous result for transfinite block sequences. (0) Theorem VIII.34. L(X, Xω1 ) ∼ = DΓX (Xω1 ) ⊕ S(X, Xω1 ) ∼ = JT∗0 (ΓX ) ⊕ S(X, Xω1 ) for every X → Xω1 . If in addition ΓX is infinite, then L(X, Xω1 ) ∼ = JT∗0 (ΓX ) ⊕ S(X, Xω1 ).
Proof. Let H : DΓX → L(X, Xω1 ) be defined by D → D|X. Assume first that X is separable. It is clear that D|X ≤ D. For an appropriate ε > 0, we can find normalized (yα )α<γ and a normalized block sequence (zα )α such that ΓX = ΓZ and α zα − yα ≤ ε where Z the closed linear span of (zα )α<γ . Since by Proposition VII.21 D|Z ≥ D/C, for C the finite block representability constant of JT0 in Xω1 , we get that D/C ≤ D|Z ≤ (1 + ε)D|Y ≤ (1 + ε)D|X = (1 + ε)H(D). (VIII.10) Hence, H defines an isomorphism. To show that H is an isomorphism when X is non separable we use a family (Xα )α<ω1 of separable complemented subspaces
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
97
of X defined as in previous proof. Proposition VIII.33 shows that L(X, Xω1 ) ∼ = DΓX (Xω1 ) ⊕ S(X, Xω1 ). For the latter isomorphism see Remark VIII.19. Notes and Remarks. Chapters VI, VII, VIII and the following appendices originate from [13]. It follows easily from the results of Chapter VIII that every T ∈ L(Xω1 ) is of the form λI +S with S an operator with separable range. The first example of a non separable Banach space with few operators, in the above sense, was provided by S. Shelah ([57]) in the late 1970s assuming V = L. Ten years later S. Shelah and J. Steprans, using Todorcevic’ “square-bracket” coloring [60], were able to provide a ZFC example with few operators [58], and in 2001 H.M. Wark using interpolation methods and the previous space, gave a reflexive space with few operators [64]. None of the above examples controls the separable subspaces as it happens in Xω1 . There are variants of the ρ function which impose additional properties in Xω1 . Of particular interest is the universal ρ function, introduced in [13] which permits the local structure of Xω1 to be repeated almost everywhere. Using the σρ coding with the universal ρ function one can obtain an HI X with a Schauder basis (en )n which belongs to the asymptotic structure of itself in the sense of [47]. A consequence of the representability of D(Xω2 ) as JT∗ yields that JT∗ with the pointwise multiplication is a Banach algebra. Notice that a similar result for the classical James space [36] is given in [2]. The unconditional counterpart of Xω1 is also presented in [13]. This is a reflexive space with an unconditional basis not isomorphic to any of its proper subspaces. In particular for every infinite A ⊂ ω1 denoted by XA = < {ea : a ∈ A} > the shift operator is not continuous. As we have mentioned in the introduction it remains open if there exist reflexive Banach spaces not containing an unconditional basic sequence and with dimension greater than ω1 . It is clear that the problem of defining such a space is reduced to defining an efficient coding function σ. S. Todorcevic has extended the notion of a ρ function for cardinals higher than ω1 . However it is not yet clear how we can pass from these ρ functions to an efficient σρ coding. To make more transparent the meaning of Theorem VIII.34, we state the following: Theorem. There exists a separable reflexive Banach space X admitting an infinite dimensional Schauder decomposition X = n ⊕Xn such that, denoting by D(X) the class of bounded operators D : X → X with the property D|Xn = λn IXn for all n, the following hold: (i) L(X) ∼ = D(X) ⊕ S(X) ∼ = JT∗0 ⊕ S(X). (ii) For every subspace X of X there exists A ⊆ N which is either an initial finite interval or is equal to N such that L(X, X) ∼ = JT∗0 (A) ⊕ S(X, X). For example, the space X = Xω2 has all these properties. It is worth pointing out that D(X) is a natural class of operators which behaves similar to the class of
98
Chapter VIII. The Spaces of Operators L(Xγ ), L(X, Xω1 )
operators of the form λI + K with K compact diagonal. For example if xn ∈ Xn with xn = 1 and X = (xn )n then for every D ∈ D(X) we have that D|X = λI + K. Let us mention that there exists a reflexive HI space X with a Schauder basis (en )n admitting strictly singular diagonal operators, which are not compact [7]. Moreover the space of strictly singular diagonal operators in this example is non separable. The problem of the existence of a separable reflexive Banach space such that the diagonal operators are compact perturbations of the multiples of the identity seems to be also open.
Appendix A
Transfinite Schauder Basic Sequences The first appendix concerns the presentation of some results related to transfinite (Schauder) bases. We recall one of the equivalent formulations of their definition. Definition A.1. Let X be a Banach space, and γ be an ordinal number. 1. A total family (xα )α<γ of elements of X (i.e., a family such that X = xα α<γ ) is said to be a transfinite basis if there exists a constant C ≥ 1 such that for every interval I of γ the naturally defined map on the linear span of (xα )α<γ α<γ
λα xα →
α∈I
λ α xα
is extended to a bounded projection PI : X → XI = xα α∈I of norm at most C. 2. A transfinite basis (xα )α<γ of X is said to be bimonotone if for each interval I of γ, the corresponding projection PI has norm 1. 3. A transfinite basis (xα )α<γ of X is said to be unconditional if there exists a constant C ≥ 1 such that for all subset A of γ, the corresponding PA has norm at most C. 4. A transfinite basis (xα )α<γ of X is said to be 1-subsymmetricif for every n ∈ N, every α1 < α2 < · · · < αn < γ and every (λi )ni=1 ∈ Rn , ni=1 λi xi = ni=1 λi xαi . Remark A.2. 1. As in the case of the usual Schauder basis (i.e., γ = ω) the above definition is equivalent to the fact that each x ∈ X admits a unique representation as α<γ λα xα , where the convergence of these series is recursively defined. 2. α<γ λα xα easily yields that for each convergent series The definition of λ x with (x ) a bounded family, the sequence of coefficients (λα )α<γ α α α α<γ α<γ belongs to c 0 (γ). Furthermore, for every ε > 0 there exists a finite subset F of γ such that α∈F / λα xα < ε.
100
Appendix A. Transfinite Schauder Basic Sequences
3. For every transfinite basis (xα )α<γ the dual basis (x∗α )α<γ is also well defined. ∗ As for the usual Schauder bases, (x∗α )α<γ is a w -total subset of X ∗ and each x∗ ∗ in X has a unique representation of the form α<γ x∗ (xα )x∗α where the series is w∗ -convergent. For a detailed study of transfinite Schauder bases we refer the reader to [59]. 4. If (xα )α<γ is a transfinite basis for the space (X, · ), then there exists an equivalent norm | · | on X such that (xα )α<γ is a bimonotone basis for the space (X, | · |). This norm is defined by |x| = sup{PI (x) : I interval of γ}. In the sequel, for every ordinal γ we shall denote by c00 (γ) the vector space of all sequences (λα )α∈γ of real numbers such that the set {α < γ : λα = 0} is finite. We also denote by (eα )α<γ the natural Hamel basis of c00 (γ). It is an easy observation that every space X with a transfinite basis (xα )α<γ is isometric to the completion of c00 (γ) endowed with an appropriate norm. Moreover if K is a subset of c00 (γ) with the properties (a) {e∗α }α<γ ⊆ K and (b) for every φ ∈ K, φ∞ ≤ 1 and for every interval I of γ, the restriction φI = φ · χI of φ to I is also a member of K, then the norm defined on c00 (γ) by xK = sup{|φ(x)| = φ, x : φ ∈ K} satisfies that the completion of (c00 (γ), ·K ) has (eα )α<γ as a transfinite bimonotone basis. Fix X with a transfinite basis (xα )α<γ . The support supp x of x ∈ X is the set {α < γ : x∗α (x) = 0}. For a given interval I ⊆ γ, let XI = PI X, and for α < γ, let Xα = X[0,α) . For x, y ∈ X finitely supported, we write x < y to denote that max supp x < min supp y. A sequence (yα )α<ξ is called a transfinite block subsequence of (xα )α<γ if and only if for all α < ξ, yα is finitely supported and for all α < β < ξ, yα < yβ . Notice that a transfinite block subsequence of a transfinite basis is always a transfinite basis of its closed linear span. Fix two Banach spaces X and Y . A bounded operator T : X → Y is an isomorphism iff T X is closed and T is one-to-one. T is called strictly singular if it is not an isomorphism when restricted to any infinite dimensional closed subspace of X (i.e., for all infinite dimensional closed X → X, either T X is not closed or T |X is not 1 − 1). This is equivalent to saying that for all Y → X and ε > 0, there is an infinite dimensional closed subspace Y of Y such that T |Y ≤ ε. It is well known that most of the structure of the infinite dimensional closed subspaces of a separable Banach space X with a basis (xn )n is described by its block sequences. Namely that for every infinite dimensional closed subspace Y of X and every ε > 0 there exists a normalized sequence in Y and a block sequence (wn )n of (xn )n which are 1 + ε-equivalent. The method used for the proof of this result is called the gliding hump argument. This result is not extendable in the case of the transfinite block sequences. For example, consider a biorthogonal basis (xα )α<ω·2 of a Hilbert space and set Y the subspace generated by the sequence (xn + xω+n )n .
Appendix A. Transfinite Schauder Basic Sequences
101
We now describe how block sequences are connected to the subspaces in the transfinite case. Proposition A.3. Let (xα )α<γ be a transfinite basis of X and Y an infinite dimensional closed subspace X. Then there exists a λ ≤ γ and a closed subspace Z of Y such that 1. Pλ : Z → Xλ is an isomorphism. 2. For every ε > 0 there exists a semi-normalized block sequence (wn )n in Xλ and a normalized sequence (zn )n in Z such that n Pλ zn − wn < ε. 3. There exists a subspace Z of Z isomorphic to a block subspace of X. 4. If we additionally assume that Y has a Schauder basis (yn )n , then the sequence (zn )n in 2. can be chosen to be a block sequence of (yn )n . Proof. We assume that (xα )α<γ is a bimonotone basis. Let β0 = min{β : Pβ : Y → Xβ is not strictly singular}.
(A.1)
Let us show that λ = β0 is the required ordinal. Notice that β0 has to be necessarily a limit ordinal. Since Pβ0 is not strictly singular on Y , there exists a subspace Z of Y such that Pβ0 : Z → Xβ0 is an isomorphism. On the other hand for every γ < β0 , Pγ : Y → Xγ is strictly singular hence for every ε > 0 and every subspace Z of Z there exists W → Z such that Pγ |W < ε. Now we are ready to apply as they are required in a modified gliding hump argument to obtain (zn )n , (wn )n εn < ε/4. We choose 2. Indeed for a given ε we choose (εn )n such that εn > 0, a normalized z1 ∈ Z . Since β0 is a limit ordinal, there must exist γ1 < β0 such that P[γ1 ,β0 ) z1 < ε1 . Hence setting w1 = Pγ1 z1 we have that w1 − Pβ0 z1 < ε1 . Since Pγ1 : Z → Xγ1 is strictly singular there exists a normalized z2 ∈ Z and Pγ1 z2 < ε2 . Choose γ2 > γ1 such that P[γ2 ,β0 ) z2 < ε2 and set w2 = P[γ1 ,γ2 ) z2 . Observe that Pβ0 z2 − w2 < 2ε2 and w1 < w2 . Continuing in this manner we obtain (zn )n and (wn )n such that for all n, Pβ0 zn − wn ≤ 2εn , hence n
Pβ0 zn − wn ≤ ε/2.
(A.2)
Since we assume that the transfinite basis (xα )α<γ is bimonotone, (A.2) implies that (Pβ0 zn )n and (wn )n are equivalent. The desired property 3. follows from 2, while 4. results of a careful choice of (zn )n in 2. As we have mentioned in the introduction the manner that block subspaces saturate the subspaces of X is weaker than the corresponding result for spaces X with a basis (xn )n . In the next proposition we provide a sufficient condition which ensures the complete extension of the result from the Schauder bases to transfinite Schauder bases fulfilling the additional condition.
102
Appendix A. Transfinite Schauder Basic Sequences
Proposition A.4. Let (xα )α<γ be a transfinite basis of X. Assume that for every I, J disjoint intervals of γ the spaces XI and XJ are totally incomparable. Then for every Y closed infinite dimensional subspace of X and every ε > 0 there exist normalized sequences such that (yn )n ⊂ Y , (zn )n block sequence of (yn )n , (zn )n (zα )α<γ and n yn − zn < ε. Proof. From Proposition A.3 there exists a subspace Z of Y and λ ≤ γ such that Pλ : Z → Xλ is an isomorphism. Assume that λ < γ and set I = [1, λ) and operator. Hence we may find J = [λ, γ). Then PJ : Z → XJ is a strictly singular ), (z ) as in Proposition A.3 (2) such that P (w n J (zn ) < ε which yields that n n z − w < 2ε. n n n Definition A.5. A transfinite basis (xα )α<γ is called shrinking iff for all (αn )n ↑, (xαn )n is shrinking in the usual sense (i.e., (x∗αn ) generates in norm the dual of the closed span of (xαn )n ). It is called boundedly complete iff for all (αn )n ↑, (xαn )n is boundedly complete in the usual sense (i.e., (λn )n , if there is some nfor all sequence of scalars C > 0 such that for all n, i=1 λi xαi ≤ C, then i λi xαi converges in norm). The following result is the extension of the well-known James’ characterization of reflexivity [35] in the general setting of a Banach space with a transfinite basis. Proposition A.6. Let (xα )α<γ be a transfinite basis of X. Then X is reflexive iff (xα )α<γ is shrinking and boundedly complete. Proof. The direct implication is consequence of the James’ characterization. The opposite requires the following two claims. Claim 1. If (xα )α<γ is shrinking then the biorthogonal basis (x∗α )α<γ generates in the norm topology the dual space X ∗ . Proof of the claim. Assume the contrary. Then there exists x∗ ∈ X ∗ not in the closed linear span Y of (x∗α )α<γ . Set β0 = min{β ≤ γ : Pβ∗ x∗ ∈ / Y }. Then Pβ∗0 x∗ ∈ / ∗ ∗ Y but for all γ < β0 , Pγ x ∈ Y . Therefore there exists an increasing sequence of successive disjoint intervals I1 < I2 < · · · < In < · · · < β0 and ε > 0 such ∗ ∗ ∗ ∗ that if x∗ ∈ X ∗ , that for each n ∈ N, ∗PIn x ∈ Y and PIn x ≥ ε. Observe ∗ ∗ ∗ x = w − α<γ µα xα , where for each α < γ, µα = x (xα ). Moreover if I is an interval of γ such that PI∗ x∗ ∈ Y and ε > 0, then there is a finite subset Fε of I such that yε∗ − x∗ < ε, where yε∗ = w∗ − α∈γ\I µα x∗α + α∈Fε µα x∗α . Using this observation we inductively select finite sets F1 ⊆ I1 ,. . . , Fn ⊆ In such that setting (A.3) yn∗ = ni=1 α∈Fi µα x∗α + Pβ0 \ ni=1 In x∗ , we have that
Pβ∗0 x∗ − yn∗ < εn < 4ε .
(A.4)
Appendix A. Transfinite Schauder Basic Sequences
103
Set y ∗ = w∗ − limn yn∗ and (A.3) and (A.4) yield that supp yn∗ ⊆ n Fn and also PF∗n y ∗ > ε/2. Since each Fn is a finite set we can enumerate n Fn as (αn )n ↑ and clearly y ∗ yields that the sequence (xαn )n is not a shrinking Schauder basis, a contradiction. Claim 2. If (xα )α<γ is boundedly complete then for every x∗∗ ∈ X ∗∗ , the series ∗∗ ∗ α<γ x (xα )xα converges in norm. Proof of the claim. Suppose the contrary and fix x∗∗ ∈ X ∗∗ but not in X. The proof is similar to the previous one. For each α < γ, let λα = x∗∗ x∗α and let β0 = min{β < γ : Pβ∗∗ x∗∗ ∈ / X}. Using a similar argumentwe can choose an increasing sequence (F n )n of finite subsets of γ such that w∗ − α∈ Fn λα x∗α exists and for every n, α∈Fn λα xα > n ε > 0. This yields that the sequence (xα )α∈ n Fn is not boundedly complete, a contradiction.
Appendix B
The Proof of the Finite Representability of JT0 The goal of this part is to prove the basic inequality and show the finite interval representability of the James-like space JT0 in Xω1 (Theorem VII.9). Reaching these two goals involves a similar sort of problems and for this reason we introduce a general theory applicable to both cases and hopefully to many other cases to come. General theory The theory deals with a block sequence of vectors (xk )nk=1 , a sequence of scalars )nk=1 , and a functional f ∈ Kω1 , and tries to estimate |f ( nk=1 bk xk )| in terms of (bk n |g( k=1 bk ek )| for an appropriately chosen functional g of an auxiliary Tsirelsonlike space X with basis (ei )i . The natural approach is to start with a tree-analysis (ft )t∈T of f , and to try to replace the functional ft at each node t ∈ T by a functional gt in the norming set of the auxiliary space, and in doing this to try to copy, as much as possible, the given tree-analysis (ft )t∈T . Not all nodes t ∈ T have the same importance in this process. It turns out that the crucial replacements ft → gt are made for t belonging to some sets A ⊆ T such that (ft )t∈A is in some sense responsible for the estimation of the action of the whole functional f on each of the vectors xk . These are the maximal antichains of T defined below. Observe that some of the replacements ft → gt are necessary before this procedure has a chance to work. Suppose for example the replacements are made in an auxiliary mixed Tsirelson space X where a particular (Anj0 , m1j )-operation is not allowed. 0 Then, every time we find a node t ∈ T such that the corresponding ft has weight w(ft ) = mj0 , the replacement gt has to be something avoiding this operation, i.e., we cannot put the combination gt = (1/w(ft )) s∈St gs . This sort of nodes are the ones that we call “catchers” below, because their own tree analyses (fs )st cannot be taken into account.
106
Appendix B. The Proof of the Finite Representability of JT0
Antichains and arrays of antichains Recall that every f ∈ Kω1 has a tree-analysis (ft )t∈T such that: For every t ∈ T , (a) if u ) t, then ran fu ⊆ ran ft , and (b) if ft is of type I, then ft = (1/w(ft )) s∈St fs . Recall that A ⊆ T is called an antichain if for every t = t ∈ A, neither t t nor t t. Given t, t ∈ T , we define t ∧ t = max{v ∈ T : v t, t }. Notice that A ⊆ T is an antichain iff t ∧ t t, t for every t = t ∈ T . Definition B.1. Fix a tree-analysis (ft )t∈T of f as above. Given a finitely supported vector x, a set A ⊆ T is called a regular antichain for x and (ft )t∈T if: (a.1) For every t ∈ A, ft is not of type II. (a.2) ft1 ∧t2 is of type II for every t1 = t2 ∈ A, and (a.3) ran ft ∩ ran x = ∅, for every t ∈ A. A is a maximal antichain for x if in addition A satisfies (a.4) For every t ∈ T , if supp ft ∩ ran x = ∅, then there is some u ∈ A comparable with t. Let (xk )nk=1 be a block sequence, and let A = (Ak )nk=1 be such that each Ak is a regular antichain for the vector xk and the tree-analysis (ft )t∈T . For a given t ∈ T , we define DtA = ut {k ∈ [1, n] : u ∈ Ak }, EtA = DtA \ ( s∈St DsA ). Whenever there is no possible confusion we simply write Dt and Et to denote DtA and EtA , respectively. A = (Ak )nk=1 is called a (maximal) regular array for (xk )nk=1 and (ft )t∈T if each Ak is a (maximal) regular antichain for xk and (ft )t∈T , and in addition (a.5) for every t ∈ k Ak such that ft is of type I, either t is a catcher, i.e., Ds = ∅ for every s ∈ St , or for every k ∈ Et , t is splitter of xk , i.e., for every k ∈ Et there are at least s1 = s2 ∈ St such that ran fsi ∩ ran xk = ∅. We denote by S(A) and C(A) the set of splitter nodes and catcher nodes of A, respectively. Notice that if ti ∈ Aki (i = 1, 2) are catcher nodes, then they are incomparable, and that Ak = S(A) ∪ C(A). Note that if no ft (t ∈ T ) is of type II then #Ak ≤ 1 for all k, and so the tree-analysis below becomes much simpler. Definition B.2. (The functor A(x, C).) Given a block vector x and C ⊆ T consisting of nodes of type I, let A(x, C) be the set of nodes t ∈ T such that (A.1) ft is not of type II. (A.2) ran ft ∩ ran x = ∅.
Appendix B. The Proof of the Finite Representability of JT0
107
(A.3) For every s t if s ∈ Su and fu is of type I, then for every s ∈ Su \ {s} we have that ran fs ∩ ran x = ∅. (A.4) If ft is of type I and t ∈ / C, then t is a splitter of x. (A.5) for every u t, u ∈ / C. Proposition B.3. Let A = A(x, C) be a maximal regular antichain such that {t ∈ A \ C : ft of type I} ⊆ S(A). Moreover, if (xk )nk=1 is a block sequence, then the corresponding A = (A(xk , C))nk=1 is a maximal regular array such that (a) {t ∈ k Ak \ C : ft of type I} ⊆ S(A), and (b) C ⊆ C(A) and for every t ∈ C, Et is an interval of integers. Proof. Fix t = t ∈ Ak . That ft∧t is of type II follows from the fact that if u t, then u ∈ / C, by (A.5), hence if fu is of type I, then (A.3) implies that u is not splitter of x. We show the maximality of A: Fix t ∈ T such that supp ft ∩ran x = ∅. Let t0 ) t be such that ft0 is of type 0 and supp ft0 ⊆ ran wk , and set b = [0, t0 ] = {v ∈ T : v t0 } which is a -well ordered set, and t ∈ b. We distinguish two cases: Suppose first that b∩C = ∅. Let u0 = min{u ∈ b : v satisfies (A.1), (A.4)}. Notice that u0 exists since t0 satisfies (A.1) and (A.4). The minimality of u0 shows that u0 satisfies (A.3), hence u0 ∈ A. Suppose now that b ∩ C = ∅, and set v0 = min b ∩ C. It is not difficult to show that u0 = max{u v0 : u satisfies (A.1), (A.4)} is in A (notice that v0 satisfies (A.1) and (A.4), hence u0 is well defined.) Repeating this procedure for each vector in a given a block sequence (xk )nk=1 , one gets that the array (A(xk , C))nk=1 is maximal and regular. Finally suppose that t ∈ C and suppose that k1 < k2 < k3 with k1 , k3 ∈ Et . It is routine to check that t satisfies (A.1)–(A.5) for xk2 , hence it follows that k2 ∈ Et . Proposition B.4. Suppose that A = (Ak )nk=1 is a regular array for a block sequence (xk )nk=1 and (ft )t∈T . Then: (b.0) If t ∈ Ak is splitter or if ft is of type 0, then supp ft ∩ ran xk = ∅. (b.1) If ft is of type I, then {Ds }s∈St ∪ {{k} : k ∈ Et } is a block family, and if t is splitter, then #Et ≤ #St − 1. Suppose that in addition A = (Ak )nk=1 is maximal for (xk )nk=1 . (b.2) Fix t ∈ Ak and fix u s t with fu of type I and s ∈ St . Then for every s ∈ Su \ {s} ran fs ∩ ran xk = ∅. (b.3) Suppose that ft is of type II, k ∈ Dt and s ∈ St . If supp ft ∩ ran xk = ∅, then k ∈ Ds . Proof. (b.0) If ft is of type 0, the conclusion is clear. If t is a splitter, let s1 = s2 ∈ St be such that fs1 < fs2 and ran fs1 ∩ ran xk , ran fs2 ∩ ran xk = ∅. Then max supp fs1 ∈ ran xk . (b.1) For the first part, if t is catcher, there is nothing to prove, so we assume t is splitter. First we show that {Ds }s∈St ∪ {{k} : k ∈ Et } is a disjoint family. If
108
Appendix B. The Proof of the Finite Representability of JT0
k ∈ Et ∩Ds for some s ∈ St , then there is some u ) s with u ∈ Ak . But t ∈ Ak and t u, a contradiction. Suppose that k ∈ Ds ∩ Ds with s = s ∈ St . Then there are u, u ∈ Ak such that u ) s, u ) s . Hence u∧u = t but ft is of type I, contradicting (a.2). For the second part, suppose that k1 < k2 < k3 are such that k1 , k3 ∈ Ds for some s ∈ St . This implies that ran xk1 ∩ ran fs , ran xk3 ∩ ran fs = ∅, and hence ran xk2 ⊆ ran fs . This implies that ran xk1 ∩ ran fs = ∅ for every s ∈ St \ {s}. / Et , and, by (a.3), k2 ∈ / Ds for every s ∈ St \ {s}. Since t is splitter, k2 ∈ Let St = {s1 < · · · < sd } be ordered such that fsi < fsj whenever i < j. For k ∈ Et , the set Hk = {i ∈ [1, d] : ran xk ∩ ran fsi = ∅} has at least two elements. We claim that the mapping k → max Hk ∈ {2, . . . , d} is one-to-one. To see this note that for k < k we obtain that Hk ∩ Hk = {max Hk } if max Hk = max Hk , and Hk < Hk otherwise. (b.2) Fix s ∈ St \ {s}, and suppose that ran fs ∩ ran xk = ∅. Since ran fs ∩ ran xk = ∅, we get that supp fs ∩ ran xk = ∅. By maximality of Ak , there is t ∈ Ak comparable with s . Since Ak is an antichain, we get that t ) s , and hence t ∧ t = u. But fu is of type I, a contradiction. (b.3) This follows using (a.4) and (a.1), (a.2). Assignments, filtrations, and their relationships Definition B.5. Given a block sequence (xk )nk=1 , and a regular array A = (Ak )nk=1 A for (xk )nk=1 , a sequence (gk,t )t∈Ak ,k ⊆ c00 (N) is called an A-assignment provided that supp gk,t ⊆ {k} for every k and t ∈ Ak . The property (b.1) ensures that A )t∈Ak ,k naturally filters down to the whole tree (GA every A-assignment (gk,t k,t )t∈T A A A as follows: If k ∈ / Dt , then GA = 0, and if t ∈ A , then G = g . Suppose that k k,t k,t k,t A = (1/w(f ))G k ∈ DtA \ DsA . If ft is of type I, then we define recursively GA t k,t k,s , A where s ∈ St is the unique s = s(k, t) ∈ St such that k ∈ Ds (by (b.1)). If ft is of A type II, ft = s∈St λs fs , then we simply set GA k,t = s∈St λs Gk,s . For t ∈ T , let GA t =
k∈DtA
GA k,t .
A We call (GA t )t∈T the filtration of (gk,t )t∈Ak ,k . Whenever there is no possible conA A , GA fusion, we write gk,t , Gk,t and Gt instead of the respective gk,t k,t and Gt .
Proposition B.6. (c.1) Fix t ∈ T . For every k, supp gk,t ⊆ {k}. Hence supp gt ⊆ Dt . (c.2) If ft is not of type II, then Gt = k∈Et gk,t + (1/w(ft )) s∈St Gs . (c.3) If ft is of type II, ft = s∈St λs fs , then Gt = s∈St λs Gs . Proof. (c.1) is clear. (c.2) If ft is of type 0, this is clear. Suppose that ft is of type I. Then by
Appendix B. The Proof of the Finite Representability of JT0
109
definition Gk,t + k∈Dt \Et Gk,t = k∈Et gk,t + s∈St k∈Ds Gk,t = 1 1 = k∈Et gk,t + s∈St w(f k∈Ds Gk,s = k∈Et gk,t + w(ft ) s∈St Gs . t) (B.1)
Gt =
k∈Et
(c.3) Suppose that ft is of type II, i.e., ft = s∈St λs fs , and suppose that k ∈ (e ) = λ G (e ) = ( Dt . Then, by (c.1), Gt (ek ) = Gt,k k s k,s k s∈St s∈St λs Gs )(ek ). If k ∈ / Dt , then Gt (ek ) = 0, and s∈St λs Gs (ek ) = 0. Definition B.7. (Canonical Assignment) Suppose that A = (Ak )k is a regular array for (xk )nk=1 and (ft )t∈T . Let fk,t = ft (xk )e∗k for k ∈ [1, n] and t ∈ Ak . This is the A-canonical assignment. Remark B.8. Note that if the array A is maximal, then filtering down the canonical assignment we get ft (wk ) = Fk,t (ek ), for every t ∈ T , and k ∈ Dt : If k ∈ Et , this is just by definition. Suppose k ∈ / Et . If ft is of type I, then Fk,t (ek ) = (1/w(ft ))Fk,s (ek ), where s ∈ St is unique such that k ∈ Ds . By the maximality of Ak , we get that supp fs ∩ ran wk = ∅ for every s ∈ St \ {s} (by (b.2)), hence ft (xk ) = (1/w(f t ))fs (xk ) = (1/w(ft ))Fk,s (ek ) = Fk,t (ek ), by inductive hypothesis. If f = λs fs is of type II, then by maximality of Ak , t s∈S t ft (xk ) = s∈St ,k∈Ds λs fs (xk ) = s∈St ,k∈Ds λs Fk,t (ek ) = Fk,t (ek ), the last equal/D . ity because Fk,u = 0 if k ∈ u We obtain that ft ( k∈Dt bk xk ) = Ft ( k∈Dt bk ek ) = Ft ( nk=1 bk ek ) for every sequence scalars (bk )nk=1 of . nThe last equality follows from supp Gt ⊆ Dt . In n particular, f ( k=1 bk xk ) = G∅ ( k=1 bk ek ), since D∅ = {k : supp f ∩ ran xk = ∅}, by maximality of A. Proposition B.9. Suppose that A = (Ak )nk=1 is a regular array (not necessarily maximal) for (xk )nk=1 and (ft )t∈T . Fix scalars (bk )nk=1 , (ck )nk=1 and suppose that (gk,t )t∈Ak ,k , (hk,t )t∈Ak ,k are A-assignments. (1) If for every t ∈ Ak gk,t (bk ek ) ≤ hk,t (ck ek ), then for every t ∈ T Gk,t (bk ek ) ≤ Hk,t (ck ek ). (2) Gk,u (ek )∞ ≤ max{gk,t ∞ : t ∈ Ak }, for every u ∈ T . n (3) If for every t ∈ k=1 Ak k∈Et gk,t (bk ek ) ≤ k∈Et hk,t (ck ek ), then for every t∈T, bk ek ) ≤ Ht ( ck ek ). Gt ( k∈Dt
(4) Gu ∞ ≤
t∈Ak ,k
k∈Dt
gk,t ∞ for every u ∈ T .
Proof. This follows from Proposition B.6.
110
Appendix B. The Proof of the Finite Representability of JT0
Two successive filtrations In some applications of the theory one needs to do the process of assignment and filtration twice starting with different arrays of antichains. To see this, suppose that C and D are regular arrays for (xk )nk=1 and (ft )t∈T . Then we can naturally D D )t∈Dk ,k by taking the filtration gk,t = GCk,t . For this to define a D-assignment (gk,t work, one needs the following special relationship between C and D. Definition B.10. We write C ⊀ D if for every k, every c ∈ Ck and every d ∈ Dk , C )k∈Ck ,k is called coherent provided that we have that c ⊀ d. A C-assignment (gk,t C gk,t = 0 whenever ft (wk ) = 0. Proposition B.11. Suppose that C ⊀ D are two regular arrays for (xk )nk=1 and (ft )t∈T , and suppose that D is in addition maximal. Fix a coherent C-assignment C )t∈Ck ,k . Then: (gk,t (a) For every k ∈ DtC ∩ DtD , GCk,t = GD k,t . (b) g∅C = g∅D . Proof. (a) If k ∈ EtD , this is just by definition. Suppose ft is of type I, and suppose D that k ∈ DsD , for some s ∈ St . Then GD k,t = (1/w(ft ))Gk,s . Since D is a maximal regular array, by Proposition B.4 (b.2), ran fs ∩ ran wk = ∅ for every s ∈ St \ {s}. If k ∈ DsC , then we are done by the inductive hypothesis. So, suppose k ∈ EtC , ∈ Dk (because k ∈ DsD ), contradicting i.e., t ∈ Ck . Hence, t u for some u combination, our assumption that C ⊀ D. If ft = s∈St λs fs is a sub-convex D D D then GD = G = G = D D C k,t k,s k,s s∈St ,k∈Ds s∈St ,k∈Ds ∩Ds s∈St ,k∈DsD ∩DsC Gk,s = GCk,t . To see the last equality note that if k ∈ / DsD , then, by maximality of D, supp fu ∩ ran wk = ∅ for every u ) s, so, by coherence of the assignment, GCk,t = 0; C / DuC for all u ) s, and so gk,u = 0 for all u ) s u ∈ Ck , giving if k ∈ / DsC , then k ∈ D us Gk,s = 0. D D C (b) Note now that g∅D = k∈D C gk,∅ = k∈D C ∩D C gk,∅ = g∅ . For if k ∈ ∅
∅
∅
D∅C \ D∅D , then by maximality of D, for all u ∈ T , supp fu ∩ ran wk = ∅, hence, by C D = 0 for all u, and hence gk,∅ = 0; if k ∈ D∅D \D∅C , coherence of the C-assignment gk,u C then every Ck = ∅, and so gk,∅ = 0.
Let us now give the two main applications of this general theory of treeanalyses. The proof of the basic inequality Let W be the minimal subset of c00 (N) containing {±e∗k }k , and closed under ((A4nj , m1j )) operations. Fix a (C, ε)-RIS (xk )nk=1 , and fix (jk )nk=1 witnessing that (xk )nk=1 is a (C, ε)-RIS, i.e., a) xk ≤ C, b) | supp xk | ≤ mjk+1 ε and c) for all type I functionals φ of K with w(φ) < mjk , |φ(xk )| ≤ C/w(φ). Fix a sequence
Appendix B. The Proof of the Finite Representability of JT0
111
(bk )nk=1 of scalars, maxk |bk | ≤ 1, and f ∈ Kω1 . Let (ft )t∈T be a tree-analysis of f . Consider the maximal regular array A = (A(xk , C))nk=1 , where C is the set of nodes t such that ft is of type I and w(ft ) = mj0 . We introduce the following two A-assignments (gk,t )t∈Ak ,k , and (rk,t )t∈Ak ,k . Fix k and t ∈ Ak . If tt is of type 0, then we set gk,t = e∗k and rk,t = 0. Suppose that t is of type I, and w(ft ) = mj0 . Let lt = min{k ∈ Et : w(ft ) ≤ mjk } if it exists, and lt = ∞ otherwise. If k > lt , then we set gk,t = (1/w(ft ))e∗k and rk,t = 0. If k < kt , then we set gk,t = 0 and rk,t = εe∗k . If k = lt , then we set gk,t = e∗k and rk,t = 0. Suppose now that w(ft ) = mj0 . Notice that Et is an interval. Set kt = max{l ∈ Dt : |bl | = (bi )i∈Et ∞ }. If k = kt then we set gk,t = e∗k , and rk,t = εek ; if not, then we set gk,t = 0, and rk,t = εe∗k . Let (Gt )t∈T and (Rt )t∈T be the corresponding filtrations. Claim (D). Fix t ∈ T . Then: (d.1) Rt ∞ ≤ ε. (d.2) |ft ( k∈Dt bk xk )| ≤ C(Gt + Rt )( k∈Dt |bk |ek ). (d.3) For every t for which ft is of type I, either Gt ∈ conv{h ∈ W : w(h) = w(ft )} / supp ht and ht ∈ conv{h ∈ W : w(h) = w(ft )}. or Gt = e∗k + ht for some k ∈ Proof of the claim. (d.1) follows from Proposition B.9, and (d.2) follows also from the same proposition applied to the canonical A-assignment, the assignment (C(gk,t + hk,t ))t∈Ak ,k , and the sequences of scalars (bk )k and (|bk |)k . (d.3) If w(ft ) = mj0 , then t is a catcher and Gt = k∈Et gk,t = e∗kt ∈ W . Suppose that t is of type I, w(ft ) = m j0 . By (c.2) and the particular A-assignment, ∗ ∗ = (1/w(ft ))( k∈E e + we know that either Gt s∈St Gs ) or Gt = elt + ht , t ,k>lt k ∗ where ht = (1/w(ft ))( k∈Et ,k>lt ek + s∈St Gs ). Assume this last case holds. Subcase 1a. For every s ∈ St the functional fs is not of type II. From the inductive hypothesis, we have that for every s ∈ St , Gs = hs or Gs = e∗ls + hs , hs ∈ W . For s ∈ St such that Gs = e∗ls + hs , set Is1 = {n ∈ N : n < ls } and Is2 = {n ∈ N : n > ls }. We set h1s = Is1 hs , h2s = Is2 hs . Then, for every s ∈ St the functionals h1s , e∗ls , and h2s are successive and belong to W . By (b.1), for s = s ∈ St the corresponding functionals together with {e∗k }k∈Et ,k>lt form a block family, and we obtain that #{e∗k }k∈Et ,k>lt + #{e∗ls : s ∈ St } + #{h1s : s ∈ St } + #{h2s : s ∈ St } ≤ 4#St . (B.2) Therefore, (1/w(ft ))( k∈Et ,k>lt e∗k + s∈St Gs ) ∈ W . Subcase 1b. There are s ∈ St for which fs is of type II. Let B1 be the set of immediate successors s of t such that fs isof type II, and B2 = St \ S1 . Observe that every sub-convex combination fs = u∈Ss ru fu satisfies that fu is of type I. We may assume, allowing repetitions if needed, that for every s ∈ St such that fs is of type II, fs = (1/k) kq=1 fs,q , where each fs,q ∈ {fu : u ∈ Ss }. For each q = 1, 2, . . . , k we set hqt = (1/mj )( l∈Et ,l>lt e∗l + s∈B1 Gs + s∈B2 Gs,q ), where Gs,q = Gu for u ∈ Ss such that fs,q = fu . A similar argument as in the previous subcase shows that hqt ∈ W with w(hqt ) = mj for q = 1, 2, . . . , k and ht = (1/k) kq=1 hqt , as required.
112
Appendix B. The Proof of the Finite Representability of JT0
The particular case t = ∅, the root of T , gives us the conclusion of the basic inequality. Remark B.12. Note that a finer assignment using the same array of antichains will actually give us the conclusion of the basic inequality for a bit smaller auxiliary space T [(A2nj , m1j )j ]. The proof of the finite interval representability of JT0 The general scheme of the proof is quite similar to the proof of the basic inequality though the input block sequence of vectors is slightly differently chosen. Notice however that the finite interval representability involve two inequalities needed for showing that the representing operator as well as its inverse are uniformly bounded. Thus, while in the proof of the Basic Inequality we could afford to go the auxiliary space T [(A4nj , m1j )j ] this is no longer possible in this case. In other words, we need to improve on the counting (B.2). It is exactly for this reason that we introduce below two arrays of antichains and use two successive filtrations as explained above in Subsection B. Fix a transfinite block sequence (xα )α<γ , n ∈ N, a sequence I1 ≤ I2 ≤ · · · ≤ In of successive, not necessarily distinct, infinite intervals of γ, and ε > 0. Let j0 be such that m2j0 +1 > 100n/ε and set l = n2j0 +1 /m2j0 +1 . Find a (1, j0 )dependent sequence (z1 , ψ1 , . . . , zn2j0 +1 , ψn2j0 +1 ) such that (a) ran ψi ⊆ ran zi for every i = 1, . . . , n2j0 +1 and (b) (zk )il k=(i−1)l+1 ⊆ xα α∈Ii for every i = 1, . . . , n. Let n2j0 +1 φ = m2j1 +1 i=1 ψi , 0
and for each k = 1, . . . , n we set m wk = 2jl0 +1 kl i=(k−1)l+1 zi and φk =
1 m2j0 +1
kl
i=(k−1)l+1 ψi
∈ Kω 1 .
Proposition B.13. Fix k = 1, . . . , n. Then (1) ran φk ⊆ ran wk , φk wk = 1 and 1 ≤ wk ≤ 24. (2) For every f ∈ Kω1 of type I with w(f ) > m2j0 +1 , |f (wk )| ≤ 1/m22j0 +1 . (3) Let f ∈ Kω1 be of type I, f = (1/w(f )) di=1 fi with w(f ) = m2j+1 for j < j0 and d ≤ n2j+1 . Let d0 = max{i ≤ d : w(fi ) < m2j0 +1 }, and set d0 −1 d fL = 1/m2j+1 i=1 fi and fR = 1/m2j+1 i=d0 +1 fi . Then |fL (wk )| ≤ 1/m22j0 +1 and |fR (wk )| ≤ 1/m2j0 +1 . d (4) Let f = (1/w(f )) i=1 fi with w(f ) = m2j0 +1 and d ≤ n2j0 +1 be such that #{i ∈ [1, d] : w(fi ) = w(ψi ) and supp zi ∩ supp fi = ∅} ≤ 2. Then, |f (wk )| ≤ 1/m22j0 +1 .
Appendix B. The Proof of the Finite Representability of JT0
113
Proof. First of all, note that (zi )kl i=(k−1)l+1 is a (12, 1/n2j0 +1 )-RIS. Note also that (1) and (2) follow from Proposition II.19. (3) By the properties of special sequences, #
d0 −1 i=1
supp fi ≤ w(fd0 ) < m2j0 +1 .
(B.3)
So, |fL (wk )| ≤ f0 1 wk ∞ ≤ m32j0 +1 /n2j0 +1 ≤ 1/m22j0 +1 . Let us now estimate |fR (wk )|. To save on notation we only estimate for k = 1. Set F0 = {r ∈ [1, l] : #({i ∈ [d0 + 1, d] : ran zr ∩ supp fi = ∅}) ≥ 2}, F1 = [1, l] \ F0 . Notice that |F0 | ≤ n2j+1 − 1. For i = 0, 1 let wi = (mj1 /l) k∈Fi zk . Since fR ∈ Kω1 and since (zk )k is a (12, 1/n2j0 +1 )-RIS, we have that m m (B.4) |fR (w0 )| ≤ w0 ≤ 2jl0 +1 k∈F0 zk ≤ 2jl0 +1 6n2j+1 . To estimate |fR (w1 )| we use the basic inequality. For each i = d0 + 1, . . . , d, let Hi ={k ∈ F1 : ran zk ∩ supp fi = ∅}. Note that {Hi }i is apartition of F1 and is a block family. For i = d0 + 1, . . . , d, we set w1,i = mj1 /l k∈Hi zk . Clearly w1 = w1,d0 +1 + · · · + w1,d and hence |fR (w1 )| ≤
d i=d0 +1
|fR (w1,i )| =
1 m2j+1
d i=d0 +1
|fi (w1,i )|.
(B.5)
Let us estimate now |fi (w1,i )|, for i = d0 +1, . . . , d. For a fixed such i, applying again the basic inequality, we obtain |fi (w1,i )| ≤ 12(g1i + g2i )(m2j0 +1 /l k∈Hiek ), where in the worst case, g1i = hi + e∗ki , with hi ∈ W , and hi ∈ convQ {h ∈ W : w(h) = w(fi )}. Since the auxiliary space is 1-unconditional, by Proposition II.9, |hi ((m2j0 +1 /l) k∈Hi ek )| ≤ m2j0 +1 /w(fi ). Note that g2i ∞ ≤ 1/n2j0 +1 . Putting all these inequalities together we get ' ( m2j0 +1 n2j+1 m2j0 +1 m2j0 +1 d 12 + n2j |fR (w1 )| ≤ m2j+1 i=d0 +1 w(fi ) + l +1 0 2 m n m m 2j+1 d 2j +1 2j +1 2j 12 0 0 0 +1 + n2j +1 . ≤ m2j+1 (B.6) i=d0 +1 w(fi ) + n2j +1 0
Using (B.4) and (B.6) we obtain ' 12m2j0 +1 2n2j+1 m2j0 +1 + |fR (w1 )| ≤ m2j+1 n2j +1 0
1 n2j0 +1
+
d
1 i=d0 +1 w(fi )
0
(
≤
1 m2j0 +1 .
(B.7)
(4) Let E = {i ∈ [1, d] : w(fi ) = w(ψi ) and supp zi ∩ supp fi = ∅}. By our assumptions, #E ≤ 2. For i ∈ [(k − 1)l, kl] \ E the properties of the dependent sequences yield that |f (zi )| ≤ 1/n2j0 +1 . Hence, |f (wk )| ≤ 2 · 24m2j0 +1 /l + m2j0 +1 /n2j0 +1 ≤ 1/m22j0 +1 .
114 Lemma B.14. (bk )nk=1 .
Appendix B. The Proof of the Finite Representability of JT0 n
k=1 bk wk
≤ 121
n
k=1 bk vk JT0
for every choice of scalars
Proof. Fix a sequence (bk )nk=1 of scalars with maxk |bk | ≤ 1, an f ∈ Kω1 , and its tree (ft )t∈T . Antichains. A node t ∈ T is called relevant if (1) w(ft ) ≤ m2j0 +1 , and (2) if u t is its immediate predecessor, if fu is of type I, and if w(fu ) = m2j+1 < m2j0 +1 , then t = s(u) = max{s ∈ Su : w(fs ) < m2j0 +1 }, where the maximum is taken according to the block ordering Su = {s1 < · · · < sd }. Let C be the set of nodes t which are either non-relevant, or such that ft is of type I and w(ft ) = m2j0 +1 . Let B = (Bk )nk=1 where Bk = A(wk , C) for k = 1, . . . , n (see (A.1)–(A.5) in Proposition B.3 above). For each k, let Bkunc = S(Bk ) \ C be the set of splitters that are not in C, Bkcnd = Bk ∩ C, and Bkat = Bk \ (Bkunc ∪ Bkcnd ). Fix u ∈ Bkunc , and observe that u is splitter of xk for every k ∈ Eu . List all s ∈ Su such that ran fs ∩ ran wk = ∅ ,{sk,1 , . . . , sk,d } ordered according to the block ordering fsk,1 < · · · < fsk,d . We set now in wk,u =wk |[min supp wk , max supp fsk,1 ] fin in wk,u =wk − wk,t . For ∈ {in, fin}, let Bk,u = A(wk,u , Cnr ), where Cnr is the set of non-relevant nodes of T . Set Bk = u∈Bunc Bk,u . Observe that B = (Bk )nk=1 is a regular (not necesk sarily maximal) arrow for (wk )nk=1 and (ft )t∈T , whenever ∈ {in, fin, cnd, at}. )k∈Bk ,k Assignments and filtrations. Consider the following B -assignments (gk,t
where ∈ {in, fin, cnd}, and (r ) where ∈ {in, fin, cnd, at}: Fix k, and k,t k∈Bk ,k t ∈ ∈{in,fin,cnd,at} Bk . at (a) Suppose that ft is of type 0. Then we set rk,t = (1/m2j0 +1 )e∗k if t ∈ Bkat , and ∗ we set gk,t = 0 and rk,t = (1/m2j0 +1 )ek , if t ∈ Bk for some ∈ {in, fin}. (b) Suppose that t is non-relevant. Then clearly t ∈ / Bkat . Fix ∈ {in, fin, cnd}. = We set gk,t = 0 in all cases. Suppose that w(ft ) > m2j0 +1 . Then we set rk,t ∗ cnd ∗ (1/m2j0 +1 )ek for ∈ {in, fin}, and rk,t = (sgn(bk )/m2j0 +1 )ek . Finally, if t = s(u), where u is the immediate predecessor of t (see the definition of relevant node), cnd = ft (wk )e∗k for ∈ {in, fin} and rk,t = sgn(bk )ft (wk )e∗k . then we set rk,t (c) Suppose now that t is relevant. = (1/w(ft ))e∗k (c.1) w(ft ) = m2j0 +1 . If t ∈ Bk , for ∈ {in, fin}, then we set gk,t n2j0 +1 and rk,t = 0. Suppose that t ∈ Bkcnd . Suppose that ft = ±I(1/m2j0 +1 ) i=1 gi , where I ⊆ ω1 is an interval, and Φ = (g1 , . . . , gn2j0 +1 ) is a 2j0 + 1-special sequence. Set Ψ = (ψ1 , . . . , ψn2j0 +1 ). Consider It = {i ∈ [1, κΦ,Ψ − 1] : Igi = 0} = k(t,2)−1 [k(t, 1), k(t, 2)], and let εt = sgn( k=k(t,1)+1 bk ). If k = k(t, i) for i = 1, 2, then we cnd,Bcnd
cnd,Bcnd
cnd cnd = sgn (bk(t,i) )e∗k(t,i) and rk,t = 0. We set gk,t k = εt e∗k and rk,t k = 0 set gk,t cnd cnd if k ∈ (k(t, 1), k(t, 2)). We set gk,t = 0, rk,t = sgn(bk )(1/m2j0 +1 )e∗k otherwise. (c.2) Suppose that w(ft ) = m2j0 +1 . Then t ∈ Bk , for some ∈ {in, fin}. Set = (1/w(ft ))e∗k and rk,t = 0 for all cases, except for w(ft ) = m2j+1 < m2j0 +1 . gk,t
Appendix B. The Proof of the Finite Representability of JT0
115
In this case, we observe that since t is splitting there are at least two immediate successor s1 = s2 ∈ St such that ran wk,u ∩ ran fsi = ∅ (i = 1, 2) for some u ∈ Bk .
= ∅ This implies that there is at most one k ∈ EtB such that ran fs(t) ∩ ran wk,v unc ∗ for v ∈ Bk , and t ∈ Bk,v . Then we set gk,t = (1/m2j0 +1 )ek and rk,t = 0 if k is = 0 and rk,t = (1/m2j0 +1 )e∗k otherwise. this one, and gk,t Let (Gt )t∈T , (Rt )t∈T be the corresponding filtrations. Recall that given a regular array A = (Ak )k for (xk )k and (ft )t∈T the canonical A-assignment A A )t∈Ak ,k is defined by fk,t = f (xk )e∗k . It was shown in Remark B.7 that if in ad(fk,t dition A is maximal, then for every (ak )nk=1 and every t ∈ T , F A ( k∈DtA ak ek ) = ft ( k∈DtA ak wk ).
Claim. Fix t ∈ T , and for ∈ {in, fin, cnd, at} let Dt = DtB . Then: (e.1) |Ft ( k∈Dt bk ek )| ≤ 24(Gt + Rt )( k∈Dt |bk |ek ) for ∈ {in, fin}. (e.2) |Ftcnd ( k∈Dcnd bk ek )| ≤ 24(Gcnd + Rtcnd )( k∈Dcnd bk ek ). t t t (e.3) |Ftat ( k∈Dtat )bk ek | ≤ 24|Rtat ( k∈Dtat )bk ek |.
∈ 3W (JT0 ). (e.4) Gt ∈ W (T0 ) for ∈ {in, fin}, and Gcnd t (e.5) Rtat ∞ ≤ 1/m . For ∈ {in, fin, cnd}, either t is non-relevant, w(ft ) < 2j0 +1 m2j0 +1 and Gk = k∈EtB ft (wk )e∗k or Rt ∞ ≤ 1/m2j0 +1 . Proof of the claim. (e.1)–(e.3) are immediate applications of Proposition B.9. (e.4) Most of the cases follows immediately by definition of the corresponding assignments. We hint the non-trivial ones: Suppose that t is relevant. If w(ft ) = m2j0 +1 , then Dtcnd = Etcnd ,and the corresponding assignment gives that Gcnd = λ1 e∗k(t,1) + λ2 e∗k(t,2) + εt k∈Etcnd ∩(k(t,1),k(t,2)) e∗k ∈ 3W (JT0), where t λi = sgn(bk(t,i) )χEtcnd (k(t, i)), for i = 1, 2, and where χE denotes the characteristic function of E. Fix ∈ {in, fin}. We claim that #Dt ≤ 1: Suppose not, and say that k1 < k2 ∈ Dt . Then since w(ft ) = m2j0 +1 there are ui ∈ Bkunc i and si ∈ Bki ,ui (i = 1, 2) such that u1 , u2 t s1 , s2 . If = in, then since ran ft ⊆ ran fs(k1 ,u1 ) , it follows that ran ft < ran wk2 , and since ran fs2 ⊆ ran ft , we obtain that ran fs2 ∩ ran wk2 = ∅, contradicting the fact that s2 ∈ Bkin2 ,u2 . If = fin, in a similar manner we obtain that ran wk1 ∩ ran fs1 = ∅, a contradiction. Hence, either Gt = 0, or Gt = (1/m2j0 +1 )e∗k , certainly in W (T0 ) considered as sub-convex combinations. Suppose now that w(ft ) = m2j0 +1 . There are three subcases to consider: If w(f t ) > m2j0 +1 , then t is non-relevant, hence a catcher node, and Gt = k∈Et gk,t = 0. If w(ft ) = m2j with j ≤ j0 , then the inductive hypothesis gives that Gcnd ∈ 3W (JT0 ) (since Etcnd = ∅). Fix ∈ {in, fin}. Observe t that for every k ∈ Et there is s ∈ St such that ran fs ⊆ ran wk , in which #Et + #{s ∈ St : Gcnd = 0} ≤ #St , and then, Gt = case Ds =∅, and so s ∗ (1/w(ft ))( k∈Et ek + s∈St Gs ) ∈ W (T0 ). If w(ft ) = m2j+1 < m2j0 +1 , then using that there is at most one im= 0, mediate successor s(t) of t which is relevant we obtain that either Gcnd t
116
Appendix B. The Proof of the Finite Representability of JT0
∗ or Gcnd = (1/m2j )Gcnd t s(t) , and for ∈ {in, fin}, either Gt = (1/m2j+1 )ek , or Gt = (1/m2j+1 )Gs(t) . (e.5) Rtat ∞ ≤ 1/m2j0 +1 follows from Proposition B.9, since this is so for the corresponding assignment of which Rtat is a filtration. Suppose that ∈ {in, fin, cnd}. The proof is by backwards induction over t. Again we concentrate on non-trivial cases. Suppose that ft is of type I and t is relevant. Then if w(ft ) = m2j with j ≤ j0 , the desired result follows from the definition of the corresponding assignments, and hypothesis. inductive Suppose that w(ft ) = m2j+1 with j < j0 . +(1/w(ft )) s∈St Rs . By the definition of the assignments, Then Rt = k∈E rk,t t ∞ ≤ 1/m2j0 +1 for every k ∈ Et . Observe that all s ∈ St , except possibly one, rk,t = fs (wk )e∗k for every k ∈ Es = Ds . Hence, s(t), are non-relevant and that rk,s for every s ∈ St \ {s(t)}, (1/w(ft ))Rs ∞ = max{(1/w(ft ))fs (wk ) : k ∈ Es } ≤ 1/m2j+ 1 ; the last inequality follows from Proposition B.13. By inductive hypoth ∞ ≤ 1/m2j0 +1 , so we are done. esis Rs(t) Suppose that t is non-relevant. The case w(ft ) > m2j0 +1 is immediate. Suppose that w(ft ) = m2j and t = s(u), where u is the immediate predecessor of t (see the node). Notice that t is a catcher, so Et = Dt , and definition of relevant ∗ Rt = k∈E ft (wk )ek , as desired. t
We are now ready to finish the proof using part B of the general theory above. Notice that for each ∈ {in, fin, cnd, at}, B ⊀ B, and that the canonical assignments of B are coherent. Let (hk,t )t∈Bk ,k be the assignments induced by )t∈Bk ,k , for ∈ {in, fin, cnd, at}. the canonical B -assignments (fk,t Claim. For every t ∈ T , Htin + Htfin + Ftcnd + Ftat = FtB , the canonical assignment of B. fin cnd at Proof of the claim. We show that for every t ∈ Bk , hin k,t + hk,t + hk,t + hk,t = is a ft (wk )e∗k . The only non trivial case is if t ∈ Bkunc . Notice that since Bk,t and (fs )st , we obtain that hk,t = Fk,t = ft (wk,t )e∗k . maximal antichain for wk,t in fin in fin ∗ ∗ Hence, fk,t + fk,t = (ft (wk,t ) + ft (wk,t ))ek = ft (wk )ek , and hk,t = 0 for ∈ {cnd, at}.
Finally, by Proposition B.11, H∅ = F∅ , for ∈ {in, fin, cnd, at}. Hence, |f ( nk=1 bk wk )| =|F∅B ( nk=1 bk ek )| ≤ ∈{in,fin,cnd,at} |F∅ ( k∈D bk ek )| ≤ ∅ ≤24(5 nk=1 bk ek JT0 +4 nk=1 bk ek ∞ ) ≤ 120 nk=1 ek JT0 +ε. (B.8) Corollary B.15. The natural isomorphism F : w1 , . . . , wn → v1 , . . . , vn defined by F (wi ) = vi satisfies that F ≤ 1 and F −1 ≤ 120 + ε. Consequently, JT0 is finite interval representable on the basis (eα )α<ω1 of Xω1 with a constant C < 121. Proof. Proposition VII.11 shows that F ≤ 1; the other inequality follows from Lemma B.14.
Bibliography [1] D. E. Alspach, S. A. Argyros, Complexity of weakly null sequences, Dissertationes Mathematicae, 321, 1992. [2] A. D. Andrew, W. L. Green, On James’ quasireflexive Banach space as a Banach algebra, Canad. J. Math. 32 (1980), no. 5, 1080–1101. [3] S. A. Argyros, A universal property of Hereditarily Indecomposable Banach spaces, Proc. Amer. Math. Soc., 129 (2001), 3231–3239. [4] S.A. Argyros, A. Arvanitakis, A.Tolias, Strictly singular extensions and HI spaces with no reflexive subspaces, in preparation, [5] S. A. Argyros, I. Deliyanni, Banach spaces of the type of Tsirelson, preprint, 1992. [6] S. A. Argyros, I. Deliyanni, Examples of asymptotic l1 Banach spaces, Trans. Amer. Math. Soc. 349 (1997), no. 3, 973–995. [7] S. A. Argyros, I. Deliyanni, On the structure of the Diagonal strictly singular operators in HI spaces, in preparation, [8] S. A. Argyros, I. Deliyanni, D. N. Kutzarova, A. Manoussakis, Modified mixed Tsirelson spaces, J. Funct. Anal. 159 (1998), no. 1, 43–109. [9] S. A. Argyros, I. Deliyanni, A. Manoussakis, Distortion and spreading models in mixed Tsirelson spaces, Studia Math. 157 (3) 2003, 199–236. [10] S. A. Argyros, V. Felouzis, Interpolating Hereditarily Indecomposable Banach spaces, Journal Amer. Math. Soc., 13 (2000), 243–294. [11] S.A. Argyros, G. Godefroy, H. Rosenthal, Descriptive set theory and Banach spaces, Handbook of the geometry of Banach spaces, Vol. 2, 1007–1069, NorthHolland, Amsterdam, 2003. [12] S. A. Argyros, J. Lopez-Abad, S. Todorcevic, A class of Banach spaces with no unconditional basic sequence, C. R. Acad. Sci. Paris. Ser. I 337 (2003), 43–48. [13] S. A. Argyros, J. Lopez-Abad, S. Todorcevic, A class of Banach spaces with few non strictly singular operators, J. of Func. Anal. (to appear).
118
Bibliography
[14] S. A. Argyros, A. Manoussakis, An Indecomposable and Unconditionally saturated Banach space, Studia Math. 159 (1), (2003), 1–32. [15] S. A. Argyros, A. Manoussakis, A sequentially unconditional Banach space with few operators, Proc. LMS (to appear). [16] S. A. Argyros, A. Tolias, Methods in the theory of hereditarily indecomposable Banach spaces, Mem. Amer. Math. Soc. 170 (2004), no. 806, [17] S. A. Argyros, A. Tolias, Indecomposability and unconditionality in duality, Geom. Funct. Anal. 14 (2004), no. 2, 247–282. [18] S. F. Bellenot, Tsirelson superspaces and p , Journal of Funct. Anal., 69, No 2, 1986, 207–228. [19] S. Bellenot, R. Haydon, E. Odell, Quasi-Reflexive and tree spaces, Contemporary Mathematics, 85 (1989), 19–43. [20] J. Bernu´es, I. Deliyanni, Families of finite subsets of N of low complexity and Tsirelson type spaces, Math. Nachr. 222 (2001), 15–29. [21] P. G. Casazza, T. Shura, Tsirelson’s space, Lecture Notes in Math. 1363, Springer Verlag, 1989. [22] I. Deliyanni, A. Manoussakis, Asymptotic p HI-spaces, in preparation. [23] G.A. Edgar, A long James space, Proc. Conf. on Measure Theory, Lecture Notes in Math. 794, (1980) 31–37. [24] M. Fabian, P. Habala, P. Hajek,V. Montesinos Santaluca, J. Pelant, V. Zizler, Functional analysis and infinite-dimensional geometry., CMS Books in Mathematics 8, Springer-Verlag, New York, 2001. [25] V. Ferenczi, Operators on subspaces of Hereditarily Indecomposable Banach spaces, Bull. London Math. Soc. 29 (1997), no. 3, 338–344. [26] V. Ferenczi, Hereditarily finitely decomposable Banach spaces, Studia Math. 123 (1997), no. 2, 135–149. [27] V. Ferenczi, A uniformly convex Hereditarily Indecomposable Banach space, Israel J. Math., 102 (1997), 199–225. [28] T. Figiel, W. B. Johnson, A uniformly convex Banach space which contains no p , Compositio Math. 29, 1974, 179–190. [29] W. T. Gowers, A Banach space not containing c0 , 1 or a reflexive subspace, Transactions of the AMS 344, No 1, 1994, 407–420. [30] W. T. Gowers, An Infinite Ramsey Theorem and Some Banach-Space Dichotomies, Ann. of Math. (2) 156, (2002), 797–833. [31] W. T. Gowers, A solution to Banach’s hyperplane problem, Bull. London. Math. Soc., 28, (1996), 297–304.
Bibliography
119
[32] W. T. Gowers, Ramsey methods in Banach spaces, Handbook of the geometry of Banach spaces, Vol. 2, 1071–1097, North-Holland, Amsterdam, 2003 [33] W. T. Gowers, B. Maurey, The unconditional basic sequence problem, Journal of AMS 6, 1993, 851–874. [34] W. T. Gowers, B. Maurey, Banach spaces with small spaces of operators, Math. Ann. 307 (1997), no. 4, 543–568. [35] R. C. James, Bases and reflexivity of Banach spaces. Ann. of Math. (2) 52, (1950). 518–527. [36] R. C. James, A non-reflexive Banach space isometric with its second conjugate space, Proc. Nat. Acad. Sci. U. S. A. 37, (1951). 174–177. [37] R. C. James, Uniformly non-square Banach spaces, Ann. of Math. 80, 1964, 542–550. [38] R. C. James, A separable somewhat reflexive Banach space with nonseparable dual, Bull. Amer. Math. Soc. 80 (1974), 738–743. [39] W. B. Johnson,A reflexive Banach space which is not sufficiently Euclidean Studia Math. 55 (1976), no. 2, 201–205. [40] J. Lindenstrauss On nonseparable reflexive Banach spaces. Bull. Amer. Math. Soc. 72 (1966) 967–970. [41] J. Lindenstrauss, L. Tzafriri, Classical Banach spaces I , Springer-Verlag Vol. 92, (1977) [42] J. Lopez-Abad, A. Manoussakis, On Tsirelson type spaces (in preparation). [43] A. Manoussakis, On the structure of a certain class of mixed Tsirelson spaces, Positivity 5 (2001), no. 3, 193–238. [44] A. Manoussakis, Some remarks on spreading models and mixed Tsirelson spaces, Proc. Amer. Math. Soc. 131 (2003), 2515–2525. [45] B. Maurey, A remark about distortion, Operator Theory: Advances and Applications 77, 1995, 131–142. [46] B. Maurey, Banach spaces with few operators, Handbook of the geometry of Banach spaces, Vol. 2, 1247–1297, North-Holland, Amsterdam, 2003 [47] B. Maurey, V. D. Milman, N. Tomczak-Jaegermann, Asymptotic infinite dimensional theory of Banach spaces, Operator Theory: Advances and Applications 77, 1995, 149–175. [48] B. Maurey, H. Rosenthal, Normalized weakly null sequences with no unconditional subsequence, Studia Math. 61, 1977, 77–98. [49] V. D. Milman, The geometric theory of Banach spaces, part II: Geometry of the unit sphere, Math. Surveys 26, 1971, 79–163.
120
Bibliography
[50] V. D. Milman, N. Tomczak-Jaegermann, Asymptotic p spaces and bounded distortions, Banach spaces, Contemp. Math. 144, 1993, 173–196. [51] E. Odell, On subspaces, asymptotic structure, and distortion of Banach spaces; connections with logic, Analysis and logic (Mons, 1997), 189–267, London Math. Soc. Lecture Note Ser., 262, Cambridge Univ. Press, Cambridge, 2002. [52] E. Odell, Th. Schlumprecht, The distortion problem, Acta Math. 173, 1994, 259–281. [53] E. Odell, Th. Schlumprecht, Distortion and Stabilized Structure in Banach spaces; New Geometric Phenomena for Banach and Hilbert Spaces, Proc. International Congress of mathematicians, vol. 1,2,(Z¨ urich, Switzerland 1994), Birkh¨ auser Verlag, Basel, 1995, 955–965. [54] J. Rainwater, Weak convergence of bounded sequences, Proc. Amer. Math. Soc. 14 (1963), 999. [55] Th. Schlumprecht, An arbitrarily distortable Banach space, Israel J. Math. 76, 1991, 81–95. [56] J. Schreier, Ein Gegenbeispiel zur Theorie der schwachen Konvergenz, Studia Math. 2, 1930, 58–62. [57] S. Shelah, A Banach space with few operators, Israel J. Math. 30 (1978), no. 1-2, 181-191. [58] S. Shelah, J. Stepr¯ ans, A Banach space on which there are few operators, Proc. Amer. Math. Soc. 104 (1988), no. 1, 101–105. [59] I. Singer, Bases in Banach spaces. II, Editura Academiei Republicii Socialiste Romˆania, Bucharest, 1981. [60] S. Todorcevic, Partitioning pairs of countable ordinals, Acta Math. 159 (1987), no. 3-4, 261–294. [61] S. Todorcevic, Coherent sequences, Handbook of set theory, to appear. [62] N. Tomczak-Jaegermann, Banach spaces of type p have arbitrarily distortable subspaces, GAFA, 6 (1996), 1074–1082. [63] B. S. Tsirelson, Not every Banach space contains p or c0 , Funct. Anal. Appl. 8 1974, 138–141. [64] H. M. Wark, A non-separable reflexive Banach space on which there are few operators, J. London Math. Soc. (2) 64 (2001), no. 3, 675–689. [65] M. Zippin, On perfectly homogeneous bases in Banach spaces, Israel J. of Math. 4 (1966), p. 265–272
Part B
High-Dimensional Ramsey Theory and Banach Space Geometry Stevo Todorcevic
Introduction One of the first remarkable applications of Ramsey theory to Banach space theory dates back to the mid 1970s and is due to Brunel and Sucheston. They were able to isolate the notion of a spreading model (en ) of a basic sequence (xn ) in a given Banach space X. The spreading model (en ) is a basic sequence in some other Banach space Y . It is finitely block equivalent to (xn ) but it typically has considerably more properties especially if one is willing to pass to its infinite block subsequences. For example, (en ) has a block subsequence which is unconditional. Working from an unconditional spreading model (en ) one can go further and find a basic sequence (fn ) in some Banach space Z such that (fn ) is finitely block representable in (en ) and such that (fn ) is equivalent to the standard basis of some p (1 ≤ p < ∞) or c0 , a well-known result of J. L. Krivine. It follows that for any basic sequence (xn ) in some Banach space X one of the classical spaces p (1 ≤ p < ∞) or c0 is finitely block representable in (xn ). This in particular gives precise connection between the local theory of general Banach spaces and the local theory of classical Banach spaces, as well as a new proof of Dvoretzky’s theorem that 2 is finitely represented in every infinite dimensional Banach space. Starting from this set of results we have split the rest of the lectures into two parts, those dealing with problems of finding subsequences of a given sequence with some desired properties (like being unconditional, for example) and those of finding block subsequences with desired properties. In Ramsey theory this corresponds to concentrating on different “Ramsey spaces” so we tried to explain this in some details. The discovery of the first Ramsey space N[∞] of all infinite increasing sequences of natural numbers has in fact been started in the early 1960s from purely utilitarian reasons of developing a theory of well-quasi-orderings, a theory that culminated in Laver’s proof of Fra¨ıss´e’s conjecture stating that the class of countable linear orderings is well-quasi-ordered under embeddability. We have presented parts of this beautiful theory of Nash–Williams not only because of its own right but also because of the importance of his notions of ‘fronts’ and ‘barriers’ in the theory of Tsirelson norms. This is an area of functional analysis that has seen a considerable growth in the last 10 to 15 years. Some of this deep theory is presented in the parallel set of lecture notes of Spiros A. Argyros which form the first part of this volume and which we warmly recommend to the reader.
124
Introduction
In the early 1970s Nash–Williams theory has been reformulated and considerably strengthened by the work of Galvin, Prikry, Silver and specially Ellentuck by introducing the topological Ramsey theory. In hindsight the first application of this new topological Ramsey theory in the Banach space theory is Rosenthal’s 1 -theorem stating that a bounded infinite sequence (xn ) of elements of some Banach space contains either an infinite subsequence (xnk ) which is weakly Cauchy or an infinite subsequence (xnk ) such that for some positive constants δ < ε, δ
m k=1
|λk | ≤
m k=1
λk xnk ≤ ε
m
|λk |
k=1
for all choices of integers m ≥ 1 and scalars λ1 , . . . , λk . The proof of Rosenthal’s 1 -theorem which used the topological Ramsey theory has actually been found by Farahat [27] shortly after Rosenthal’s original proof [78]. In fact, it was Farahat’s proof which has introduced topological Ramsey theory to this area of Banach space theory. Out of the numerous results proved in the wake of Farahat’s proof of Rosenthal’s 1 -theorem one could not go without mentioning Elton–Odell’s beautiful result that every infinite dimensional normed space X contains an infinite normalized sequence (xn )∞ n=0 of vectors such that for some ε > 0 and all m = n, xm − xn > 1 + ε. Diestel’s book [20] contains an exposition of several other results about sequences in Banach spaces obtained using the topological Ramsey space N[∞] of infinite subsets of N. The Ramsey theory of N[∞] is particularly well suited for the study of sequence — convergence and summability of series in Banach spaces, or more generally, in topological abelian groups. We have presented this in Sections II.9 and II.10. For example, we show how Nash–Williams’ version of this theory enters naturally into the proof of Rosenthal’s theorem stating every weakly null sequence (xn ) in some Banach space X contains either a subsequence (xnk ) all of whose further subsequences are Ces`aro summable, or a subsequence (xnk ) whose spreading model is isomorphic to 1 . In Section II.10 we show that a simple application of the topological Ramsey theorem for N[∞] gives a simple and uniform way for deducing several basic principles of functional analysis such as principles of uniform boundedness and automatic continuity, Schur’s 1 -theorem, Orlicz–Pettis theorem, Vitali–Hahn–Saks theorem, etc. While the Ramsey space N[∞] has numerous applications to Banach space theory the block Ramsey spaces such as the space FIN[∞] of all infinite block sequences of finite sets seem to be more relevant to deeper problems of this theory. We have chosen to exemplify this on the problem of finding an unconditional sequence of a given weakly null sequence (xn ) of some Banach space X. The Ramsey theory of N[∞] via an unpublished result of Rosenthal shows that every weakly null sequence in ∞ (Γ) consisting of characteristic functions of subsets of Γ contains an unconditional subsequence. In these notes (see II.5), we shall extend this result to all weakly null sequences in l∞ (Γ) that are in some sense separated away from 0. There is however a bound on how far one can go in this direction.
Introduction
125
The famous example of Maurey–Rosenthal shows that this is no longer true even 2 in the case of weakly null sequences of the function space C(ω ω + 1). However, it still makes sense asking for an unconditional block-subsequence of a given weakly null sequence. The search for a block Ramsey theorem applicable to this problem from the Banach space theory lasted for almost twenty years. The culmination of this search is the famous Gowers’ dichotomy which although it does not depend on any previous result about known Ramsey spaces, such as N[∞] or FIN[∞] , it uses the basic idea of the ‘combinatorial forcing’ present in essentially all results establishing the existence of various Ramsey spaces. We have taken some effort in pointing explicitly any place where combinatorial forcing is used not only to point out the similarities in various arguments but to also indicate the existence of some sort of method that might be applicable to many other cases. We have also taken some effort to point out the difference between the classical notion of a Ramsey subset of a given Ramsey space and Gowers’ notion of strategically and approximately Ramsey sets of infinite normalized block sequences of vectors of a given Banach space E. For example, in the last sections of these notes we show that while classical Ramsey property is always closed under the operation of complementation, Gowers’ notion of strategic or approximate Ramsey property in general is not preserved by taking complements. This is done by transferring the strategic or approximate Ramsey property of a given class of sets of normalized block sequences to the class of their continuous images. So, for example, if the Banach space E contains no isomorphic copy of c0 then there is a rather automatic way to transfer the strategic Ramsey property of analytic sets of infinite block sequences of E to the strategic Ramsey property of Gδ sets of infinite block sequences of E. This explains why the full strength of Gowers’ analytic Ramsey theorem for Banach spaces (Theorem 4.1 of [35]) is really contained in its Gδ -case and why all known applications of this theorem involve only simple sets of block sequences. There is an aspect of Ramsey theory that calls for applications. This is a part of Ramsey theory that tries to classify ‘canonical’ equivalence relations on a given Ramsey space. For example in the case of the Ramsey space N[∞] one is interested in the behavior of equivalence relations (equivalently, maps from N[∞] into some other space) on N[∞] , not globally but relative to the possibility of going to an arbitrary chosen sub-cube M [∞] over an infinite subset M of N. We have chosen to present a result of Pudlak and R¨ odl that essentially deals with the classification of all Borel equivalence relations on N[∞] with at most countably many classes. We have also included some block Ramsey analogues such as the beautiful result of A. D. Taylor which identifies the list of five equivalence relations on FIN and the results of J. Lopez-Abad which does the same for the generalizations FINk of FIN. Finally, we mention that this set of notes is a reworked version of the material that was originally prepared for the Advanced Course on Ramsey Methods in Analysis at the Centre de Recerca Matem`atica during January 2004. We have tried to present some of the aspects of Ramsey theory that have shown to be
126
Introduction
useful in some areas of functional analysis but undoubtedly have missed many others. Even the small selection when fully presented would fill an amount of lecturing of a much greater length than that given given to us. So it was necessary to compromise and give only the key concepts and ideas of the theory. The length restriction is also responsible for our compromise of being rather brief and at times superficial regarding the credits and other historical discussions. We choose this opportunity to apologize to the numerous authors that have built this subject and hope that the rich source of literature that we include at the end of these notes will indirectly remedy this flaw since any reader interested in more details will have no problems of finding a more complete picture there. During the preparation of this set of notes I have profited from remarks of many participants of the Advanced Course. Special thanks go to Neus Castells and Jordi Lopez Abad who helped not only with mathematical contents of these notes but also with the technical aspects of preparing these notes. Naturally, all the remaining omissions and errors are my sole responsibility.
Chapter I
Finite-Dimensional Ramsey Theory: Finite Representability of Banach Spaces I.1
Finite-Dimensional Ramsey Theorem
Consider a set S with possibly some structure such as for example a partial semigroup structure, where the associative relation is defined only for x and y respecting some order. Then given a positive integer k, Ramsey-theoretic results at this level are typically not about colorings of the full k-power S k but rather some restricted version S [k] ⊆ S k that respects the partial semigroup structure on S. In the case S = N with the usual order, S [k] is the set of all k-element subsets of N, and similarly for any other ordered set (S, <). Theorem I.1.1 (Ramsey). For every positive integer k and for every finite coloring of the symmetric power N[k] there is an infinite set M ⊆ N such that M [k] is monochromatic. Proof. Choose a nonprincipal ultrafilter U on N. It is very convenient to think about U as a quantifier over N in the sense that a formula of the form (Un)ϕ(n) is interpreted as saying that the set {n : ϕ(n)} belongs to U. The corresponding quantifier respects all propositional connectives in the sense that for every choices of formulas ϕ(x) and ψ(x) we have: (a) ¬(Un)ϕ(n) ←→ (Un) ¬ϕ(n), (b) (Un)ϕ(n) & (Un)ψ(n) ←→ (Un) (ϕ(n) & ψ(n)), (c) (Un)ϕ(n) ∨ (Un)ψ(n) ←→ (Un) (ϕ(n) ∨ ψ(n)).
128
Chapter I. Finite-Dimensional Ramsey Theory
Given a positive integer k and an ultrafilter U we can define its k-power U k by deciding when a subset X of N[k] belongs to U k as follows: X ∈ U k iff (Un0 )(Un1 ) · · · (Unk−1 )X(n0 , n1 , . . . , nk−1 ) where, of course, X(n0 , n1 , . . . , nk−1 ) has the meaning that the k-element set {n0 , n1 , . . . , nk−1 } is written in its <-increasing order and that it belongs to X. Then the properties (a), (b), and (c) of the quantifier (Un) for this particular formula translate to the following facts about U k : (a ) X ∈ U k iff (N[k] \X) ∈ U k . (b ) X, Y ∈ U k iff X ∩ Y ∈ U k . (c ) X ∈ U k or Y ∈ U k iff X ∪ Y ∈ U k . It follows that U k is indeed a nonprincipal ultrafilter on N[k] . Hence, given a finite coloring of N[k] we can find a color P such that P ∈ U k . Given a set s ⊆ N of size l < k, let Ps = {t ∈ N[k−l] : max(s) < min(t) & s ∪ t ∈ P }. Note the following properties of these sets: (0) P∅ = P ∈ U k (1) {s ∈ P [l] : Ps ∈ U k−l } ∈ U l for 0 ≤ l < k. Let T = {s ∈ N[≤k] : Ps ∈ U [k−|s|] }, where in case s ∈ N[k] , we choose the convention that “Ps ∈ U 0 ” means “s ∈ P ”. Note that: (2) ∅ ∈ T (3) s ∈ T ∩ N[
I.1. Finite-Dimensional Ramsey Theorem
129
[2] Proof. Given a sequence {Mi }∞ → {0, 1} by i=0 of elements of U define c : N [2] letting c({i, j}) = 0 iff j ∈ Mi . If M ∈ U is such that c M is constant, then the constant value has to be 0, giving us the conclusion j ∈ Mi whenever i < j ∈ M . For the converse implication, given c : N[2] → {0, 1}, for each i let ε(i) ∈ {0, 1} be such that Mi = {j > i : c(i, j) = ε(i)} ∈ U. Get M ∈ U such that j ∈ Mi whenever i < j ∈ M . Shrinking M we may assume that ε M is constant, so c M [2] is also constant.
Lemma I.1.5. A nonprincipal ultrafilter U on N is Ramsey iff for every f : N → N there exists an M ∈ U such that f M is either 1 − 1 or constant. Proof. Given f , define a coloring c : N[2] → {0, 1} by letting c(i, j) = 0 iff f (i) = f (j). Find M ∈ U with monochromatic M [2] . Then f is either constant or oneto-one on M. We prove the converse implication using the characterisation given in the previous Lemma. Let {Mi }∞ i=0 ⊆ U be a given sequence which we may assume to be decreasing and with empty intersection. Define f : N → N by f (i) = min{j : i ∈ Mj }. Then there is M ∈ U on which f is one-to-one. Choose a strictly increasing infinite sequence (nk ) in N such that for all i, j, k ∈ N, if f (i) = j, then i ≤ nk implies j < nk+1 and j ≤ nk implies i < nk+1 . Applying the selection property to the function that collapses each interval [nk , nk+1 ) to a point, we obtain an N ∈ U which takes at most one point from each of the intervals. Going to a subset of N , we may assume that N does not intersect two consecutive intervals [nk , nk+1 ). Then P = M ∩ N is a member of U such that j ∈ Mi whenever i < j ∈ P. Exercise I.1.6. Show that if U is a Ramsey ultrafilter on N then for every (xn ) ∈ c0 there is M ∈ U such that n∈M |xn | < ∞. Note that for a given ultrafilter U on some set S and a sequence (xs )s∈S of elements of some compact space X there is a unique member x of X such that {s ∈ S : xs ∈ U} ∈ U for every open neighborhood U of x. We shall denote this fact by the formula lim xs = x.
s→U
Note also that the set βS of all ultrafilters on S has a natural compact Hausdorff topology generated by basis {U ∈ βS : A ∈ U}
(A ⊆ S).
ˇ Exercise I.1.7. Show that βS is the Stone-Cech compactification of the discrete space S, or in other words, that for every f : S → X where X is a compact Hausdorff space there is a continuous map βf : βS → X such that βf S = f . Exercise I.1.8. Use Ramsey’s Theorem to show that every bounded infinite se∞ quence (xn )∞ n=0 of real numbers has an infinite subsequence (xnk )k=0 such that ∞ ∞ both (xnk )k=0 and (xnk+1 −nk )k=0 are convergent.
130
I.2
Chapter I. Finite-Dimensional Ramsey Theory
Spreading Models of Banach Spaces
Recall the notion of a Schauder basis of an infinite-dimensional Banach space X, a sequence (ei ) ⊆ X with the property that for every x ∈ X there is a unique sequence (ai ) of scalars such that x=
∞
ai ei .
i=0
Given a Schauder basis (ei ) of X the sequence (Pn )∞ n=1 of canonical projections is n−1 ∞ defined by Pn (x) = i=0 ai ei where x = i=0 ai ei . The sequence (Pn )∞ n=1 of norms is uniformly bounded and the corresponding least upper bound is the basis constant of (ei ). By going to an equivalent norm of X this constant can be made to be equal 1. One also implicitly assumes that ei = 1 for all i. Exercise I.2.1. Show that if(ei ) is a Schauder basis of a Banach space X with ∞ constant C > 0, and if x = i=0 ai ei is a vector from X of norm at most 1 then |ai | ≤ 2C for all i. Definition I.2.2. A sequence (ei ) ⊆ X is an unconditional basic sequence if there n−1 n is C < ∞ such that for all finite sequence (ai )n−1 i=0 of scalars and (εi )i=0 ∈ {±1} ,
n−1
εi ai ei ≤ C
i=0
n−1
ai ei .
i=0
The smallest C satisfying this is called the unconditional basis constant of (ei ). Exercise I.2.3. Show that (ei ) ⊆ X is an unconditional basic sequence if for every x in the closed linear span of (ei ) there exists a sequence (ai ) of scalars such that x=
∞
aπ(i) eπ(i)
i=0
for every permutation π of N. Exercise I.2.4. Show that the standard bases of p (1 ≤ p < ∞) and c0 are 1-unconditional. One of the first uses of Ramsey Theory in the study of Banach spaces is based on the following concept. Definition I.2.5. Given a normalized basic sequence (xn ) in some Banach space X, its spreading model is a normalized basic sequence (yn ) in possibly another Banach space Y such that for every integer k ≥ 0 there is an integer l ≥ 0 such that k k 1 ani xni − ani yni | < | k i=0 i=0
I.2. Spreading Models of Banach Spaces
131
for every sequence of integers l ≤ n0 < · · · < nk and for every sequence (ani )i≤k of scalars of modulus at most 1. Note that while a spreading model for a given normalized basic sequence (xn ) needs not to exist, it is unique whenever it does. Recall that two basic sequences (xn ) and (yn ) in possibly different Banach spaces X and Y are C-equivalent for some constant C > 0 whenever (1/C)
∞ n=0
a n xn ≤
∞
an yn ≤ C
n=0
∞
a n xn
n=0
for every choice of scalars (an ) of modulus at most 1. Definition I.2.6. A basic sequence (xn ) in some Banach space X is C-spreading for some C > 0 if it is C-equivalent to all of its infinite subsequences. Example I.2.7. The canonical basic sequences of c0 and p (p ≥ 1) are 1-spreading. Note the following reformulation of the existence of a 1-spreading model. Definition I.2.8. A basic sequence (xn ) in some Banach space X is asymptotically spreading if there is a 1-spreading basic sequence (yn ) in a possibly different Banach space Y such that for all k, ε > 0 there is n ∈ N such that (xni )ki=0 ∼1+ε (yi )ki=0 1 for every choice of integers n < n0 < · · · < nk . The following Lemma gives the intended meaning to this definition in regard to Definition I.2.5. Lemma I.2.9. A basic sequence (xn ) is asymptotically spreading iff it admits a 1-spreading model. Theorem I.2.10 (Brunel–Sucheston). Every normalized basic sequence (xn ) in some Banach space X has a subsequence which is asymptotically spreading. Proof. Let C > 0 be the basic constant of (xn ). For every integer k > 0 we fix a 1 )-net Dk in [−2C, 2C]k in the metric determined by the supremum norm. finite ( 2k We assume moreover that Dk is closed under scalar multiplication by ±/k (0 ≤ ≤ k). Then for every k > 0 and d = (d0 , . . . , dk−1 ) ∈ Dk we have a map fd : N[k] −→ R+ defined by fd ({n0 , n1 , . . . , nk−1 }< ) =
k−1
di xni .
i=0 1 (u
i)
∼C (vi ) is our notation for C-equivalence defined above.
132
Chapter I. Finite-Dimensional Ramsey Theory
[k] Note that fd ({n0 , n1 , . . . , nk−1 }) ≤ k−1 i=0 |di | for every {n0 , n1 , . . . , nk−1 } ∈ N . In other words, the range of fd is bounded in R for all d ∈ Dk and k > 0. It follows that lim fd (s) = rd s→U k
is finite for all > 0 and d ∈ Dk . To simplify the notation we assume that U is, in fact, a Ramsey ultrafilter, so by Corollary 1.3 we can find Mk ∈ U (k > 0) such that 1 . |fd (s) − rd | < 2k [k]
for all k > 0, d ∈ Dk and s ∈ Mk . We assume that the sets Mk are decreasing. Pick infinite M = (ni )i∈N (in fact in U) such that nj ∈ Mni whenever i < j. Define a norm · on c00 by letting
k−1
di ei = rd
(k > 0, d = (d0 , . . . , dk−1 ) ∈ Dk ).
i=0
Note that indeed this set of equalities defines a norm since for example for a scalar λ for which λd = (λd0 , . . . , λdk−1 ) belongs to Dk , we have
k−1
λdi ei = λrd .
i=0
Note that in this norm the basis (ei ) of c00 is 1-spreading, i.e., k−1 i=0 λai eni = k−1 i=0 λai ei for every choice of n0 < · · · < nk−1 , and k > 0. By the choice of M = (nj ), k−1 k−1 1 | di ei − di xnji | < k i=0 i=0 for every k > 0 and every choice of j0 < j1 < · · · < jk−1 as long as j0 ≥ k. Since (Dk ) is a sequence of finer and finer nets, this sequence of estimates are sufficient to conclude that ((ei ), · ) is a spreading model of the subsequence (xnj ) of our given sequence (xn ). The following fact shows the going to a block-subsequence of the spreading model (en ) one can improve its behavior. ∞ Lemma I.2.11. If (en )∞ n=0 is spreading then (e2n − e2n+1 )n=0 is 1-unconditional.
Proof. Let fi = e2i − e2i+1 , i = 0, 1, . . . . We need to verify that for every pair of finite sets of integers I ⊆ J and every choice aj (j ∈ J) of scalars of modulus at most 1, ai fi ≤ aj fj . i∈I
j∈J
I.2. Spreading Models of Banach Spaces
133
Pick an integer n > 0. Choose a block sequence sj (j ∈ J) of finite subsets of N (i.e., si < sj whenever i < j in J) such that |sj | = 2 for j ∈ I and |sj | = n + 1 for j ∈ J \ I. For j ∈ J and k < |sj | let sj (k) denote the kth member of sj according to the increasing enumeration of sj . Then by the 1-spreading property of (ei ) and for all k < n, aj fj = ai (esi (1) − esi (0) ) + aj (esj (k+1) − esj (k) ). j∈J
i∈I
j∈J\I
Summing up these n inequalities and dividing by n, we get
aj fj ≥
j∈J
n−1 1 n ai (esi (1) − esi (0) ) + aj (esj (k+1) − esj (k) ) n i∈I
≥
k=0 j∈J\I
1 |aj | (esj (n) − esj (0) ) n
ai (esi (1) − esi (0) ) −
i∈I
≥
j∈J\I
2|J \ I| . n
ai fi +
i∈I
Since
2|J\I| n
→ 0 as n → ∞ this gives us the desired inequality.
The following result gives us a sufficient condition for the spreading model (en ) to be unconditional. Theorem I.2.12 (Brunel–Sucheston). Every normalized weakly null basic sequence (xn ) in some Banach space X has a subsequence with a 1-spreading unconditional model. Proof. On the basis of the previous proof, it suffices to show that the spreading model (ei ) of the subsequence (xni ) of (xn ) is 1-unconditional under the additional assumption that (xn ) is weakly null. In other words we have to prove that
k
ai ei ≤
k
ai ei
i=0
i=i0
for all 0 ≤ i0 ≤ k and all choices of scalars ai (i ≤ k) with ai0 = 0. Fix > 0. Find n such that k k | ai ei − ai xni | < i=i0
|
k i=0
i=i0
ai ei −
k
ai xni | <
i=0
for all choices of integers nk > nk−1 > . . . > n0 ≥ n. Since (xni ) is weakly null by
134
Chapter I. Finite-Dimensional Ramsey Theory
Mazur’s theorem (see II.3.35 below) there is a sequence of integers kl > kl−1 > · · · > k0 ≥ nk . and a sequence λi (i ≤ l) of positive scalars which add to 1 such l that the convex-combination y = i=i0 λi xni has norm at most |ai | . Then for 0 every j ∈ [k0 , kl ],
k
ai ei ≥
i 0 −1
i=0
ai xni + ai0 xj +
i=0
k
ai xni −
i=i0 +1
Note that this inequality remains valid if we replace xj by any convex combination of vectors satisfying this inequality, and so in particular if we replace xj by y. Hence, i k k 0 −1 ai ei ≥ ai xni + ai0 y + ai xni − i=0
≥
i=0 k
ai xni + |ai0 |y − ≥
i=i0
i=i0 +1 k
ai xni − 2.
i=i0
Since > 0 was arbitrary this finishes the proof.
We shall see below that going to block subsequences of the spreading model one can always achieve the unconditionality. This will be the subject matter of our next section but let us finish the present section by pointing out some standard examples that can be used to test these new notions. Example I.2.13. The Schreier space S is the completion of (c00 , · S ), where the norm is given by xS = sup |x(n)| : E ⊆ N and |E| ≤ min(E) + 1 n∈E
Note that while 1 does not embed into S the spreading model of its Schauder basis is isomorphic to 1 . This is essentially the first nontrivial example of what is usually called asymptotic 1 space. The second example of an asymptotic 1 space is the following well-known space. Example I.2.14. The Tsirelson space is the completion of (c00 , · T ), where · T is implicitly given by a system of equations n−1 1 xT = x∞ ∨ sup E x : n ≤ E0 < E1 < · · · < En−1 , 2 =0
where for a subset E of N and x ∈ c00 by Ex we denote the member of c00 which is equal to x on E and 0 otherwise. Notice that the standard basis (en ) of c00 is a Schauder basis of T .
I.3. Finite Representability of Banach Spaces
135
Exercise I.2.15. (1) Prove that for every ε > 0 there is a vector x = n an en ∈ T such that εx1 > xT . Give explicitly such a vector x. (2) Prove the statement (1) where (en ) is replaced by an arbitrary normalized sequence (xn ) of finitely supported vectors of T such that for every n max supp xn < min supp xn+1 2 . Use this to show that 1 does not embed into T . (3) Verify that Schreier’s as well as Tsirelson’s space have spreading models isomorphic to 1 .
I.3
Finite Representability of Banach Spaces
The construction of the spreading model presented in the previous section suggests considering ultrapowers X I /U of Banach spaces X. Thus, for a Banach space X, an (infinite) index set I and a (nonprincipal) ultrafilter U on I we let X I /U = {(xi )i∈I ∈ X I : lim xi ≤ ∞}/ ∼, i→U
where we put (xi )i∈I ∼ (yi )i∈I if limi→U xi − yi = 0, and where we equip X I /U with the norm [(xi )i∈I ] = lim xi . i→U
Definition I.3.1. A Banach space X is finitely representable in a Banach space Y if for every > 0 and every finite-dimensional subspace X0 of X there is a finite-dimensional subspace Y0 of Y and an isomorphism T : X0 → Y0 such that T T −1 < 1 + . Note that if (en ) is a spreading model of some sequence (xn ) in some Banach space X then any space which is finitely representable in (en ) is also finitely representable in X. Theorem I.3.2. The ultrapower X I /U is a Banach space which contains a natural isometric copy of X and which is finitely representable in X. Proof. To see that X I /U is complete, consider a Cauchy sequence (v n )∞ n=0 of we can choose a decreasing elements of X I /U. Going to a subsequence of (v n )∞ n=0 sequence I = I0 ⊇ · · · ⊇ In ⊇ . . . of elements of U and representatives (xni )i∈I ∈ v n (n = 0, 1 . . . ) such that n m for all i ∈ In (1) xm i − xi ≤ 2 m+1 m (2) xi = xi for i ∈ Im \ Im+1 . Then for every i ∈ I the sequence (xni )∞ n=0 is Cauchy in X so we can assign to it I a limit xi . Then [(xi )i∈I ] is the limit of the sequence (v n )∞ n=0 in X /U. Identifying x ∈ X with the constant sequence (x)i∈I gives us an isometric embedding of X into X I /U. 2 such
a sequence (xn ) is usually called a block subsequence of (en )
136
Chapter I. Finite-Dimensional Ramsey Theory
To show that X I /U is finitely representable in X, choose a finite-dimensional subspace V0 of X I /U spanned by vectors v 0 , . . . , v n of norm 1. Choose C > 0 such that n n n C |ak | ≤ ak v k ≤ |ak | k=0
k=0
k=0
Let v = for k ≤ n. for every choice of scalars and for d ∈ D Fix > 0. Choose a finite (C · )-net D in the unit ball of n+1 1 and k ≤ n let dk be the kth coordinate of d relative to the basis of n+1 . Then 1 (ai )ni=0 .
(∀ d ∈ D)(Ui )C ·
n
k
[(xki )i∈I ]
|dk | ≤
k=0
n
dk xki ≤
k=0
n
|ak |.
k=0
Since D is finite we can find a single set J ∈ U such that for all i ∈ J and d ∈ Dn , C·
n k=0
|dk | ≤
n k=0
dk xki ≤
n
|ak |.
k=0
Fix i ∈ J and let X0 be the linear span of (xki )nk=0 , and let T : V0 → X0 be determined by T (v k ) = xki . Then one straightforwardly checks that T · T −1 ≤ 1 + 3
The following result shows that the notion of ultrapower captures the notion of finite representability in Banach spaces in a very precise sense. Theorem I.3.3. If a Banach space X is finitely representable in some other Banach space Y then there is an ultrapower Y I /U of Y which contains an isometric copy of X. Proof. Let I be the collection of all pairs (V, ) where V is a finite-dimensional subspace of X and > 0. We order I by letting (U, ) ≤ (V, δ) if U ⊆ V and ≥ δ. Note that (I, ≤) is upward directed, so we can find an ultrafilter U on I such that {(V, δ) ∈ I : (V, δ) ≥ (U, )} ∈ U for all (V, ) ∈ I. By the hypothesis of the theorem, for every finite-dimensional subspace V ⊆ X and > 0 we can choose an isomorphism T(V,) : V → U where U is some finite-dimensional subspace of Y . This determines T : X → Y I /U by T (x) = (T(V,) (x))(V,)∈I) , where we let T(V,) (x) = 0 if x ∈ / V . Then T is a norm-preserving linear operator from X into Y I /U.
I.3. Finite Representability of Banach Spaces
137
The ultrapower technique leads to a natural realization of the spreading model of a given basic sequence (xn ) in some Banach space X. To see this take a nonprincipal ultrafilter U on N and consider its finite Fubini powers U k (k ≥ 1). Note that there is a natural identification X N /U 1 ⊆ X N /U 2 ⊆ · · · ⊆ X N /U k ⊆ . . . [1]
[2]
[k]
via the sequence of linear isometric embeddings ϕ : X N /U k → X N /U l (k ≤ l) [k]
[l]
defined by ϕ([(ys )s∈N[k] ]) = [(zt )t∈N[l] ] where zt = ytk . Each ultrapower X N /U k has a distinguished vector ek determined by our starting sequence (xn )∞ n=0 ⊆ X as [k]
ek = [(ys )s∈N[k] ], where ys = xmax(s) . Then for every x ∈ X, every integer n > 0 and every sequence ak (k ≤ n) of scalars we have the equality x +
l−1 k=o
ak ek l = lim x + s→U l
a|s∩n| xn
n∈s
where for s ∈ N[l ] and n ∈ s, we let s ∩ n = {m ∈ s : m < n} and where on the [l] left-hand side x ∈ X is identified with the constant sequence [(x)s∈N[l] ] ∈ X N /U l . It follows that (ek )∞ k=0 is a spreading model of a subsequence of (xn ) found via the simple diagonal procedure presented above during the course of the proof of Theorem I.2.10. The spreading sequence (ek ) has some interesting block-sequences, i.e., sequences (e2n − e2n+1 )∞ n=0 considered above in Lemma I.2.11. In fact one can find block-subsequences of (en ) with stronger properties. Lemma I.3.4. Every spreading normalized basic sequence (en )∞ n=0 has a block∞ is 1-equivalent to ( subsequence whose spreading model (fk )∞ n fn )n=0 for any k=0 ∞ choice of (n )n=0 of signs. Proof. By Lemma I.2.11 we may assume that (en )∞ n=0 is 1-unconditional. We distinguish two cases Case 1. li=0 ei → ∞ as l → ∞. Choose finite sets Fk (k = 0, 1, . . . ) such that for every k |Fk |−1 ei ≥ k2 , and (a) i=0 (b) max Fk + 1 < min Fk+1 . For k = 0, 1, . . . , let i∈Fk σk (i)ei , fk = |Fk |−1 i=0 ei
138
Chapter I. Finite-Dimensional Ramsey Theory
where σk : Fk → {−1, 1} is the alternating sign-assignment starting with 1. We want to show that the spreading model of (fk ) has the desired property. To see this, it suffices to show that for every n ≤ k0 < · · · < kn−1 , every sequence of signs (k )nk=0 and every choice of scalars (ai )n−1 i=0 , |
n−1
ai fki −
i=0
n−1
i ai fki | ≤
k=0
2n maxn−1 i=0 |ai | . k02
(I.1)
Fix n ≤ k0 < · · · < kn−1 , a sequence of signs (k )nk=0 and a sequence of scalars (ai )n−1 i=0 . For i ≤ n − 1, let i∈Gk τk (i)ei gki = , |Gk |−1 i=0 ei where Gi = (Fi \ {min Fi }) ∪ {max Fi + 1}, and τi : Gi → {−1, 1} is the alternating sign-assignment starting with 1. Notice that (c) for every i ≤ n − 1 |Fi | = |Gi |, (d) for every i < n − 1, Gi < Fi+1 , and |Fk |−1 ei )(eli + (−1)|Fi |+1 eri +1 ), where (e) for every i ≤ n − 1 fki + gki = (1/ i=0i li = min Fi and ri = max Fi . Let I + = {i < n : k = 1} and I − = {i < n : k = −1}. Note that since (ei ) is spreading we have that
n−1
i ai fki =
i=0
ai fki −
ai gki .
(I.2)
i∈I −
i∈I +
So, using that (en ) is 1-unconditional