The Szlenk index of Lp(X) and Ap
Ryan M. Causey
Abstract.
Given a Banach space X, a w∗-compact subset of X∗, and 1<p<∞, we provide an optimal relationship between the Szlenk index of K and the Szlenk index of an associated subset of Lp(X)∗. As an application, given a Banach space X, we prove an optimal estimate of the Szlenk index of Lp(X) in terms of the Szlenk index of X. This extends a result of Hájek and Schlumprecht to uncountable ordinals. More generally, given an operator A:X→Y, we provide an estimate of the Szlenk index of the “pointwise A” operator Ap:Lp(X)→Lp(Y) in terms of the Szlenk index of A.
1. Introduction
Throughout this work, X will be a fixed Banach space and K⊂X∗ will be a w∗-compact, non-empty subset. For 1<p<∞, we let Kp denote the w∗-closure in Lp(X)∗ of all functions of the form gh∈Lq(X∗)⊂Lp(X)∗, where g:[0,1]→K is simple and Lebesgue measurable, and h∈BLq. Recall that these functions act on Lp(X) by ⟨gh,f⟩=∫01⟨g(ϖ),f(ϖ)⟩h(ϖ)dϖ for f∈Lp(X). Note that if R⩾0 is such that K⊂RBX∗, Kp⊂RBLp(X)∗, so that Kp is also w∗-compact. If K=BX∗, Kp=BLp(X)∗ by the Hahn-Banach theorem. If A:X→Y is an operator, then there exists a “pointwise A” operator Ap:Lp(X)→Lp(Y) given by (Apf)(ϖ)=A(f(ϖ)) for all ϖ∈[0,1]. Then if K=A∗BY∗, Kp=(Ap)∗BLp(Y)∗, which follows from the Hahn-Banach theorem. Thus it is natural to examine what relationship exists between K and Kp. In particular, one may ask what relationship exists between the Szlenk indices of these sets. To that end, we obtain the optimal relationship. In what follows, ω denotes the first infinite ordinal.
Theorem 1**.**
Fix 1<p<∞. Suppose that ξ is an ordinal such that Sz(K)⩽ωξ. Then Sz(Kp)⩽ω1+ξ. If K is convex, Sz(Kp)⩽ωSz(K). If K is convex and Sz(K)⩾ωω, Sz(K)=Sz(Kp).
Using the facts stated in the introduction that Kp=(Ap)∗BLp(Y)∗ if K=A∗BY∗, we immediately deduce the following from Theorem 1.
Corollary 2**.**
Fix 1<p<∞. If A:X→Y is an operator and K=A∗BY∗, then Sz(Ap)⩽ωSz(A), and if Sz(A)⩾ωω, Sz(Ap)=Sz(A). In particular, Ap is Asplund if and only if A is.
Applying Corollary 2 to the identity of a Banach space, we extend the result of Hájek and Schlumprecht from [9] to uncountable ordinals.
We recall that K is said to be w∗-fragmentable if for any non-empty subset L of K and any ε>0, there exists a w∗-open subset U of X∗ such that L∩U=∅ and diam(L∩U)<ε. We recall that K is w∗-dentable if for any non-empty subset L of K and any ε>0, there exists a w∗-open slice S of X∗ such that L∩U=∅ and diam(L∩S)<ε. We recall that a w∗-open slice is a subset of X∗ of the form {x∗∈X∗:Re x∗(x)>a} for some x∈X and a∈R. As mentioned in [6], a consequence of Corollary 2 is that if Sz(K)⩽ωξ, then Sz(K)⩽Dz(K)⩽ω1+ξ, where Dz(K) denotes the w∗-dentability index of K. Thus Corollary 2 implies that K is w∗-dentable if and only if it is w∗-fragmentable.
In addition to considering the Szlenk index of a set, one may consider the ξ-Szlenk power type pξ(L) of the set L, which is important in ξ-asymptotically uniformly smooth renormings of Banach spaces and operators. The concept of a ξ-asymptotically uniformly smooth operator was introduced in [7], and further sharp renorming results regarding the ξ-Szlenk power type of an operator were established in [5]. To that end, we have the following.
Theorem 3**.**
For any ordinal ξ and any 1<p<∞, if 1/p+1/q=1, p1+ξ(Kp)⩽max{q,pξ(K)}.
In the case that ξ⩾ω and pξ(K)⩽p, pξ(K)=pξ(Kp), in showing that Theorem 3 is sharp in some cases.
The author wishes to thank P.A.H. Brooker, P. Hájek, N. Holt, and Th. Schlumprecht for helpful remarks during the preparation of this work.
2. Lp(X), Trees, Szlenk index, games
2.1. Trees, Γξ,n, Pξ,n, and stablization results
Given a set Λ, we let Λ<N denote the finite, non-empty sequences in Λ. Given two members s,t of Λ<N, we let s⌢t denote the concatenation of s and t, ∣s∣ denotes the length of s, s⪯t means s is an initial segment of t, and s∣i denotes the initial segment of s having length i. Given t∈Λ<N, we let [⪯t]={s∈Λ<N:s⪯t}.
Any subset T of Λ<N which contains all non-empty initial segments of its members will be called a B-tree. We define by transfinite induction the derivedB* trees* of T. We let MAX(T′) denote the ⪯-maximal members of T and T′=T∖MAX(T). We then define T0=T, Tξ+1=(Tξ)′, and if ξ is a limit ordinal, Tξ=∩γ<ξTγ. We let o(T) denote the smallest ordinal ξ such that Tξ=∅, provided such an ordinal exists. If no such ordinal exists, we write o(T)=∞. We say T is well-founded if o(T) is an ordinal, and T is ill-founded if o(T)=∞. For convenience, we agree to the convention that if ξ is an ordinal ξ<∞, and that ω∞=∞.
Given a B-tree T and a Banach space Y, we let T.Y={(ζi,Zi)i=1k:(ζi)i=1k∈T,Zi∈codim(Y)}, where codim(Y) denotes the closed subspaces of Y having finite codimension in Y. We let C denote the norm compact subsets of BX and
[TABLE]
We note that T.Y and T.X.C are B-trees. Furthermore, for any ordinal γ, (T.Y)γ=Tγ.Y and (T.X.C)γ=Tγ.X.C. In particular, T.Y and T.X.C have the same order as T.
Given a B-tree T, a Banach space Y, and a collection (xt)t∈T.Y⊂Y, we say (xt)t∈T.Y is normally weakly null provided that for any t=(ζi,Zi)i=1k∈T.Y, xt∈Zk. Given another B-tree S and a function σ:S.Y→T.Y, we say σ is a pruning provided that for every s,s1∈S.Y with s≺s1, σ(s)≺σ(s1), and if s1=s⌢(ζ,Z) and σ(s1)=t⌢(μ,W) for some t∈T.Y, W⩽Z. If σ:S.Y→T.Y is a pruning and τ:MAX(S.Y)→MAX(T.Y) is such that for every s∈MAX(S.Y), σ(s)⪯τ(s), we say the pair (σ,τ) is an extended pruning, and denote this by (σ,τ):S.Y→T.Y.
For every ξ∈N and n∈N, a B-tree Γξ,n was defined in [4] so that o(Γξ,n)=ωξn. Furthermore, a function Pξ:Γξ→[0,1] was defined so that for every t∈MAX(Γξ), ∑s⪯tPξ(s)=1. Furthermore, Γξ+1 is the disjoint union of Γξ,n, n∈N. For convenience, we define Pξ,n:Γξ,n→[0,n] by Pξ,n(s)=nPξ+1(s). It follows from the definitions that Γξ,1=Γξ and Pξ,1=Pξ. For every ξ and every n∈N, there exist disjoint subsets Λξ,n,1, …, Λξ,n,n of Γξ,n such that Γξ,n=∪i=1nΛξ,n,i. It follows from the facts regarding Pξ+1 discussed in [4] that, with these definitions, for every ordinal ξ, every n∈N, every 1⩽i⩽n, and every t∈MAX(Γξ,n), ∑Λξ,n,i∋s⪯tPξ,n(s)=1. For any Banach space Y, we may define Pξ,n on Γξ,n.Y and Γξ,n.X.C by letting
[TABLE]
and
[TABLE]
We say an extended pruning (σ,τ):Γξ,n.X→Γξ,n.X is level preserving provided that for every 1⩽i⩽n, σ(Λξ,n,i)⊂Λξ,n,i.
The following theorem collects results from Theorem 3.3, Propositions 3.2, 3.3, and Lemma 3.4 of [5].
Theorem 4**.**
Suppose ξ is an ordinal and n is a natural number.
- (i)
If f:Π(Γξ.n.X)→R is bounded and λ∈R is such that
[TABLE]
then there exist a level preserving extended pruning (σ,τ):Γξ,n.X→Γξ,n.X and real numbers b1,…,bn such that λ<∑i=1nbi and for every 1⩽i⩽n and every Λξ,n,i∋s⪯t∈MAX(Γξ,n.X), bi⩽f(σ(s),τ(t)).
2. (ii)
If (M,d) is a compact metric space and f:Π(Γξ,n.X)→M is any function, then for any δ>0, there exist x1,…,xn∈M and a level preserving extended pruning (σ,τ):Γξ,n.X→Γξ,n.X such that for every 1⩽i⩽n and every Λξ,n,i∋s⪯t∈MAX(Γξ,n.X), d(xi,f(σ(s),τ(t)))<δ.
3. (iii)
If F is a finite set and f:MAX(Γξ,n.X)→F is any function, there exists a level preserving extended pruning (σ,τ):Γξ,n.X→Γξ,n.X such that f∘τ∣MAX(Γξ,n.X) is constant.
4. (iv)
For any natural numbers k1<…<kr⩽n, there exists an extended pruning (σ,τ):Γξ,r.X→Γξ,n.X such that for every 1⩽i⩽r, σ(Λξ,n,i)⊂Λξ,n,ki.
2.2. The Szlenk index, Szlenk power type
Given a w∗-compact subset L of X∗ and ε>0, we let sε(K) denote the set consisting of those x∗∈L such that for every w∗-neighborhood V of x∗, diam(L∩V)>ε. We define the transfinite derivations
[TABLE]
[TABLE]
and if ξ is a limit ordinal,
[TABLE]
If there exists an ordinal ξ such that sεξ(L)=∅, we let Sz(L,ε) be the minimum such ordinal. Otherwise we write Sz(L,ε)=∞. Since sεξ(L) is w∗-compact, we deduce that Sz(L,ε) cannot be a limit ordinal. We agree to the conventions that ω∞=∞ and ξ<∞ for any ordinal ξ. We let Sz(L)=supε>0Sz(L,ε). If B:Z→W is an operator, we let Sz(B,ε)=Sz(B∗BW∗,ε), Sz(B)=Sz(B∗BW∗). If Z is a Banach space, Sz(Z,ε)=Sz(IZ,ε) and Sz(Z)=Sz(IZ).
We recall that a set L⊂X∗ is called w∗-fragmentable if for any ε>0 and any w∗-compact, non-empty subset M of L, sε(M)⊊M. This is equivalent to Sz(L)<∞. We say an operator B:Z→W is Asplund if B∗BW∗ is w∗-fragmentable, which happens if and only if Sz(B)<∞. We say a Banach space Z is Asplund if IZ is Asplund. These are not the original definitions of Asplund spaces and operators, but they are equivalent to the original definitions (see [2]).
If Sz(K)⩽ωξ+1, then for any ε>0, Sz(K,ε)⩽ωξn for some n∈N. We let Szξ(K,ε) be the smallest n∈N such that Sz(K,ε)⩽ωξn. We define the ξ-Szlenk power type pξ(K) of K by
[TABLE]
This value need not be finite. By convention, we let pξ(K)=∞ if Sz(K)>ωξ+1. We let pξ(A)=pξ(A∗BY∗) and pξ(X)=pξ(BX∗). The quantities pξ(X), pξ(A) are important for the renorming theorem of ξ-asymptotically uniformly smooth norms with power type modulus.
Given a w∗-compact subset L of X∗ and ε>0, we let HεL denote the set of Cartesian products ∏i=1nCi such that Ci∈C for each 1⩽i⩽n and such that there exist (xi)i=1n∈∏i=1nCi and x∗∈K such that for each 1⩽i⩽n, Re x∗(xi)⩾ε.
2.3. The Szlenk index of Kp
Recall that for 1<p<∞, Lp(X) denotes the space of equivalence classes of Bochner integrable functions f:[0,1]→X such that ∫∥f∥p<∞, where [0,1] is endowed with its Lebesgue measure. Recall also that if 1<q<∞, Lq(X∗) is isometrically included in Lp(X)∗ by the action
[TABLE]
for g∈Lq(X∗). We also recall that if ϱ:X→R is any Lipschitz function, then for any f∈Lp(X), ϱ∘f∈Lp.
We note that the Szlenk index and the ξ Szlenk power type of K are unchanged by scaling K by a positive scalar or by replacing K with its balanced hull. Moreover, for a positive scalar c, (cK)p=cKp, which has the same Szlenk index and ξ-Szlenk power type as Kp. If TK is the balanced hull of K, Kp⊂(TK)p and Sz(K)=Sz(TK) ([4, Lemma 2.2]) so that Theorem 1, Corollary 2, and Theorem 3 hold in general if they hold under the assumption that K⊂BX∗ is balanced. Therefore we can and do assume throughout that K⊂BX∗ and K is balanced.
Let ϱ:X→R be given by ϱ(x)=maxx∗∈KRe x∗(x). Since we have assumed K is balanced, ϱ(x)=maxx∗∈K∣x∗(x)∣. It is easy to see that for any 1<p<∞ and any f∈Lp(X), ∥ϱ(f)∥Lp=maxf∗∈KpRe f∗(f). Combining this fact with [5, Corollary 2.4] and the proof of that corollary, we obtain the following.
Theorem 5**.**
Fix 1<p,α<∞.
- (i)
If for every B-tree T with o(T)=ω1+ξ and every normally weakly null (ft)t∈T.Lp(X)⊂BLp(X),
[TABLE]
then Sz(Kp)⩽ω1+ξ.
2. (ii)
If there exists a constant C such that for every n∈N, every B-tree T with o(T)=ω1+ξn, and every normally weakly null collection (ft)t∈T.Lp(X)⊂BLp(X),
[TABLE]
then p1+ξ(Kp)⩽α.
Proposition 6**.**
Suppose T is a non-empty B-tree. Suppose also that (Cs)s∈T.X⊂C is fixed and for s=(ζi,Zi)i=1k∈T.X, let λ(s)=Zk∩Cs. Suppose that S is a non-empty, well-founded B-tree and θ:S.X→T.X is a pruning. For s∈S.X, let s(s)=∏i=1∣s∣λ(θ(s∣i)). If ε>0 is such that for every t∈S.X, s(s)∈HεK=∅, then for any 0<δ<ε, any 0⩽γ<o(S), and any s∈Sγ.X, s(s)∈Hεsδγ(K)=∅. Moreover, for any 0<δ<ε, Sz(K,δ)>o(S).
Proof.
We induct on γ. The base case is the hypothesis. Assume γ+1<o(S) and the result holds for γ. Assume s∈Sγ+1.X, which means there exists ζ such that s⌢(ζ,Z)∈Sγ.X for all Z∈codim(X). Then for every Z∈codim(X), there exists Z⩾WZ∈codim(X) such that s(s⌢(ζ,Z))⊂s(s)×BWZ. From this and the inductive hypothesis, for every Z∈codim(X), we fix xZ∈BWZ, (xiZ)i=1∣s∣∈s(s), and xZ∗∈sδγ(K) such that Re xZ∗(xZ)⩾ε and Re xZ∗(xiZ)⩾ε for each 1⩽i⩽∣s∣. By compactness of s(s)×K with the product topology, where λ(θ(s∣i)) has its norm topology and K has its w∗-topology,
[TABLE]
Fix (x1,…,x∣s∣,x∗) lying in this intersection. Obviously x∗∈sδγ(K). Moreover, for any w∗-neighborhood V of x∗, there exists Z∈codim(X) such that ker(x∗)⊂Z and xZ∗∈V, whence
[TABLE]
This implies x∗∈sδγ+1(K). It is obvious that Re x∗(xi)⩾ε for all 1⩽i⩽∣s∣. This shows that s(s)∈Hεsδγ+1(K) and completes the successor case.
Finally, assume γ<o(S) is a limit ordinal and the result holds for all ordinals less than γ. Fix s∈Sγ.X and let s(s)×K be topologized as in the successor case. By the inductive hypothesis, for all β<γ, there exists (x1β,…,x∣s∣β,xβ∗)∈s(s)×K such that xβ∗∈sεβ(K) and for all 1⩽i⩽∣s∣, Re xβ∗(xiβ)⩾ε. By compactness of \bigl{(}\prod_{i=1}^{|s|}\lambda(\theta(s|_{i}))\bigr{)}\times K,
[TABLE]
Clearly any (x1,…,x∣s∣,x∗) lying in this intersection is such that x∗∈sδγ(K) and for any 1⩽i⩽∣s∣, Re x∗(xi)⩾ε. This shows that s(s)∈Hεsδγ(K) and completes the induction.
We have shown that for any 0<δ<ε, Sz(K,δ)⩾o(S). If o(S) is a limit ordinal, we deduce that Sz(K,δ)>o(S) since Sz(K,δ) cannot be a limit ordinal. If o(S) is a successor, say o(S)=ξ+1, then there exists a length 1 sequence (ζ)∈Sξ. For every Z∈codim(X), s((ζ,Z))=WZ∩Cθ((ζ,Z)) for some W⊂Z. The first part of the proof yields that for each Z∈codim(X), there exists xZ∈WZ∩Cθ((ζ,Z))⊂WZ∩BX and some xZ∗∈sζξ(K) such that Re xZ∗(xZ)⩾ε. Arguing as in the successor case, we deduce that any w∗-limit of a subnet of (xZ∗)Z∈codim(X) lies in sδξ+1(K), whence Sz(K,δ)>ξ+1=o(S).
∎
2.4. Games
Suppose T⊂Λ<N is a well-founded, non-empty B-tree and E⊂MAX(T.X.C) is some subset. We define the game on T.X.C with target set E. Player I first chooses (ζ1,Z1)∈Λ×codim(X) such that (ζ)∈T and Player II then chooses C1∈C. Assuming (ζi,Zi)i=1n∈T.X and C1,…,Cn∈C have been chosen, the game terminates if (ζi,Zi)i=1n∈MAX(T.X). Otherwise Player I chooses (ζn+1,Zn+1)∈Λ×codim(X) such that (ζi)i=1n+1∈T and Player II chooses Cn+1∈C. Since T is well-founded, this game must terminate after finitely many steps. Suppose that the resulting choices are (ζi,Zi)i=1n and C1,…,Cn∈C. We say that Player II wins if (ζi,Zi,Ci)i=1n∈E, and Player I wins otherwise.
A strategy for Player I for the game on T.X.C with target set E is a function ψ:T′.X.C∪{∅}→Λ×codim(X) such that if ψ((ζi,Zi,Ci)i=1n−1)=(ζn,Zn), (ζi)i=1n∈T. We say ψ is a winning strategy for Player I provided that for any sequence (ζi,Zi,Ci)i=1n∈MAX(T.X.C) such that (ζi,Zi)=ψ((ζj,Zj,Cj)j=1i−1) for every 1⩽i⩽n, (ζi,Zi,Ci)i=1n∈/E.
A strategy for Player II for the game on T.X.C with target set E is a function ψ defined on the set
[TABLE]
and taking values in C. We say ψ is a winning strategy for Player II provided that for any sequence (ζi,Zi,Ci)i=1n∈MAX(T.X.C) such that Ci=ψ((ζj,Zj,Cj)j=1i−1,(ζi,Zi)) for all 1⩽i⩽n, (ζi,Zi,Ci)i=1n∈E.
Proposition 7**.**
[6, Proposition 3.1]** For any non-empty, well-founded B-tree T and any E⊂T.X.C, either Player I or Player II has a winning strategy for the game on T.X.C with target set E.
Proposition 8**.**
Suppose that Player II has a winning strategy for a game on T.X.C with target set E. Then there exists (Cs)s∈T.X⊂C such that for every t=(ζi,Zi)i=1k∈MAX(T.X), (ζi,Zi,Ct∣i)i=1k∈E.
Proof.
Fix a winning strategy ψ for Player II in the game. We define Cs by induction on ∣s∣. We let C(ζ,Z)=ψ(∅,(ζ,Z)). If ∣s∣=k+1, Cs∣i has been defined for every 1⩽i⩽k, and s=s∣k⌢(ζ,Z), we let Cs=ψ(s∣k,(ζ,Z)).
∎
For the next proposition, if h∈Lp(X) is a simple function, we let h be the function in Lp(X) such that h(ϖ)=0 if h(ϖ)=0 and h(ϖ)=h(ϖ)/∥h(ϖ)∥ otherwise.
Proposition 9**.**
Let ξ be an ordinal, n a natural number, and let T be a B-tree with o(T)⩾ω1+ξn. If ψ is a strategy for Player I for some game on Γξ,n.X.C, then for any 1<p<∞, any δ>0, and any normally weakly null (ft)t∈T.Lp(X)⊂BLp(X), there exist s=(ζi,Zi)i=1k∈MAX(Γξ,n.X), ∅=t0≺t1≺…≺tk∈T.Lp(X), gi∈co(fu:ti−1≺u⪯ti), hi∈BLp(X), and Ci∈C such that for every 1⩽i⩽k,
- (i)
hi* is simple,*
2. (ii)
range(hi)=Ci⊂BZi,
3. (iii)
∥gi−hi∥Lp(X)<δ,
4. (iv)
(ζi,Zi)=ψ((ζj,Zj,Cj)j=1i−1).
Remark 10**.**
For a B-tree S on Λ and s∈S, we let S(s) denote those non-empty sequences u∈Λ<N such that s⌢u∈S. An easy induction argument yields that for any ordinals ξ,ζ, Sξ(s)=(S(s))ξ for any ordinal ξ. From this it follows that s∈Sξ if and only if o(S(s))⩾ξ. Furthermore, another easy induction yields that if (Sξ)ζ=Sξ+ζ, from which it follows that if o(S)⩾ξ+ζ, o(Sξ)⩾ζ. Therefore if s∈Sξ+ω, o(Sξ(s))⩾ω.
Proof of Proposition 9.
We first note that if Z∈codim(X), Lp(X)/Lp(Z) is either the zero vector space or isomorphic to Lp, and therefore has Szlenk index not exceeding ω. As explained in [6], this means that for any B-tree T with o(T)⩾ω, any δ>0, and any normally weakly null (ft)t∈T.Lp(X)⊂BLp(X), there exist t∈T.Lp(X), g∈co(fs:∅≺s⪯t), and h∈BLp(Z) such that ∥g−h∥Lp(X)<δ. Moreover, by the density of simple functions, we may assume this h is simple.
Let ψ be a strategy for Player I for a game on Γξ,n.X.C. Let T be a B-tree with o(T)=ω1+ξn and define γ:Γξ,n.X∪{∅}→[0,ωξn] by letting γ(t)=max{μ⩽ωξn:t∈(Γξ,n.X)μ} for t∈Γξ,n.X and γ(∅)=ωξn. Let s0=t0=∅. Now assume that for some k∈N and all 1⩽i<k, si∈Γξ,n.X, ζi∈[0,ωξn], Zi∈codim(X), ti∈T.Lp(X), gi,hi∈BLp(X), and Ci∈C have been chosen such that for all 1⩽i<k,
- (i)
hi is simple,
2. (ii)
si=(ζj,Zj)j=1i,
3. (iii)
t0≺t1≺…≺tk−1,
4. (iv)
ti∈(T.Lp(X))ωγ(si),
5. (v)
(ζi,Zi)=ψ((ζj,Zj,Cj)j=1i−1),
6. (vi)
gi∈co(fu:ti−1≺u⪯ti),
7. (vii)
∥gi−hi∥Lp(X)<δ,
8. (viii)
range(hi)=Ci⊂BZi.
If sk−1 is maximal in Γξ,n.X, we let s=sk−1, and one easily checks that the conclusions are satisfied. Otherwise let (ζk,Zk)=ψ((ζj,Zj,Cj)j=1k−1) and sk=sk−1⌢(ζk,Zk). Let uk−1 be the sequence of first members of the pairs of tk−1 and let U denote the proper extensions of uk−1 in Tωγ(sk). Then (ftk−1⌢u)u∈U.Lp(X)⊂BLp(X) is normally weakly null and o(U)⩾ω by the remark preceding the proof, so that the previous paragraph yields the existence of some u′∈U.Lp(X), gk∈co(fu:tk−1≺u⪯tk−1⌢u′), and some simple function hk∈Lp(Zk) such that ∥gk−hk∥Lp(X)<δ. Let tk=tk−1⌢u′. In order to apply the remark before the proof, we note that since sk−1≺sk, γ(sk−1)⩾γ(sk)+1. Since
[TABLE]
the remark preceding the proof applies. Note that Ck:=range(hk)⊂BZk. This completes the recursive construction. Since Γξ,n.X is well-founded, eventually this process terminates. The resulting s=(ζi,Zi)i=1k∈MAX(Γξ,n.X) clearly satisfies the conclusions.
∎
3. Definition of an associated space and two games
3.1. The associated space and its properties
If E is a vector space with seminorm ∥⋅∥, we say a sequence (ei)i=1n in E is 1-unconditional provided that for any scalars (ai)i=1n and any (εi)i=1n∈{±1}n, ∥∑i=1nεiaiei∥=∥∑i=1naiei∥. Recall that for 1<p<∞, a vector space E with seminorm ∥⋅∥ which is spanned by the 1-unconditional basis (ei)i=1n is called p-concave provided there exists a constant C such that for any (fi)i=1n⊂Lp,
[TABLE]
The smallest such constant C is denoted by M(p)(E).
Given x∈span(ei:1⩽i⩽n), where (ei)i=1n is a Hamel basis for the seminormed space E, we write x=∑i=1naiei and supp(x)={i⩽n:ai=0}. We say the vectors x1,…,xn∈span(ei:1⩽i⩽n) are disjointly supported if the sets supp(x1), …, supp(xn) are pairwise disjoint.
For 1<β<∞, we say that an unconditional Hamel basis (ei)i=1n for a seminormed space E satisfies an 1-lower ℓβ estimate provided that for any m∈N and any disjointly supported elements (xi)i=1m⊂E,
[TABLE]
Theorem 11**.**
[8, Theorem 1.f.7]** Fix 1<β<p<∞. There exists a constant C′=C′(β,p) such that if (ei)i=1n is a 1-unconditional basis for the seminormed space E which satisfies a 1-lower ℓβ estimate, then E is p-concave and M(p)(E)⩽C′.
For the remainder of this section, T is a fixed, non-empty B-tree.
For a non-empty set J, we let c00(J) be the span of the canonical Hamel basis (ej)j∈J in the space of scalar-valued functions on J, where ej is the indicator of the singleton {j}. We let ej∗ denote the coordinate functional to ej. Given x∈c00(J), we may write x=∑j∈Jajej. Then we define ∣x∣ to be ∑j∈J∣aj∣ej. A suppression projection is an operator P from span(ej∗:j∈J) into itself such that there exists a subset F of J such that P∑j∈Jajej∗=∑j∈Fajej∗.
For 0<ϕ<θ<1, let
[TABLE]
For 0<ϕ<θ<1 and 1<α<∞, let
[TABLE]
Note that the set Mθ,ϕ,α,T is closed under suppression projections.
We define the seminorm ∥⋅∥θ,ϕ,α,T on c00(T.X.C) by
[TABLE]
Claim 12**.**
Fix 1<α<∞ and 0<ϕ<θ<1. For any t∈T.X.C, (et∣i)i=1∣t∣ is 1-unconditional and satisfies a 1-lower ℓβ estimate in its span, where 1/α+1/β=1.
Proof.
Note that 1-unconditionality is obvious. Fix x1,…,xn∈span(et∣i:1⩽i⩽∣t∣) with disjoint supports. That is, there exist pairwise disjoint subsets S1,…,Sn of {1,…,∣t∣} such that xi∈span(et∣j:j∈Si). Then there exist g1,…,gn∈Mθ,ϕ,α,T such that for each 1⩽i⩽n, gi(∣xi∣)=∥xi∥θ,ϕ,α,T. Since Mθ,ϕ,α,T is closed under suppression projections, we may assume that supp(gi)⊂Si for each 1⩽i⩽n. Then if (ai)i=1n are such that ∑i=1naiα=1, ai⩾0, and ∑i=1nai∥xi∥θ,ϕ,α,T=(∑i=1n∥xi∥θ,ϕ,α,Tβ)1/β, g:=∑i=1naigi∈Mθ,ϕ,α,T and
[TABLE]
∎
Claim 13**.**
Fix 1<α<∞ and 0<ϕ<θ<1. For any t=(ζi,Zi,Ci)i=1k∈T.X.C, any sequence (xi)i=1k∈∏i=1kZi∩Ci, and any sequence (ai)i=1k of non-negative scalars,
[TABLE]
Proof.
We recall that if C∈C, C⊂BX by the definition of C. With t, (xi)i=1k∈∏i=1kZi∩Ci, and (ai)i=1k as in the statement, fix x∗∈K such that Re x∗(∑i=1kaixi)=ϱ(∑i=1kaixi). For all j∈N, let Bj={i⩽k:Re x∗(xi)∈(ϕj,ϕj−1]}. Note that for every j∈N, θj∑i∈Bjet∣i∗∈Nθj,ϕj,T, so
[TABLE]
Then
[TABLE]
∎
Corollary 14**.**
Fix 1<p,α,β<∞ with 1/α+1/β=1 and β<p. Let C′=C′(β,p) be the constant from Theorem 11. Suppose that ξ is an ordinal, n is a natural number, ε>0, and 0<ϕ<θ<1 are such that Player I has a winning strategy in the game with target set
[TABLE]
Then for any B-tree T with o(T)⩾ω1+ξn and any normally weakly null (ft)t∈T.Lp(X)⊂BLp(X),
[TABLE]
Proof.
Recall for the proof that for a simple function h∈Lp(X), h is the function in Lp(X) such that h(ϖ)=0 if h(ϖ)=0 and h(ϖ)=h(ϖ)/∥h(ϖ)∥ otherwise.
Fix a winning strategy ψ for Player I in the game with the indicated target set. Fix δ>0. By Proposition 9, there exist s=(ζi,Zi)i=1k∈MAX(Γξ,n.X), ∅=t0≺…≺tk, gi∈co(fu:ti−1≺u⪯ti), simple functions hi∈BLp(X), and Ci∈C such that ∥gi−hi∥Lp(X)<δ, range(hi)=Ci⊂BZi, and (ζi,Zi)=ψ((ζj,Zj,Cj)j=1i−1). This means that for any ϖ∈[0,1], (hi(ϖ))i=1k∈∏i=1kZi∩Ci, whence by Claim 13, for any non-negative scalars (ai)i=1k,
[TABLE]
Since by Claim 13 (eu)u⪯s satisfies a lower ℓβ estimate in its span, we deduce that
[TABLE]
Here we have used 1-unconditionality, ∥hi∥Lp(X)⩽1 for each 1⩽i⩽k, and the fact that since ψ is a winning strategy for Player I,
[TABLE]
Let g=n−1∑u⪯sPξ,n(u)gi∈co(fu:u⪯tk) and h=n−1∑u⪯sPξ,n(u)hi. Since ϱ is 1-Lipschitz, it follows that ∥ϱ(g)−ϱ(g)∥Lp⩽∥g−h∥Lp(X)<δ, so that
[TABLE]
Since δ>0 was arbitrary, we are done.
∎
3.2. Particular games on Γξ,n.X.C
The statement of Proposition 6 is notationally cumbersome. We isolate the following result as a way of using Proposition 6.
Lemma 15**.**
Fix 0<ϕ<θ<1. Suppose that ξ is an ordinal, m,n are natural numbers, (Cs)s∈Γξ,n.X⊂C, and (σ,τ):Γξ,m.X→Γξ,n.X is an extended pruning. For t=(ζi,Zi)i=1k∈Γξ,n.X, let r(t)=(ζi,Zi,Ct∣i)i=1k. If ν∈N is such that for every s∈MAX(Γξ,m.X), there exists a functional hs∈∪l=1νNθi,ϕi,Γξ,n such that ∪t⪯sr(σ(t))⊂supp(hs), then Sz(K,ϕν/2)>ωξm.
Proof.
For s=(ζi,Zi)i=1k∈Γξ,n.X, let λ(s)=Zk∩Cs. For s∈Γξ,m.X, let s(s)=∏i=1∣s∣λ(σ(s∣i)).
Fix s∈MAX(Γξ,m.X) and let hs∈∪l=1νNθl,ϕl,Γξ,n be as in the statement of the lemma and fix 1⩽l⩽ν such that hs∈Nθl,ϕl,Γξ,n. We will prove that s(s)∈HϕνK. Since for any 1⩽m⩽k and any C1′,…,Ck′∈C such that ∏i=1kCi′∈HϕνK, ∏i=1mCi′∈HϕνK, this will show that for any non-empty initial segment s1 of s, s(s1)∈HϕνK. From here, an appeal to Proposition 6 will finish the proof.
Fix u=(μi,Wi,Ci)i=1∣u∣∈Γξ,n.X.C and 1⩽j1<…<jμ⩽∣u∣ such that hs=θl∑i=1μeu∣ji∗ and ∏i=1μWji∩Cji∈HϕlK. Let τ(s)=t=(ζi,Zi)i=1η. For each 1⩽i⩽∣s∣, let li=∣σ(s∣i)∣. Note that for all 1⩽i⩽∣s∣, r(σ(s∣i))=(ζj,Zj,Ct∣j)j=1li and s(s)=∏j=1∣s∣Zlj∩Ct∣lj. By hypothesis,
[TABLE]
From this it follows that there exist m1<…<m∣s∣ such that for every 1⩽i⩽∣s∣, r(σ(s∣i))=u∣jmi. Choose (xi)i=1μ∈∏i=1μWji∩Cji such that there exists x∗∈K so that Re x∗(xi)⩾ϕl for each 1⩽i⩽μ, which exists because ∏i=1μWji∩Cji∈HϕlK. Since Zli=Wjmi and Ct∣li=Cjmi, (xmi)i=1∣s∣∈∏i=1∣s∣Zli∩Ct∣li, which shows that s(s)∈HϕlK. Since l⩽ν, HϕlK⊂HϕνK, so that s(s)∈HϕνK.
∎
Lemma 16**.**
Fix 1<α<∞ and 0<ϕ<θ<1. If Sz(K)⩽ωξ, then for any ε>0, Player I has a winning strategy in the game with target set
[TABLE]
Proof.
Suppose not. Then by Proposition 8, there exist ε>0 and (Cs)s∈Γξ.X⊂C such that
[TABLE]
For s=(ζi,Zi)i=1k∈Γξ.X, let r(s)=(ζi,Zi,Cs∣i)i=1k. For every t∈MAX(Γξ.X), fix ft∈Mθ,ϕ,α,Γξ such that supp(ft)⊂[⪯r(t)] and ft(∑s⪯tPξ(s)er(s))=∥∑s⪯tPξ(s)er(s)∥θ,ϕ,α,Γξ. Define F:Π(Γξ.X)→R by letting F(s,t)=ft(er(s)). By Theorem 4, there exists an extended pruning (σ,τ):Γξ.X→Γξ.X such that
[TABLE]
Fix ν∈N such that ε>θν and for each t∈MAX(Γξ.X), write fτ(t)=∑i=1ktai,tgi,t where ai,t⩾0, ∑i=1ktai,tα⩽1, and gi,t∈∪n=1∞Nθn,ϕn,Γξ have pairwise disjoint supports. For each t∈MAX(Γξ.X), let
[TABLE]
Since ∑i=1ktai,tα⩽1, ∣Rt∣⩽⌊1/εα⌋=:k0. Note that since ε<fτ(t)(er(σ(s))) for any ∅≺s⪯t, r(σ(s))∈∪i∈Rtsupp(gi,t). We write ∑i∈Rtai,tgi,t=∑i=1ltbi,thi,t where lt⩽k0, (bi,t)i=1lt is an enumeration of (ai,t)i∈Rt, and (hi,t)i=1lt is the corresponding enumeration of (gi,t)i∈Rt. Define κ:Π(Γξ.X)→{1,…,k0} by letting κ(σ,τ) be the unique i⩽lt such that r(σ(s))∈supp(hi,t). By Theorem 4(ii), there exists an extended pruning (σ′,τ′):Γξ.X→Γξ.X and 1⩽l⩽k0 such that κ(σ′(s),τ′(t))=l for all (s,t)∈Π(Γξ.X). We now note that for any s∈MAX(Γξ.X), hl,τ′(s)∈∪i=1νNθi,ϕi,Γξ is such that
[TABLE]
and an appeal to Lemma 15 yields that Sz(K,ϕν/2)>ωξ. This contradiction finishes the proof. To see that hl,τ′(s)∈∪i=1νNθi,ϕi,Γξ, we note that if hl,τ′(s)∈Nθi,ϕi,Γξ,
[TABLE]
This shows that i⩽ν by our choice of ν.
∎
Lemma 17**.**
Fix 1<α,β<∞ and 0<ϕ<2−1/α and assume that 1/α+1/β=1. Assume that for some C⩾1 and all i∈N, Szξ(K,ϕi/2)⩽C2i. Let θ=2−1/α. Then for any n∈N and any C1>C, Player I has a winning strategy in the game with target set
[TABLE]
Proof.
Suppose not. Then for some n∈N, there exist (Cs)s∈Γξ,n.X⊂C and
[TABLE]
such that
[TABLE]
We may assume as in Lemma 16 that supp(ft)⊂[⪯r(t)] for each t∈MAX(Γξ,n.X). Then by Theorem 4(i), there exist a level preserving extended pruning (σ,τ):Γξ,n→Γξ,n and numbers, b1,…,bn such that Cn1/β<∑i=1nbi and for all 1⩽i⩽n and all Λξ,n,i∋s⪯t∈MAX(Γξ,n), fτ(t)(er(σ(s)))⩾bi. Fix δ>0 such that Cn1/β+nδ<∑i=1nbi. Let R={i⩽n:bi⩾δ}.
Sublemma 18**.**
There exist a level preserving extended pruning (σ0,τ0):Γξ,n.X→Γξ,n.X, l,w∈N, (ai)i=1l∈Bℓαl, (ki)i∈R⊂{1,…,l}, (wi)i=1l⊂{1,…,w}, and (gt)t∈MAX(Γξ,n.X)⊂Mθ,ϕ,α,Γξ,n such that
- (i)
for each t∈MAX(Γξ,n.X), ∥gt−fτ∘τ0(t)∥∞<δ,
2. (ii)
for any t∈MAX(Γξ,n.X), there exist disjointly supported functionals h1,t,…,hl,t such that hi,t∈Nθwi,ϕwi,Γξ,n and gt=∑i=1laihi,t,
3. (iii)
for i∈R and Λξ,n,i∋s⪯t∈MAX(Γξ,n.X), r(σ∘σ0(s))∈supp(hki,t),
We first finish the proof of the lemma and then return to the proof of the sublemma. Note that item (iii) of the sublemma implies that for i∈R and Λξ,n,i∋s⪯t∈MAX(Γξ,n),
[TABLE]
From this and our choice of δ we deduce that
[TABLE]
Partition R into sets R1,…,Rl, where Rj={i∈R:ki=j}, so that
[TABLE]
We claim that for each j, ∣Rj∣⩽C2wj. Indeed, suppose ∣Rj∣>C2wj for some j. By Theorem 4(iv), if Rj={r1,…,rm}, with r1<…<rm, there exists extended pruning (σ′,τ′):Γξ,m.X→Γξ,n.X such that σ′(Λξ,m,i)⊂Λξ,n,ri. We now use Lemma 15 to deduce that Szξ(K,ϕwj/2)>C2wj, which is a contradiction. Thus we deduce that ∣Rj∣⩽C2wj for each j. This means that for each 1⩽j⩽l,
[TABLE]
Then
[TABLE]
Thus we reach a contradiction.
We now return to the proof of the sublemma. First fix w∈N such that θw<δ. For each t∈MAX(Γξ,n), write fτ(t)=∑i=1ktai,tfi,t for some disjointly supported fi,t∈∪j=1∞Nθj,ϕj,Γξ,n and ai,t⩾0 such that ∑i=1ktai,tα⩽1. Let St={i⩽kt:∥ai,tfi,t∥∞⩾δ}. Note that since ∑i=1ktai,tα⩽1, ∣St∣⩽⌊1/δα⌋=:k0. As in the previous lemma, we write ∑i∈Stai,tfi,t=∑i=1ltai,t′fi,t′ for some lt⩽k0. Considering the function from MAX(Γξ,n.X) given by t↦lt∈{1,…,k0}, we use Theorem 4(iii) to obtain l∈N and a level preserving extended pruning (σ′,τ′):Γξ,n.X→Γξ,n.X such that for all t∈MAX(Γξ,n.X), lτ′(t)=l. Note that since ∥ai,τ′(t)′fi,τ′(t)′∥∞⩾δ for every 1⩽i⩽l and t∈MAX(Γξ,n), if fi,τ′(t)′∈Nθj,ϕj,Γξ,n, j⩽w. Let wi,τ′(t) be the value j∈{1,…,w} such that fi,τ′(t)′∈Nθj,ϕj,Γξ,n. By considering the map from MAX(Γξ,n.X) into Bℓαl×{1,…,w}l given by
[TABLE]
we use Theorem 4(iii) again to find another level preserving extended pruning (σ′′,τ′′):Γξ,n.X→Γξ,n.X, (ai)i=1l∈Bℓαl and (wi)i=1l⊂{1,…,w} such that for all t∈MAX(Γξ,n), ∥(ai,τ′∘τ′′(t))i=1l−(ai)i=1l∥ℓαl<δ and for all 1⩽i⩽l, fi,τ′∘τ′′(t)′∈Nθwi,ϕwi,Γξ,n. Note that for all t∈MAX(Γξ,n.X),
[TABLE]
This implies that for any i∈R and any Λξ,n,i∋s⪯t, since
[TABLE]
r(σ∘σ′∘σ′′(s))∈∪j=1lsupp(fj,τ′∘τ′′(t)′). Thus we may let κ(s,t) be the unique j∈{1,…,l} such that r(σ∘σ′∘σ′′(s))∈supp(fj,τ′∘τ′′(t)) if s∈∪i∈RΛξ,n,i, and κ(s,t)=0 otherwise. Applying Theorem 4(ii), we deduce the existence of (ki)i∈R⊂{1,…,l} and a level preserving extended pruning (σ′′′,τ′′′):Γξ,n.X→Γξ,n.X such that setting σ0=σ′∘σ′′∘σ′′′, τ0=τ′∘τ′′∘τ′′′, hi,t=fi,τ0(t)′, and gt=∑i=1laihi,t, finishes the proof.
∎
4. Proof of the main results
Proof of Theorem 1.
Let ϕ=1/3 and θ=2/3, so that θ−ϕ1=3. Fix 1<p<∞. Fix any 1<α,β<∞ such that β<p and 1/α+1/β=1. Let C′=C′(β,p) be the constant from Theorem 11. Fix ε>0. By Lemma 16, Player I has a winning strategy in the game with target set
[TABLE]
By Corollary 14, for any B-tree T with o(T)=ω1+ξ and any normally weakly null collection (ft)t∈T.Lp(X)⊂BLp(X),
[TABLE]
We deduce Sz(Kp)⩽ω1+ξ by Theorem 5(i).
It is clear that Sz(K)⩽Sz(Kp) for any 1<p<∞. If K is convex, then either Sz(K)=∞, in which case Sz(Kp)=∞=ω∞=Sz(K), or there exists an ordinal ξ such that Sz(K)=ωξ [3, Proposition 4.2]. We deduce that Sz(Kp)⩽ω1+ξ=ωSz(K) by the previous paragraph. In the case that ξ⩾ω, 1+ξ=ξ.
∎
Proof of Theorem 3.
If pξ(K)=∞, there is nothing to show, so assume pξ(K)<∞. Fix 1<p,q<∞ with 1/p+1/q=1. Fix 1<α,β,γ<∞ such that max{pξ(K),q}<γ<α and 1/α+1/β=1. Let C′=C′(β,p) be the constant from Theorem 11. Let ϕ=2−1/γ and note that supi∈NεγSzξ(K,ϕi/2)/2i<∞. By Lemma 17, with θ=2−1/α, there exists a constant C1 such that for every n∈N, Player I has a winning strategy in the game with target set
[TABLE]
By Corollary 14, for every n∈N, every B-tree T with o(T)=ω1+ξn, and every normally weakly null (ft)t∈T.Lp(X)⊂BLp(X),
[TABLE]
By Theorem 5(ii), p1+ξ(Kp)⩽α. Since α>max{pξ(K),q} was arbitrary, we deduce that p1+ξ(Kp)⩽max{pξ(K),q}.
∎