You are on page 1of 175
SYMMETRIC STRUCTURES IN BANACH SPACES W. 7. Gowers A dissertation submitted for the degree of Doctor of Philosophy, December 1980 ETRIC STRUCTURES IN BANACH SPACES W.T. Gowers ‘The backbone of the dissertation is series of results to do with Snding almost sym metric block bases of sequences which isfy certain commonly oceu ing conditions. This has been known to be possible for some years: in 1982 and 1985, smi and Milman pub- lished two important papers containing various results on the subject. My contsibution has been to find sub otally larger block bases and to construct examples in many eases to show that one cannot improve my new results further. Probabilistic methods play an tant part in calculating bounds in both directions ‘These results wose originally motivated by a theorem of Krivine, which can be se atded as the inite-dimensional analogue of the well-known distortion problem. Also in the dissertation is an analogue of the dstostion problem in co, which strengthens consid cexably a result of James, and indicates that, contrary to what is generally believed, the answer to the distortion problem itself could very well be positive. "There is also a counterexample to a fairy long-standing question about norm-attal operators. Ishow that &, daes not have property Bif < p < oc. That is, Igve an operator into f, which cannot be appeoximated in norm by a norm-attainirg operator In the last chapter, I give an unusual method of constructing the Zy-spaces. By a very natural geometric process, one can build up a symmetric polytope that approximates the sphere to within V3. The result genoralizes to give pol pes that approximate the unit 8 Ak) = | I] smmetric bass 21,22,-.., one can use the same process to give anat bulls ofthe other &-spaces. Given any function A:N —+ R that satis for some example of such a basis. Some clementary properties ofthis class of spaces are investigated. Declaration No part of this dis tation is derived from any other source, except where it is explicitly stated otherwise, Viewers CONTENTS Introduction 1 PART I, PRELIMINARIES 1, Basic Definitions and Standard Results| 7 2, Technical Results 2 PART Il. THE SIZE OF SYMMETRIC BLOCK BASES: LOWER BOUNDS 3. Bases with Large Average Growth 3% 4. Bases Equivalent to the Standard Basis of é2 6 PART II]. THE SIZE OF SYMMETRIC BLOCK BASES: UPPER BOUNDS 5. ase with Large Average Growth 20 6. Bases Equivalent to the Standard Bass of 6 1. General I-Unconditional Bases 2 Summary of Results and Open Problems 104 PART IV. OTHER RESULTS 8, Infinite Almost Symmetsie Sequences 109 9. Distance from the Sphere 130 10. The Hilbert Space does not have Property B 138 11. An Isomorphie Construction of the Classical Spaces ua Bibliography 167 A INTRODUCTION In 1971 Milan [98] published « new proof of Dvoretaly’s theorem that was to be the starting point of a great deal of research in the local theory of Banach speces, His proof was based on Lévy’s isoperimetric inequality on the sphere, and it gove extremely sharp bounds. It was later realized that one could wwe results bout measure concentration in certain discrete metrie spaces to obtain other in teresting results about Banach spaces. For the main theorems ofthis dissertation, ‘ve shall se such techniques to find large almost symmetric block bases of bases which satisfy various diferent natural conditions, ‘The two conditions that wil principally concern us are, Ss, thatthe original basis should be equivalent to the unit vector basis of (7, and, second, that it should satisfy «growth condition of the following form: ifthe basis x1...) is normalized, one asks that ET il should be large, where the expectation is taken overall posble choices of signe eayoosyty steibuted uniformly, The Birt peopl to show that these conditions allow one to obtain etiates sing measure concentration that are sigaicantly better than thse obtainable by Ramsey theoretical techniques were Amie and Milman, They published bro important paper (8 4} in 1082 and 1085, giving a srien of sls in which they ebtained vncondtionsl nd spmmetic Hock hate of bases with various natal assumptions on then. They used some of these rer to abn loa versions of Kivine's theorem and the Maurey-Pisier theorem. ‘The two results of Amir and Milman that concern us most are the following ‘They showed that, for any 1 < p< oo and ¢ > O, a basis which is equivalent to the unit vector basis of & has » (1 + e)-aymmetsic block basis of cardinality of ‘order n*/3, This was the first step in the proof of their local version of Krivine's hore. They als considered bass 2,2 that ata the condition where 1 < p <2.and the expectation is taken over all choices of signs (cs)f- They J >, showed that such a basis has a (1 + ¢)-symmetsic block basis of cardinality of order n 0-9/0", They used results due to Mautey and Schechtman concerning concentration of measure in various diserete metric spaces, This result was the first step in the proof of thei local version of the Maurey-Pisier theorem, Now, it seemed likely that these results were not best posible. Although the ‘bounds obtained by Amir and Milman in the loeal versions of Krivine's theorem snd the Maurey-Pisier theorem are not significently affected by improvements in the frst step, the problem of determining best possible bouncs for the size of a (1 + e)aymmetsic basis when the orignal basis satisfies euch natural conditions ‘5 the ones shove isan interesting one in it own sight, The main results of this 1 and e> 0, then any basis which is C-equivalent to the unit vector basis of ff has a (1+ ¢}-symmetrc block bats of cardinality at least a(¢,p,C)n/ logn, where a(¢,p,C) > 0 dependson ¢, pandC only. Moreover, ay basissatisfying the growth condition above has a (+2) aymmetsie block basis of cardinality e)n2"1/logn, where Ae) > D depen on ¢caly. We abo sive example o show thet these estimates ae indeed close tothe best posible We shall now give an overview of the results contained in each chapter of the dissertation, ‘The frst chapter introduces the basic definitions and outlines the probabilistic tools which ie at the heart ofthe Iter proofs namely Asia's Inequality, and deviation inequality due to Hosfing. The relevance of Azume's inequality to Banach space theory was discovered by Mourey (5), and Mauzey's ‘method was developed by Schechtman (46). The second chapter consists of results which are of some interest on their own, but are mainly proved as tools for later 1. This chopter is quite long and in places technical. The reader may prefer to real the proofs of the results in the chapter only after secing the results used tater In the third chapter, we start on our main results, conside:ing base with large average growth, and proving the result mentioned above concerning such bases, In the fourth chapter, we show how the same method ean be adapted to prove the result we have stated above about bases equivalent to the standard basis of an Gy-space. ‘There follow three chapters of upper bounds. In Chapter 5, we construct basis with the growth condition above which does not have a (1 + e)-symmetrie block basis of cardinality greater than o(e)n2/"“¥(logn)/*, 161 < p < 8/2, then ‘his basis can be chosen to satisfy a lower p-estimate, In Chapter 6 we construct, for 1 < p < oo, a basis which is equivalent to the unit vector basis of € which has no (1 +¢}symmetric block basis of cardinality exceeding a(« p)nloglogn/logn In Chopter 7, we construct a sequence which i» C-oquivelcal to the unit vector basis of 62 with no (1 + e)-symmetsie block basis of eardinabty nO), where tends to zer0 a8 log(l +¢)/log tends to zero. This shows that the restriction P< co is necessary in the main result of Chapter 4. We also obtain an upper bound of a rather diferent nature, since it concerns arbitrary subspaces and not just those generated by a block bass. Specifically, we show that, for any absolute constants snd M, and form € N slfciently lrg, there exists an r-dimensonal normed space X such that no n7-dimensional subspace of X bas an M-symmetric basis, Rather surprisingly, the proof of this result is an adaptation of the proof ofa similar result for block bases. The result itself gives negative answer to a question of Milman, ‘The remaining four chapters are different in character ‘rom Chapters 4 to 2 rr 7, although they mostly concern symmetric sequences in one way or another. In ipter§ we discuss the natural infinite-dimensional analogue of the main result is, if X is a Banach space that is isomorphic tof, then must of Chapter 4. Th X contain a (1 + }symmetric basic sequence? We do not solve this problem. “This is not too surprising, as we show that iti in fact equivalent tothe distortion problem, which it leary resembles. We also give a positive answer to a “distortion problem for 9”, showing that, for any > O and any Lipschite function F on the ‘it sphere ofc, there exists an infinite dimensional subspace of ey om whose unit sphere Fvaties by at most e. We do this by constricting an ultralter with special properties Jn Chapter 9 we discuss a problem which is quite well known snd is related to one of the results ofthe fourth chapter. It concerns the rdationship between the type constants ofa space and the distance ofthat space fiom a Hilbert space of the some dimension. In Chapter 10 we provide a simple counterexample to ‘9 question shout norm-attaining operators. In Chapter 11 we give an unusual isomorphic constriction of Ef which arose out of «surprising observation about faisly natural geometric process. This suggested several natural questions, many cf which we answer. In particular, the result generalizes to give an isomorphic construction of & for arbitrary 1 < p< oo. [Most of the results of Chapters 25, Section 6.1 and Chapter 9 will appear in two papers accepted for publication by the Inrsl Journal of Mathematics [22,2] All the results inthe dissertation are orginal except where it is explicitly stated otherwise. ‘Throughout the dissertation, except at the end of Section 1.5, all our scalars willbe assumed tobe real. The results, however carzy over without any difficulty to the complex case, We shall often assume that n, the dimension of the space under consideration, is sufficiently large, without actually mentioning this. ‘This is of particular importance in Sections 2.2 and 28, and Chapters 6 and 7. Fi there are several places where it would be hopelessly cumbersome to make sure ‘hat all integer quantities are actually given as integers, so in most eases we have 10 that they ate rigorous in ¢ not done so, It is easy to modify the proo respect, We have not claimed any result that is not true when appropriate integer parts are tsken tant is Dr B. far the most mp 1 am indebted to vasious people, but Bollabés, my research supervitor. He drew my’ attention to the papers of Amir and Milman and suggested that some of their bounds might be improved. He then give me great encouragement and very valuable advice: I could not have asked 1 results in this dissertation has for a better supervisor. The presentation oft benefited enormously from his eiticsms. Any inadequacies that remain are, of course, entirely my own responsibility would also like to thank Yoshiharu Kohayakawa, Imre Leader and Jamie Radcliffe for many stimulating conversations over the last three years, The atmo- sphore thay have provided les made my task much easier. In pesticulr, they have increased my general knowledge and sometimes provided me with key references 1am gratefl to Yoshiharu Kohayakawa for pointing out various minor errors in caries drafts ofthe dissertation Finally, I would like t ank my wife, Baily for her suppart, and for putting up with distracted and unsociable behaviour when I have been working on prob- lems. Ihope that one day Twill he able to explain to her what she has helped me to proce. PARTI PRELIMINARIES Gers eee CHAPTER 1 BASIC DEFINITIONS AND STANDARD RESULTS §1.1 Basie Definitio ‘The definitions which follow are almost all standard. ‘The most importent {for our purposes will be that of « symmetzic basis, Given a sequence of vectors {4s,.0-yn in a normed space X, we say that it is Ieymmetric or simply symmetric if, for any permutation * € Sq, any choice of signs €3,..-yéa snd any sequence of scalas8 35-252, oral] It under the same conditions we have only then we say that the basis 11,...,20 is a-symmetric. Sometimes, we shall say CS ea) @ We denote this by C,(X). The smallest constants for which (2) and (3) hold whenever V s+ > éada) > 0. Given such a permutation and sequence of signs, Of ie defined to be siagig- This it amily seen to be wall-dafined. ‘The vector 1)P is the decreasing rearrangement of a. Given t > O and a funetion from the closed interval [0,1] to R, the decreasing rearrangement f* of fis defined by (2) =sup{s>0: [fv f) > 9}|> 2} We shall use some standard notation for various sete and sot systems. In particular, [n] will stand for the set {1,2,...yn}, and fn]? will stand for the collection of subsets of [n] of cardinality r. This should nat be confused with [n]", which stands for the set of -tuples (f,...yi-) of elements of 'n We shall frequently talk about the standard basis or the unit vector basis ‘of certain normed spaces, The meaning of this is obvious, For example, given ‘normed space X = (R" [ly the standard basis of X is the basis €1,...,¢) ‘where e; is the vector with 1 in the i coordinate and zero everywhere else. Of Dirge eR", courte the identifieation of X with R” most be explicit. If and A.C [n] isa subset of then the restriction of to A, written a |, isthe vector Den oe §1.2 Standard Results In this short section we shall state two deviation inequalities from probability jonal theory, a simple estimate for the size of nets in the unit ball ofa fnite-dimes ‘ormed space and some bounds for the hypergeometric distribution. Apart from these results, which all have easy proofs, this dissertation is more or less self contained. Suppose we choose a sequence a;,...,a of real numbers and Jook at the sum Theos where e1,....€0 if a randomly chosen sequence of signs. Khintchine’s ‘inequality tells us that the expected value of the modulus ofthis sum is about (Zi of)"7, An inequality of Azuma [5] states thet the probsbility of the sum being substantially larger then this in moduls i extremely small. The proof of this fact is very quick, but the consequences are far-reaching. It will be our main tool for proving measure-concentration results ‘Theorem 1-1. Let (di)? be # martingale difference sequence, and let (c))? be non-negative real numbers such that lldillas $ ci for every 1 i 0, 4) >| ce0(-¥/234 ‘which ean sometimes be used to prove stronger results, A “martingale version” of this result was recently proved by McDiarmid (87). We shall use the following result of Hoeftding, 10 of independent Dheorem 12. (Hoeiding 106) Let X, es tandoon variables satishing 0 < Xj <1 foreach i, and a N= nt E}X pae¥ andg=1-p. Theaifoctes, ne : -]< (GG) ‘he proot af the every sniar in tle to the proof of Aruma's equality ‘We shall use this theorem in a situation where p is much sizaller than 1, where Aruma’s inequality gives only weak results, if any A E-net of » metric space X is a subset A CX with the property that, for every 2 € X, there existe 2! € A such that d(z,s!) < 4 We turn now to ‘8 very standard estimste for the size of a &-net of the unit ball of an azbitrary ‘n-dimensional normed space. An easy proof may be found in [18] oF [89] Lemma 1.3. Let X' be an n-dimensional normed space and let 0< 6 <1, Then the unit ball of X contains a 6-net of cardinality (1-+2/6)" a We end this chapter with ueeful estimates forthe hypergeometric distribution whieh ean be found in {20} Lemma 14. Let 0 ... > an >0. We shall call this the decreasing part ofthe unit ball I turns out that it is more convenient to contol the norm using a set that is not actualy e-net. Our fest few lemmas will show that there is a set of vectors {ay,....8y7) of fanly small cardinality with the property that any norm whichis almost sametie at each ay rust be almost symmetzic on the whole space. We shal se thatthe norm on an ‘dimensional space with « symmnetsie basis is almost determined hy its restriction to a subspace of dimension roughly log. In the other direction, we shall need to find a Iargish collection of vectors in 2 the decreasing pact of the unit ball off with the property that the norm ofa ‘one of the vectors is not controlled by the norms of the others, This we shall do {in Sections 2 and 23, One can get some sort of estimate using a separated set nd well known estimates for the modulus of convenity of €f Our approach will tbe more direct and will give a beter result. ‘The main result of this section is the following Proposition 24. Let § > 0, let (Rf) be # normed space and set N mi"), There exist N vectorsay,...ay suc that if is (-+4)-syammetric at a; for every i, then the standard basis of R™ is (1 + 6)(1 ~68)--symmetric ‘We shall prove Proposition 21 by splitting it into a number of further simple lemmas, but fist we need some notation. Let W be the set {-1,1}" x Sm, and, for any a= Df, aye; €R™ and any (m5) = (Mhy..42,2) € B, let aye stand for the vector FPL 1/0;601- Let us also define two orders oR as follows. We shall say a <; b if can be written as a convex combination of vector of the form bye, and a

0, let us define » subspace U = U(8) of R", as follows, Let rrr ——— 13 subspace U will be that generated by uy,...,te, For technical reasons, we shall define kegs to bon-+1. Note that for1 0 and let U = U(é) bs as defined above, Lemma 23, Let i] be a norm which is defined on U. Then there exists « function [ : R™ + Ry such that any I-symmetrie norm [LI with the property that [xI|= lll for every 2 € U satisfies also fe) < I< 0+ 8)f(2) for every 2 ER", Proof. Let a= Sf" ey and let a) >... > dy 20. Let us define two vectors a! and a" in U by and Blew ead 30 ya Ys Our function f will be defined by f(a) = lla". Note that a” is dominated "H< (lal < Es'b We shall show that af <2 (1+ 6)a" and hence (by Lemma 22) that fa'l < pointvvise by a, which is itself dominated pointwise by a. Thus (+e which will complete the proof. Let us write (a})$* and (a) forthe yiSsén coordinates ofa! and a" respectively. Then for a 1x) min( skies — 2} “ a aod Yooh = Dhow, ~ ena,)in(ssb} But for each i as remarked above, kizs 1 § (1++6)h;, 50 clearly min{s, fuga 1} (146) minfsyki). Hence a! <2 (1 + da” as stated. a Lemma 2-4, Let 6! > 0 and let [jl] be any norm on R™ which is (2 — 8 symmetric at every a € U(6)- Then [i is (1+ 8)(1 — 26°)-*-semmetrie on R™ Proof. Define » orm fon RM by fal = 20 {qell:(n.0) € 8). Then, i 2€U, we have Jal| < [all < (1 +6) lal by assumption. Now, given any a € define a ns in the proof of Lemma 28, We know that [all < fal. In the other ' direction, since a is dominated pointwise by a, 2a" — a is dominated pointwise by al, so [2a — all < fa"J. But, since a” € U, we have > 2a — f20" — al > 21-6')fa"l- fal = (1 26)f0"1 > (2-260 +8)" where the last inequality follows from the proof of Lemma 2, Hence lis (1+ 6)(1—26")-!-equivalent to the I-symmetsie norm I, which roves the lemma. o Lemma 2.5. Let [| bea norm on R™, and define a I-symmeteie norm [| on R™ by [af = max{llag oll: (9,2) € ¥}- Suppose that the set of vectors {a1,...,an) forms a 6-net in J. ofthe [unit ball of U and that [li (14+ 8)-symmetrie at every a. Then [ll is (1+ 6)(1 ~ 66)--symmetric on R™ Proof, By hypothesis, given any 1< i < N and any (n,0) € W, we have Wadyoll > (1+6)-Mladle Let us pick a U with fa = 1, We shall show th Ill is (1 ~ 36)-*-symmetrie at a. So pick any (n,2) € W and pick £ such that 15 Jaa] <5. Wite b = aye and bf =(ai)qe- Then we have (bE ~ by < Pb — bi + [PBT ~ [I] + Ib’ — | < 641-0497 46.636 But [bE = fal] = 1, so the norm |} is indeed (1 ~ 36)-!symmetric at every vector in U, But then, by Lemma 2:4, it is (1-4 4)(1 ~ 66)—!-symmetrie on A" as stated. a Proof of Proposition 2:1. The dimension of U(6) is at mest log, 44m, e0, by Lemma 1.3, there is a S:net of the [-[-unit ball of U of cardinality at most (1-+ 2/6}P8+0™. When 5 < 1/11 one can easily check that this is at most m*"#4(4"" 5. o Proposition 21 now follows immediately from Lemma Although twill not be strictly necessary for our purposes, t sof some interest tocstimate the size ofa 6.net ofthe decreasing pat ofthe unit ball ofan arbitrary redimensional space with « 1-symmetri basis. We have not dane this in general, but when the space is (2, we obtain an estimate of n(*/#1°(€) for some absolute constants ¢ and ¢!. In other words, the size of a net can be about the same asthe sive ofthe set obtained in Proposition 2.1. It seems very likely that the same is true for any space with & symmetric basis, Proposition 26. Let 1< p< oo, 0.<8 <1 and let KC 6 be the set facg ly, <1, 04 Bs. 2 09 2 0} ‘Then K contains a S-net A of cardinality N, where Ng n(t/ia(144/3) 1065/0) Proof. Let 8 = 6/3 and let a= (a))! € K. Ifa! (af)9 € 9 is any vector such that 0; < of < (1-4 8a for all 1 4 € m then la~ al], < AL} af)" € 8. So, 16 iven a let us define a! to be the vector with df= min{(1+6)-9":5 31,0467 9 > a}. max{ol,(1-+8)~*), where k = 2 logy a(n). Let a € 67 be defined by af Note that & > logy 4(8-n!/*), so (1-40)-* < @n¥, Te follows easily that Ja” —a'], <8, and therefore that lla" — ally < 20. If, given aay vector a, we can find a vector b in such that [b— a] <6, then lb— al] <30 = 6, so then A. will bee net, In other word, ti enough to approximate towithin 6 vectors of the form a = Fait, where uw; = xu, for some sequence of possibly empty sete Uy... Ue satisfying US; Consider two vectors a= E¥aiu, and a! = 5 acu, where (wf and (vt oI Thaleresesdlve-vp) inl and &y < hy whenever i 1, (ay — ai41 +2)? — 2” is an increasing function of z (when. 30),50 I$. ene vol’ — [eo enner—s < (05 ~ of, .)|supatvs ~ v5)] Thos = af,,)fsupp(vs — ¥})] But lial? = Sf, aflsupp(u;)| = C},(aj - of,,))supp(vs)| < 1+ 26 and Ie = D5 of (. F — af, )lsupp(v5)| < 1428, so V is at most the size of a O-net B(E), ie. N < (14201 420/87) < (6/0 But, since k= 2 logn/p log(t +6), Ng nftlleatt4enioes ie) a " 2.2 Well-Separated Classes of Vectors in the Unit Ball of (3 (1 < p < =) In the last section we estimated from above the smallest posible size of a set of vectors which controls an almost symmetric norm. Knowing en almost symmetric norm everywhere on such a set tells us, to considerable eccuracy, the norm everywhere in the space. In Chapter 6, we shal construc, for 1 < p < oo, an equivalent norm on & with the property that no block basis of cardinality than a(p,¢)nloglogn/logn is (1 + ¢)symmetric, for a constant @ which depends conly on € and p. We shall do this by taking a large collection of subsets of the unit sphere of ff, each of which is invariant under the syramstsies of €f induced by permutations and changes of sgn ofthe standard basis, and then defining & ‘orm randomly in such a way that i is very unlikely to be symmetric at any given vector in any one ofthe subsets. tis important in our proof that our subsets should have two other properties he fist is that any suficintly large block bass ofthe standard basis should generate at least one vector in each subset, and the second is that we should be able to define our random norm independently on each subset. ‘This second property isthe most important, We demand thatthe subsets should not interfere with cach other in the following sense. If we define a norm on R" by taking its unit ball to be the convex ull of all the subsets but one, then the notin of a vector in the subset that we leave out should be greater than 1 4 for some which does not depend on n. Actually, for technical reasens, we will ask for slightly more than this because of our particular method of proof in Chapter 6 but this isthe basi iden, This last property is what enables ws to define © norm randomly and independently on each subset. We shall then oblain an estimate for the probability ofa block basis being almost symmetiie at any particular vector it {Generates in one ofthe subsets. Since these probabilities are irdependent, we will 18 —_.——l™r™mrmrU™CCOCS be able to multiply them all together. If we have found a large number of classes, then the resulting probability is very small indeed and enables us to show that with positive probability, no bloc basis of cardinality a(«,p)nloglogn/logn is (14 oeymmetric. We shall speak loosely of the subsets being “well separated In a way, finding as many well-separated vectors as possible is the opposite of finding as few vectors as possible which control the norm, ‘The numbers used in the construction are those that we shall need when apply the result. As usual, q is the conjugate index for p. In eur application, the onder of magnitude of will be logn/ loglogn. So, let n and h be given, let 0 << 1/3, let 1 = nll2, k= hi4PtHe-7i8, Artellt = (b/2)"? and let t = log(l/2h)/ log > logn/2(l + p+ a)loglosn, so that h DY K < ‘Then, for 1™———- 5 Ap, Fo and Gp 28 follows. 1o-{Bx neavies} Fo {@« nenvenl and oo= {Qo nec wea where @ denotes a sum with disjoint supports Note that if € Ap, then there exists f € Fp such that fla) = (t/2)!* [all Indeed, let. = @,ep 8e where a; € Aj for each i € B, let f cach such j and let f = @jen fi. Then fla) = t/2 while lalsign(a,) for (2). The next lemma shows that the classes (Ap: B € B} are “well-separated” Lemma 2-7. Suppose B and C are distinct elements of B, and suppose f € Fo, 9€Gp andac Ac. Then Sa) + ofa) < (72) lal, Proof. It issmple to show that fs and yar two vectors in RY, then (eqn eve) is maximized when ze and yo ate oth non-negative decreasing vectors. We shall therfore assume this of f,g and a. Let us write f = Zep fi with fi € Fi for each i and the fi being disjointly supported, and similarly write g = Dye 65 and a = Dec aj. In order to estimate (f + 9)(a) we shall estimate fi(a) and 4i(a) in the eases i € BNC and i € BC. Fiat let ws ook at f(SEjgoa)) in the ese §€ BC. Writing ff forthe decreasing rearrangement off (Le. for f, without the string of zeros at the front) 2 Seer ss )i, ke C We have alzeady estimated the first term, Also Fil) < fil aay < AUPE? RADE 1, while remaining close enough to 1 for & to be C-equivalent to ff for some fixed C, we do not obtain N classes of vectors for some N which tends to infinity with. However, using a different construction, itis posible to find X “well-separated” classes of vectors in the unit ball of an n-dimensional normed space which is C-equivalent to &f with WV = (logn/loglogn)", where (Cy4) > 0. Tris to be expected that ‘we should obtain fewer classes in this ease, because the unit ball of 7 cannot be renormed to be uniformly conves. We can obtain a very small amount of canvesity by renorming, however: it will be just enough to enable us to construct 2 bs which is C-equivalent to the unit vector basis of 7, such that no block basis of cardinality exceeding 9{¢,C)n/loglogn is (1-+ e}-symmetric, As before, we shall define some classes of vectors and functionals, and then prove a lemma about them, Let ¢> 0, © > 1 and h €N be given. In our application, h will be about loglogn. Fim let us define four more parameters, Let r = —logC/log(1 ~ 4e), let b= 99, let A= [logy n)/2r] and let N= (1/2), Next, for 1 # < ry let (A =e). Ths © > fy > oo. > Be = 1, and Biya /Bi $1 Ae for eh i Now, forany 1<¢ i KO“) We shall also define a class of functionals to go with Ajj. It turns out in this case, as we mentioned at the end of the last section, that only one class of functionals is necessary. Let Fs be the set of functionals j on R” such that 23 Joupph | = ARGH and ench non-zero coordinate of f is We shall now define, for any 5 = (s1,.-+.4r) € [4/2]", two-lasses Ay and A as follows {@« aie Aig EH snd 2 1 for the classes Ay and Fi. {Oissera ‘The next lemma is the anslogue of Lemme Lemma 28. Let 5s! € [1/2)' and suppose that there exists a subset KC [r] of cardinality at least r/3 such that «; < 6; for every i € K. Then, given any f & Fe and a € Ay, we have fla) . Then as before, We aleo hare (@a)en< Since of < a; for at least r/3 values off, we have @*)( bs art = Da) < (090 — se + CHAN + HA) + Br + HEA) 3 tand 5>0, Pl - 436] by > O.and A and B aze contained in the same atom of F— are equal except perhaps at for #~"(o(8)), and Bereta) $B Jin A, d((e.m),6¢(68))) <2 Since f is 7-Lipschitz, fj varies by at most 276; in any atom of follows easily that fy - fini € 2yb; as was needed, oO §25 A Generalization of the Hypergeometric Distribution This section concerns a weighted version of the hypergeometric distribution, (a) is given positive Specifically, we ask the following question. Suppose a vestor in R" and B is a randomly chosen set in [n]), Then, given # > 0, what isthe probability that 5 Dien os 3 #7 Ia is just the charecteristic function of eet of | then thie probability cen be estimated from above and below by vsing known bounds for the hypergeometric distribution. We shell need estimates in ‘both directions (in different contexts) but only weak ones. Our two main results will be, roughly speaking, that ifthe maximum value of the a: js st most 1, and 4a; is at most I, then the probability of Te ai deviating from its mesn by a given proportion of the mean is largest when a, = ... = a) = 1 and the rest of ‘the aj are zero, whereas if one restricts the size of the support ofthe sequence to 1 and tries to minimize this probability, one cannot do much better than to pick the same sequence. In short, the probebility, as one might expect, gets smaller the more the sequence is spread out Or first lemma is a straightforward deduction fom the theorem of Hoefiding stated in the last chapter (Theorem 1.2). In fact a slightly stronger result can be found in Hoefiding's paper [26 but since we shall not need the extra strength, and ‘he next argument is simple one, we shall content ourselves with the following statement, Lemma 2-10. Let 1 > 26, let ky Hand n be positive integers let a = (ay)? be a non-negative vector ia RY satising lall,, 1 and lally <1 ard let A € [nf be chosen at random. Then Proof. Let Xj,...,N, be a sequence of independent Bernoulli random variables 28 of mean 2k/n, and set X; = aX} for each i Let > C [n] be the (variable) set (i: ¥=2) Then Ee [Sxo nw visio = ons rims] Pf j] ve[Exoax nina i>] > aH where the last inequality followed from the obvious fact that offex>au|n offeaa saad is exactly the quantity we wish to estimate, We shall therefore show that P [ir] > A] is at least 1/2 and PIE, is an increasing function of j. However, > Akl] is at most (2e/)#/". ‘This will prove the lemma, First, we have | DPX} and Ef 2k. By the second past of Theorem 1.2 we therefore have iit] =P fji-2e< 4] ere f.y Xi > Akl. Setting # = fall, we apply the 29 frst part of Theorem 1.2, with p= 241'/n? and ¢ = (AK? /n®) ~p, obtaining P Sx >ani] (3) & a (aap tle = (ae pynl™ Fy (us estimate from below will be needed in Chapter 6. Thesituation that will interest us is when the size of the support of the vector ais around log and bis ‘proportional ton. The statement of the nest lemma i slightly unnatural because cof the appearance of the parameter ¢. This isto give usa litle elbow-room when sve come to apply it Lemma 2-11. Let r =n, h (1-20! Proof. Note that €(Dyex-@i) = & Clearly P [Tena =O) > (VC) > ( bution given by Lemma 14. For I< 7/2, 0.< a <1 we obtain (2) 6502 (Fe) Casey . 3) once > (1/a)"(e/2)0"C ~ 26)! = (e/2a)"(1 —26). )" > 26) a state For the first estimate, we use the lower bounds for the hyrergeometsie disti- 0 Now let By © By Cos By C {lyeessh} be defined by Bo 16) €4), where 6 = Jog,(2h) | > Se[By) for 1 HMB ON, aK)| > Sia oi (22H) > e274 21) Bs > 4 since Daisa; <2°*} < 1/2, But elias > a | Bie > Sel > (ctl "soei)! Gai) = (2/16)"401( — 26)! P[|B. 0K] > SelBal] > (2/16)%4%C4 ~ 26) 292i Pliajn xl > sep) vics aso Ei But [By] <2, so Cf [Bj] < 4h, and so 0 [Sapa > anon cay Note that, in the proof of Lemma 2-11, we aetually gave alower estimate for he anal event [[B) 9 1 > SelB or every 1 t/S is most Si, (,//2,)(«{{2,) < 3(0/2) (12). Hence, by picking sets one at a time, each jeMajsie) < 30R) (fe in)! fa) Ga) ‘one disjoint from the previous ones, we can find B with [B| >} But, by Lemma 1.4, (15) (16)/fe) = Gig)oatarar*erre ((s)or@arer (3/9/29 (3/4)" = (aya)? so 1B] > $14/3)" > (23/20" a Our final result of the section i, in a sense, # generalization of Lemma 2.18, In conjunction with Lemma 2.8, it gives a lower estimate forthe sire of a well: separated colletion of subsets of the unit ball ofan isomorph of 7 Lemma 214. Let n,k €N and let & be an even number, There exists a subset 2 that, whenever s #5! Proof. Let us pick and s' randomly from [n}!/? and estimate P [lie (h/2) si = 9i}| > 8/6] Now |{i € [k/2]: 5; = 4)] ie simply a sum of k/2 independent Bernow of mean 1/n. By standard estimates for the binomial distribution (10), or by a simple application of Theorem 1.2, we obtain that the above prcbability is at most Be/n)¥®, Let us pick a set! C [n]¥/? of cardinality N randomly. The probability F two elements of $ coincide in more than F/6 coordinates is certainly at that a most (¥)(8e/n)¥6, Thisis less than one, since N < (n/3e)*/, Thus there exists S°C [n]¥? such that, for any 5 £ 3! € 5%, |{F € [b/2] : 6: = 4f}| < 4/6. Given wy 5€5", define (8) €[ (49) Let S = {¢(s):#€ S'}. Then if s #8! € S, we clearly have that [ies nf. Then there i block basis of (21)f with blocks of #1 coefficients and equal length, which is (1+ e-symmetsic and has cardinality m2 r(o(log nnd where 7(e) = (€/3,000,000)(04(33/6)) ‘The dependence on 1 in this theorem improves on the previously known de- pendence of n@P"/9#" obtained by Amir and Milman in [4 Section 5.2). They have also shown that, if X has ptype constant C, one can obtain a bound of a{e.p,C)n'?-7)290490 (3, Theorem 2.4}. Our exponent of n of 2/p = 1 therefore improves both these resus, with or without an assumption about type-conditions We shall say a litle about the effect of type conditions at the end of this chapter and more at the end of the next one We sll begin with some notation. Let W be the group {-1,1)" x Sn with multiplication given by ((n)f%.2) © eve R™, and (nb .e!) = (nen). 202"), acting on R™ as follows. If a= (12) € %9= (9, then (yaa Bgl) = Yonsei Let 9 be the group (—1,1)" x Sy acting on X as follows. If b € X, Tf bie, and (¢,x) € , then (62) b a n(b) & Bow = Do birt 36 ‘We shall sometimes relabel the indices of (2))f. Let ry = euaaty (i Auscosh), where im =n, and similarly let 6, yney and iy & a((i—h +3) for (6,7) €9. We shall regard a block basis of (2, )P as a random embedding of R™ into X. Let 6:R™ +X be the embedding defined by Senn EE am, Then let bie = Wen $5. and write us = Shy ny for é When 1 € i 07 fall 37 (ii) Let ¢ and m be as in the statement of Theorems 3.1, let h = n/m and let eft. For any 8 €R™, let E(a) stand for Ep ll.x(a)|- Then Pa [3t.0) 84. [Ibae(@ne)l ~ Ete)| > G0 Hah A] <7 ‘The main step in the argument isthe second part of Lemma 8.2. This states, roughly, that for any vector a € R™, the devintion of any vector of the form ce(@q.) ftom their common average i, with large probability, smell. The frst part provides a lower bound for the average tel, so that the deviation isin fact proportionstely smal. Let ue see why Proposition 2.1 and Lemma 3.2 are enough to prove Theorem 3. Xf they are both true, then we can choose vectors ay,.-8nv thet satisfy the conclusion of Proposition 2.1. Having done this, let us considera single vector a= aj, Taking 6 = ¢/11, wehave 6 < 1/11, so certainly (146/9)(1-6/3)"! < 146, Hence, by the two parts of Lemma 3.2, Pa [mgs ibe<(4y.2)1/myfalibc(@qo)l > 146] n/7, Now let a= SP ayes be a vector in RM with a > 0 for every # 38 ft ihhmhhmhmrtrti—“‘_i_O_O_OSO For 1< i om 2 0. This is for ease of notation. Let By....,Bt4x C [m] be defined by {elms 29 <0 <2-0-Y} 1ejck fielm): <2) joker where & = log,(200mn!/*/e), Let by,.--sby be given by by define Bi, the coefficients of bi, lie between 2 Y, let us als), (1<5 Gaal dg) = bese (b) when 1 belbe) = ein (Bh) when 1 Shin Similarly, we obtain wong) P [fie (7) = fea! (6 ) lay be ele 5 lal & that is, for which SEC) = Roller) > Fe lah An Then (62) = Fall6s2)) > lal oY 0, 5, +4 Be © «/ 40, there willbe some 1 << k such that Sai (es) > Elia ho, Rell However, by the estimates for (a) and (h) and the normazation lal, the probability of such r and (y,2) existing is at most eon) Som o0( Ea where « is the smallest value of r for which 7, > 0. This is therefore an upper bound for the probability we wish to estimate. ¢ remains for us to choose appropriate &,...S and to verify that this probability is at most 2-mo# "a2", Since the inequality inthe other direction is exactly similar, we will then be done, ae! ap! «66 will do. Choosing 6, First, using the Cauchy-Schwarz inequality and the fact that $27", < a PF ensna secon, Lene 0 llotom) - ete) eh 50, 000077 O for every 7 > 6 But since h > (20/e) (lg(83/¢)) + (150,000/2)-n?/" log n, we have oe (etm) — sep hr.) < Re (1~ (2/2) oe») o((t/9in/eee») H0xyoreso9/0 Hog) which is what we needed. This completes the proof of Lemma 3.2 (i), and with it the proof of Theorem 3.1 a Let us finish this chapter with two simple corollaries. 2 Corollary 33. Let be a sequence of vectors in a narmed space C (1+ e-symmetzie block ‘equivalent to the unit vector basis of (2. The there base (us) of (es) with blocks of £1 coffcieats and equal length of cardinality mB 1()07*(log nn? , where (6) = (2 /3,000,000)(104(33/6)?. Proof. Without loss of generality, the norm of each 7; is at most 1 and >c“ni Sen 7 e | If pis chosen so that n¥/9" = C-Int/P, then nl C-*n2!”, Corollary 3.3 is thus an immediate consequence of Theorem 8.1 a Tt ture out, however, that one ean do much better than Corollary 3.3 when p> 1. In this chapter, we have used the fact that, for an appropriate distance on 0, the function la. isa Lipechitefunetion on 9. If the norm concerned is equivalent to the Gynoem, there ase stonger continsity propertise avilable, We shal show how to use these in the Chapter & AAs our final result in this chapter, we show that ifthe original sequence in Theorem 8.1 is contained in « space with a type concition, then the almost symmetri block basis obtained satisfles a stronger growth condition Corollary 84. Let 1 < p< 2,0 <€ 1, and let (xi)f be a sequence of unit veetors in a Banach space Suppose that E |} «ill 3 n™/* and suppose that the p-type constant of X is C. Then there is a block bass (wi)! of (xs)f with ymmetric and has blocks of 41 coefficients and equal length, which is (1+ 6) cardinality m3 2(0log ny-tn 6 where 9(¢) = (2 /3,000,000}(0g(89/e))"*. Moreover, fh = nfm,1< k tend ec. ‘To obtain the second inequality, let us set f= [n/] and pasttion fr into 1 soto Aujeeydt of cae hand one oct Aves of site lone than k. Thon it follows coily bass that a [Elomi from the type condition on X and the fact that uy... tim i ® 2-symmetrie block saci s1y4| 0 a ‘The result follows now from the growth assumption on the original basis. 4“ CHAPTER 4 BASES EQUIVALENT TO ‘THE STANDARD BASIS OF ( In the last chapter, we showed thnt a normalized basis for which the average of all ET-sums is at least n'/? must have an almost symmetric block basis of cardinality proportional to n'¥/?1/log n, In this chapter, we shall show that, if wwe assume the stronger condition that the basis is equivalent to the wnit vector basis of an fy-space, for some p < 20, then we get @ much strongrr result. Infact there is an almost symumetic block basis of cardinality proportional to n/logn Note that inthe case p = 1, we have already proved this result under a weaker sssumption, The extra strength when p> 1 came from the fact that we ean define a natural metric on the set of rearrangements of vector in ia such a way that swith respect to this metric, with, any equivalent norm on ff is Hélder continuo ‘exponent 2/p <1. In the previews chapter, we only used a Lipschits condition, Let us now state our main result, ‘Theorem 4:1. Let 1< p< o0,0 1 and let (si)f be a basis for a normed space X. Suppose that, for any a= Df aer €R", ‘Then (zi)? has a block basis with blocks of 1 coefficients and equal length, which lal, <| ... 2 am 2 0, we define, for each (7,0) € W, a function ye: —+ Ras follows. Let Dye € 2 be the set {e (The symbol M denotes here and forthe res ofthe chapter the median taken over a) Let dye be a metric on O defined by le ea(Onell (8/60) < (1/2)m—* "he Let us first see how we may deduce Theosem 4.1 essentially from Proposition 2.1 and Lemma 4.2. Suppose both of these are true, and pick vectors ay,...,ay which satisfy the conclusion of Proposition 2.1. Now apply Lemma 4.2 to each of the vectors a. Since Y = m*“"I5805"), we have, with probability greater than 1/2 if we pick (¢,2) at random from 9, that gye((6.=)) < (SI/GC)Ph for every (7,9) € © and every 1 (6/9984? for every #€ [X] and (1,0) € 8 ‘Now the median above is certainly at least hY/*, and, since €< 1/11, we also hhave (1-+6/3)(1 ~6/3)~! < 146. With these two facts and the estimates above, | we obtain that there exists (¢,) € 9 such that mpl o((aine)l / mallece((Aye) <14+5 43 ss rr———(‘<‘“‘“‘“‘SOSCSC*S BP for every { €[N]) Hence, if we define a norm [jon R™ by lal! = []6.(a)], we find that this norm is (1+ é}symmetric at ay,...yAy. It fllows from Proposiion 2.1 that itis (1+ e)symmettic. This tells us that d,e(01)s+-s#en(@m) i a (1+ aynametrie lock basis of 21... Tt therefore remains for us to prove Lemma 42. Before doing ths, we shall prove one other lemma, which we sall then wse in the proof of Lemma 4.2 Its ‘technicality which is found in the proofs of many’ results ofthis kind, Lemma 43. Let 6, p, C,m,h,a and gy be as in Lemma 42, Then Engnel(esr)) < W/A(6/60)" Proof, This lemma states that the expectation and median of bza(4y.)/] 7 close. It follows easily from Proposition 2.9, Indeed, let us set @ to be , and define our weights by bs san? for each i € [n}. Then the function f = gor is I-Lipschitz, Applying Proposition 2.9 with s mn and t= 0 we obtain vy -21 <0 ... > en >0, and define oo! eset {ie [mk of <2 ee where & = loga( 4 (6C/6)?m), As before, let by = al, (1 0, a [Fo((o=) — S428) > 6h] } y= Pa[aine)€ @ st. fel < Demo (— where dy... 4, is any sequence satisfying ot 6, « (1/2}(6/6C). We shall choose 4, to be (1/8) 2°12 (6/60). Then, just as before, i nde most (1/2) (6/6C), and the right hand side of (1) is at most te tam =(6)"4) But if Srell9)) ~ Moll) < Relor) < HE 1s we remarked eater, AEMon) - Alla) <3 (B)'s then BMD <(B Hence | But since A > 64- (6C/8}* (20/e) -Iog(939/e}logn, this is t most exp (loen( 1 20/eot08/0)) enctvobeca/e (4/22/0910 (1/3) mH HE, ‘This proves Lemma 4.2, and hence Theorem 4.1 ao One et of Ami ad nan] ges on estimate far then of (1 cymes ck as hen he gna al ba ge avrg wth butte basta gee with pte constant ad hs avenge etn ht i within a constant eng he greats posse consent wit iste conten Asin hopes ey se he pe conden to find uberqee of te gal ceucce wich sates an average loves pest, hat th evga soqrc, they find a subsequtee ym and conte ach hat Eel] > ofr eery# mT as wl sealing Dn to inroe the bound oe the ne they obiin without a type condones growth conan ot synmete obs, Coaliry 8.4), In Cape, esa exhibit, or ¢ p< 9 a seunce wih sis lover pest, wich dosnt have an amt smmetie Hck sequence of erty sei rset at urate! by These 8 Howe it taras out tha» pe conn nthe pce cotinine gl equmce on enti nba tof ger sno symm ek ses, This cory Toe issu cnet and the pgp constant of pce is lente to the ncn tain infrton bu! he distance fn pce bet soe he ane dneson. We sal hit an hen apy Thee it Lt conse the p=, He yr et el hat ges power of mis interesting, since no such bound follows from Theotem 8.1 or from results of Amir and Milman, We shall obtain a block sequence that is (1+ «)-ymmetsie ‘nd whose eardinality is & power of n that depends on the precise type constant, tending to 1/2 a8 the constant tends to 1. We shal of course insist -hat the original ‘basis is independent, since the I-dimensional Banach space has 2-ype constant 1 abilistic method cannot pessibly work. Tn ‘This in fact shows that a purely p ‘he next simple lemma, we show how to replace the original bass by a block basis that looks much nicer. Lemma 4.5 shows that a space with a good 2type constant ‘cannot have £00 large 2-cotype constant. The proof of Lemma £5 uses a fait standard technique. Lemma 44. Let 21,...)2_ bea linearly independent sequence of vectors in ts, ‘Then there isan orthonormal block sequence yty-+-tim Of f35.+-1ay of cardinality Proof, Set yx = 2:/lIz[|. Now there is at least one unit vector in the space spanned by 22 and 25 which is orthogonal to yy. Let yp be such a vector, There is at least one init veetor in the space spanned by 24, 25 and ag whith is orthogonal to both yy and ys. Let ys be such a vector. Continuing this process gives orthonormal block basis of cardinality m, where m is the greatest integer such that Jm(m_—1) VIF. a Lemuna 4-5. There exists an absolute constant 7 with the following property Let 0 <1 and fet X be any n-dimensional Banach space satisfying T(X) < 1-4. Then CX) < ynl8!149/1052 gn < n*/!82Jogn Proof, Infact, we use a rather weaker hypothesis. For any 2, 13 € X we have 1 : ater +lae alles + al? + lly ~ 20?) < (1+ O*Cleal? + Hall) By a simple substitution this implies tha, for say ys €X lle + vol? + ln — aol?) > +) + Ban) @ 53 Konig and eater [29 have shown that there it an absolute constant that for any n-dimensional space ¥ (V) € r0C210 mXlogn)* Let = 2 be the smallest power of that is greater than n,s0 k & 1+logn/ log! tnd suppose we have a sequence of vectors 2),...,2» € X. By repeated applica- ) tions of (2) we find that Elyrenf ease Seen +e| | | > eater) ad? We therefore have Cx(X,n) < C,(X,) < (146)! < (14e)-(L4)5/08? = (24 e)nlsttteoe? < 2n¢/82, Thus, if we set 7 = 2yo, we have that Cy(X) < yn'l982 (log n)? a ‘Theorem 4.6. Suppose #1y-.-y#n i# linearly independent sequence of vectors spanning a Banach space X with 2-type constant 1+ €. Then taere isa (1+ )- symmetric block sequence yiy.+.sUm Of 215...424 of cardinaliy at east m = anf (logn)’, where fle) = } —4e/log2 and a = a(¢) Proof, By Lemma 4.5, X has 2-cotype constant at most C' = -n'/!"82Jogn. A, ‘well known result of Kwapien (1) states that for any k-dimensional Banseh space y aC) < THY ICHY). Hence, X is actually C = (1+ e)C"-equivalent to €3. Let T:X + ( be a map such that (7 Land [|P-}|] (log) 73", Tnegermann's result (48) states that ay(Xyn) and a,(X) are the same, to within an absolute constant. We obtain CA X,n) > (log n) ATH X* n) > (log n)Faa( Xn) > rillog n)"aa(X*) > ra(log nN") > rallog n) CAC) where the remaining steps ane standard (soe ag. [89 Chapter 6) 1 seems likely that if the sequence in Theorem 4.7 satisfies EUS} ail > en¥/* for some constant c, then Lemma 4.4 is too weak, However, we have not found a way of exploiting the growth in this ease to obtain a better bound. ‘There axe various other questions suggested by the results of this chapter. One is to what extent Theorem 4.1 is best possible, There i a strong easlogy between ‘Theorem 4.1 and results of Figiel, Lindenstrouss and Milman, [15] ronnected with Dvoretsky's theorem. One of their results (cf, also (30) is that if X is an ne dimensional normed space that is C-equivalent to f2, then it has a subspace of dimension k = a(e,C)n that is (1-4 e}equivalent to G4. One can restate this as follows. Suppose lI: is # norm on R" such that [zl] < CljAzl] br any x € R | C—O and A € O(»). Then there isa k-dimensional subspace YC R® such that for any y€Y and any A € O(n) that eaves ¥ invariant, fyll < (+0) [lay Theorem 4.2 is very similne, but is concerned with the symmetry group {1.1]" x Sy instead of On). This suggests two possibilities. One is that one might beable to obtain abound in Theorem 4.1 that is actually proportional ton. The other is that one aight be able to relax the condition on the original bass from being C-equivelen to the unit vector basis of (y to being C-eysmmetsc, 1 turns owt that neither of these works, In Chapter 6, we shall show hat ‘Theorem 4.1 as stated is best possible, up to a factor of loglogn, and in pter 17, we shall exhibit a bass that is C-equivalent to the unit vector bass of (2, which has no almost symmetri block basis of cardinality n*%©), where 8(¢,C) depends fon e and C only, and tends to 2ero as log(1 +¢)/log C tends to aero. PART IIT ‘THE SIZE OF SYMMETRIC BLOCK BASES: UPPER BOUNDS CHAPTER 5 BASES WITH LARGE AVERAGE GROWTH In Chapter 8 we showed that any sequence 21... of wait vectors in normed space which satisfies the condition that Ef ill eteastn'/? mast Ihave an almost symmetsie block basis of cardinality at least 9(2)n*/?“1/ og Discussion of an upper bound for the size of an almost symmetric lock basis that js gunranteed by these conditions is somewhat complicated by the fact that there can often be block bases which are almost symmetric but which do not satiy cextsin other very natural conditions, The following example shews that in one sense the result of Chapter 3 is best possible. Let 1

3/2 our construction fils heeause the basi it gives hes a large block basis that is close to the unit vector basis of an approprinte (4, ‘Theorem 5:1. There exists an absolute constant C such that for any 1

[all 60 (ii) if > Cn¥l-Y(logn)*/* then no block basis wy.....uy of the standard ) log: Dasis is 2aymmetrie Let ws begin by setting m = (C/2)n*logn)*, h = (2/Cn*(logn)-*!, (Sn2V"*, We shall pick 27 fonetionals fis... fi N = 6008/" Jog» and 2 independently at random from the set of all functionals on R* with 1-coordinates, where this cet is endowed with the uniform probability measure. Given a vector 2 ER", we define «random norm by setting lal vax(llaly fila) s---sLfv(@)D) Our aim isto show that there exists a choice of fi,..., 1 such that no block basis of the standard basis of R* is 2-symmetric under the corresponding norm. In fact, it is ensy to deduce from our proof tht, with high probity, random choice will do. The other two conditions of Theorem 5.1 are trivially satiated by ny notm of this kind, As in the previous two chapters, we shall make one or two definitions and "ns state (wo lemmas which will be enough to prove our main theorem. Suppose we have a block basis uj,...,thy of the standard basis, and suppose ‘hat we can find some 1 meforvento 0 We shall say that it satisfies condition (+4) iF there exist j lm] and n sequence |} ) of signs my... such that [Sova >neefeenenta a = TTT ‘The next definition enables us to restrict our attention to block bases chat xy block basis, Suppose ky > F and sre slightly more regular than an arbi Visesss¥io is « block basis of the standard basis. Since the suppects of the vj are disjoint, we can certainly find k/2 of them such that cach one is supported on at most h coordinates. Passing to a subsequence ngsin, and relabeling, we ean use the pigeonhole principle to find a subbasis wt,...,thq and 0 > such that, for each GFE mAS ily <2. By multiplying each clement of the basis by At wwe obtain a bloc basis tay. sich that, for each 1 ella] > 1/2 We can therefore define some independent random variables 73y...y7m in such a way that, foreach é, 7 is dominated by [f(ui, and takes the values etl or 0, each with probability 1/2. Then E(DP%) = $y" lull, By an easy eppplicotion of ‘Theorem 1.1 and the fact that exch w, ie supported an nt most. coordinates, we have is] | Using these facts again, and also that p < 3/2, and picking she index j for > yy legge on Tr llog nj /P48/9 which [full is minimal, we have Beir Su > mmr bul, > mi hut, > (C/2)?* osm yl It follows that, if yee Moreover, since the functionals fi,...fy were chosen indspendently, the Pe bs Wewal < rnax{0 tog [lh vals us| probability that, for every j and every choice of signs m,---"im+ [Eve] -omfonenin i fs at most 8% = exp(—gmb!2/"N), In other words, we have shown that & siven proper block basis satisfies condition (e) with probability at lest 1 — 6% the proof of the frst part of Tt is ensy to check that @™ < M~, which comple Lemma 8. ot een anne Proof of Lemma 5:2. (ji) We must show that a proper bleck basis (w)F ‘which satisfies condition (+8) cannot be 2symmetsic. So let us suppose that itis aveymmetric, Thea fr ell choices of sgn (i) and any € [me certainly have [Sa [Som |} It follows that the support functional at each vector of the form SO$* nas is [> mrfsegots cone of fiys-eo fx We shall show that, on the contrary, no given fy ean support as many as N~!2M of these vectors, Let us Bit 1 O such that for every choice of signs (1), done alla < <2u lull fiom which t follows that CP (u)] < 2a. We know also that > 16 og and that, for each i, [f(us)| < 2|lui||. Let @ be the probability space of all sequences of signs (uniformly distributed. A final application of Theorem 3.1 gives Pal|s(So)] > atsil] x [all > 26 log fu stated. This completes the proof of Lemma 5.2 a Proof of Lemma 6:3. Given & > 0, let us define two block bases (ui}f* and (uf to be &-close if they are related ia the following way. First, for any i # jy supp(ui) Msupptus) = 0, and second, foreach i, us ~ uly <4. Let us estimate, 65 {or given 6, the size required ofa et of block bases for every proper block b cardinality kto be 6-close to atleast one block basis in the set. Sinve the nuruber ‘of ways of choosing m disjoint sets of size h ie certainly less than n™", and, by at ost (1-4/8) Lemna 1.3, the number of vectors # &-net ofthe 2-ball of wwe find that the size needed is certainly no greater than (9n/6)"™ = M. Now fix 6 to be n=}, let (ui}f" be a proper block bass, let (v4) be éelose to (ui}P and suppose that (v)}! satisfies condition (2). Since (us IP is proper block basis, IEP maul m2? for every choice of signs (7,)). We therefore have, for some j = ntlegmn§l9 ie |>[Eo > 80 logn ysl —2"/*6m"/* > 80 logni( lull, — 4"/7) > 64 logn lus Tha similar vay, using the fact that for every choice of signs, (n)P SIP mol, > lle, one can show that IEP nal] 4 SIP new and hence that (ai) satis fies condition (4) a We have lef open the following problem, If 3/2 < p <2 and t1y..-135 is a normalized basis satisfying a lower peetimate, then how loge an almost symmetsie block basis of 1)... must there be? Theorems 9.1 and 3.1 show that the anewer lies between about n¥/*-1 and about n!/, In Chapter 7 se shall ive partial answer to this, In particular, when p = 2, which is perhaps the most interesting case, we shall show that, for every a > 0, ifm is sufcintly large then there exits a normalized basis r1,-..,2n satisfying a lower 2-stimate such that no block basis of cardinality n® is 2-symmetsic, This will justify the rough idea fought not to be able to deduce very much merely from the fact that a 66 iofies « lower 2estimate, as this is fea property CHAPTER 6 BASES EQUIVALENT TO ‘THE STANDARD BASIS OF ( In Chapter 4, we showed that, if1 & p < 00, €> O and C > 1, then every bsia C-equivalent to the unit vector bass of fj has a (1 + e)-symmetri block basis of eardnalty a(e,p,C)n/logn, where a(e,p,C) > 0 depends on ¢ p and C ly. In this chapter, we shall show that this result, a least when p > 1, i close to being best posible. When p = 1, we shall obtain an upper bound which shows thet one eannot slways find an almost symmetric block basis of proportional size. ‘The two eases will be dealt with separately. (61 The Case 1< p O such that 1< [uy], <4 for each i For such 0 A {1 = Au, for each i, By a simple and standard averaging argument there exists a subset AC [ms] with [4] = n/® such that uy is supported on at most h = 25n/6me = log n/640(1 + p+ 4)eloglogn coordinates, for every i € A (The averaging argument gives more than thi, of course, but we shall not need the extra precision.) By applying the pigeonhole principle, we can ind 4 € [1,4] and A' CA such that [a!| =n? and p< lull < w+ AMV" for every i € A’ IE sve set uf = pu for each i ¢ a, we certainly have 1< [uf ¢14 307 for every 1 € We shall say that a block basis vij.-.,¥m is proper if m = n#/4, and Joupp(wvi)] < A and 1 fl] @ 14 AM for each 1 < F< ms. We have just shown that every block basis of cardinality at least mg has a subbssis, a multiple ‘of which is proper. We shall construct a norm in such a way that no proper block basisis (1.4 47!/%e/3)-symmetrie. It will follow that no block basis of cardinality im or greater is (1 4 4-¥/Pe/9)-symmetric under that norm. ‘The next lemma gives, es promised, the main properties that we shall use of the sets Ag, Fp and Gp. The third part of the lemma is simply a repetition of Lem 27. Lemma 6-1. (i) For any set B € [and any normalized proper block basis UUsjecss Um there exists a sequence of scalars dy... such that Fy aius € An, (ii) Let B € [1], Jot uy,...5thn be @ normalized proper block basis and let oo a for any pe: ausessom be # sequence for which SY aius € Ap. Then 1 € Sm and any sequence €3,1+- stm of signs (ii) Suppose B,C € B, B # C and suppose f € Fr, G € Ga and a € Ac Then fla) + (a) < (#/2)*! lal Proof, Note that, for any Xj € fm] with [Xj] = b the veotor [XI son clement of Ay. Hence, ifthe sts Xj (j € B) are all disiit, and we sot 2. = (jen NsI-Pxx,) 9 we Bave a = BIT aves € Av. This proves the fist prt of the lento, The second partis trivial and the third part as proved in Section 2.1 o “Let us now define the norm which we shall use. Let B be a set of the kind guaranteed to exist by Lemma 2.18, that is, a subset of (i) of cardinality (23/20)! with the property that, whenever B,C € B are distinct elements of B, (Kp: B B) be an element of wwe have [BAC] < 4/3. Set r= en and let 7 ({ol!)®. Then we can define a norm [on Ra follows: vp [010d s0) +06) F 6 Fa, 9 € Go, nl) ¢ Ke] “There is one very important fact about the norm [},, namelr that if € € B and a € Ac, then the maximum above is attained at C. That i, for uch an a we have al, v (2/04 mast fla) + (a) f € Foy 9 € Go, suppig) ¢ Ke} (0) “This follows from Lemma 6. (ji). Indeed, if B # C, f € Fa and € Go, 2/e)A(fla) + o(a)) < (1/2). On the other hand if “ny then, by Lemma 6.1 (i), ign(a) € Fey and (2/8)/*/(a) ae Ac, then f= al 70 Let P be the uniform probability measure on F. We shall show that ify €T is chosen randomly, then there is high probsbility that no normalized prope block basis is (1-4-4°¥/Pe)-symmetric under the statement of the We shall introduce one fusther definition to simpli next lemma and Inter discussion. Suppose w is a unit vector in A” such that Jeupp(u)| < A, and suppose that A [nll We shall say that w is lange on K if it can be restricted to a veetor u with fsupp(u)| 4-Y/Pet/2. It is obvious that wwe con ind f € Fy such tht f(a!) > €/2, so fall, > (/2}8/9(1 +4 ve) Now [a"ll, = (t/2)"?, and supp(a") Kx = 0. But, for any f € Fa, a 9 I = (4/2), 2, by (2) "ly < (t/2)!/". Hence (us) fails to be (1-+4-¥/*e) cymmetsie at a, which proves the lemma, a ‘We shall show thatthe sequences needed inthe conditions of Lemma 6.2 exist, with very high probability. For this we shall wse Corollary 2.12. Lemma 6:8, Let (wi) be a normalized proper block basis and let B € B. Then he probability that we can find indices iy,...yi1 such that wi,....)a, are Tonge (on Kp is at last 1-() @-ensera er) -(")a-a-ern" Prof e wl i etn px = Pu is large on K for at most 1 values of i], shen Ais chosen randomly from {n)( and r = en, Setting a = Jul? and taking «/8 instead of ¢ in Corollary 2.1 we obtsin [ovis tang on K | upp(us)n X= W fr 165] fs at Teast (1/16) (1 ~ 7/4), and so ne(t) ® [ll Lal, = <(f)a-a-ey—" o ane —e yey Similoly for at most {values of i] 1 Corollary 6-4. Let (u)_? be a normalized proper block basis, Thea the probe bility thot (ui)ft is (1-+472Fe)symmetsie under I, i af most b(t) @-ansrra enn") Proof Forcoch B € By conic ap € Ap geal by Own a8 te ron of Lemma 6:19). By (2) al, depends nl on Ki (where 1= (Ko: Be 8), Let po be the probability tat fl, (4 4-/Pebsymmete at ap. The, by Lemans 6.2 903, po<(") (-anotta-erer)™" + (7) 4-270" <2(7) (-anoa- #5) nd it B 4 C then po and pe are independent. The result fll immediatly a ‘The next emma resembles Lemna 89. Waal prove it tthe end ofthe section. First, however, we shall astume it and use it to prove the main theorem of the section, Lemma 6:5, Let 1 < p< 00,0.< 97 <1 and let M = (20n/n)"™. Then there exists a collection of M normalized proper block bases (u})Ba,-+-4(4) 2a of the standard basis of R" such that any norm 2-equivalent to |}, whish fails to be (14 n)-symmetzic on any of (u})By,---s (uf!) falls to be (1-+/8)-symmetric ‘on any proper block basis “The proof of our main theorem is now a simple matter of verification, ‘Theorem 6:6. Let 0 < ¢ < 1/2, let 1 < p< co, let n EN end let mp = 1000(1 + p+ 4)enloglogn/logn. Then there exists a norm jh] on R™ such that for any 2 ER", [rly < Ui] <2[slly but no block basis of cardinality exceeding img is (1+ 6}symannetcie for any 8 < 4-MP 6/3, co - Corollary 64 and Lemme 6.5 (with 9 = 41/¥e) it m) €T such that noblock basis of Proof. show that f2(7) @-cnsrra ‘From this it will follow thet there i at least one Now P(t) Gansta 270") < 2°! (om —N0/28) exp (¥ (og2 + Hog — (mn —Da/i6y“"4C 2/93) But since h slg, this ist most e/4)) * and (vi)? closet they satisfy supp(ui) supply) = B whenever i #j and if [us — vill, 1 breaks dowa when p = 1 and one doesnot obtain any result even by approximating ff by 65 for p sufficiently close to 1 for €f to be uniformly equivalent to €f. Roughly speaking, thisis becouse the unit bal of? i not sulfciently convex to allow many classes of “well-separated” vectors. However, using the construction of Section 2.9 and Lemma 2.8, we shall obtain a basis which is C-equivalent to the unit vector basis of ff such that no Bock bass of cardinality exceeding a(¢,C)/loglogn is (14¢}-symmetrc. The proofis similar to the proof of Theorem 6.6: ve shall prove a sequence of lemmas resembling Lemmas 6.1 to 6.4 First, we need a defsition ofa proper block basi appropriste for this context Let mg = (240e/logC)n/loglogn and let h = (1ogC/200)loglogn, We shall say that a block basis yy... tm is proper if m = n¥/4, Jsupptus)| < hand 1 < [Jul] € 1+ 307% for each 1-< i Proof, If Xi € [mm] has cardinality KODA, then 8 Dey, € Aas If we pick disjoint sets Xy,...,%r each satisfying the above, and if we set eee eee 1nd the third follows then a= DiLyqiu) € dy. ‘The second part is trv tely fom Lemme 28. o There is an important fact sbout [L, anslogous to the fact mentioned after Sanda the proof of Lemma 6.1, namely that if ev then the ater maximum in the definition ofall, is attained at s. That is, for such an a, we have Hall, = lal, Vmax fila) + fala): fase € Farsupp fa ‘This follows from Lemma 6.7 end the fact thet S is an ontichainin the strong we of Lemma 2.14, Indeed, suppose # and sare distinct members of S and yy Lemma 6.7 (i), fala) + ala) r Given w€ RY and K€ [n]!, let us define w to be large on K if supplu) C IK. Suppose that uy,...,Uei8 a sequence of disjintly supported vectors such Provided that i < yf, the following two estimates are easy, whatever the sets Wj which appear might be, P [sno(u) woplu)nKaWerrejo* and Pfanp(aj nk = 8 fannaprx=W;oer r(1 +). On the other hand, a! € dy and supp(a”) 1K = 0, By the remarks following the proof of Lemma 6.7, it follows that Ja",

You might also like