• No results found

Convex-transitivity and function spaces

N/A
N/A
Protected

Academic year: 2021

Share "Convex-transitivity and function spaces"

Copied!
13
0
0

Loading.... (view fulltext now)

Full text

(1)

www.elsevier.com/locate/jmaa

Convex-transitivity and function spaces

Jarno Talponen

Department of Mathematics and Statistics, Box 68 (Gustaf Hällströminkatu 2b), FI-00014 University of Helsinki, Finland Received 23 November 2007

Available online 26 February 2008 Submitted by B. Cascales

Abstract

It is shown that if X is a convex-transitive Banach space and 1p <∞, thenLp([0,1],X)andLs ([0,1],X)are convex-transitive. HereLs ([0,1],X)is the closed linear span of the simple functions in the Bochner spaceL([0,1],X). If H is an infinite-dimensional Hilbert space andC0(L)is convex-transitive, thenC0(L,H)is convex-transitive. Some new fairly concrete

examples of convex-transitive spaces are provided.

©2008 Elsevier Inc. All rights reserved.

Keywords:Vector-valued function spaces; Transitive; Almost transitive; Convex-transitive; Rotation problem

1. Introduction

This paper is concerned with several aspects of symmetries of real Banach spaces. We denote the closed unit

ball of a real Banach space X byBX and the unit sphere of X bySX. A Banach space X is calledtransitiveif for

eachxSXthe orbitGX(x)= {. T (x)|T: X→X is an isometric automorphism} =SX. IfGX(x)=SX (respectively

conv(GX(x))=BX) for allxSX, then X is calledalmost transitive(respectivelyconvex-transitive).

These concepts are motivated by the Banach–Mazur rotation problemappearing in [2, p. 242] which remains

unsolved to this day and asks whether each separable transitive space is isometrically a Hilbert space. A branch of the isometric theory of Banach spaces has developed around this problem, and we refer to [3] for an extensive survey of this field. In this article we will investigate the abovementioned transitivity conditions, mainly convex-transitivity, in different settings. For some important results related to this investigation, see [12,13,18,26].

The main line of study in this paper involves the rotations of certain Banach-valued function spaces. It is already a

classical result that the spaceLpis almost transitive forp∈ [1,)and convex-transitive forp= ∞(see [27]). In [12]

the almost transitivity of the Bochner spaceLp([0,1],X)was established in the case where X is almost transitive and

1p <∞. See [1] for the analogous study of the spaces C0(L,X). We will extend these investigations into the

convex-transitive setting. We will show that if X is convex-transitive, thenLs (X)is convex-transitive. HereLs (X)

denotes the closed linear span of the simple functions inL([0,1],X). It also turns out that ifLis a locally compact

space such thatC0(L)is convex-transitive and H is an infinite-dimensional Hilbert space, thenC0(L,H)is

convex-transitive. The arguments are different compared to [12] and [1], since, for example, the rotation groupGL∞ differs

E-mail address:[email protected].

0022-247X/$ – see front matter ©2008 Elsevier Inc. All rights reserved. doi:10.1016/j.jmaa.2008.02.034

(2)

considerably fromGLpforp <∞. Some implications of the transitivity conditions ofC0(L,X)for the topology ofL

are also discussed.

We will also give some new, fairly concrete examples of almost transitive and convex-transitive spaces. These

examples are built starting from classical function spaces. For example, it turns out that the subspace ofL1consisting

of all the functions whose average is 0, is almost transitive in the usual norm.

Finally, we will study non-separable transitive spaces. Recall that any Banach space X of density characterκ can

be isometrically embedded as a subspace of an almost transitive space of the same density character (see [23] and [3, pp. 8–11]) or of a transitive space (see [3, Corollary 2.21]). Starting from a transitive space one can also pass to a separable almost transitive subspace (see [5] and also [3, Theorem 2.24]). We will prove here that each transitive

space contains a transitive subspace, the density character of which does not exceed 2ℵ0.

1.1. Preliminaries

Throughout this article we will considerrealBanach spaces denoted by X,Y and Z unless otherwise stated. For

non-empty subsetsA, B ⊂X we put dist(A, B)=infaA, bBab. The group of rotationsGX of X consists of

isometric automorphismsT: X→X, the group operation being the composition of the maps and the neutral element

is the identity mapI: X→X. Iff ∈X∗ andx∈X, then we denote byfx the mapf (·)x: X→ [x]. Recall that

xSXis called abig pointif conv(GX(x))=BX.

We refer to [20] for background on measure algebras and isometries of Lp-spaces. In what follows Σ is the

completed sigma algebra of Lebesgue measurable sets on[0,1]. We denote bym:Σ→Rthe Lebesgue measure. Let

us define an equivalence relation∼monΣby settingAmBifm((AB)\(AB))=0.

For an introduction to ordinal numbers and such matters we refer to [8]. We denote the cardinality of a setAby|A|.

Here we will apply cardinal arithmetic notations, so that 2ℵ0 = |R|. Recall that the density character of X, dens(X)

for short, is the smallest cardinalκ such that X contains a dense subset of cardinalityκ. Given a limit ordinalκ, its

cofinality is cf(κ)=. min{|A|: Aκ,supA=κ}.

2. Convex-transitivity of Banach-valued function spaces

For notational simplicity we abbreviate the Lebesgue–Bochner space Lp([0,1],X)by Lp(X) for 1p∞.

Recall that this space consists of strongly measurable mapsf:[0,1] →X endowed with the norm

fpLp(X)= 1

0

f (t )pXdt forp∈ [1,),

andfL(X)=ess supt∈[0,1]f (t )X. It is not hard to verify that the subspace

Ls (X)=span{χAxAΣ, x∈X}

L(X)

is non-separable if dim(X) >0 and Ls (X)L(X)if dim(X)= ∞. We refer to [7] for precise definitions and

background information regarding the Banach-valued function spaces appearing in this section. 2.1. Convex-transitivity ofLp(X)

Recall that L∞ is convex-transitive (see [25] and [27]). Greim, Jamison and Kaminska proved that Lp(X) is

almost transitive if X is almost transitive and 1p <∞, see [12, Theorem 2.1]. We will present an analogous result

for convex-transitive spaces, that is, if X is convex-transitive, thenLs (X)andLp(X)are also convex-transitive for

1p <∞.

Note thatLp(p)=Lp isometrically, wherepis not convex-transitive forp=2, so that the above implications

cannot be reversed. We know neither an example of a convex-transitive space X such that L(X)fails

convex-transitivity, nor an example of a transitive space Y such thatL2(Y)fails transitivity.

(3)

We will make some preparations before giving the proof. The following two facts are obtained immediately from

the definition ofLs (X)and the triangle inequality, respectively.

Fact 2.2.LetF =χA1x1+χA2x2+ · · · +χAnxn, wheren∈N,{Ak|1kn}is a measurable partition of[0,1]

andx1, . . . , xnBX. Such simple functionsF are dense inBL∞s (X).

Fact 2.3.LetXbe a Banach space andT1, . . . , TnGX, n∈N. Assume thatx, y, z∈Xsatisfydist(y,conv({Tj(x)|

j=1, . . . , n}))= >0andxz =δ >0. Then disty,convTj(z)j =1, . . . , n

+δ.

Proof of Theorem 2.1. Our strategy for the caseLs (X), which we mainly concentrate on, is to show that for a given

xSXthe constant functionχ[0,1]xLs (X)is a big point and thatχ[0,1]x∈conv(GLs (X)(F ))for eachFSLs (X).

This suffices for the claim according to Fact 2.3.

First we will show that for anyxSXthe functionχ[0,1]x is a big point. By using Fact 2.2 it suffices to show that

any simple functionFSLs (X)(as in Fact 2.2) is contained in conv(GLs (X)(χ[0,1]x)). LetF=χA1y1+ · · · +χAnyn,

where{Ak|1kn}is a measurable partition of[0,1]andy1, . . . , ynBX. Let >0.

Since X is convex-transitive, there are for each j ∈ {1, . . . , n} finite sets Mj ⊂N, families of isometries

(Tk(j ))kMjGXand convex weights(a

(j ) k )kMjS1 +∩c00such that kMj ak(j )Tk(j )(x)yj < forj∈ {1, . . . , n}. (2.1)

Observe that, given(ij)j

n

j=1Mj, one obtains rotationsRGLs (X)by setting R(g)(t )= 1jn χAj(t )T (j ) ij g(t ) for a.e.t∈ [0,1]. (2.2) Next we will take a convex combination of this type of rotations. By induction on the number of terms in the product one can check that

(i1,i2,...,in) n j=1 ai(j ) j =1, (2.3)

where the summation is taken over all the combinations(i1, i2, . . . , in)

n

j=1Mj. One can also verify by induction

on the number of terms in the product and by changing the order of summation that

(i1,i2,...,in) n l=1 a(l)i l n l=1 χAl(t )T (l) il = n l=1il∈Ml ai(l) l χAl(t )T (l) il , (2.4)

where the leftmost sum is taken over all combinations(i1, . . . , in)

n j=1Mj.

Hence we obtain by (2.4), (2.1) and the definition ofF that

(i1,...,in) n l=1 ai(l) l n l=1 χAl(·)T (l) il (x)F (·) Ls (X) = n l=1ilMl a(l)i l χAl(·)T (l) il (x)n l=1il∈Ml ai(l) l χAl(·)F (·) Ls (X) .

Note that according to (2.2) and (2.3) the map

g(i1,...,in) n l=1 ai(l) l n l=1 χAlT (l) ilg

(4)

Let us check next that for eachFSLs (X) andxSXit holds thatχ[0,1]x∈conv(GLs (X)(F )). To achieve this

we employ a kind of sliding hump argument. FixFSLs (X). SinceF =1, one can find by Fact 2.2 a sequence

(xn)nSXand a sequence(Bn)nof measurable (but not necessarily pairwise disjoint) subsets of[0,1]such that

sup

tBn

F (t )xnX<2−(n+1) (2.5)

and 0< m(Bn) <12for alln. PutΔn= [1−2−n,1−2−(n+1)]forn∈N.

Denote byΣ\mthe quotient sigma algebra of Lebesgue measurable sets on[0,1]formed by identifying them-null

sets with∅. Recall thatψ:Σ\mΣ\mis a measure-preserving Boolean isomorphism if and only if there exists a

bijectionα:[0,1] → [0,1]such thatα, α−1are measurable andα(A)mψ (A)forAΣ(see [24, pp. 582–584] and

[14, p. 340]). For the definition of Boolean isomorphism we refer to [20, p. 118].

Hence, by using the composition of suitable bijective transformations[0,1] → [0,1]one can construct measurable

mappingsgn:[0,1] → [0,1]andgˆn:[0,1] → [0,1]such that

gn(Bn) m ∼ [0,1] \Δn and gn BncmΔn, (2.6) the measureμn(·) . =mgn(·) :Σ→Ris equivalent tom (2.7) and ˆ gngn(t )=t for a.e. t∈ [0,1], (2.8) for eachn∈N.

Next we will apply some observations which appear e.g. in [11] and [10]. Observe that (2.7) gives in particular that

the mapφn:Σ\mΣ\mdetermined byφn(A)

m

gn(A)forAΣ is a Boolean isomorphism for eachn∈N. Note

thatgˆn(A) m

φn−1(A)forAΣandn∈N.

According to the convex-transitivity of X, there are for each n∈N a finite set Kn ⊂N, a set of rotations

(Ti(n))iKnGXand convex weights(d

(n) i )iKnS1+c00such that xiKn di(n)Ti(n)(xn) X < 1 2n+1 for alln∈N. (2.9)

We may define mappingsSi(n):Ls (X)Ls(X)forn∈NandiKn, by putting

Si(n)(F )(t )=Ti(n)Fgˆn(t )

for a.e.t∈ [0,1], FLs (X).

Moreover, by (2.7) and (2.8) we get thatSi(n)GLs (X)(see also [10, pp. 467–468]).

The functionχ[0,1]x can be approximated by convex combinations coming from conv(GLs (X)(F ))as follows:

χ[0,1]x− 1 k k n=1iKn di(n)Si(n)(F ) Ls (X) 2+ k i=12−i k k→∞ −−−→0. (2.10)

Indeed, forn∈Nand a.e.t∈ [0,1] \Δnit holds by (2.5) and (2.9) that

xiKn di(n)Si(n)(F )(t ) X xiKn di(n)Ti(n)(xn) X + 1 2n+1 1 2n.

On the other hand,xiK

nd

(n)

n Si(n)(F )(t )X2 for a.e.tΔn. In (2.10) we apply the fact thatΔnare pairwise

essentially disjoint.

Consequently, χ[0,1]x∈conv(GLs (X)(F )) for all FSLs (X), by (2.10). We conclude that Ls (X)is

convex-transitive.

The case 1p <∞is a straightforward modification of the proof of [12, Theorem 2.1], where one replacesUixi

(5)

2.2. Convex-transitivity ofC0(L,X)

If L is a locally compact space and X is a Banach space, thenC0(L,X) consists of the X-valued continuous

functions onLtending to 0 at infinity. This is a Banach space endowed with the normf =suptLf (t )X.

Let us recall that for the Cantor set K the spaceC(K)is convex-transitive but not almost transitive (see [27]).

There exist plenty of convex-transitive spaces of the typeC0(L)(see e.g. [30]).

The following problem about the almost transitivity ofC0(L)spaces has attracted attention: Wood [30] conjectured

that ifLis a locally compact Hausdorff space andC0(L)is an almost transitive space over the scalarsK, thenLis a

singleton. This problem was answered by Greim and Rajagopalan in [13] in the caseK=Rin thepositiveand was

recentlyrefutedindependently by Kawamura in [18] and by Rambla in [26] in the caseK=C. Theorem 2.4 below

extends the work in [13] (and hereK=R).

We will require the following generalization of Stone’s theorem due to Jerison (see e.g. [4, p. 145]):

Let (L, τ ) be a locally compact Hausdorff space and let Y be a strictly convex Banach space. Then a map

T:C0(L,Y)C0(L,Y)is a rotation if and only ifT has the form

T (F )(t )=σ (t )Fh(t ) forFC0(L,Y); tL, (2.11)

whereσ:LGYis(τ,SOT)-continuous andh:LLis a homeomorphism.

Theorem 2.4.Let(L, τ )be a locally compact Hausdorff space that is locally connected at some pointxL. Suppose thatXis a non-trivial strictly convex Banach space.

(i) IfC0(L,X)is almost transitive, thenLis a singleton.

(ii) IfC0(L,X)is convex-transitive, thenLis connected.

Proof. Let us first make some preparations towards both these claims. Let x, yL be such thatx =y and Lis

locally connected at x. Since L is completely regular and Hausdorff, there are open neighbourhoods Vx andVy

of x andy, respectively, such thatxy= ∅. According to the complete regularity ofL, there is a continuous

mapf0:L→ [0,1]such thatf0(L\Vx)= {0}andf0(x)=1. SinceLis locally connected at x andf0−1((12,1])

is an open neighbourhood of x, there is an open connected neighbourhoodUxf0−1((

1

2,1])of x. Again, by the

complete regularity there is a positive continuous mape:L→ [0,1]such thate(L\Ux)= {0}ande(x)=1. Define

f =min(f0,12)+max(e·(f0−12),0). Note thatfC0(L), its range is in[0,1],f (L\Ux)⊂ [0,12],f (Ux)⊂ [12,1]

andf (x)=1. Letg:L→ [0,1]be a positive map inC0(L)such thatg(L\Vy)= {0}andg(y)=1.

FixwSX. Note thatfw, (f +g)wSC0(L,X)by the construction off andg.

Claim(i). Suppose thatx, yLare as above. ThenC0(L,X)is not almost transitive.

Indeed, assume to the contrary thatC0(L,X)is almost transitive. Hence there must be a rotationT:C0(L,X)

C0(L,X)such that

T (fw)(f+g)wT (fw)(f+g)w< 1

10. (2.12)

By (2.11) we know thatT (Qw)(t )=σ (t )(Q(h(t ))w)for anyQC0(L), whereh:LLis a homeomorphism

andσ:LGX. In particular

T (Qw)(t )X=Qh(t )wX=Qh(t ) for eachtL, (2.13)

sincewX=1. Thus by (2.12), (2.13) and the positivity off andgwe obtain that

fh(t )− 1

10< (f+g)(t ) < f

h(t )+ 1

10 fortL. (2.14)

Note that sincef (x)=g(y)=1, and f (y)=g(x)=0, it holds thatf (h(x)), f (h(y)) 109. Sincef (L\Ux)

[0,12], we obtain thath(x), h(y)Ux and hencex, yh−1(Ux). By (2.14) and the selection ofUx andf we have

that (f+g)h−1(t )> f (t )− 1 10> 1 2 − 1 10= 2 5

(6)

for alltUx. Sincef andgare disjointly supported, we get that

x, yh−1(Ux)f−1

(2/5,1]∪g−1(2/5,1].

Moreover, there exists a separation between the open setsf−1((2/5,1])xandg−1((2/5,1])y. Thush−1(Ux)is

not connected and henceUxis not connected; a contradiction.

Claim(ii). Suppose thatx, yLare as in the beginning of the proof. Sinceywas arbitrary, it suffices to show that

x andybelong to the same connected component.

Let w∗∈SX∗ be a support functional forwSX. Define FSC0(L,X)∗ byF(u)=

w(u(x)u(y))

2 for eachu

C0(L,X). Note thatF is a support functional for(fg)wSC0(L,X)as

F(fg)w=f (x)g(x)(f (y)g(y))

2 w

(w)=f (x)+g(y)

2 =1.

SinceC0(L,X)was assumed to be convex-transitive we obtain that

supFconvGC0(L,X)(fw)

=F(fg)w=1.

In particular we may select by the linearity ofF an elementGGC0(L,X)(fw)such thatF(G) >

9

10. This means

thatw(G(x)),w(G(y))(108,1]. Hence

G(x)X,G(y)X(4/5,1], (2.15)

sincew∗X∗=1.

Again, by (2.11) we may write G(t )=σ (t )(f (h(t ))w). Note that G(t )X = |f (h(t ))| for all tL. Thus

G(t )X 12 for all tL\h−1(Ux)and hence x, yh−1(Ux) by (2.15). Clearly x and y belong to the same

connected component asUxis connected. 2

Theorem 2.5.Let(L, τ )be a locally compact Hausdorff space.

(i) IfXis a strictly convex Banach space andC0(L,X)is convex-transitive, thenXis convex-transitive.

(ii) IfHis a Hilbert space,dim(H)= ∞andC0(L)is convex-transitive, thenC0(L,H)is convex-transitive.

Our argument below relies strongly on the assumption that dim(H)= ∞. We do not know if this assumption can

be removed.

Proof. (i) Fixx, ySX. LetF, GC0(L,X)be given byF =e(·)x, G=e(·)y, whereeSC0(L). By the local

compactness of Land the continuity ofethere ist0∈Lsuch that|e(t0)| =1. SinceC0(L,X)is convex-transitive,

there exists a sequence (Tn)n∈N ⊂GC0(L,X) such that G∈conv((Tn(F ))n∈N). Since X is strictly convex,

repre-sentation (2.11) gives that Tn(F )(t0)=σn(t0)(e(hn(t0))x) for suitable sequences (σn)and (hn). Recall that here

σn:LGX are continuous and hn:LL are homeomorphisms for n∈N. Since G(t0)∈ {±y}we obtain for

an . =e(hn(t0))∈ [−1,1]that y ∈convσn(t0)(anx)n∈N ⊂convconvσn(t0)(±x)n∈N =conv±σn(t0)(x)n∈N ⊂convGX(x). (2.16) Hence X is convex-transitive.

(ii) Let H be an infinite-dimensional Hilbert space and let {}γΓ be an orthonormal basis of H. Fixγ0∈Γ,

0< <1 andF0, G0∈SC0(L,H). Define r : H→SH∪ {0}by r(z)=

z

z for z=0 and r(0)=0. Recall that r is

continuous away from 0.

We will make crucial use of the fact that there exists a( · ,SOT)-continuous mapA:SH\ {0} →GHsuch that

A(x)(eγ0)=x for allxSH\ {0}, (2.17)

see [1, Proposition 5.4]. We will advance in two steps to complete the proof. The first, rather technical step is needed

in order to apply the above fact (2.17). This step uses the assumption that dim(H)= ∞. The second step involves

(7)

Step 1. Note that the subset W = {tL: F0(t ) 8} ⊂L is compact, and its image under the continuous

mappingF0is also compact. Since dim(H)= ∞one can find by approximation an indexμΓ, μ=γ0,such that

F0(t )<8 fortW. Above: H→ []is the orthogonal projection. It follows thatF0(t )<8 for

alltL.

Towards an application of (2.17) we define an auxiliary mappingFC0(L,H)by perturbingF0as follows:

F (t )=

F0(t )r(F0(t )+8eμ) ifF0(t )2, F0(t )r(F0(t )r(F0(t )+8eμ)+(8−14F0(t ))eμ) ifF0(t )<2.

Put rF(t )=r(F (t )) for tLsuch that F (t )=0 and rF(t )= otherwise. ThenF and rF satisfy the following

conditions:

(a) F (t ) = F0(t )fortL.

(b) F0−F< .

(c) F (L)∩ [0] ⊂ {0}.

(d) limF0(t )→0rF(t )=.

Indeed, conditions (a) and (d) are immediate. Condition (b) follows by analyzing the upper and lower cases separately.

In the upper case one applies geometric estimates in the euclidean plane spanned by F0(t ) and in H. If one

writesF0(t )r(F0(t )+8eμ)=bF0(t )+ce for suitableb, c∈R andeF0(t ), where e =1 and F0(t )

2, then|(F0(t )b)|

8 and|c|

4. The lower case follows immediately by applying the triangle inequality.

Towards condition (c), giventL, writePμ(F0(t )+2eμ)=aeμfor suitablea∈R. The fact thatF0(t )<

8 fortL yields that a >0 above. Thus r(F0(t )+

8eμ)=0 for alltL andr(F0(t )r(F0(t )+

8eμ)+

(8−14F0(t ))eμ)=0 fortsuch thatF0(t )<2. Hence (c) holds, since0.

Similarly, by using a suitableνΓ\ {0}, one can defineGC0(L,H)and rG, which correspond toG0and have

analogous properties. Observe that rF and rGare continuous mappingsLSHby condition (d) and the continuity

ofF andG.

Step 2.We claim that the map

E(t )ArG(t )

ArF(t ) 1

E(t ), tL, EC0(L,H),

defines an element inGC0(L,H). Indeed, recall thatAis( · ,SOT)-continuous and(GH,SOT)is a topological group,

which means that the group operation and the taking of the inverse are continuous. Thus the composition L

SH×SHGHgiven by t→rG(t ),rF(t )ArG(t )ArF(t ) 1

is(τ,SOT)-continuous. ClearlyA(rG(t ))(A(rF(t )))−1∈GHfortL. By (2.17) we obtain that

rG(t )=A rG(t ) (eγ0)=A rG(t )ArF(t ) 1 rF(t ) fortL. (2.18)

ConsiderG(·),F (·)C0(L). One can find by the convex-transitivity ofC0(L)and (2.11) homeomorphisms

hn:LLand continuous functionsθn:L→ {−1,1}forn∈Nsuch thatG(·) ∈conv({θn(·)F (hn(·)): n∈N}).

PutTn(E)(t )=A(rG(t ))(A(rF(hn(t ))))−1(E(t ))forn∈N,EC0(L,H)andtL. By (2.18) we obtain that

Tn(Fhn)(t )= F (hn(t ))rG(t )for alltL.

SinceG(·) ∈conv({θn(·)F (hn(·)): n∈N})C0(L), we obtain that

G(·)=G(·)rG(·)∈conv θn(·)F hn(·)rG(·): n∈N =convθn(·)ITn Fhn(·) : n∈N⊂C0(L,H).

Note that according to (2.11) the map E(·)(θn(·)I)Tn(E(hn(·)))defines an element in GC0(L,H) for n∈N.

HenceG∈conv(GC0(L,H)(F )). SinceF0, G0andwere arbitrary, Fact 2.3 and condition (b) yield thatC0(L,H)is

(8)

3. Some new examples

Even though there exist plenty of transitive spaces, very fewconcreteexamples of almost transitive and

convex-transitive (scalar-valued) function spaces are known (see [3]). Next we will demonstrate transitivity conditions for a few fairly concrete spaces by direct proofs. These new examples are obtained by performing natural operations on classical function spaces.

In this section we denote

λ (κ)=x(κ): supp(x)λ(κ),

whereκ,λare infinite cardinals andλκ. This clearly defines a closed subspace of(κ). Recall thatκ+stands for

the successor cardinal ofκ, i.e. the least cardinal strictly larger thanκ, andκ++=+)+.

In [28] the special role of 1-codimensional subspaces ofLp in connection with the rotations is discussed. There it

is also verified that the subspace

M1=. xL1 1 0 x(t )dt=0 ⊂L1

appearing in the following result is neither 1-complemented, nor isometric toL1.

Theorem 3.1.The subspaceM1⊂L1is almost transitive.

Proof. For eachfL1 we denote f+(t )=max(f (t ),0)andf(t )=max(f (t ),0), so that f =f+f. Fix

x, ySM1 and >0. LetAB= [0,1]be a measurable partition such thatA=supp(x+). Similarly, letCD=

[0,1]be a measurable partition such thatC=supp(y+). Observe thatx+ = x = y+ = y =12.

Note that ifE, F ⊂ [0,1]are measurable sets with strictly positive measure andR:L1(E)L1(F )is a positive

linear isometry onto, thenEf (t )dt=FR(f )(t )dtforfL1. Indeed,

E f (t )dt= E f+(t )dtE f(t )dt= f+L1(E)fL1(E)=R(f+)L1(F )R(f)L1(F ) = F R(f+)(t )dtF R(f)(t )dt= F R(f )(t )dt, sincef =f+f,R(f+)0 andR(f)0.

Let R1:L1(A)L1(C) and R2:L1(B)L1(D) be positive linear isometries onto. Then

Ax+(t )dt = CR1(x+|A)(t )dt and Bx(t )dt =

DR2(x−|B)(t )dt by the above observation. Since both R1(x+|A), y+|C

L1(C)are positive and have norm 12, it follows by the standard argument, which is used to prove thatL1is almost

transitive (see e.g. [21, Theorem 3.1]), that there is a positive rotationT1:L1(C)L1(C)such thatT1R1(x+|A)

y+|C<2. Similarly there is a positive rotationT2:L1(D)L1(D)such thatT2R2(x−|B)y−|D<2. Now

T1R1⊕T2R2:L1=L1(A)⊕1L1(B)L1(C)⊕1L1(D)=L1

is a linear isometry onto. Hence [0,1]f (t )dt =[0,1]R(f )(t )dt for each fL1, so that (T1R1⊕T2R2)|M1:

M1→M1 is a linear isometry onto. Note that (T1R1⊕T2R2)xy< . Sincex, y and were arbitrary, we

conclude thatM1is almost transitive. 2

We refer to [15] for background in ultraproducts in Banach space theory. Recall that an ultrafilterUis non-principal

if it does not contain any singletons. The writer thanks Å. Hirvonen and T. Hyttinen for providing help in proving the following fact.

Lemma 3.2(Homogeneity). LetUbe a non-principal ultrafilter onNandA, B⊂Nbe infinite sets such thatA, B /U. Then there is a permutationh:N→Nsuch that:

(i) h(A)=B.

(9)

Proof. Observe that N\(AB)U. Let L, M ⊂N\(AB) be infinite disjoint subsets such that LM=

N\(AB). Without loss of generality assume thatMUandL /U.

SinceAandLare infinite and disjoint, there is a bijectiong:ALALsuch thatg(A)=Landg(L)=A.

Defineg˜:N→Nbyg˜|AL=gandg˜|N\(AL)=id|N\(AL). Note thatVU if and only ifV \(AL)U. Hence

˜

g(U )U if and only ifUU.

Similarly, one can construct a bijectionf˜:N→Nsuch that f (L)˜ =B,f (B)˜ =Landf (U )˜ ∈U if and only if

UU. Observe thath= ˜f ◦ ˜g:N→Nis the claimed permutation. 2

Fact 3.3.LetΓ be a non-empty set. ThenB(Γ )=conv({−1,1}Γ)(Γ ).

The proof is left as an exercise (see [9, p. 99]). Note that eachxB(Γ )can be approximated by elements of

{−1,nn1, . . . ,nn1,1}Γ, wherenN.

Theorem 3.4.LetUbe a non-principal ultrafilter onNand

Y= (xn)∞lim U xn=0 . ThenY/c0is convex-transitive.

Let us make a few comments before the proof. Recall that∞itself is far away from being convex-transitive in

view of the characterization of the rotations of∞(see [22, 2.f.14]). Note thatexactlyone of the sets{2n|n∈N}and

{2n+1|n∈N}is a member ofU, say{2n+1|n∈N} ∈U. Thus(xn)(0, x1,0, x2,0, x3, . . .)defines an isometric

embedding∞→Y. In particular, Y/c0is a non-separable space containing an isometric copy of/c0.

Recently Cabello [6] proved that/c0is convex-transitive.

Proof. First note that ifx=(xn)∞is such that limU|xn| =c >0, then dist(x,Y)c >0 becausexyc

for eachy∈Y. Thus Y⊂∞is a closed subspace.

Recall (see [22, 2.f.14]) thatTG∞if and only if

T(xn)n

=θ (n)xπ(n)

n, (3.1)

whereπ:N→Nis a bijection andθ:N→ {−1,1}. Also note that such an isometryT restricted toc0is a member

ofGc0.

Next we will check that if TG∞, thenT:x+c0→T (x)+c0, for x∞, defines a rotation /c0→

/c0. Indeed, it is well known that T:/c0 →/c0 is a linear bijection. Moreover, infzc0xz =

infzc0T (x)T (z) =infzc0T (x)z, so thatT:/c0→/c0is an isometry.

Note that if the permutationπabove is such thatπ−1(U )Uexactly whenUU, thenT|Y: Y→Y is a rotation.

To summarize,T|Y/c0∈GY/c0 for suchπ.

Fixu, vSY/c0. Ifx, y∈Y are such thatu=x+c0andv=y+c0, then

dist(x, c0)=lim sup

n→∞ |

xn| =1=dist(y, c0)=lim sup

n→∞ |

yn|, (3.2)

sinceu, vSY/c0. Hence we may pickx, ySYsuch thatu=x+c0andv=y+c0.

Fixk∈N. LetA= {n∈N: |xn|1−k1}andB= {n∈N: |yn|1k}. Observe that these areinfinitesets by (3.2)

and thatN\A,N\BU. Thus, by Lemma 3.2 there is a bijectionπ:N→Nsuch thatπ(B)=Aandπ(U )Uif and

only ifUU. Observe thatT: Y→Y;(xn)n∈N→(xπ(n))n∈Nis a rotation. Putw=(wn)n∈N=(xπ(n))n∈N∈GY(x).

By the definition of the setsAandBwe obtain that|wn|1−1k if and only ifnB.

Fix an auxiliary pointz∈Y, which satisfies

yzY

1

k, |zn|1−

1

k fornBandzn=0 forn∈N\B.

Write∞=(B)(N\B). It follows from Fact 3.3 that

z|B∈conv

(10)

Since (wn)nB− sign(wn) nB(B) 1 k (3.3)

we obtain by Fact 2.3 that distz|B,conv θ (n)wn nBθ (n)= ±1 fornB 1 k. (3.4) It follows that distz,convθ (n)wn n∈Nθ (n)= ±1 forn∈N 1 k. (3.5)

Indeed, one can use convex combinations 1 2 i ai(fi+g)+ i ai(fig), (3.6)

wherefi∈ {(θ (n)wn)nB|θ (n)= ±1 fornB}are obtained from (3.4) such that

iaifiz|B(B)1k and

g=(wn)n∈N\B(N\B). Above we used thatz(n)=0 forn∈N\B.

Sinceyz1k by the selection ofzand(wn)=(xπ(n))GY(x), Fact 2.3 yields that

disty,convGY(x)disty,convθ (n)xπ(n)

n∈Nθ:N→ {±1}

2

k.

Since kwas arbitrary we obtain thaty∈conv(GY(x)). Thusv=y+c0∈conv(GY/c0(u)), so that Y/c0is

convex-transitive. 2

We note that the technique applied above does not give that Y or/c0should be convex-transitive. However, by

applying similar ideas we obtain another fairly concrete example of a convex-transitive space:

Theorem 3.5.The spaceκ+++)/κ ++)is convex-transitive for any infinite cardinalκ.

Proof. Letκ be an infinite cardinal and denote X=κ+++)/κ ++). Fixx, ySX. Picku, vκ+++)such

thatx=u+κ ++)andy=v+κ ++).

Thusu1 andv1. Observe that

ακ++: u(α)1+1 k κ and ακ++: v(α)1+1 k κ

for eachk∈Nsincex, ySX. Thus, by using the fact that|ωκ| =κwe obtain that|{ακ++: |v(α)|>1}|κ

and|{ακ++:|u(α)|>1}|κ. Henceuandvabove can be chosen such thatu, vS

κ+++).

Put Ai = {ακ++: |u(α)|1− 1i} for i∈N. Observe that |Ai| =κ+ for i∈N since xSX. Also note

that |supp(u)| = |supp(v)| =κ+. Fix Bκ++\(supp(u)∪supp(v))such that |B| =κ+. Write Γ =supp(u)

supp(v)B.

This finishes the combinatorial part of the argument at hand. The essential point above was to find suitably

normal-izedu, vandΓ. Next we aim to show that when regardingu, vS(Γ )it holds that

v∈convG(Γ )(u)

(Γ ). (3.7)

In such a case one can see similarly as in the proof of Theorem 3.4 thaty∈conv(GX(x)), which gives the claim.

To prove (3.7) observe that for eachi∈Nthere is a bijectionπi:ΓΓ such thatπi(Ai)=supp(v). For each

i∈Ndefinew(i):Γ →Rby

w(i)(α)=χsupp(v)(α)sign

i−1(α)+χΓ\supp(v)(α)u

πi−1(α).

One can check thatv∈conv({(θ (α)w(i)(α))αΓ |θ:Γ → {±1}})by applying Fact 3.3 on supp(v)and the (trivial)

equality w(i)(α)2w(i)(α) =0 onΓ \supp(v)similarly as in (3.6) and (3.5). Finally, Fact 2.3 and the observation that

(11)

4. Final remarks: Constructions for transitive spaces

Recall that each transitive space contains a separable almost transitive subspace (see [5, Corollary 1.3], also [3, Theorem 2.24]). In fact, it turns out below that one can always pass to a suitable transitive subspace of density

character at most 2ℵ0.

Theorem 4.1.LetXbe a transitive space and letY⊂Xbe a subspace withdens(Y)2ℵ0. Then there exists a closed subspaceZ⊂Xsuch that:

(1) Y⊂Z.

(2) dens(Z)2ℵ0.

(3) Zis transitive with respect to subgroupT = {TGX|T (Z)=Z}ofGX.

Let us recall the following folklore fact which is proved here for convenience.

Fact 4.2.Let(Y, d)be a metric space, κ a cardinal withcf(κ) > ω0and {}α<κ an increasing family of closed

subsets. Thenα<κ is closed.

Proof. Assume to the contrary that there isxα<κYαd\

α<κYα. For eachn < ω0letσn< κbe the least ordinal

such that dist(x, Yσn) < 1

n+1. It follows from the selection ofxthat supn<ω0σn=κ, which contradicts cf(κ) > ω0. 2

Proof of Theorem 4.1. If dens(X)2ℵ0, then the claim holds trivially by putting Z=X, so let us assume that dens(X) >2ℵ0. We will apply the following fact. IfEis a Banach space with dim(E)2 and dens(E)2ℵ0, then

|SE| =2ℵ0. Indeed, clearly|SE|2ℵ0. IfDEis dense and|D|2ℵ0, then of courseDBE is dense inBE and

|DBE|2ℵ0. Note that for eacheBEthere is a sequence(dn)DBE such thatdneasn→ ∞. Thus, in

order to estimate|BE|, let us estimate the number|(DBE)ω0|of sequences ofDBEas follows:

(DBE)ω0

2ℵ0ℵ0=2ℵ0·ℵ0=2ℵ0.

Hence|SE||BE|2ℵ0 and consequently|SE| =2ℵ0. Observe that there are

|SE×SE| =2ℵ0×2ℵ0=2ℵ0 (4.1)

many pairs(x, y)SE×SE.

We may assume without loss of generality, possibly by passing to a larger subspace Y, that dens(Y)=2ℵ0. Next

we will apply the transitivity of X in a transfinite induction. We will construct increasing sequences{}α<2ℵ0 and

{}α<2ℵ0, which consist of subgroups ofGX and closed subspaces of X, respectively. PutZ0=Y andT0= {IX}.

For each 0< α <2ℵ0 we will construct a subgroupGX and a subspace⊂X, which satisfy the following

conditions: (a) ||2ℵ0.

(b) forβ < α.

(c) For eachx, ySXβ<αZβthere isTsuch thatT (x)=y.

(d) =span(

{T (Zβ)|TTα, β < α}).

(e) dens(Zα)=2ℵ0.

In the caseα=0 only (a) and (e) apply. Suppose that we have obtained this kind of construction for allα < γ, where

0< γ <2ℵ0. Observe that dens α<γ γ×2ℵ0=2ℵ0.

Thus, by (4.1) and the transitivity of X there is a subsetFGXsuch that for each pairx, ySXα<γZγ there

isTF such thatT (x)=yand|F| =2ℵ0. LetGX be the subgroup generated by the set

(12)

satisfies conditions (b) and (c) (for α=γ). Note that ||| +1)×2ℵ0 × ℵ0| =2ℵ0, so that satisfies

condition (a). Observe that dens(Zγ)| ×γ ×2ℵ0 × ℵ0| =2ℵ0, so that condition (e) holds, as Y⊂. This

completes the induction.

Put Z=α<2ℵ0Zα and observe that dens(Z)=2ℵ0. Note that Y⊂Z by the construction. Recall that according to

König’s lemma cf(2ℵ0) >ℵ0(see e.g. [8, Lemma 10.40]). Hence, by Fact 4.2, we obtain that

Z=

α<2ℵ0

Zα. (4.2)

Fixx, ySZandT

α<2ℵ0. Letσ <2ℵ0 be such thatT. According to (4.2), there isβ <2ℵ0such that

x, y. ThenT (x)Zmax(σ,β)+1⊂Zby the construction ofZ. SinceT andxSZwere arbitrary, we get that in

fact bothT (Z)ZandT−1(Z)Zhold. This means thatT|Zis a bijectionZZ.

Observe that there is S+1 such thatS(x)=y by the construction ofZ. Sincex andy were arbitrary and

α<2ℵ0T, we conclude thatZis transitive with respect toT. 2

Remark 4.3. Observe that in Theorem 4.1 one has some control of the density character of Z, which, even though being a superspace of Y, is a still subspace of X. See also [29] for similar results. To put Theorem 4.1 into perspective, recall that every Banach space can be isometrically regarded as a subspace of a suitable transitive Banach space (see [3, Corollary 2.21]). Recently Hirvonen and Hyttinen observed using model theoretic tools [17, Theorem 2.10] (see [16, Theorem 1.13] for details) that there exist very homogeneous Banach spaces containing all the Banach spaces up

to a given density character: Letμbe an infinite cardinal. Then there exists a Banach space X such that:

(1) If Y is any Banach space such that dens(Y) < μ, then X contains an isometric copy of Y.

(2) If closed subspaces Y1,Y2⊂X with dens(Y1)=dens(Y2) < μare mutually isometric, then there isTGXsuch

thatT (Y1)=Y2.

The construction of X above is not economical in the sense that typically dens(X)is much larger thanμ. Since

the 1-dimensional subspaces [x] and[y] are isometric for allx, ySX, it follows that in (2) eitherT (x)=y or

T (x)=y, so that X is in particular transitive. For recent results regarding somewhat economically produced homo-geneous spaces, see [19].

Acknowledgments

This article is part of my PhD research supervised by H.-O. Tylli to whom I am grateful for his careful comments. This work has been financially supported by the Finnish Graduate School in Mathematical Analysis and Its Applications.

References

[1] A. Aizpuru, F. Rambla, Almost transitivity inC0spaces of vector-valued functions, Proc. Edinb. Math. Soc. 48 (2005) 513–529.

[2] S. Banach, Théorie des Opérations Linéaires, Warsaw, 1932.

[3] J. Becerra, A. Rodriguez, Transitivity of the norm on Banach spaces, Extracta Math. 17 (2002) 1–58.

[4] E. Behrends,M-Structure and the Banach–Stone Theorem, Lecture Notes in Math., vol. 736, Springer-Verlag, Berlin, 1979. [5] F. Cabello, Transitivity ofM-spaces and Wood’s conjecture, Math. Proc. Cambridge Philos. Soc. 124 (1998) 513–520. [6] F. Cabello, Convex-transitive norms on spaces of continuous functions, Bull. London Math. Soc. 37 (2005) 107–118. [7] J. Diestel, J. Uhl Jr., Vector Measures, Math. Surveys Monogr., vol. 15, American Mathematical Society, Providence, RI, 1977. [8] H.B. Enderton, Elements of Set Theory, Academic Press, 1977.

[9] M. Fabian, P. Habala, P. Hajek, V. Montesinos Santalucia, J. Pelant, V. Zizler, Functional Analysis and Infinite-Dimensional Geometry, CMS Books Math., Springer-Verlag, 2001.

[10] P. Greim, The centralizer of BochnerL∞-spaces, Math. Ann. 260 (1982) 463–468.

[11] P. Greim, Isometries andLp-structure of separably valued BochnerLp-spaces, in: Measure Theory and Its Applications, in: Lecture Notes in Math., vol. 1033, Springer-Verlag, 1983, pp. 209–218.

[12] P. Greim, J.E. Jamison, A. Kaminska, Almost transitivity of some functions spaces, Math. Proc. Cambridge Philos. Soc. 116 (1994) 475–488. [13] P. Greim, M. Rajagopalan, Almost transitivity inC0(L), Math. Proc. Cambridge Philos. Soc. 121 (1997) 75–80.

[14] P.R. Halmos, J. von Neumann, Operator methods in classical mechanics II, Ann. of Math. 43 (1942) 332–350. [15] S. Heinrich, Ultraproducts in Banach space theory, J. Reine Angew. Math. 313 (1980) 72–104.

(13)

[17] Å. Hirvonen, T. Hyttinen, Categoricity in homogeneous complete metric spaces, preprint. [18] K. Kawamura, On a conjecture of Wood, Glasg. Math. J. 47 (2005) 1–5.

[19] W. Kubis, Fraisse sequences—a category-theoretic approach to universal homogeneous structures, preprint, arXiv: 0711.1683. [20] H.E. Lacey, The Isometric Theory of Classical Banach Spaces, Grundlehren Math. Wiss., vol. 208, Springer-Verlag, New York, 1974. [21] J. Lamperti, On the isometries of certain function-spaces, Pacific J. Math. 8 (1958) 459–466.

[22] J. Lindenstrauss, L. Tzafriri, Classical Banach Spaces. I. Sequence Spaces, Ergeb. Math. Grenzgeb., vol. 92, Springer-Verlag, Berlin, 1977. [23] W. Lusky, A note on rotations in separable Banach spaces, Studia Math. 65 (1979) 239–242.

[24] J. von Neumann, Einige Satze Uber Messbare Abbildungen, Ann. of Math. 33 (1932) 574–586.

[25] A. Pelczynski, S. Rolewicz, Best norms with respect to isometry groups in normed linear spaces, in: Short Communications on International Math. Conference in Stockholm, 1962, p. 104.

[26] F. Rambla, A counterexample to Wood’s conjecture, J. Math. Anal. Appl. 317 (2006) 659–667. [27] S. Rolewicz, Metric Linear Spaces, Polish Scientific Publishers, Reidel, 1985.

[28] J. Talponen, Asymptotically transitive Banach spaces, in: B. Randrianatoanina, N. Randrianantoanina (Eds.), Banach Spaces and Their Appli-cations in Analysis, in: de Gruyter Proc. Math., 2007, pp. 423–438.

[29] J. Talponen, Convex-transitive characterizations of Hilbert spaces, preprint, Reports in Mathematics 460, University of Helsinki, 2007. [30] G. Wood, Maximal symmetry in Banach spaces, Math. Proc. R. Ir. Acad. Ser. A 82 (1982) 177–186.

References

Related documents

This section outlines the method to find the best allocation of n distinguishable processors to m dis- tinguishable blocks so as to minimize the execution time.. Therefore,

Electron micrographs of mannonamide aggregates from water (a-e) or xylene (f): (a and b) details of aged fiber aggregates of D-mannonamide 2 negatively stained

We are now using the second part of our test database (see Figure 4 ) ; the boxpoints table which contains 3000 customer points, and the box table with 51 dierent sized bounding

Political Parties approved by CNE to stand in at least some constituencies PLD – Partido de Liberdade e Desenvolvimento – Party of Freedom and Development ECOLOGISTA – MT –

Most companies recruit for full-time and internship positions, but some indicate Co-Op as a recruiting priority, while not attending Professional Practice

Note: The figure shows analysis of the impact of the implied contract doctrine on state union membership rates using equation 3, a weighted OLS difference and differences

• Taxpayers subject to the provisions of Title II of the Income Tax Law (ITL) which have declared taxable income of $644,599,005 or more in the immediately preceding tax