Power type ξ-Asymptotically uniformly smooth
and ξ-asymptotically uniformly flat norms
R.M. Causey
Department of Mathematics, Miami University, Oxford, OH 45056, USA
[email protected]
Abstract.
For each ordinal ξ and each 1<p<∞, we offer a natural, ismorphic characterization of those spaces and operators which admit an equivalent ξ-p-asymptotically uniformly smooth norm. We also introduce the notion of ξ-asymptotically uniformly flat norms and provide an isomorphic characterization of those spaces and operators which admit an equivalent ξ-asymptotically uniformly flat norm.
Given a compact, Hausdorff space K, we prove an optimal renormong theorem regarding the ξ-asymptotic smoothness of C(K) in terms of the Cantor-Bendixson index of K. We also prove that for all ordinals, both the isomorphic properties and isometric properties pass from Banach spaces to their injective tensor products.
We study the classes of ξ-p-asymptotically uniformly smooth, ξ-p-asymptotically uniformly smoothable, ξ-asymptotically uniformly flat, and ξ-asymptotically uniformly flattenable operators. We show that these classes are either a Banach ideal or a right Banach ideal when assigned an appropriate ideal norm.
2010 Mathematics Subject Classification. Primary: 46B03, 46B06; Secondary: 46B28, 47B10.
Key words: Szlenk index, operator ideals, ordinal ranks.
Contents
-
1 Introduction
-
2 Weakly null trees and moduli
-
2.1 Trees and moduli
-
3 Combinatorical necessities
-
3.1 Trees of peculiar importance
-
3.2 Cofinal and eventual sets
-
4 Upper tree estimates and renormings
-
5 C(K) spaces and injective tensor products
-
5.1 C(K) spaces
-
6 Ideals
-
7 Technical lemmata
1. Introduction
Beginning with [14], significant attention has been devoted to equivalent, asymptotically uniformly smooth norms on Banach spaces and operators ([8], [10], [11], [19]). These renorming theorems have been concerned with when an equivalent asymptotically uniformly smooth norm exists, and what isomorphic invariants of the given space or operator can determine which power types, if any, are possible for the asymptotic uniform smoothness modulus of a Banach space. These results hinge upon the Szlenk index and Szlenk power type of a Banach space. The classes of spaces (resp. operators) which admit asymptotically uniformly smooth norms coincides with the class of spaces (resp. operators) which have Szlenk index ω=ω0+1. In [7], [9], and [16], analogous renorming results were shown for spaces (resp. operators) which have Szlenk index ωξ+1 for a general ξ, with the ξ=0 case recovering the previously known results. In a number of recent results in the non-linear theory of Banach spaces, power type asymptotically uniformly smooth and asymptotically uniformly convex Banach spaces have played an important role. Given the recent, remarkable result of Motakis and Schlumprecht [17], which proves a transfinite version of results from [2], the existence of the transfinite notions of asymptotic uniform smoothness and asymptotic uniform convexity are potentially very useful in proving results akin to those in [17]. The notion of asymptotic uniform flatness was pivotal in [12] for the Lipschitz classification of C(K) spaces isomorphic to c0. We introduce for each ordinal ξ the notion of ξ-asymptotic uniform flatness and provide an isomorphic characterization of those Banach spaces which admit an equivalent ξ-asymptotically uniformly flat norm.
We first state our main renorming theorem. All required definitions will be given in subsequent sections.
Theorem 1.1**.**
Let A:X→Y be an operator, ξ an ordinal, and 1<p<∞.
- (i)
A* admits an equivalent ξ-p-asymptotically uniformly smooth norm if and only if A satisfies ξ-ℓp upper tree estimates.*
2. (ii)
A* admits an equivalent ξ-asymptotically uniformly flat norm if and only if A satisfies ξ-c0 upper tree estimates.*
We also prove an optimal renorming theorem for C(K) spaces regarding ξ-asymptotic uniform smoothness.
Theorem 1.2**.**
Let K be a compact, Hausdorff space. Then for any ordinal ξ, C(K) admits an equivalent ξ-asymptotically uniformly flat norm if and only if the Cantor-Bendixson index of K is less than ωξ+1.
Theorem 1.2 is a transfinite version of a result from [15], in which the ξ=0 case of this theorem was shown.
We also prove that each of our asymptotic properties of operators pass to injective tensor products in the optimal way.
Theorem 1.3**.**
Let A0:X0→Y0, A1:X1→Y1 be operators and let A0⊗A1:X0⊗^εX1→Y0⊗^εY1 be the induced operator between injective tensor products. Let ξ be any ordinal and 1<p<∞. If A0, A1 are ξ-asymptotically uniformly smooth (resp. ξ-p-asymptotically uniformly smooth, ξ-asymptotically uniformly flat), then so is A0⊗A1.
Finally, we study the properties of classes of ξ-p-asymptotically uniformly smooth (Gξ,p), ξ-asymptotically uniformly flat (Fξ), ξ-p-asymptotically uniformly smoothable (Tξ,p), and ξ-asymptotically uniformly flattenable (Tξ,∞) operators. Regarding these topics, we have the following.
Theorem 1.4**.**
Fix an ordinal ξ and 1<p<∞.
- (i)
There exist ideal norms tξ,p, tξ,∞ such that (Tξ,p,tξ,p) and (Tξ,∞,tξ,p) are Banach ideals.
2. (ii)
There exist right ideal norms gξ,p, fξ such that (Gξ,p,gξ,p) and (Fξ,fξ) are right Banach ideals.
The author wishes to thank G. Lancien for productive discussions during the preparation of this work.
2. Weakly null trees and moduli
Throughout, K will denote the scalar field, which is either R or C. By “operator,” we shall mean continuous, linear operator between Banach spaces.
2.1. Trees and moduli
Given a set Λ, we let Λ<N denote the finite sequences whose members lie in Λ, including the empty sequence, ∅. Given t∈Λ<N, we let ∣t∣ denote the length of t. For 0⩽i⩽∣t∣, we let t∣i denote the initial segment of t having length i. If t=∅, we let t− denote the maximal, proper initial segment of t. We let s⌢t denote the concatenation of s with t. Given s,t∈Λ<N, we let s<t denote the relation that s is a proper initial segment of t.
For us, a tree on Λ will be a subset of Λ<N∖{∅} such that if ∅<s⩽t∈T, then s∈T. A rooted tree on Λ will be a subset of Λ<N such that if ∅⩽s⩽t∈T, then s∈T. If the underlying set Λ is understood or unimportant, we will simply refer to T as a tree (or rooted tree) without specifying the set Λ.
Given a tree T, we let T′=T∖MAX(T), where MAX(T) denotes the <-maximal members of T. That is, MAX(T) denotes those t∈T which have no proper extension in T. Note that T′ is also a tree. We then define the transfinite derived trees of T by
[TABLE]
[TABLE]
and if ξ is a limit ordinal, we let
[TABLE]
If there exists an ordinal ξ such that Tξ=∅, we say T is well-founded and we let o(T) denote the smallest ordinal ξ such that Tξ=∅. If Tξ=∅ for all ξ, then we say T is ill-founded and we write o(T)=∞. However, we will not be particularly concerned with the ill-founded case. Note that all of the definitions here for trees can be also made for rooted trees. Given two trees S,T, we say θ:S→T is monotone provided that for any s<s′, s,s′∈S, θ(s)<θ(s′). We recall a standard fact regarding trees, which we use freely throughout. A proof of this can be found in [6].
Fact 2.1**.**
If S,T are trees and o(S)⩽o(T), there exists a monotone, length-preserving map θ:S→T.
Given a directed set D and a tree T, we let
[TABLE]
We treat the members of T.D as sequences of pairs, so that the length of (ζi,ui)i=1n is n. Furthermore, it is clear that T.D is also a tree and (T.D)ξ=Tξ.D for any ordinal ξ. Furthermore, T.D∪{∅} is a rooted tree and (T.D∪{∅})ξ=(T∪{∅})ξ.D for any ordinal ξ. Note that for a sequence t∈T.D∪{∅}, ζ∈Λ, then t⌢(ζ,u)∈T.D for some u∈D if and only if t⌢(ζ,u)∈T.D for every u∈D.
Given a directed set D, a tree T, and a Banach space X, we say a collection of vectors (xt)t∈T.D⊂X is weakly null provided that for any t∈T′.D∪{∅} and any ζ such that {t⌢(ζ,u):u∈D}⊂T.D, (xt⌢(ζ,u))u∈D is a weakly null net in X. For convenience, our primary method of witnessing weakly null trees will be to have D be a weak neighborhood basis at [math] in X and to have x(ζi,ui)i=1n∈un, which obviously satisfies the weakly null condition. However, for some of our later applications, it will be convenient to have the more general notion of a weakly null collection defined here. Given a collection (xt)t∈T.D⊂X, a subset of this collection of the form {xs:∅<s⩽t} for some t∈T will be called a branch. We say a collection (xt)t∈T.D is weakly null of order ξ if o(T)=ξ.
Given a directed set D, a tree T, and a Banach space Y, we say a collection of vectors (yt∗)t∈T.D⊂Y∗ is weak∗ null provided that for any t∈T′.D∪{∅} and any ζ such that {t⌢(ζ,u):u∈D}⊂T.D, (yt⌢(ζ,u)∗)u∈D is a weak∗ null net. We define weak∗ null of order ξ in the obvious way.
Remark 2.2**.**
We note that the definition of a weakly null collection or a weak∗ null collection differs from those given in [9]. For the purposes of computing the moduli defined below, the distinctions between the two definitions of weakly null or weak∗ null make no difference. In the last section of this paper, we explain why this is so. However, for the purposes of this work, our present, more restrictive definition is required. This is because in [9], the only goal was to show, for example, that every weakly null collection of order ωξ admitted a branch with a certain property. For our work we wish to show that for a weakly null collection of order ωξ, “most” of the branches have that certain property. We will make this precise in the next subsection.
Given a rooted tree T with order ξ+1, a Banach space Y, and (yt∗)t∈T⊂Y∗, we say the collection is weak∗-closed of order ξ provided that for any ordinal ζ and any t∈Tζ+1,
[TABLE]
This definition of weak∗-closed is the same as that given in [9].
Given an ordinal ξ, a non-zero operator A:X→Y, and σ>0, we define
[TABLE]
where the supremum is taken over all y∈BY, all trees T with o(T)=ωξ, all directed sets D, and all weakly null collections (xt)t∈T.D⊂σBX. It is contained in [9] that this supremum actually need not be taken over all T and D, and in fact we obtain the same modulus taking the supremum only over T=Γξ and D to be any weak neighborhood basis at [math] in X, where Γξ is one of the special trees to be defined in the next section. However, it is convenient to state the definition of the modulus in this generality. For completeness, we define ϱξ(0,A)=0 for any A and ϱξ(σ,A)=0 for all σ>0 when A is the zero operator.
For an operator A:X→Y, an ordinal ξ, and 1<p<∞, we say A is
- (i)
ξ-asymptotically uniformly smooth if limσ→0+ϱξ(σ,A)/σ=0,
2. (ii)
ξ-p-asymptotically uniformly smooth if supσ>0ϱξ(σ,A)/σp<∞,
3. (iii)
ξ-asymptotically uniformly flat if there exists σ>0 such that ϱξ(σ,A)=0.
We abbreviate these properties as ξ-AUS, ξ-p-AUS, and ξ-AUF. We say a Banach space X has one of these properties if its identity operator does. We note that the notions of [math]-AUS, [math]-p-AUS, and [math]-AUF coincide with the usual definitions of asymptotically uniformly smooth, p-asymptotically uniformly smooth, and asymptotically uniformly flat. We remark that renorming the domain of an operator may change specific values of the modulus ϱξ, but each of the properties ξ-AUS, ξ-p-AUS, and ξ-AUF is invariant under renorming the domain. We say A:X→Y is ξ-asymptotically uniformly smoothable (resp. ξ-p-asymptotically uniformly smoothable, ξ-asymptotically uniformly flattenable) if there exists an equivalent norm ∣⋅∣ on Y such that A:X→(Y,∣⋅∣) is ξ-AUS (resp. ξ-p-AUS, or ξ-AUF).
Given an ordinal ξ, an operator A:X→Y, and τ>0, we define
[TABLE]
where the supremum is taken over all y∗∈SY∗, all trees T with o(T)=ωξ, and all weak∗-null collections (yt∗)t∈T.D⊂Y∗ such that ∥A∗yt∗∥⩾τ for all t∈T.D. For 1⩽q<∞, an operator A:X→Y, and an ordinal ξ, we say A is
- (i)
weak∗-ξ-asymptotically uniformly convex provided δξweak∗(τ,A)>0 for all τ>0,
2. (ii)
weak∗-ξ-q-asymptotically uniformly convex provided inf0<τ<1δξweak∗(τ,A)/τq>0.
In the case q=1, this is equivalent to infτ>0δξweak∗(τ,A)/τ>0. We refer to these as properties of A and not A∗, since they depend on the weak∗-topology on Y∗ coming from Y. We use the abbreviations weak∗-ξ-AUC, weak∗-ξ-q-AUC. We remark that these properties are invariant under renorming X. We will say A is weak∗-ξ-asymptotically uniformly convexifiable (resp weak∗-ξ-q-asymptotically uniformly convexifiable) if there exists an equivalent norm ∣⋅∣ on Y making A:X→(Y,∣⋅∣) weak∗-ξ-AUC (resp. weak∗-ξ-q-AUC).
We also define some related quantities for this operator A:X→Y. Given an ordinal ξ and 1<p<∞, we let tξ,p(A) denote the infimum of those C>0 such that for any σ⩾0, any y∈Y, any tree T with o(T)=ωξ, any weakly null collection (xt)t∈T.D⊂σBX,
[TABLE]
We observe the convention that tξ,p(A)=∞ if no such C exists. We define tξ,∞(A) to be the infimum of those C>0 such that for any σ⩾0, any y∈Y, any tree T with o(T)=ωξ, and any weakly null collection (xt)t∈T.D⊂σBX,
[TABLE]
The following fact is an easy computation which was discussed in [8].
Proposition 2.3**.**
Let A:X→Y be an operator and let ξ be an ordinal.
- (i)
For 1<p<∞, A is ξ-p-AUS if and only if tξ,p(A)<∞.
2. (ii)
A* is ξ-AUF if and only if tξ,∞(A)<∞.*
More precisely, for any 1<p<∞, there exist functions fp:[0,∞)→[0,∞) and hp:[0,∞)2→[0,∞) such that for any ordinal ξ, any operator A:X→Y, and any constants C,C′,C′′, if ∥A∥⩽C and supσ>0ϱξ(σ,A)/σp⩽C′, then tξ,p(A)⩽hp(C,C′), and if tξ,p(A)⩽C′′, supσ>0ϱξ(σ,A)/σp⩽fp(C′′).
Furthermore, if ϱξ(1/σ,A)=0, then tξ,∞(A)⩽σ+∥A∥, and if tξ,∞(A)<σ, ϱξ(1/σ,A)=0.
Lemma 2.4**.**
Fix an ordinal ξ, 1<p<∞, and an operator A:X→Y.
- (i)
A* is ξ-AUS if and only if it is weak*∗-ξ-AUC.
2. (ii)
A* is ξ-p-AUS if and only if it is weak*∗-ξ-q-AUC, where 1/p+1/q=1.
3. (iii)
A* is ξ-AUF if and only if it is weak*∗-ξ-1-AUC.
Proof.
Items (i) and (ii) were shown in [9, Theorem 3.2, Proposition 3.3]. It was also shown there that if σ,τ>0 are such that δξweak∗(τ,A)⩾στ, then ϱξ(σ,A)⩽στ. Thus if infτ>0δξweak∗(τ,A)/τ=σ>0, ϱξ(σ,A)⩽infτ>0στ=0. This shows that if A is weak∗-ξ-1-AUC, it is ξ-AUF.
Now suppose A is ξ-AUF and ϱξ(σ,A)=0, where σ>0. Fix τ>0, y∗∈Y∗ with ∥y∗∥=1, and (yt∗)t∈T.D⊂Y∗ weak∗-null of order ωξ with ∥A∗yt∗∥⩾τ for all t∈T.D (it was shown in [9] that if no such collection exists, δξweak∗(τ,A)=∞ for all τ>0, which means A is trivially weak∗-ξ-1-AUC). Then, as was shown in [9], for any 0<δ,θ<1, there exist y∈SY, a tree S of order ωξ, a weakly null collection (xt)t∈S.D⊂BX, and a monotone map d:S.D→T.D such that for every t∈S.D,
[TABLE]
for any x∈co(xs:∅<s⩽t). Since ϱξ(σ,A)=0, there exists t∈S.D and x∈co(xs:∅<s⩽t) such that ∥y+Ax∥⩽1+δ, whence
[TABLE]
Since 0<δ,θ<1 were arbitrary, we deduce that δξweak∗(τ,A)/τ⩾σ/2. Since this holds for all τ>0, we deduce that A is weak∗-ξ-1-AUC.
∎
We also include here a discussion of the ξ-Szlenk power type of an operator and existing renorming results on this topic. Given a Banach space X, a weak∗-compact subset K of X∗, and ε>0, we let sε(K) denote the subset of K consisting of those x∗∈K such that for every weak∗-neighborhood V of x∗, diam(V∩K)>ε. We define the transfinite derived sets by
[TABLE]
[TABLE]
and if ξ is a limit ordinal,
[TABLE]
We let Sz(K,ε) be the minimum ordinal ξ such that sεξ(K)=∅ if such a ξ exists, and otherwise we write Sz(K,ε)=∞. We let Sz(K)=supε>0Sz(K,ε), with the agreement that Sz(K)=∞ if Sz(K,ε)=∞ for some ε>0. Given an operator A:X→Y, we let Sz(A,ε)=Sz(A∗BY∗,ε), Sz(A)=Sz(A∗BY∗). If X is a Banach space, we let Sz(X,ε)=Sz(IX,ε) and Sz(X)=Sz(IX). Then Sz(A) is the Szlenk index of A, and Sz(X) is the Szlenk index of X.
We may also define Szξ(K,ε) to be the minimum ordinal ζ such that sεωξζ(K)=∅. If Sz(K,ε)⩽ωξ+1 for a weak∗-compact set, then Szξ(K,ε) is a natural number, and we may define
[TABLE]
We note that this value need not be finite. This is the ξ-Szlenk power type of A. For completeness, we may define pξ(A)=∞ whenever Sz(A)>ωξ+1. Regarding these topics, we have the following existing renorming results.
Theorem 2.5**.**
[9, Theorem 5.3]** Let A:X→Y be an operator and let ξ be an ordinal. Then A is ξ-AUS-able if and only if Sz(A)⩽ωξ+1.
It was shown in [5] that A:X→Y has Szenk index not exceeding ωξ if and only if for every weakly null collection (xt)T.D⊂BX of order ωξ and every ε>0,
[TABLE]
This is equivalent to ϱξ(σ,A)=0 for all σ>0, so operators with Szlenk index not exceeding ωξ are trivially ξ-AUF.
Theorem 2.6**.**
[7, Theorem 1.2, Theorem 2.3]** Let A:X→Y be an operator and let ξ be an ordinal.
- (i)
If Sz(A)⩽ωξ, then A is asymptotically uniformly flat.
2. (ii)
If Sz(A)=ωξ+1, then pξ(A)∈[1,∞], and if 1/p+1/pξ(A)=1, then p is the supremum of those q such that A admits an equivalent ξ-q-AUS norm.
One of the main purposes of our general renorming theorem is to characterize when the supremum in (ii) of the previous theorem is obtained. That is, for every ξ of countable cofinality, and in particular for every countable ordinal, and every 1⩽q<∞, an example X was given of a Banach space which has 1/pξ(X)+1/q=1 but which did not admit any ξ-q-AUS (resp. ξ-AUF if q=1) norm. An example was also given in [7] for every ordinal ξ and every 1⩽q<∞ of a Banach space S which has 1/pξ(S)+1/q=1 and which is ξ-p-AUS (resp. ξ-AUF if q=1).
3. Combinatorical necessities
3.1. Trees of peculiar importance
We first define some trees which will be of significant importance for us. Given a sequence (ζi)i=1n of ordinals and an ordinal ζ, we let ζ+(ζi)i=1n=(ζ+ζi)i=1n. Given a set G of sequences of ordinals and an ordinal ζ, we let ζ+G={ζ+t:t∈G}. For each ξ∈Ord and n∈N, we define a tree Γξ,n which consists of decreasing ordinals in the interval [0,ωξn). We let
[TABLE]
If ξ is a limit ordinal and Γζ,1 has been defined for every ζ<ξ, we let
[TABLE]
If for some ξ and every n∈N, Γξ,n has been defined such that the first member of each sequence in Γξ,n lies in the interval [ωξ(n−1),ωξn), we let
[TABLE]
Finally, if Γξ,1 has been defined, we let Λξ,1,1=Γξ,1 and for 1<n∈N and 1⩽i⩽n, we let
[TABLE]
We refer to the sets Λξ,n,1,…,Λxi,n,n as the levels of Γξ,n.
We also define
[TABLE]
[TABLE]
For a directed set D, an ordinal ξ, and n∈N, we let
[TABLE]
We remark that for each ζ, then for any directed set D, (ωζ+Γζ+1,1).D is canonically identifiable with Γζ+1,1.D. For any ξ and any n∈N, Λξ,n,1.D is canonically identifiable with Γξ,1.D. Finally, for any n∈N, any ordinal ξ, and any t∈MAX(Λξ,n,1) (resp. t∈MAX(Λξ,∞,1.D)), {s∈Γξ,n+1.D:t<s} (resp. {s∈Γξ,∞.D}) is canonically identifiable with Γξ,n.D (resp. Γξ,∞.D). We often implicitly use these canonical identifications without giving them specific names.
We last define what it means for a subset of Γξ,n.D to be a unit. For any ordinal ξ and any n∈N, Λξ,n,1.D is a unit. If for some n∈N, every ordinal ξ, and every 1⩽k⩽n, the units in Γξ,k.D are defined, we say a subset U of Γξ,n+1.D is a unit if either U=Λξ,n+1,1.D or if there exists t∈MAX(Λξ,n+1,1.D) such that, if
[TABLE]
is the canonical identification, j(U) is a unit in Γξ,n.D
3.2. Cofinal and eventual sets
For a fixed directed set D, we now define sets Ωξ,n. Each set Ωξ,n will be a subset of the power set of MAX(Γξ,n.D). Given E⊂Γ0,1.D, we can write
[TABLE]
for some D0⊂D. Then we say E∈Ω0,1 if D0 is cofinal in D.
Now suppose that for a limit ordinal ξ and every ζ<ξ, Ωζ+1,1 has been defined. For each ζ<ξ, let jζ:(ωζ+Γζ+1).D→Γζ+1,1.D be the canonical identification. Then a subset E⊂MAX(Γξ,1) lies in Ωξ,1 if there exists a cofinal subset M of [0,ξ) such that for every ζ∈M, jζ(E∩MAX((ωζ+Γζ+1.D))∈Ωζ+1,1.
Now suppose that for an ordinal ξ and every n∈N, Ωξ,n has been defined. Then we say E⊂MAX(Γξ+1,1.D) is a member of Ωξ+1,1 if there exists a cofinal subset M of N such that for every n∈N, E∩Γξ,n.D∈Ωξ,n.
Last, suppose that for an ordinal ξ, a natural number n, and each 1⩽i⩽n, Ωξ,i has been defined. Suppose that E⊂MAX(Γξ,n+1.D) is given. For each t∈MAX(Λξ,n,1), let Pt={s∈Γξ,n+1.D:t<s}, let jt:Pt→Γξ,n.D be the canonical identification, and let j:Λξ,n,1.D→Γξ,1.D be the canonical identification. Let
[TABLE]
Then we say E∈Ωξ,n+1 if j(F)∈Ωξ,1.
We remark that an easy induction proof shows that MAX(Γξ,n.D)∈Ωξ,n for every ξ an n, and if F⊂E⊂MAX(Γξ,n.D) and F∈Ωξ,n, then E∈Ωξ,n.
We refer to the sets in Ωξ,n as cofinal in Γξ,n.D. We say a subset E of MAX(Γξ,n.D) is eventual if MAX(Γξ,n.D)∖E fails to be cofinal. Each unit U⊂Γξ,n.D is canonically identifiable with Γξ,1.D, and as such we can define what it means for a subset of MAX(U) to be cofinal or eventual using the identification with Γξ,1.D.
We say a subset B of ∪n=1∞MAX(Λξ,∞,n.D) is
- (i)
inevitable provided that B∩MAX(Λξ,∞,1.D) is eventual and for each n∈N and each t∈B∩MAX(Λξ,∞,n.D), B∩MAX(Λξ,∞,n+1.D)∩Γξ,∞(t<) is eventual,
2. (ii)
big if it contains an inevitable subset.
We conclude this section by stating some combinatorial lemmas. We relegate the usually easy but somewhat technical proofs to the final section of the paper. For the following proofs, we say d:Γξ,n.D→Γξ,n.D is a level map if
- (i)
for any ∅<s<t∈Γξ,n.D, d(s)<d(t),
2. (ii)
if U⊂Λξ,n,i.D is a unit, then there exists a unit V⊂Λξ,n,i.D such that d(U)⊂V.
Note that since Γξ,1.D is a single unit, (ii) is vacuous in the case n=1. Given a level map d:Γξ,n.D→Γξ,n.D, we say e:MAX(Γξ,n.D)→MAX(Γξ,n.D) is an extension of d if for any t∈MAX(Γξ,n.D), d(t)⩽e(t). Since Γξ,n.D is well-founded, any level map d admits some extension. We define an extension of a monotone map in the same way we define an extension of a level map.
We let Π(Γξ,n.D)={(s,t)∈Γξ,n.D×MAX(Γξ,n.D):s⩽t}.
Lemma 3.1**.**
Suppose that ξ is an ordinal, n∈N, X is a Banach space, and (xt)t∈Γξ,n.D is weakly null.
- (i)
If E⊂MAX(Γξ,n.D) is cofinal, there exists a level map d:Γξ,n.D→Γξ,n.D with extension e such that e(MAX(Γξ,n.D))⊂E and (xd(t))t∈Γξ,n.D is weakly null.
2. (ii)
For any k∈N, if MAX(Γξ,n.D)⊃E=∪i=1kEi∈Ωξ,n, then there exists 1⩽j⩽k such that Ej∈Ωξ,n.
3. (iii)
If F is a finite set and χ:Π(Γξ,n.D)→F is a function, then there exist a level map d:Γξ,n.D→Γξ,n.D with extension e and α1,…,αn∈F such that for any 1⩽i⩽n and any Λξ,n,i.D∋s⩽∈MAX(Γξ,n.D), αi=F(d(s),e(t)), and such that (xd(t))t∈Γξ,n.D is weakly null.
4. (iv)
If h:Π(Γξ,n.D)→R is bounded and if E⊂MAX(Γξ,n.D) is cofinal, then for any δ>0, there exist a1,…,an∈R and a level map d:Γξ,n.D→Γξ,n.D with extension e such that e(MAX(Γξ,n.D))⊂E, for each 1⩽i⩽n and each Λξ,n,i.D∋s⩽t∈MAX(Γξ,n.D), h(d(s),e(t))⩾ai−δ, and for any t∈MAX(Γξ,n.D), ∑∅<s⩽e(t)Pξ,n(s)h(s,e(t))⩽δ+∑i=1nai.
Remark 3.2**.**
Items (i) and (ii) together yield that if MAX(Γξ,n.D)=∪i=1kEi, then there exists 1⩽j⩽k and a level map d:Γξ,n.D→Γξ,n.D with extension e such that (xd(t))t∈Γξ,n.D is weakly null and e(MAX(Γξ,n.D))⊂Ej. A typical application of this result will be to have a real-valued function h:MAX(Γξ,n.D)→C⊂R, where C is compact. We may then fix δ>0 and a finite cover F1,…,Fk of C by sets of diameter less than δ. We then let Ei denote those t∈MAX(Γξ,n.D) such that h(t)∈Fi. We may then find d, e, and j as above and obtain (xd(t))t∈Γξ,n.D weakly null such that for every t∈MAX(Γξ,1.D), h(e(t))∈Fj.
Similarly, we will often apply (iii) to a function h1:Π(Γξ,n.D)→C⊂R, where C is compact, by first covering C by F1,…,Fk of sets of diameter less than δ. We then define h(s,t) to be the minimum j⩽k such that h1(s,t)∈Fj.
Corollary 3.3**.**
Given a non-zero A:X→Y and an ordinal ξ, let
[TABLE]
where the supremum is taken over all y∈SY, all weakly null collections (xt)T.D⊂σBX with o(T)=ωξ. Then ϱξ(σ,A)=ϱξ(σ,A).
Proof.
Since ϱξ(σ,A) involves taking the supremum over y∈BY and ϱξ(σ,A) involves taking the supremum only over y∈SY, ϱξ(σ,A)⩽ϱξ(σ,A). To obtain a contradiction, assume there exists y∈BY, δ>0, and a collection (xt)t∈T.D⊂σBX such that
[TABLE]
We may assume T=Γξ,1. By perturbing, we may also assume y=0. For each t∈MAX(Γξ,1.D), fix yt∗∈BY∗ such that Re yt∗(y+A∑∅<s⩽tPξ,1(s)xs)=∥y+A∑∅<s⩽tPξ,1(s)xs∥. By Lemma 3.1, we may fix a monotone map d:Γξ,1.D→Γξ,1.D with extension e such that (xd(s))s∈Γξ,1.D) is still weakly null and
[TABLE]
Let E={t∈MAX(Γξ,1.D):Re ye(t)∗(y)⩾0} and let F=MAX(Γξ,1.D)∖E. Then by switching y with −y if necessary, we may choose another monotone map d′:Γξ,1.D→Γξ,1.D with extension e′ such that (xd∘d′(s))s∈Γξ,1.D is weakly null, Re ye∘e′(t)∗(y)⩾0 for all t∈MAX(Γξ,1.D), and
[TABLE]
Then
[TABLE]
This contradiction finishes the proof.
∎
Corollary 3.4**.**
Let A:X→Y be a Banach space, D a weak neighborhood basis at [math] in X, and ξ an ordinal.
- (i)
For any τ⩾0, ϱξ(σ,A)⩽τ if and only for every σ>0, every weakly null (xt)t∈Γξ,1.D⊂σBX and every y∈BY,
[TABLE]
if and only if for every σ>0, every weakly null (xt)t∈Γξ,1.D⊂σBX, every y∈BY, and every τ′>0,
[TABLE]
is eventual.
2. (ii)
For any τ⩾0 and any 1<p<∞, tξ,p(A)⩽τ if and only if for every σ>0, every weakly null (xt)t∈Γξ,1.D⊂σBX, and every y∈Y,
[TABLE]
if and only if for every σ>0, every weakly null (xt)t∈Γξ,1.D⊂σBX, every y∈BY, and every τ′>∥y∥p+τpσp,
[TABLE]
is eventual.
3. (iii)
For any τ⩾0, tξ,p(A)⩽τ if and only if for every σ>0, every weakly null (xt)t∈Γξ,1.D⊂σBX, and every y∈Y,
[TABLE]
if and only if for every σ>0, every weakly null (xt)t∈Γξ,1.D⊂σBX, every y∈BY, τ′>max{∥y∥,τσ},
[TABLE]
is eventual.
Proof.
We prove only (i), with (ii) and (iii) being similar. Fix y∈BY and (xt)t∈Γξ,1.D⊂σBX and assume that for some τ′>τ,
[TABLE]
fails to be eventual. Fix δ>0 such that τ′−2δ>τ. For each t∈MAX(Γξ,1.D), fix yt∗∈BY∗ such that
[TABLE]
Then by Lemma 3.1(iii) applied to the function h(s,t)=Re yt∗(y+Axs), there exist a∈R and a monotone map d:Γξ,1.D→Γξ,1.D with extension e:MAX(Γξ,1.D)→E such that (xd(t))t∈Γξ,1.D is weakly null, for every (s,t)∈Π(Γξ,1.D), Re ye(t)∗(y+Axd(t))⩾a−δ, and for each t∈MAX(Γξ,1.D),
[TABLE]
This means a−δ>1+τ. But for any t∈MAX(Γξ,1.D) and any convex combination x of (xd(s):∅<s⩽t),
[TABLE]
Thus y, (xd(t))t∈Γξ,1.D witness that ϱξ(σ,A)⩾a−δ>τ.
Now suppose ϱξ(σ,A)>τ′>τ. Then there exists some tree T with o(T)=ωξ, a directed set D1, y∈BY, and a weakly null (xt)t∈T.D1⊂σBX such that
[TABLE]
Since o(T)=o(Γξ,1), there exists a monotone, length-preserving map θ:Γξ,1→T. Fix t∈MIN(Γξ,1) and consider the weakly null net (x(θ(t),u))u∈D1. We may fix for each u∈D some vu∈D1 such that x(θ(t),vu)∈u. Let Θ((t,u))=(θ(t),vu). Now suppose that for some t∈Γξ,1.D∖MIN(Γξ,1.D), Θ(t−) has been defined such that if t−=(ζi,ui)i=1n and θ((ζi)i=1n)=(μi)i=1n, then Θ(t−)=(μi,vi)i=1n for some v1,…,vn. We then write t=(ζi,ui)i=1n+1 and θ(t)=(μi)i=1n+1 for some ζn+1, μn+1, un+1. Then consider the weakly null net (xΘ(t−)⌢(μn+1,v))v∈D1. Choose some vn+1∈D1 such that xΘ(t−)⌢(μn+1,vn+1)∈un+1 and define Θ(t)=Θ(t−)⌢(μn+1,vn+1). Now let xt′=xΘ(t) for t∈Γξ,1.D. It is clear that (xt′)t∈Γξ,1.D⊂σBX is weakly null and satisfies
[TABLE]
Now suppose that y∈BY, (xt)t∈Γξ,1.D⊂σBX is a weakly null collection such that
[TABLE]
Then
[TABLE]
and therefore cannot be eventual.
∎
Corollary 3.5**.**
Let ξ be an ordinal, A:X→Y an operator, and 1<p<∞. Then if tξ,p(A)⩽C, G⊂Y is compact, T⊂K is compact, ε>0, and (xt)t∈Γξ,1.D⊂BX is weakly null,
[TABLE]
is eventual.
The analogous statement holds when p=∞ if we replace the ℓp norm with the maximum.
Proof.
Fix δ>0, a finite δ-net F⊂G, and a finite δ-net S⊂T. Then for each y∈F and each α∈F,
[TABLE]
is eventual. Thus E:=∩y∈F,α∈SEy,α is also eventual, being a finite intersection of eventual sets. Provided δ>0 is chosen sufficiently small,
[TABLE]
whence the latter set is eventual.
∎
Corollary 3.6**.**
Let X,Y be Banach spaces, α,β>0 with α+β=1, A,B:X→Y, and σ>0. Then ϱξ(σ,αA+βB)⩽αϱξ(σ,A)+βϱξ(σ,B).
Proof.
For any y∈BY, any weakly null (xt)t∈Γξ,1.D⊂σBX, any a>ϱξ(σ,A), and b>ϱξ(σ,B),
[TABLE]
and
[TABLE]
are eventual. This means there exists t∈EA∩EB, whence
[TABLE]
Since a>ϱξ(σ,A), b>ϱξ(σ,B), y∈BY, and (xt)t∈Γξ,1.D⊂σBX weakly null were arbitrary, we are done.
∎
Corollary 3.7**.**
Suppose that A:X→Y is an operator, D a directed set, G⊂BY is such that co(G)=BY, σ>0, τ⩾0, and for every y∈G and every weakly null collection (xt)t∈Γξ,1.D⊂σBX,
[TABLE]
Then ϱξ(σ,A)⩽τ.
Proof.
By Lemma 3.1, the hypotheses imply that for any τ′>τ, any y∈G, and any (xt)t∈Γξ,1.D⊂σBX weakly null,
[TABLE]
is eventual. For any y∈BY and any weakly null (xt)t∈Γξ,1.D⊂σBX, we may first fix δ>0, positive scalars a1,…,an summing to 1, and y1,…,yn∈G such that ∥y−∑i=1naiyi∥⩽δ. We then note that for each 1⩽i⩽n,
[TABLE]
is eventual. Then we may fix any t∈∩i=1nEi and note that for this t,
[TABLE]
Since δ>0 was arbitrary,
[TABLE]
Since y∈BY and (xt)t∈Γξ,1.D⊂σBX weakly null were arbitrary, we deduce that ϱξ(σ,A)⩽τ.
∎
4. Upper tree estimates and renormings
Given a collection (xt)t∈Γξ,∞.D⊂X and t∈MAX(Λξ,∞,n.D), we let z1t,…,znt be the vectors given by
[TABLE]
This is a convex block sequence of (xs)∅<s⩽t. We note that this notation should reference the underlying collection (xt)t∈Γξ,∞.D, but having no such reference will cause no confusion.
Given a Banach space E with basis (ei)i=1∞, C>0, an ordinal ξ, and an operator A:X→Y, we say A satisfies C-ξ-E upper tree estimates provided that for any normally weakly null (xt)t∈Γξ,∞.D⊂BX,
[TABLE]
is big. We say A satisfies ξ-E upper tree estimates provided that there exists C>0 such that A satisfies C-ξ-E upper tree estimates.
Theorem 4.1**.**
Fix an ordinal ξ and an operator A:X→Y.
- (i)
A* is ξ-p asymptotically uniformly smoothable if and only if A satisfies ξ-ℓp upper tree estimates.*
2. (ii)
A* is ξ-asymptotically uniformly flattenable if and only if A satisfies ξ-c0 upper tree estimates.*
Proof.
(i) First assume that A is ξ-p-AUS and fix C>tξ,p(A). Fix positive numbers (εn)n=1∞ such that tξ,p(A)p+∑n=1∞εn<Cp. Fix (xt)t∈Γξ,n.D⊂BX weakly null. For n∈N, let Bn denote the set of all t∈MAX(Λξ,∞,n.D) such that for every (ai)i=1n∈Bℓpn,
[TABLE]
Let Bn′ be the set consisting of those t∈MAX(Λξ,∞,n.D) such that for each 1⩽m⩽n, if s⩽t is such that s∈MAX(Λξ,∞,m.D), then s∈Bm. It follows from Corollary 3.5 that B:=∪n=1∞Bn′ is inevitable. Furthermore, B is contained in
[TABLE]
so the latter set must be big. This shows that A satisfies C-ξ-ℓp upper tree estimates.
Now assume A:X→Y satisfies C1-ξ-upper tree estimates for some C1>0 and let C=2C1. Fix a weak neighborhood basis D at [math] in X. Define [⋅] on Y by letting [y] be the infimum of those μ>0 such that for any weakly null (xt)t∈Γξ,∞.D⊂BX,
[TABLE]
is big. We note that C1∥y∥⩽[y]⩽∥y∥ and [cy]=∣c∣[y] for any scalar c. Let G={y∈Y:[y]<1}. We let |y|=\inf\bigl{\{}\sum_{i=1}^{n}[y_{i}]:n\in\mathbb{N},\sum_{i=1}^{n}y_{i}=y\bigr{\}}. Then ∣⋅∣ is a norm on Y such that C1∥y∥⩽∣y∣⩽∥y∥. We will show that for any y∈G and any weakly null (xt)t∈Γξ,1.D⊂σBX,
[TABLE]
whence ϱξ(σ,A:X→(Y,∣⋅∣))⩽σp for all σ>0 by Corollary 3.7. For this we are using the fact that co(G)=BY∣⋅∣. To that end, suppose μ⩾0, y∈G, and (xt)t∈Γξ,1.D⊂BX are such that
[TABLE]
Then for each t∈MAX(Γξ,1.D), there exists (xs,t)s∈Γξ,∞.D⊂BX weakly null such that
[TABLE]
fails to be big. Here, (zis,t)i=1n is the obvious convex blocking of (xu,t)∅<u⩽s.
For t∈MAX(Γξ,1.D), let ϕt:Γξ,∞.D→{s∈Γξ,∞.D:t<s} be given by
[TABLE]
This is the canonical identification of Γξ,∞.D with {s∈Γξ,∞.D:t<s}. Let us now extend (xt)t∈Γξ,1.D to a collection (xt)t∈Γξ,∞.D by letting xs=xϕt−1(s),t if t∈MAX(Γξ,1.D) is such that t<s. Since [y]<1, there exists an inevitable set B which is contained in
[TABLE]
Fix any t∈MAX(Λξ,∞,1.D)∩B and note that
[TABLE]
must be big. Since Bt is not big, there exists s∈B′∖Bt. Since s∈/Bt, if v=ϕt(s), there exists (ai)i=1n∈Kn such that
[TABLE]
But since s∈B′, for this (ai)i=1n,
[TABLE]
This shows that μ⩽σ and finishes (i).
(ii) The same argument as in (i) with ℓpn replaced by ℓ∞p yields that if A is ξ-AUF, A satisfies C-ξ-c0 upper tree estimates for any C>tξ,∞(A).
Now assume A:X→Y satisfies C-ξ-c0 upper tree estimates. Fix a weak neighborhood basis D at [math] in X. Define g on Y by letting g(y) be the infimum of those C1>0 such that for any weakly null (xt)t∈Γξ,∞.D⊂BX,
[TABLE]
is big. Then we claim that g has the following properties:
- (a)
g is 1-Lipschitz.
2. (b)
g is balanced.
3. (c)
for any y∈Y, ∥y∥⩽g(y)⩽∥y∥+C.
4. (d)
g is convex.
The first three properties are obvious from definitions. To see convexity, fix y,y′∈Y, α,α′>0 with α+α′=1, and β>g(y), β′>g(y′). Fix a weakly null (xt)t∈Γξ,∞.D⊂BX and note that by the triangle inequality, Bαy+α′y(αβ+α′β′)⊃By(β)∩By′(β′), where Bαy+α′y′(αβ+α′β′), By(β), By′(β′) are as in the definition of ∣⋅∣. Since supersets of big sets are big, By(β), By′(β′) are big, and the intersection of two big sets is big, Bαy+α′y′(αβ+α′β) is big. From this we deduce convexity.
Let G={y∈Y:g(y)⩽1+C} and let ∣⋅∣ be the Minkowski functional of G. Then if y∈BY, g(y)⩽∥y∥+C⩽1+C, and y∈G. If y∈G, ∥y∥⩽g(y)⩽1+C, so y∈(1+C)BY. Thus ∣⋅∣ is an equivalent norm on Y. We will show that ϱξ(1,A:X→(Y,∣⋅∣))=0. To that end, fix y∈Y with ∣y∣<1 and (xt)t∈Γξ,1.D⊂BX weakly null. Assume
[TABLE]
which means there exists μ>0 such that
[TABLE]
For each t∈MAX(Γξ,1.D), we may fix (xs,t)s∈Γξ,∞.D⊂BX weakly null such that
[TABLE]
fails to be big and define (xt)t∈Γξ,∞.D as in (i). We now argue as in (i) to find some inevitable subset B of
[TABLE]
some t∈MAX(Λξ,∞,1.D)∩B, and s such that ϕt(s)∈B′∖Bt, where B′={u∈Γξ,∞.D:ϕt(u)∈B}. Then with v=ϕt(s),
[TABLE]
a contradiction. This contradiction finishes the proof.
∎
Remark 4.2**.**
It follows from the proof that for any 1<p⩽∞, any ordinal ξ, any operator A:X→Y, and any C>tξ,p(A), A satisfies C-ξ-ℓp (resp. c0 if p=∞) upper tree estimates.
It also follows from the proof and Proposition 2.3 that for each 1<p⩽∞, there exists a constant Cp⩾1 such that if ∥A∥<1 and A satisfies C-ξ-ℓp (resp. c0 if p=∞) upper tree estimates for some C<1, then there exists an equivalent norm ∣⋅∣ on Y such that
[TABLE]
and tξ,p(A:X→(Y,∣⋅∣))⩽Cp.
5. C(K) spaces and injective tensor products
5.1. C(K) spaces
Our first result of this section is the optimal renorming theorem regarding asymptotic smoothness for C(K) spaces. Recall that for a compact, Hausdorff space K and a closed subset L of K, L′ denotes the subset of L consisting of those members of L which are not isolated relative to L. We define the transfinite Cantor-Bendixson derivatives by
[TABLE]
[TABLE]
and if ξ is a limit ordinal,
[TABLE]
We say K is scattered provided that there exists an ordinal ξ such that Kξ=∅, and in this case we let CB(K) be the minimum such K. Of course, we are implicitly assuming K is non-empty, so that if K is scattered, compactness yields that CB(K) is a successor ordinal. Regarding the renorming of C(K), we have the following. The proof is a transfinite analogue of a result of Lancien from [15], wherein the ξ=0 case of the following result is proved.
Theorem 5.1**.**
For any ordinal ξ and any compact, Hausdorff space K, the following are equivalent.
- (i)
CB(K)<ωξ+1,
2. (ii)
Sz(C(K))⩽ωξ+1,
3. (iii)
C(K)* is ξ-asymptotically uniformly smoothable.*
4. (iv)
C(K)* is ξ-asymptotically uniformly flattenable.*
Proof.
The equivalence of (i) and (ii) follows from [6], while the equivalence of (ii) and (iii) follows from [9]. Of course, (iv)⇒(iii). Thus it suffices to show that (i)⇒(iv). Assume that CB(K)<ωξ+1, from which we deduce the existence of some n∈N such that Kωξn=∅. For a measure μ∈C(K)∗ and a Borel subset F of K, let μ∣F be the measure given by μ∣F(E)=μ(E∩F). Now define ∣⋅∣ on C(K)∗ by
[TABLE]
It is clear that this is an equivalent norm on C(K)∗ which is weak∗ lower semi-continuous. Therefore this is the dual norm to an equivalent norm ∣⋅∣ on C(K). It remains to show that (C(K),∣⋅∣) is ξ-AUF. We will show that ϱξ(1/2,(C(K),∣⋅∣))=0. To obtain a contradiction, assume that D is a weak neighborhood basis at [math] in C(K) and that f∈BC(K)∣⋅∣, (ft)t∈Γξ,1.D⊂21BC(K)∣⋅∣ is normally weakly null and ϵ>0 is such that
[TABLE]
For each 1⩽i⩽n, let
[TABLE]
and let S=∪i=1nSi. Note that S is weak∗-compact and abs coweak∗(S)=BC(K)∗∣⋅∣. From this it follows that for every t∈MAX(Γξ,1.D), we may fix ft∗∈S such that
[TABLE]
We now apply Lemma 3.1 to the function F(s,t)=Re ft∗(f+fs) to deduce the existence of a map d:Γξ,1.D→Γξ,1.D with extension e:MAX(Γξ,1.D)→MAX(Γξ,1.D) such that for every (s,t)∈Π(Γξ,1.D), Re fe(t)∗(f+fd(s))>1+ϵ and such that (fd(s))s∈Γξ,1.D is weakly null. By applying Lemma 3.1 and another map with extension and relabeling, we may assume there exist 1⩽i⩽n and α⩽1 such that for every t∈MAX(Γξ,1.D), ft∗∈Si and ∣α−Re ft∗(f)∣⩽ϵ/2.
We now make the following claim: For any 0⩽ζ<ωξ and any t∈Γξ,1ζ.D, there exist ε with ∣ε∣=1 and ϖ∈Kωξ(i−1)+ζ such that ∣α−Re 2iεδϖ(f)∣⩽ϵ/2 and for any ∅<s⩽t, Re 2iεδϖ(f+fs)⩾1+ϵ. The base case follows immediately from the previous paragraph. For the limit ordinal case, we assume t∈Γξ,1ζ.D=∩μ<ζΓξ,1μ.D. For every μ<ζ, we fix εμ and ϖμ as in the claim. Then any weak∗-limit of a subnet of (2iεμδϖμ)μ<ζ must be of the form 2iεδϖ, where ε and ϖ are the ones we seek. Assume ζ+1<ωξ and the conclusion holds for ζ. Then for t∈Γξ,1ζ+1.D, we may fix some γ such that for every u∈D, t⌢(γ,u)∈Γξ,1ζ.D. By the inductive hypothesis, for every u∈D, we may fix εu with ∣εu∣=1 and ϖu∈Kωξ(i−1)+ζ such that ∣α−Re 2iεuδϖu(f)∣⩽ϵ/2, and for every ∅<s⩽t⌢(γ,u), Re 2iεuδϖu(f+fs)⩾1+ϵ. Let f∗=2iεδϖ be a weak∗-limit of a subnet (2iεuδϖu)u∈D′ of (2iεuδϖu)u∈D. We only need to show that ϖ∈Kωξ(i−1)+ζ+1. But 2iεuδϖuweak∗,u∈D′→2iεδϖ means ϖu→ϖ in K. Since ϖu∈Kωξ(i−1)+ζ, we only need to show that ϖ=ϖu for all u in a cofinal subset of D′. This follows immediately from the fact that since
[TABLE]
it must be that
[TABLE]
This finishes the claim.
We now claim that there exist a scalar ε with ∣ε∣=1 and ϖ∈Kωξi such that ∣α−Re 2iεδϖ(f)∣⩽ϵ/2. Indeed, if ξ=0, this can be deduced as in the successor case from the previous paragraph. If ξ>0, this can be deduced as in the limit ordinal case in the previous paragraph. But since 2(2iεδϖ)∈Si+1, it follows that ∣2iεδϖ∣⩽1/2, whence α⩽Re 2iεf∗(f)+ϵ/2⩽1/2+ϵ/2. But then for any t∈MAX(Γξ,1.D),
[TABLE]
and this contradiction finishes the proof.
∎
Remark 5.2**.**
We remark that for metrizable K, Theorem 5.1 follows from Lemma 2.4, [13], and the classical isomorphic characterization of separable C(K) spaces due to Bessaga and Pełczyński. But for non-separable C(K) spaces, this result is new.
Remark 5.3**.**
If K is scattered, then there exists an ordinal ξ such that Kξ=∅ and Kξ+1=∅. In this case, we let C0(K)={f∈C(K):f∣Kξ≡0}. It follows from [6] that if CB(K)=ωξ+1, then C0(K) is ξ-asymptotically uniformly flat. However, if ωξ+1<CB(K), C0(K) is not ξ-asymptotically uniformly flat, or even ξ-asymptotically uniformly smooth. Moreover, if ωξ+1⩽CB(K), C(K) is not ξ-asymptotically uniformly smooth. Indeed, if ϖ∈Kωξ+1, one can easily construct a weak∗-null tree (μt)t∈T.D in which μt=δϖt−δϖt− for some ϖt∈K such that t∈Tζ.D if and only if ϖt∈Kζ. Then
[TABLE]
yielding that δξweak∗(2,C(K))=0 whenever ωξ+1⩽CB(K). Replacing μt with μt∣C0(K), one can see that δξweak∗(2,C0(K))=0. We will say more about this in the final section.
We now move on to injective tensor products. We recall that for Banach spaces X,Y, X⊗^εY is the norm closure in L(X∗,Y) of the operators of the form u=∑i=1nxi⊗yi. We recall that the notation u=∑i=1nxi⊗yi means that
[TABLE]
If A0:X0→Y0, A1:X1→Y1 are operators, there exists a unique bounded, linear extension of the map x0⊗x1↦A0x0⊗A1x1 from X0⊗^εX1 into Y0⊗^εY1. We denote this extension by A0⊗A1. If A0=IX0 and A1=IX1, then IX0⊗IX1=IX0⊗^εX1.
We say a property P which an operator may or may not possess passes to injective tensor products of operators if A0⊗A1 has P whenever A0,A1 have P. We say a property P which a Banach space may or may not possess passes to injective tensor products of Banach spaces if X0⊗^εX1 has P whenever X0,X1 have P.
Our main result in this direction is the following.
Theorem 5.4**.**
For any 1<p<∞ and any ordinal ξ, the following properties pass to injective tensor products of Banach spaces and operators.
- (i)
ξ-asymptotic uniform smoothness.
2. (ii)
ξ-p-asymptotic uniform smoothness.
3. (iii)
ξ-asymptotic uniform flatness.
4. (iv)
ξ-asymptotic uniform smoothability.
5. (v)
ξ-p-asymptotic uniform smoothability.
6. (vi)
ξ-asymptotic flattenability.
7. (vii)
pξ(⋅)⩽p.
It is clear that if either A0=0 or A1=0, A0⊗A1 has each of the seven properties in Theorem 5.4. Thus the non-trivial case is when A0,A1 are non-zero. Theorem 5.4 will follow immediately from the following lemma, using Lemma 2.4, Theorem 4.1, Theorem 2.6, and standard arguments regarding Young duality.
Lemma 5.5**.**
Let A0:X0→Y0, A1:X1→Y1 be non-zero operators and let ξ be an ordinal. Let R=max{∥A0∥,∥A1∥}. Define
[TABLE]
Then for any 0<σ,τ, if δ(τ)⩾στ, ϱξ(σ/8R,A0⊗A1)⩽στ.
Proof.
Seeking a contradiction, assume that μ>0, u∈BY0⊗^εY1, (ut)t∈Γξ,1.D⊂8RσBX0⊗^εX1 are such that
[TABLE]
Now fix δ>0 such that μ>3δ+σδ/4R.
For each t∈MAX(Γξ,1.D), fix y0,t∗∈BY0∗, y1,t∗∈BY1∗ such that
[TABLE]
Define h:Π(Γξ,1.D)→R by h(s,t)=Re y0,t∗⊗y1,t∗(u+A0⊗A1(us)) and note that by Lemma 3.1, there exists a monotone map d:Γξ,1.D→Γξ,1.D with extension e such that for each (s,t)∈Π(Γξ,1.D), Re y0,e(t)∗⊗y1,e(t)∗(u+A0⊗A1(ud(s)))⩾1+στ+μ and such that (ud(s))s∈Γξ,1.D is weakly null. Now define χ:Π(Γξ,1.D)→R2 by
[TABLE]
By Lemma 3.1, we may fix another monotone map d′:Γξ,1.D→Γξ,1.D with extension e′, α,β∈R such that (ud∘d′(s))s∈Γξ,1.D is still weakly null, for every t∈MAX(Γξ,1.D),
[TABLE]
and for every (s,t)∈Π(Γξ,1.D),
[TABLE]
and
[TABLE]
Then for any t∈MAX(Γξ,1.D),
[TABLE]
Since α⩽1+δ, we deduce that
[TABLE]
and
[TABLE]
Proposition 5.6**.**
\alpha\leqslant 1+\delta-\sigma\bigl{(}\frac{\beta-2\delta}{8R}\bigr{)}.
The proof of this claim is somewhat technical, so we relegate the proof to the end of the final section and proceed with the proof of Proposition 5.5. We deduce that
[TABLE]
and this contradiction finishes the proof.
∎
Remark 5.7**.**
Of course, we have a partial converse to Theorem 5.4. If A0⊗A1 has any of the seven properties from Theorem 5.4, then either A0=0, A1=0, or A0,A1 each have that property.
6. Ideals
In this section, we let Ban denote the class of all Banach spaces over K. We let L denote the class of all operators between Banach spaces and for X,Y∈Ban, we let L(X,Y) denote the set of operators from X into Y. For I⊂L and X,Y∈Ban, we let I(X,Y)=I∩L(X,Y). We recall that a class I is called an ideal if
- (i)
for any W,X,Y,Z∈Ban, any C∈L(W,X), B∈I(X,Y), and A∈L(Y,Z), ABC∈I,
2. (ii)
IK∈I,
3. (iii)
for each X,Y∈Ban, I(X,Y) is a vector subspace of L(X,Y).
We recall that an ideal I is said to be closed provided that for any X,Y∈Ban, I(X,Y) is closed in L(X,Y) with its norm topology.
We say a class I is a right ideal provided that items (ii) and (iii) above hold for I, but item (i) is replaced by the property that for any W,X,Y∈Ban, any B∈L(W,X), and any A∈I(X,Y), AB∈I.
If I is an ideal and ι assigns to each member of I a non-negative real value, then we say ι is an ideal norm provided that
- (i)
for each X,Y∈Ban, ι is a norm on I(X,Y),
2. (ii)
for any W,X,Y,Z∈Ban and any C∈L(W,X), B∈I(X,Y), A∈I(Y,Z), ι(ABC)⩽∥A∥ι(B)∥C∥,
3. (iii)
for any X,Y∈Ban, any x∈X, and any y∈Y, ι(x⊗y)=∥x∥∥y∥.
We similarly defined a right ideal norm on a right ideal I by replacing item (ii) above with the property that for any W,X,Y∈Ban, any B∈L(W,X), and A∈I(X,Y), ι(AB)⩽ι(A)∥B∥.
If I is an ideal and ι is an ideal norm on I, we say (I,ι) is a Banach ideal provided that for every X,Y∈Ban, (I(X,Y),ι) is a Banach space. A right Banach ideal is defined similarly.
For 1<p<∞ and an ordinal ξ and an operator A:X→Y, we let Tξ,p(A) be the infimum of those C such that A satisfies C-ξ-ℓp upper tree estimates, where Tξ,p(A)=∞ if there is no such C. We let Tξ,∞(A) be the infimum of those C such that A satisfies C-ξ-c0 upper tree estimates. For 1<p⩽∞, we let tξ,p(A)=∥A∥+Tξ,p(A). We let Tξ,p denote the class of operators A for which tξ,p(A)<∞. We note that by Theorem 4.1, Tξ,p is the class of all ξ-p asymptotically uniformly smoothable operators, and Tξ,∞ is the class of ξ-asymptotically uniformly flattenable operators.
We need the following observation.
Proposition 6.1**.**
Let I be a non-empty set, ξ an ordinal, 1<p<∞, and for each i∈I, let Ai:Xi→Yi be an operator. Assume that supi∈I∥Ai∥<∞. Define A:X:=(⊕i∈IXi)ℓp(I)→Y:=(⊕i∈IYi)ℓp(I) by A∣Xi=Ai. Then
[TABLE]
The analogous result holds when p=∞ if we replace ℓp(I) with c0(I).
Proof.
We prove the result in the case 1<p<∞, with the p=∞ case requiring only notational changes. Let C=supi∈Imax{tξ,p(A),∥Ai∥}. Fix y=(yi)i∈I∈Y such that J:={i∈I:yi=0} is finite. Fix σ>0 and a weakly null (xt)t∈Γξ,1.D⊂σBX. To obtain a contradiction, assume
[TABLE]
for some δ>0. As usual, we may apply Lemma 3.1, relabel, and assume that for each t∈MAX(Γξ,1.D), there exists yt∗∈BY∗ such that for each ∅<s⩽t,
[TABLE]
Fix a finite subset S of ℓp1+∣J∣ such that
- (i)
for each (a,aj)j∈J∈S, a,aj>0,
2. (ii)
for each (a,aj)j∈J∈S, ap+∑j∈Jajp⩽(σ+δ)p,
3. (iii)
for any (b,bj)j∈J∈σBℓp1+∣J∣, there exists (a,aj)j∈J∈S such that ∣b∣⩽a and ∣bj∣⩽aj for each j∈J.
For each t∈Γξ,1.D, there exists (at,ajt)j∈J∈S such that ∥PI∖Jxt∥⩽at and ∥xt,j∥⩽ajt for each j∈J. We may use Lemma 3.1 and relabel once again to assume there exists (a,aj)j∈J∈S such that (at,ajt)j∈J=(a,aj)j∈J for all t∈Γξ,1.D. Thus we arrive at a weakly null collection (xt)t∈Γξ,1.D⊂BX such that
[TABLE]
for every t∈MAX(Γξ,1.D), and
[TABLE]
[TABLE]
for every j∈J and t∈Γξ,1.D.
Now for each j∈J, let Ej denote the set of those t∈MAX(Γξ,1.D) such that
[TABLE]
Then for each j∈J, Ej fails to be cofinal, whence there exists t∈MAX(Γξ,1.D)∖∪j∈JEj. From this we deduce that
[TABLE]
This is the contradiction we sought.
∎
Theorem 6.2**.**
For every ordinal ξ and every 1<p⩽∞, (Tξ,p,tξ,p) is a Banach ideal.
Proof.
It is quite clear that tξ,p is positive homogeneous, takes finite values on Tξ,p, and tξ,p(A)=0 if and only if A=0. Fix Banach spaces X,Y and fix a weakly null collection (xt)t∈Γξ,∞.D⊂BX, A,B∈Tξ,p(X,Y), α>Tξ,p(A), β>Tξ,p(B). Then
[TABLE]
Since the two latter sets are big, supersets of big sets are big, and the intersection of two big sets is big, we deduce that Tξ,p(A+B)⩽Tξ,p(A)+Tξ,p(B) and tξ,p(A+B)⩽tξ,p(A)+tξ,p(B). Thus (Tξ,p(X,Y),tξ,p) is a normed space.
It is clear that Tξ,p(A)=0 for any compact A, since weakly null collections are sent to norm null collections by a compact operator. From this we deduce that tξ,p(x⊗y)=∥x∥∥y∥ for any Banach spaces X,Y, any x∈X, and any y∈Y. Fix W,X,Y,Z∈Ban, C∈L(W,X), B∈Tξ,p(X,Y), A∈L(Y,Z) with ∥A∥=∥C∥=1. Fix (wt)t∈Γξ,∞.D⊂BW weakly null and β>Tξ,p(B). Then
[TABLE]
Since (Cwt)t∈Γξ,∞.D⊂BX is weakly null, the latter set is big, and so is the former. By homogeneity, Tξ,p(ABC)⩽∥A∥Tξ,p(B)∥C∥ and tξ,p(ABC)⩽∥A∥tξ,p(B)∥C∥ for any C∈L(W,X), B∈Tξ,p(X,Y), and C∈L(Y,Z). Thus Tξ,p is an ideal and tξ,p is an ideal norm on Tξ,p.
We last fix X,Y∈Ban and show that (Tξ,p(X,Y),tξ,p) is complete. Fix a tξ,p-Cauchy sequence (An)n=1∞. This sequence is norm Cauchy and has a norm limit, say A. To obtain a contradiction, assume nlimsuptξ,p(A−An)>ε for some 0<ε<1. From this it follows that nlimsupTξ,p(A−An)>ε. Fix positive numbers (εn)n=1∞ such that 4Cp∑n=1∞εn<ε, where Cp⩾1 is the constant from Remark 4.2. By passing to a subsequence, we may assume Tξ,p(A−An)>ε for all n∈N, while tξ,p(An+1−An)<εn−2 for all n∈N. By Remark 4.2, for each n∈N, there exists a norm ∣⋅∣n on Y such that 21BY⊂BY∣⋅∣n⊂2BY and tξ,p(εn−2(An+1−An):X→(Y,∣⋅∣n))⩽Cp. For each n∈N, let Xn=X and Yn=(Y,∣⋅∣n). Define S1:X→(⊕n=1∞Xn)ℓp, S2:(⊕n=1∞Xn)ℓp→(⊕n=1∞Yn)ℓp, S3:(⊕n=1∞Yn)ℓp→Y by
[TABLE]
[TABLE]
[TABLE]
Then
[TABLE]
∥S1∥⩽∑n=1∞εn, ∥S3∥⩽2∑n=1∞εn, and
[TABLE]
But S3S2S1=A−A1, yielding a contradiction.
∎
For each ordinal ξ and 1<p<∞, we let Gξ,p denote the class of p-asymptotically uniformly smooth operators. For each ordinal ξ, we let Fξ denote the class of asymptotically uniformly flat operators. We let
[TABLE]
[TABLE]
[TABLE]
We let
[TABLE]
[TABLE]
and
[TABLE]
Theorem 6.3**.**
For any ordinal ξ and any 1<p<∞, (Gξ,p,gξ,p) and (Fξ,fξ) are right Banach ideals.
We first recall the following classical result.
Fact 6.4**.**
If L is a Banach space, C⊂BL is a non-empty, closed, convex, balanced set with Minkowski functional f, then (spanC,f) is a Banach space.
Proof of Theorem 6.3.
Fix 1<p<∞ and Banach spaces X,Y. Let C={A∈L(X,Y):Gξ,p(A)⩽1}. It is clear that Gξ,p(A)⩾∥A∥, from which we deduce that C⊂BL(X,Y). We also note that ∣ϱξ(σ,A)−ϱξ(σ,B)∣⩽σ∥A−B∥ for any σ>0 and A,B:X→Y. From this it follows that if An→A in norm, then for any σ>0, ϱξ(σ,An)/σp→ϱξ(σ,A)/σp. Moreover, if An→A in norm, gξ,p(A)⩽nlimsupgξ,p(An). From this we see that if ∥An∥+gξ,p(An)⩽1 and An→A in norm,
[TABLE]
This shows that C is closed. Obviously C is non-empty and balanced. By Corollary 3.6, for α,β>0 with α+β=1, σ>0, and A,B:X→Y,
[TABLE]
From this it follows that gξ,p and Gξ,p are convex and C is a convex set. Clearly span(C)=Gξ,p(X,Y) and gξ,p∣Gξ,p(X,Y) is the Minkowski functional of C. From Fact 6.4, we deduce that (Gξ,p(X,Y),gξ,p) is a Banach space.
The same argument holds to show that Fξ(X,Y) is a Banach space, once we establish that C′={A∈L(X,Y):Σξ(A)⩽1} is closed and convex. If An→A in norm, we can deduce that σξ(A)⩽nlimsupσξ(An), and deduce closedness as in the previous paragraph. For convexity, it suffices to show that σξ is a convex function on Fξ(X,Y). Fix α′,β′>0 with α′+β′=1 and fix A,B∈Fξ(X,Y). Fix α>σξ(A) and β>σξ(B). Then
[TABLE]
Of course, 0=σξ(A)=gξ,p(A) whenever A is compact, so fξ(x⊗y)=gξ,p(x⊗y)=∥x∥∥y∥, since gξ,p(x⊗y)=σξ(x⊗y)=0 for any X,Y∈Ban and x∈X, y∈Y.
Finally, in order to show that gξ,p(AB)⩽gξ,p(A)∥B∥ (resp. fξ(AB)⩽fξ(A)∥B∥) whenever W,X,Y∈Ban, B∈L(W,X), and A∈Gξ,p(X,Y) (resp. Fξ(X,Y)), it suffices to show that gξ,p(AB)⩽gξ,p(A) whenever ∥B∥⩽1 (resp. σξ(AB)⩽σξ(A) whenever ∥B∥⩽1). But these follow immediately from the fact that
[TABLE]
for every σ>0 whenever ∥B∥⩽1. This is because under these hypotheses, any weakly null collection of order ωξ in σBW is sent by B to a weakly null collection of order ωξ in σBX.
∎
Proposition 6.5**.**
For any ordinal ξ and 1<p<∞, Gξ,p and Fξ fail to be left ideals, and Gξ,p, Fξ, Tξ,p, Tξ,∞ fail to be closed.
We will need the following example.
Proposition 6.6**.**
Let ξ be an ordinal.
- (i)
There exists a weakly null collection (ft)t∈T.N⊂BC0([0,ωωξ]) such that for every t∈T.N, ft⩾0 and ∥f∥=1 for every convex combination f of (fs:∅<s⩽t).
2. (ii)
tξ,∞(C0([0,ωωξ]))=1.
3. (iii)
C([0,ωωξ])* fails to be ξ-AUS.*
Proof.
(i) Let T={(γi)i=1k:ωξ>γ1>…>γk}. Given t=(γi,ni)i=1k∈T.N, let ft be the indicator of the interval
[TABLE]
Note that if t1<…<tk, ti∈T.D, then It1⊃…⊃Itk, yielding that ∥f∥=1 for any t∈T.D and any f∈co(fs:∅<s⩽t). Moreover, an easy induction yields that for any 0⩽γ<ωξ,
[TABLE]
whence o(T)=ωξ. Last, if t⌢(γ,1)∈T, (It⌢(γ,n))n∈N are pairwise disjoint, and (ft⌢(γ,n))n∈N is weakly null.
(ii) Fix f∈C0([0,ωωξ]) and a weakly null tree (ft)t∈T.D⊂σBC0([0,ωωξ]). Fix ε>0 and let F={ϖ∈[0,ωωξ]:∣f(ϖ)∣⩾ε}. Then since F is closed and ωωξ∈/F, there exists γ<ωωξ such that F⊂[0,γ]. Since Sz(C([0,γ]))⩽ωξ, if R:C0([0,ωωξ])→C([0,γ]) is the restriction map Rg=g∣[0,γ], there exists t∈T.D and g∈co(fs:∅<s⩽t) such that ∥g∣[0,γ]∥<ε. The latter claim follows from [5]. Then
[TABLE]
This yields that tξ,∞(C0([0,ωωξ]))⩽1. The collection from (i) yields that tξ,∞(C0([0,ωωξ]))⩾1, giving (ii).
(iii) If (ft)t∈T.N is the collection from (i), then for any σ>0, 1[0,ωωξ]∈BC([0,ωωξ]) and (σft)t∈T.N witness that ϱξ(σ,C([0,ωωξ]))⩾σ.
∎
Proof of Proposition 6.5.
Since C0([0,ωωξ]) is ξ-AUF by Proposition 6.6, while the isomorphic space C([0,ωωξ]) is not ξ-AUS, we deduce that Fξ, Gξ,p are not left ideals. Indeed, since Fξ (resp. Gξ,p) is a right ideal, if Fξ (resp. Gξ,p) were a left ideal and if A:C([0,ωωξ])→C0([0,ωωξ]) is an isomorphism, IC([0,ωωξ])=A−1IC0([0,ωωξ])A would lie in Fξ (resp. Gξ,p).
For 0<τ<1, define the norm ∣⋅∣τ on K⊕C0([0,ωωξ]) by
[TABLE]
and let Xτ denote K⊕C0([0,ωωξ]) with this norm. For 0<τ<1 and 0<θ, let Aτ,θ:C0([0,ωωξ])→Xτ by Aτ,θ(g)=(0,θg). By Proposition 6.6, since tξ,∞(C0([0,ωωξ]))=1, we deduce that for any σ>0, ϱξ(σ,Aθ,τ)⩽max{0,τ+θσ−1}. Indeed, if (a,f)∈BXτ and (gt)t∈Γξ,1.D⊂σBC0([0,ωωξ]) is weakly null,
[TABLE]
Furthermore, using Proposition 6.6(i), we deduce that ϱξ(σ,Aθ,τ)⩾max{0,τ+θσ−1}, yielding equality. In particular, σξ(Aθ,τ)=1−τθ. Let Wn=C0([0,ωωξ]) for each n∈N and define B,Bk:(⊕n=1∞Wn)c0→(⊕n=1∞X1−1/n)c0 by
[TABLE]
[TABLE]
[TABLE]
Then since Aθ,τ is ξ-AUF for each θ,τ, each Bk is ξ-AUF. Moreover, Bk→B in norm. However, B is not ξ-p-AUS for any 1<p<∞. Indeed, fix 1<p<∞, C>0, let q be such that 1/p+1/q=1. Fix n∈N such that C1/p2log2(n+1)<n1/q. Let σ=n2log2(n+1) and note that
[TABLE]
For the non-closedness of Tξ,p, we fix θn=1/log2(n+1) for each n∈N. We let A,Ak:(⊕n=1∞C([0,ωωξn]))c0→(⊕n=1∞C([0,ωωξn]))c0 be given by A∣C([0,ωωξn])=θnIC([0,ωωξn]), Ak∣C([0,ωωξn])=θnIC([0,ωωξ] if n⩽k, and Ak∣C([0,ωωξn])=0. Then each Ak lies in Tξ,∞, Ak→A in the operator norm, and Sz(A,θn)⩾Sz(An,θn)⩾n. But this implies that pξ(A)=∞, whence A∈/∪1<p⩽∞Tξ,p by Theorem 2.6.
∎
Remark 6.7**.**
We now discuss distinctness of the classes. Let Szξ denote the class of operators with Szlenk index not exceeding ωξ. It was shown in [4] that this is a closed operator ideal. For any 1<p<∞,
[TABLE]
The first and last containments follow from Theorems 2.5 and 2.6. The identity operator of C0([0,ωωξ]) shows that the first containment is proper. It was explained in [9] how a construction from [7] demonstrates that the last containment is proper. The middle containment is obvious, while a construction from [9] provided for each 1<p<r<∞ a Banach space whose identity lies in Gξ,p∖Tξ,r. Of course, we have already shown the existence of an operator in Tξ,p∖∪1<pGξ,p. This fully elucidates the relationships between all classes discussed here.
We remark that the distinctness of all classes can be witnessed by an identity operator. However, the construction from [7] actually shows that when ξ>0, there is an identity operator in Szξ+1∖∪1<p<∞Tξ,p, while it is known [19] that no identity operator can lie in this set difference when ξ=0. This is because of the submultiplicativity of the ε-Szlenk index of a Banach space.
7. Technical lemmata
Our first task in this section is to explain how our definition of weakly null differs from that given in [9], and why these notions give the same modulus ϱξ. The same arguments apply to δξweak∗. There, a collection (xs)s∈S was called weakly null of order ωξ if o(S)=ωξ and for any s∈({∅}∪S)ζ+1,
[TABLE]
Every collection (xt)t∈T.D which is weakly null of order ωξ according to our definition is weakly null by the definition of [9]. However, by the [9] definition, weakly null trees may contain many “superfluous” branches, which is an obstruction to the usefulness of the notions of “cofinal” and “eventual” for trees.
Now suppose that (xs)s∈S is weakly null of order ωξ and for each s∈S, let oS(s)=max{ζ<ωξ:s∈Sζ}. Fix any weak neighborhood basis D at [math] in X. For t∈Γξ,1.D, let oΓξ,1.D(t)=max{ζ<ωξ:t∈(Γξ,1.D)ζ}. Then one can recursively define a monotone map Θ:Γξ,1.D→S such that for any t=(ζi,ui)i=1n∈Γξ,1.D, xΘ(t)∈un. Indeed, suppose t=(ζ,u)∈MIN(Γξ,1.D) and let γ=oΓξ,1.D(t). Then γ<ωξ, and there exists u∈(∅∪S)γ+1. We may let Θ(t)=v, where v∈Sγ is such that v−=u and xv∈u. Now suppose that t=(ζi,ui)i=1n∈Γξ,1.D for n>1, Θ(t) has been defined, and oS(Θ(t−))⩾oΓξ,1.D(t−). Since γ:=oΓξ,1.D(t)<oΓξ,1.D(t−), Θ(t−)∈Sγ+1. Then we may fix some w∈Sγ such that w−=Θ(t−) and xw∈un and let Θ(t)=w.
Thus we arrive at a weakly null collection (xΘ(T))t∈Γξ,1.D all of whose branches are subsequences of branches of the collection (xt)t∈S. This shows that a collection which is weakly null according to the definition of [9] has a subcollection which is weakly null according to our definition. From this it is easy to see why these two notions give rise to the same ϱξ modulus.
Our next task in this section is to prove Lemma 3.1.
Remark 7.1**.**
We note that for ξ⩽ζ and any directed set D, Γξ,1.D can be mapped into Γζ,1.D. More specifically, if (xt)t∈Γζ,1.D is weakly null, and if ξ⩽ζ, there exist a monotone map d:Γξ,1.D→Γζ,1.D such that (xd(t))t∈Γξ,1.D is weakly null. Furthermore, since Γζ,1.D is well-founded, this d admits an extension, e. To see the existence of this d, we prove by induction on γ⩾0 that if (xt)t∈Γξ+γ,1.D is weakly null, there exists a monotone map d:Γξ,1.D→Γξ+γ,1.D such that (xd(t))t∈Γξ,1.D is weakly null. If γ=0, we can d to be the identity. If we have the result for some γ and if (xt)t∈Γξ+γ+1,1.D is weakly null, we note that Γξ+γ,1.D=Λξ+γ+1,1,1.D⊂Γξ+γ+1,1.D. By the inductive hypothesis, there exists d:Γξ,1.D→Γξ+γ,1.D⊂Γξ+γ+1,1.D such that (xd(t))t∈Γξ,1.D is weakly null. Last, if γ is a limit ordinal, we may take d to be the composition of the inclusion of Γξ,1.D into Γξ+1,1.D together with the canonical identification of Γξ+1,1.D with (ωξ+Γξ+1,1).D⊂Γξ+γ,1.D.
Furthermore, for any ordinal ξ and any m,n∈N with m⩽n, there exists a monotone map, and in fact a canonical identification, of Γξ,m.D with ∪i=1mΛξ,n,i.D. since Γξ,n.D is well-defined, this identification also admits an extension e.
The following result is an inessential modification of [7, Proposition 3.3].
Proposition 7.2**.**
Given an ordinal ξ, m,n∈N with m⩽n, 1⩽s1<…<sm⩽n, a Banach space X, a directed set D, and a weakly null collection (xt)t∈Γξ,n.D⊂X, there exists a monotone map d:Γξ,m.D→Γξ,n.D such that d(Λξ,m,i.D)⊂Λξ,n,si.D.
We now move to the proof of Lemma 3.1. This lemma has four parts, and our strategy will be to prove by induction on Ord×N with lexicographical order that each of the four claims holds for a given (ξ,n). For convenience, we restate the lemma.
Lemma 7.3**.**
Suppose that ξ is an ordinal, n∈N, X is a Banach space, and (xt)t∈Γξ,n.D is weakly null.
- (i)
If E⊂MAX(Γξ,n.D) is cofinal, there exists a level map d:Γξ,n.D→Γξ,n.D with extension e such that e(MAX(Γξ,n.D))⊂E and (xd(t))t∈Γξ,n.D is weakly null.
2. (ii)
For any k∈N, if MAX(Γξ,n.D)⊃E=∪i=1kEi∈Ωξ,n, then there exists 1⩽j⩽k such that Ej∈Ωξ,n.
3. (iii)
If F is a finite set and χ:Π(Γξ,n.D)→F is a function, then there exist a level map d:Γξ,n.D→Γξ,n.D with extension e and α1,…,αn∈F such that for any 1⩽i⩽n and any Λξ,n,i.D∋s⩽∈MAX(Γξ,n.D), αi=F(d(s),e(t)), and such that (xd(t))t∈Γξ,n.D is weakly null.
4. (iv)
If h:Π(Γξ,n.D)→R is bounded and if E⊂MAX(Γξ,n.D) is cofinal, then for any δ>0, there exist a1,…,an∈R and a level map d:Γξ,n.D→Γξ,n.D with extension e such that e(MAX(Γξ,n.D))⊂E, for each 1⩽i⩽n and each Λξ,n,i.D∋s⩽t∈MAX(Γξ,n.D), h(d(s),e(t))⩾ai−δ, and for any t∈MAX(Γξ,n.D), ∑∅<s⩽e(t)Pξ,n(s)h(s,e(t))⩽δ+∑i=1nai.
Proof.
Case 1: (ξ,n)=(0,1). (i) Write E={(1,u):u∈D0} for a cofinal subset D0 of D. For each u∈D, fix some vu∈D0 with u⩽vu. Let d((1,u))=e((1,u))=(1,vu). Then e(MAX(Γ0,1.D))⊂E and (xd(t))t∈Γ0,1.D is weakly null.
(ii) Write Ei={(1,u):u∈Di}. Then ∪i=1kEi={(1,u):u∈∪i=1kDi}∈Ω0,1, ∪i=1kDi is cofinal in D, and so must one of the sets D1,…,Dk be.
(iii) Note that Π(Γ0,1.D)={((1,u),(1,u)):u∈D}. For each α∈F, let Eα={t∈Γ0,1.D:χ(t,t)=α}. Then by (i) and (ii), there exists α∈F such that Eα∈Ω0,1. For this we are using the fact that MAX(Γ0,1.D)∈Ω0,1. Fix d and e as in (i) with E=Eα.
(iv) Since the range of h is totally bounded, we may fix a finite subset F of R such that range(h)⊂∪a∈F[a−δ,a+δ]. For each a∈F, let Ea={t∈E:h(t,t)∈[a−δ,a+δ]}. Then there exists a∈F such that Ea∈Ω0,1. Fix d,e as in (i) with E replaced by Ea and note that this d,e satisfies the conclusions.
Case 2: If ξ is a limit ordinal and (ζ+1,1) holds for all ζ<ξ, then (ξ,1) holds.
(i) Assume E∈Ωξ,1. Then there exists a cofinal subset M of [0,ξ) such that, with Θζ+1=(ωζ+Γζ+1,1).D, E∩Θζ+1 is cofinal in Θζ+1 for all ζ∈M. For each ζ∈M, using canonical identifications, there exists a monotone map dζ:Θζ+1→Θζ+1 with extension eζ such that (xdζ(t))t∈Θζ+1 is weakly null and e(MAX(Θζ+1))⊂E. Now for each η<ξ, fix ζη∈M such that η+1⩽ζη+1. By Remark 7.1 and canonical identifications, there exists dη′:Θη+1→Θζη+1 such that (xdζη∘dη′(t))t∈Θη+1 is weakly null. Let eη′ be any extension of dη′ and define d,e by letting d∣Θη+1=dζη∘dη′ and e∣MAX(Θζ+1=eζη∘eη′.
(ii) Assume E∈Ωξ,1. Let Θζ+1 be as in the previous paragraph. There exists M⊂[0,ξ) cofinal in [0,ξ) such that for every ζ∈M, Θζ+1∩E is cofinal in Θζ+1. By the inductive hypothesis, this means that for each ζ∈M, there exists 1⩽jζ⩽k such that Θζ+1∩Ejk is cofinal in Θζ+1. Let Mj={ζ∈M:j=jζ}. Then there exists 1⩽j⩽k such that Mj is cofinal in M, whence Ej∈Ωξ,1.
(iii) Again, let Θζ+1 be as in the two previous paragraphs. Applying the inductive hypothesis to χ∣Π(Θζ+1), we obtain dζ:Θζ+1→Θζ+1 with extension eζ and αζ∈F such that for each (s,t)∈Π(Θζ+1), χ(dζ(s),eζ(t))=αζ, and such that (xdζ(t))t∈Θζ+1 is weakly null. For each α∈F, let Mα={ζ<ξ:αζ=α} and fix α∈F such that Mα is cofinal in [0,ξ). We now define dη′, eη′ and then d,e as in (i) of Case 2.
(iv) Fix a cofinal subset M of [0,ξ) such that E∩Θζ+1 is cofinal in Θζ+1 for each ζ∈M. For δ>0 and ζ∈M, we may apply the inductive hypothesis to h∣Π(Θζ+1) to deduce the existence of aζ and dζ:Θζ+1→Θζ+1 with extension eζ such that eζ(MAX(Θζ+1))⊂E, for each (s,t)∈Π(Θζ+1), h(dζ(s),eζ(t))⩾aζ−δ/2, for each t∈MAX(Θζ+1), ∑∅<s⩽eζ(t)h(s,eζ(t))⩽aζ+δ/2, and (xd(t))t∈Θζ+1 is weakly null. Since h is bounded, (aζ)ζ<ξ is bounded, and we may fix a∈R such that N={ζ∈M:∣a−aζ∣<δ/2} is cofinal in [0,ξ). We now fix dη′, eη′ and then d,e as in (i) of Case 2.
Case 3: If for an ordinal ξ, (ξ,n) holds for every n∈N, then (ξ+1,1) holds.
(i) Assume E⊂MAX(Γξ+1,1.D) is cofinal. Then there exists a cofinal subset M of N such that for each n∈M, E∩Γξ,n.D is cofinal in Γξ,n.D. For each n∈M, there exists a monotone map dn:Γξ,n.D→Γξ,n.D with extension en such that en(MAX(Γξ,n.D))⊂E and such that (xdn(t))t∈Γξ,n.D is weakly null. Now for each i∈N, fix ni∈M with i⩽ni and let di′:Γξ,i.D→Γξ,ni.D be a monotone map such that (xdni∘di′(t))t∈Γξ,i.D is weakly null. Such a map di′ exists by Remark 7.1. Let ei′ be any extension of di′. Define d,e by d∣Γξ,i.D=dni∘di′ and e∣MAX(Γξ,i.D=eni∘ei′.
(ii) Assume E⊂MAX(Γξ+1,1.D) is cofinal. Then there exists a cofinal subset M of N such that for each n∈M, E∩Γξ,n.D is cofinal in Γξ,n.D. By the inductive hypothesis, for each n∈M, there exists 1⩽jn⩽k such that Ejn∩Γξ,n.D is cofinal in Γξ,n.D. Let Mj={n∈M:j=jn} and fix 1⩽j⩽k such that Mj is cofinal in N. Then Ej∈Ωξ+1,1.
(iii) For each n∈N, applying the inductive hypothesis to χ∣Π(Γξ,n.D) yields a level map dn:Γξ,n.D→Γξ,n.D with extension en and α11,…,αnn∈F such that for each 1⩽i⩽n and Λξ,n,i.D∋s⩽t∈MAX(Γξ,n.D), χ(dn(s),en(t))=αin and (xdn(t))t∈Γξ,n.D is weakly null. Then there exist α∈F and 1⩽n1<n2<…, and for each i∈N 1⩽s1i<…<sii⩽ni such that αsjni=α for each 1⩽j⩽i. For each i∈N, fix a monotone map di′:Γξ,i.D→Γξ,ni.D such that di′(Λξ,i,j.D)⊂Λξ,ni,sjni.D and such that (xdni∘di′(t))t∈Γξ,i.D is weakly null. Such a map exists by Proposition 7.2. Let ei′ be any extension of di′. Let d∣Γξ,i.D=dni∘di′ and e∣MAX(Γξ,i.D)=eni∘ei′.
(iv) Fix a cofinal subset M of N such that for each n∈M, E∩Γξ,n.D is cofinal in Γξ,n.D. For each n∈M, applying the inductive hypothesis to h∣Π(Γξ,n.D) yields a level map dn:Γξ,n.D→Γξ,n.D with extension en and numbers a1n,…,ann such that en(MAX(Γξ,n.D))⊂E, (xdn(t))t∈Γξ,n.D is weakly null, for each 1⩽i⩽n and each Λξ,n,i.D∋s⩽t∈MAX(Γξ,n.D), h(dn(s),en(t))⩾ain−δ/2, and for each t∈MAX(Γξ,n.D), ∑∅<s⩽en(t)Pξ,n(s)h(s,en(t))⩽δ/2+∑i=1nain. Note that the collection (ain:n∈N,1⩽i⩽n) is bounded, so there exist n1<n2<…, ni∈M, such that a=limini1∑j=1niajni exists. By passing to a further subsequence of (ni)i=1∞, we may assume that for each i∈N,
[TABLE]
and a+δ/2⩾ni1∑j=1niajni. For each i, we fix 1⩽s1ni<…<sini⩽ni such that asjni⩾a−δ/2 for each 1⩽j⩽i. We now fix di′, ei′ and finish as in (i) of Case 3.
Case 4: If (ξ,k) holds for some ξ and each 1⩽k⩽n, (ξ,n+1) holds.
(i) Suppose E⊂MAX(Γξ,n+1.D) is cofinal. For each t∈MAX(Λξ,n+1,1.D), let Pt={s∈Γξ,n+1.D:t<s}. Then there exists a subset F of MAX(Λξ,n+1,1.D) which is cofinal in Λξ,n+1,1.D such that E∩Pt is cofinal in Pt for each t∈F. For each t∈F, fix a level map dt:Pt→Pt with extension et such that et(MAX(Pt))⊂E and (xdt(s))s∈Pt is weakly null. Now fix a monotone map d′:Λξ,n+1,1.D→Λξ,n+1,1.D with extension e′:MAX(Λξ,n+1,1.D)→MAX(Λξ,n+1,1.D) such that e′(MAX(Λξ,n+1,1.D))⊂F and (xd′(t))t∈Λξ,n+1,1.D is weakly null. For each t∈MAX(Λξ,n+1,1.D), let jt:Pt→Pe′(t) be the canonical identification. Now define d, e by letting d∣Λξ,n+1,1.D=d′ and for t∈MAX(Λξ,n+1,1.D), d∣Pt=de′(t)∘jt and e∣MAX(Pt)=ee′(t)∘jt.
(ii) For each t∈MAX(Λξ,n+1,1.D), let Pt be as in (i). Then there exists a set F⊂MAX(Λξ,n+1,1.D) which is cofinal in Λξ,n+1,1.D such that E∩Pt is cofinal in Pt for each t∈F. Applying the inductive hypothesis, for each t∈F, there exists 1⩽jt⩽k such that Ejt∩Pt is cofinal in Pt. For each 1⩽j⩽k, let Fj={t∈F:j=jt}. Then by the inductive hypothesis, there exists 1⩽j⩽k such that Fj is cofinal in Λξ,n+1,1.D, whence Ej∈Ωξ,n+1.
(iii) For each t∈MAX(Λξ,n+1,1.D), let Pt be as in (i). Applying the inductive hypothesis to χ∣Π(Pt) yields a level pruning dt:Pt→Pt with extension et and (αit)i=2n+1∈Fn such that for each 2⩽i⩽n+1 and each Pt∩Λξ,n+1,i.D∋s⩽u∈MAX(Pt), χ(dt(s),et(u))=αit and such that (xd(s))s∈Pt is weakly null. Now, with t∈MAX(Λξ,n+1,1.D) still fixed, for each β∈F∣t∣, let Eβ={s∈MAX(Pt):(χ(t∣i,et(s)))i=1∣t∣=β}. By (i) and (ii), we may fix a level map dt′:Pt→Pt with extension et′ and βt=(βit)i=1∣t∣ such that et′(MAX(Pt))⊂Eβt and (xdt∘dt′(s))s∈Pt is weakly null. We now note that for any s⩽t∈MAX(Λξ,n+1,1.D) and any maximal extension u of t, χ(s,et∘et′(u))=β∣s∣t. Now define υ:Π(Λξ,n+1,1.D)→F by letting υ(s,t)=β∣s∣t. By the inductive hypothesis, there exist a monotone map d′′:Λξ,n+1,1.D→Λξ,n+1,1.D with extension e′′ and α1∈F such that for each (s,t)∈Π(Λξ,n+1,1.D), υ(d′′(s),e′′(t))=α1 and (xd′′(t))t∈Λξ,n+1,1.D is weakly null. Now for each β∈Fn, let Fβ={t∈MAX(Λξ,n+1,1.D):(αie′′(t))i=2n+1=β}. By (i) and (ii), there exist another monotone map d′′′:Λξ,n+1,1.D→Λξ,n+1,1.D with extension e′′′ and β=(αi)i=2n+1 such that e′′′(Λξ,n+1,1.D)⊂Fβ. Now define d and e by letting d∣Λξ,n+1,1.D=d′′∘d′′′, d∣Pt=de′′∘e′′′(t)∘de′′∘e′′′(t)′∘jt and e∣MAX(PT)=ee′′∘e′′′(t)∘ee′′∘e′′′(t)′∘jt, where jt:Pt→Pe′′∘e′′′(t) is the canonical identification.
(iv) This is quite similar to the previous paragraph. For each t∈MAX(Λξ,n+1,1.D), let Pt be as in (i). Note that there exists a subset F of MAX(Λξ,n+1,1.D) which is cofinal in Λξ,n+1,1.D such that E∩Pt is cofinal in Pt for each t∈F. For each t∈F, applying the inductive hypothesis to h∣Π(Pt) yields a level pruning dt:Pt→Pt with extension et and (ait)i=2n+1∈Rn such that for each 2⩽i⩽n+1 and each Pt∩Λξ,n+1,i.D∋s⩽u∈MAX(Pt), h(dt(s),et(u))⩾ait−δ/4, for any s∈MAX(Pt), ∑t<u⩽et(s)h(u,et(s))⩽δ/4+∑i=2n+1ait, and (xdt(s))s∈Pt is weakly null. Now, with t∈F still fixed, fix a finite partition Ut of subsets β of range(h)∣t∣ such that each β∈Ut has diameter (with respect to the ℓ1∣t∣ on R∣t∣) less than δ/4. For each β∈Ut, let Eβ={s∈MAX(Pt):(h(t∣i,et(s)))i=1∣t∣∈β}. By (i) and (ii), we may fix a level map dt′:Pt→Pt with extension et′ and βt=(βit)i=1∣t∣ such that et′(MAX(Pt))⊂Eβt and (edt∘dt′(s))s∈Pt is weakly null. Now fix (ϖit)i=1∣t∣∈βt. We now note that for any s⩽t∈MAX(Λξ,n+1,1.D) and any maximal extension u of t, ∣ϖ∣s∣t−h(s,et∘et′(u))∣<δ/4. Now define υ:Π(Λξ,n+1,1.D)→R by letting υ(s,t)=ϖ∣s∣t if t∈F, and υ(s,t)=0 otherwise. By the inductive hypothesis, there exist a1∈R and a monotone map d′′:Λξ,n+1,1.D→Λξ,n+1,1.D with extension e′′:Λξ,n+1,1.D→F such that for each (s,t)∈Π(Λξ,n+1,1.D), υ(d′′(s),e′′(t))⩾a1−δ/4, for each t∈MAX(Λξ,n+1,1.D), ∑∅<s⩽e′′(t)υ(s,e′′(t))⩽a1+δ/4, and (xd′′(t))t∈Λξ,n+1,1.D is weakly null. Now by boundedness of the collection (ait:2⩽i⩽n+1,t∈MAX(Λξ,n+1,1.D)), we may fix a finite subset S of Rn such that for each t∈MAX(Λξ,n+1,1.D), there exists γt=(bit)i=2n+1∈S such that ∑i=2n+1∣aie′′(t)−bit∣<δ/4. Now fix another monotone map d′′′:Λξ,n+1,1.D→Λξ,n+1,1.D and (ai)i=2n+1∈S such that (ai)i=2n+1=(bie′′′(t))i=2n+1 for all t∈MAX(Λξ,n+1,1.D). Now define d and e by letting d∣Λξ,n+1,1.D=d′′∘d′′′, d∣Pt=de′′∘e′′′(t)∘de′′∘e′′′(t)′∘jt and e∣MAX(PT)=ee′′∘e′′′(t)∘ee′′∘e′′′(t)′∘jt, where jt:Pt→Pe′′∘e′′′(t) is the canonical identification.
∎
Our final task in this section is to prove Proposition 5.6, contained in Lemma 5.5. We first make the following observation.
Remark 7.4**.**
Let A0:X0→Y0, A1:X1→Y1 be non-zero operators and let R=max{∥A0∥,∥A1∥}. Suppose also that y0∗,v0∗∈BY0∗, y1∗,v1∗∈BY1∗, γ′∈R are such that
[TABLE]
Then
[TABLE]
We will need the following.
Proposition 7.5**.**
Suppose A:X→Y is an operator, σ,τ>0, ξ is an ordinal, and δξweak∗(τ,A)⩾στ. If T is a rooted tree with o(T)=ωξ+1 and if c⩾τ and if (yt∗)t∈T⊂BY∗ is a weak∗-closed tree such that ∥A∗yt∗−A∗yt−∗∥⩾c for all t∈T.D, then σc⩽1 and ∥y∅∗∥⩽1−cσ.
Proof.
It was shown in [9, Proposition 3.10] that under these hypotheses, either y∗=0 or ∥y∗∥⩽1−σc. Thus it suffices to prove the result in the case that y∗=0. As was explained in [9], the conditions imply that Sz(A)>ωξ, whence δweak∗(⋅,A) is finite and continuous. Fix 0<σ1<σ and 0<τ1<τ such that δweak∗(τ1,A)⩾σ1τ1. Fix δ>0 such that (1+δ)τ1<τ. Fix any z∗∈Y∗ with ∥z∗∥=δ. Let zt∗=(1+δ)−1(z∗+yt∗). Then we deduce from the result in [9] that σ1⋅1+δc⩽1. Since 0<σ1 and δ>0 were arbitrary, σc⩽1.
∎
We now introduce another notion which is closely related to the Szlenk index, but defined to overcome the deficiency that the adjoint of an operator need not be injective. Given an operator B:E→F, a weak∗-compact subset K of F∗, and ε>0, we define ⟨K⟩B,ε denote the set of those f∗∈K such that for every weak∗-neighborhood V of f∗, diam(B∗(K∩V))>ε. We define the transfinite derivations
[TABLE]
[TABLE]
and if ξ is a limit ordinal,
[TABLE]
Note that ⟨K⟩B,εξ is weak∗-compact for any ordinal ξ and any ε>0. We note that if B:E→F is the identity of E, then the notions above exactly coincide with the Szlenk derivations sεξ.
The following is a trivial proof by induction and is well-known for the Szlenk index. Our proof is an inessential modification.
Lemma 7.6**.**
If B:E→F is an operator, K⊂F∗ is weak∗-compact, ε>0, and f∗∈⟨K⟩B,εξ, then there exists a rooted tree T with o(T)=ξ+1 and a weak∗-closed collection (ft∗)t∈T⊂K such that f∅∗=f∗ and for each ∅=t∈T, ∥B∗ft∗−B∗ft−∗∥>ε/2.
Lemma 7.7**.**
Suppose T is a non-empty, well-founded tree, B:E→F is an operator, D is a directed set, γ>0, (et)t∈T.D⊂BE is weakly null, K⊂F∗ is weak∗-compact, and (ft∗)t∈MAX(T.D)⊂K is such that for any ∅<s⩽t∈MAX(T),
[TABLE]
Then for any 0<γ′<γ, ⟨K⟩B,γ′o(T)=∅.
Proof.
We prove by induction on ξ that if t∈Tξ.D, there exists f∗∈⟨K⟩B,γ′ξ such that for any ∅<s⩽t, Re f∗(Bes)⩾γ. The ξ=0 case holds by the hypotheses. Suppose ξ is a limit ordinal and t∈Tξ.D. Then for every ζ<ξ, we may fix fζ∗∈⟨K⟩B,γ′ζ such that Re fζ∗(Bes)⩾γ for each ∅<s⩽t. Then any weak∗-limit f∗ of a weak∗-converging subnet of (fζ∗)ζ<ξ lies in ⟨K⟩B,γ′ξ and satisfies Re f∗(Bes)⩾γ for each ∅<s⩽t. Last suppose we have the result for some ordinal ξ and t∈Tξ+1.D. Then there exists some λ such that t⌢(λ,u)∈Tξ.D for some (equivalently, every) u∈D. Then for each u∈D, we fix fu∗∈⟨K⟩B,γ′ξ such that Re fu∗(et⌢(λ,u))⩾γ and Re fu∗(es)⩾γ for each ∅<s⩽t. Let f∗ be a weak∗-limit of a subnet (fu∗)u∈D′ of (fu∗)u∈D. Then since
[TABLE]
we deduce that f∗∈⟨K⟩B,γ′ξ+1.
Now if o(T) is a limit ordinal, for any ξ<o(T), ⟨K⟩B,γ′ξ=∅ by the previous paragraph, whence ⟨K⟩B,γ′o(T)=∅ by weak∗-compactness. If o(T)=ξ+1, then we may fix λ such that (λ,u)∈Tξ.D for some (equivalently, all) u∈D and for each u∈D, fix fu∗ such that Re fu∗(e(λ,u))⩾γ. Arguing as in the successor case of the previous paragraph, we deduce that if f∗ is a weak∗-limit of a subnet of (fu∗)u∈D, f∗∈⟨K⟩B,γ′ξ+1=⟨K⟩B,γ′o(T).
∎
For Banach spaces Y0, Y1, K0⊂Y0∗, K1⊂Y1∗, we let
[TABLE]
Lemma 7.8**.**
Suppose A0:X0→Y0 A1:X1→Y1 are non-zero operators, ε>0, ξ is a limit ordinal, K0⊂BY0∗, K1⊂BY1∗ are weak∗-compact, and M⊂[0,ξ) is cofinal in [0,ξ). Then
[TABLE]
and
[TABLE]
Proof.
Define j:B(Y0⊕1Y1)∗→B(Y0⊗^εY1)∗ by j(y0∗,y1∗)=y0∗⊗y1∗. Note that j is weak∗-weak∗ continuous. We prove the first containment, with the second containment following by symmetry. Assume u∗∈∩ζ∈M[⟨K0⟩A0,εζ,K1] and for each ζ∈M, fix y0∗,ζ∈⟨K0⟩A0,εζ and y1∗,ζ∈K1 such that u∗=y0∗,ζ⊗y1∗,ζ=j(y0∗,ζ,y1∗,ζ). Now fix
[TABLE]
Since j is weak∗-weak∗ continuous, j∣{(y0∗,γ,y1∗,γ):ζ⩽γ∈M}weak∗≡u∗ and u∗=y0∗⊗y1∗∈[⟨K0⟩A0,εξ,K1].
∎
Lemma 7.9**.**
Let A0:X0→Y0, A1:X1→Y1 be non-zero operators, R=max{∥A0∥,∥A1∥}. Let J be a finite set and suppose that for each j∈J, K0,j⊂BY0∗ is a weak∗-compact set and K1,j⊂BY1∗ is a weak∗-compact set.
Then for any ε>0, any ordinal ξ, and any n∈N,
[TABLE]
Proof.
As usual, we will work by induction on Ord×N with its lexicographical ordering. Assume u^{*}\in\Bigl{\langle}\bigcup_{j\in J}[K_{0,j},K_{1,j}]\Bigr{\rangle}_{A_{0}\otimes A_{1},\varepsilon}. This means there exists a net (y0,λ∗⊗y1,λ∗)λ∈⋃j∈J[K0,j,K1,j] converging weak∗ to u∗ and such that ∥(A0⊗A1)∗u∗−(A0⊗A1)∗y0,λ∗⊗y1,λ∗∥>ε/2 for all λ. By passing to subnets, we may suppose there exists j∈J such that y0,λ∗∈K0,j and y1,λ∗∈K1,j for all λ. By passing to a further subnet, we may assume y0,λ∗weak∗→y0∗∈K0,j and y1,λ∗weak∗→y1∗∈K1,j. Then u∗=y0∗⊗y1∗. By Remark 7.4 and by passing to a subnet once more and swithcing A0 and A1 if necessary, we may assume ∥A0∗y0,λ∗−A0∗y0∗∥>ε/4R for all λ. This shows that u∗∈[⟨K0,j⟩A0,ε/4R1,⟨K1,j⟩A1,ε/4R0]. This finishes the (ξ,n)=(0,1) case.
Now assume ξ is a limit ordinal and the claim holds for every ζ<ξ. Fix u^{*}\in\Bigl{\langle}\bigcup_{j\in J}[K_{0,j},K_{1,j}]\Bigr{\rangle}_{A_{0}\otimes A_{1},\varepsilon}^{\omega^{\xi}}. For every ζ<ξ, there exist jζ∈J and nζ∈{0,1} such that u∗∈[⟨K0,jζ⟩A0,ε/4Rωζnζ,⟨K1,jζ⟩A1,ε/4Rωζ(1−nj)]. There exist a cofinal subset M of [0,ξ), j∈J, and n∈{0,1} such that jζ=j and nζ=n for all ζ∈M. It then follows from Lemma 7.8 that u∗∈[⟨K0,j⟩A0,ε/4Rωξn,⟨K1,j⟩A1,ε/4Rωξ(1−n)], which yields the (ξ,1), ξ a limit case.
Now assume that for some ordinal ξ and every n∈N, the claim holds for (ξ,n). Then if u^{*}\in\Bigl{\langle}\bigcup_{j\in J}[K_{0,j},K_{1,j}]\Bigr{\rangle}_{A_{0}\otimes A_{1},\varepsilon}^{\omega^{\xi+1}}, for each n∈N,
[TABLE]
Thus for every n∈N, we may fix jn∈J and kn∈{0,1} such that
[TABLE]
Then there exist a cofinal subset M of N, j∈J, and k∈{0,1} such that jn=j and kn=k for all n∈M. By Lemma 7.8,
[TABLE]
if k=1 and
[TABLE]
if k=0.
Now assume that for some ordinal ξ some n∈N, and every 1⩽k⩽n, we have the result for the pair (ξ,k). Then
[TABLE]
∎
Proof of Proposition 5.6.
We recall the progress we had made prior to the statement of Proposition 5.6. We have u∈BY0⊗^εY1, (ud∘d′(s))s∈Γξ,1.D⊂8RσBX0⊗^εX1, (y0,e∘e′(t)∗)t∈MAX(Γξ,1.D)⊂BY0∗, (y1,e∘e′(t)∗)t∈MAX(Γξ,1.D)⊂BY1∗, α,β,δ such that β−2δ>0, (ud∘d′(s))s∈Γξ,1.D is weakly null, ∣α−Re y0,e∘e′(t)∗⊗y1,e∘e′(t)∗(u)∣⩽δ for all t∈MAX(Γξ,1.D), and for each (s,t)∈Π(Γξ,1.D), ∣β−Re y0,e∘e′(t)∗⊗y1,e∘e′(t)∗(A0⊗A1(σ8Rud∘d′(s)))∣⩽δ. Let
[TABLE]
and note that, by Lemma 7.7 applied with γ=β−δ and zt=σ8Rud∘d′(t), ⟨K⟩A0⊗A1,β−2δωξ=∅. Fix u∗∈⟨K⟩A0⊗A1,β−2δωξ and note that
[TABLE]
By Lemma 7.6 and Proposition 7.5 applied with c=8Rβ−2δ⩾τ,
[TABLE]
and ∥u∗∥⩽1−σ(8Rβ−2β). Since u∗∈K, ∣α−Re u∗(u)∣⩽δ, whence α⩽δ+Re u∗(u)⩽1+δ+σ(8Rβ−2δ).
∎