Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

1 Introduction

Let \(X = (\mathbb{R}^{n},\vert \vert \cdot \vert \vert )\) be an n-dimensional normed space. For a given integer k define by α(k), β(k) the smallest possible constants, satisfying

$$\displaystyle{\left (E\left \|\sum _{i=1}^{k}\gamma _{ i}x_{i}\right \|^{2}\right )^{1/2} \leq \alpha (k)\left (\sum _{ i=1}^{k}\vert \vert x_{ i}\vert \vert ^{2}\right )^{1/2}}$$

and

$$\displaystyle{\left (E\left \|\sum _{i=1}^{k}\gamma _{ i}x_{i}\right \|^{2}\right )^{1/2} \geq \beta ^{-1}(k)\left (\sum _{ i=1}^{k}\vert \vert x_{ i}\vert \vert ^{2}\right )^{1/2}}$$

for any {x i }1 k ⊂ X and γ i independent normalized Gaussian random variables. We say that X has type 2 α where α = sup k α(k). Similarly we say that X has cotype 2 constant β where β = sup k β(k). By a result of Tomczak-Jaegermann (see [11]), it is known that α ≤ 2α(n) and β ≤ 2β(n). Thus, up to a universal constant we may always deal with n-tuples in the definition of type and cotype for n-dimensional spaces. Both notions play an important role in the study of Banach spaces and local theory.

Remark 1.1

In this note we consider only Gaussian type and cotype constants, and we do not deal with Rademacher type and cotype (see [6, 7, 11]).

Before we discuss a few examples, recall that given two n dimensional normed spaces X, Y, the Banach Mazur distance between X, Y is

$$\displaystyle{d(X,Y ) =\sup \{ \vert \vert T\vert \vert \vert \vert T^{-1}\vert \vert: T: X \rightarrow Y \ \text{is an isomorphism}\}.}$$

Whenever Y is a Euclidean space, we will denote d(X, Y ) by d X . The next theorem, due to Kwapien, provides an upper bound for d X through type 2 and cotype 2 constants.

Theorem 1.2 (Kwapien [4])

Let X be a (finite or infinite) Banach space. Then, X is isomorphic to a Hilbert space if and only if it has a finite type 2 and a finite cotype 2 constants. Moreover, in this case we have d X ≤αβ, where α is the type 2 constant and β is the cotype 2 constant of X.

It can be shown that the bound in Theorem 1.2 is not optimal. That is, we can find a space X such that α β is of order n, which is clearly not optimal since d X is always bounded by \(\sqrt{n}\) (John’s Theorem). In this note we present a new point of view on the above result, which provides us an equality instead of an upper bound in Theorem 1.2. To this end, we present the notion of orbits in normed spaces.

Definition 1.3

Let x = (x 1, … x k ) ⊂ X. We say that a k-tuple y = (y 1, … y k ) belongs to the orbit set of x if there exists U = (u ij ) ∈ O(k) such that

$$\displaystyle{y_{i} =\sum _{ j=1}^{k}u_{ ij}x_{j}.}$$

The set of all such k-tuples will be denoted by O(x) = { Ux: U ∈ O(k)} and called the orbit of x.

Using this notion, we may define the Gaussian type 2 and cotype 2 of an orbit x as the smallest constants α(x), β(x) such that

$$\displaystyle{\left (E\left \|\sum _{i=1}^{k}\gamma _{ i}y_{i}\right \|^{2}\right )^{1/2} \leq \alpha (x)\left (\sum _{ i=1}^{k}\vert \vert y_{ i}\vert \vert ^{2}\right )^{1/2}}$$

and

$$\displaystyle{\left (E\left \|\sum _{i=1}^{k}\gamma _{ i}y_{i}\right \|^{2}\right )^{1/2} \geq \beta ^{-1}(x)\left (\sum _{ i=1}^{k}\vert \vert y_{ i}\vert \vert ^{2}\right )^{1/2}}$$

for all y ∈ O(x). Clearly, α(x) = α(y) and β(x) = β(y) for all y ∈ O(x), so the constants are well defined. Denote

$$\displaystyle{g(x,\gamma ) = E\left \|\sum _{i=1}^{k}\gamma _{ i}x_{i}\right \|^{2},}$$

where γ = {γ i }1 k. Due to the rotation invariance of the standard Gaussian measure we have that if y ∈ O(x) then g(x, γ) = g(y, γ ), where γ  = {γ i }1 k are independent Gaussian variables, which are also independent of γ (see e.g. [9, Chap. 2, p. 13]). Hence,

$$\displaystyle{ \alpha (x)\beta (x) =\inf \left \{\left (\frac{\sum _{i=1}^{k}\vert \vert y_{i}\vert \vert ^{2}} {\sum _{i=1}^{k}\vert \vert z_{i}\vert \vert ^{2}}\right )^{1/2}: y,z \in O(x)\right \} }$$
(1)

Using the notion of orbits it is possible to write the exact formula for d X in Theorem 1.2:

Theorem 1.4

For any n dimensional normed space X we have

$$\displaystyle{d_{X} =\sup \{\alpha (x)\beta (x)\vert x = (x_{1},\ldots x_{k}),k = 1,2,\ldots \}.}$$

Moreover,

$$\displaystyle{d_{X} \leq 4\sup \{\alpha (x)\beta (x): x = (x_{1},\ldots x_{n})\}.}$$

Of course, the first formula is correct for infinite dimensional spaces as well.

Remark 1.5

The question of the exact formula for d X was also considered in the Master Thesis of Limor Ben-Efraim, under the supervision of V. Milman (not published).

Remark 1.6

It was noted by Pivovarov (private communication, 2016) that Theorem 1.4 easily implies that \(d_{X} \leq 4\sqrt{n}\).

In the spirit of Theorem 1.4, it is possible to reformulate several well known theorems regarding embeddings of l 1 k and l k in X, such as Alon-Milman’s theorem (see [1]) and Elton’s theorem (see [2]). However, since those theorems involve Rademacher averaging instead of Gaussian averaging, the results will not be precise, as those averages are not equivalent in the general case.

However, the following two theorems may be reformulated in an exact way:

Theorem 1.7 (Figiel-Lindenstrauss-Milman [3])

Let X be an n dimensional normed space with the unit ball K. Let x = (x 1 ,x 2 ,…x n ) be an orbit with cotype 2 constant β(x). If x is the orthogonal basis of the maximal volume ellipsoid of K then X contains a subspace of dimension k = cnβ(x) −2 that is 2-isomorphic to l 2 k , for some universal constant c > 0.

Theorem 1.8 ([6, Theorem 9.7])

Let X be an n-dimensional normed space and let x = (x 1 ,…,x k ) ⊂ X be a k-tuple for some k ≤ n. If O(x) has a 2-type constant α, then the space E = span{x i } 1 k contains a space of dimension \(m = \left [c\alpha ^{2}\right ]\) which is 2-isomorphic to l 2 m , for some absolute constant c > 0.

It may be an interesting question to analyze the Maurey-Pisier lemma for equivalence of Rademacher and Gaussian averages (see [8, Proposition  3.2]) in this context. However, one should consider a general orbit of cotype q which is not done in this note.

2 Proof of the Extended Kwapien Theorem

Proof

Before we proceed with the proof of Theorem 1.4, let us recall a few definitions and facts.

Definition 2.1

An operator u: X → Y factors through a Hilbert space if there is a Hilbert space H and operators B: X → H and A: H → Y such that u = AB. Denote by \(\Gamma _{2}(X,Y )\) the space of all such operators, equipped with the norm

$$\displaystyle{\gamma _{2}(u) =\inf \{\| A\|\|B\|\}}$$

where the infimum is taken over all factorizations of u.

A well known theorem by Lindenstrauss and Pelczynski (see [5], [7, Theorem 2.4], [11, Proposition 13.11]) provides a necessary and sufficient condition when an operator u belongs to \(\Gamma _{2}(X,Y )\):

Theorem 2.2

u: X → Y belongs to \(\Gamma _{2}(X,Y )\) if and only if there exists a constant C such that for all n and all n × n orthogonal matrices (a ij ) we have,

$$\displaystyle{\left (\sum _{i=1}^{n}\left \|\sum _{ j=1}^{n}a_{ ij}ux_{j}\right \|^{2}\right )^{1/2} \leq C\left (\sum _{ i=1}^{n}\left \|x_{ i}\right \|^{2}\right )^{1/2}}$$

for all x, 1 …x n ∈ X. Moreover, γ 2 (u) coincides with the smallest possible constant C satisfying the above inequality.

Let x = (x j ) be a k-tuple of elements of X and let (a ij ) ∈ O(k). By the definition of Gaussian orbit cotype of x we have

$$\displaystyle{ \beta (x)^{-1}\left (\sum _{ i=1}^{k}\left \|\sum _{ j=1}^{k}a_{ ij}x_{j}\right \|^{2}\right )^{1/2} \leq \left (E\left \|\sum _{ i=1}^{k}\gamma _{ i}\sum _{j=1}^{k}a_{ ij}x_{j}\right \|^{2}\right )^{1/2}. }$$
(2)

By the definition of Gaussian orbit type we have

$$\displaystyle{ g(x,\gamma )^{1/2} \leq \alpha (x)\left (\sum _{ i=1}^{k}\|x_{ i}\|^{2}\right )^{1/2}. }$$
(3)

However, since g(x, γ) = g(y, γ) where

$$\displaystyle{y_{i} =\sum _{ j=1}^{k}a_{ ij}x_{j},}$$

we get that

$$\displaystyle{ \left (\sum _{i=1}^{k}\left \|\sum _{ j=1}^{k}a_{ ij}x_{j}\right \|^{2}\right )^{1/2} \leq \alpha (x)\beta (x)\left (\sum _{ i=1}^{k}\|x_{ i}\|^{2}\right )^{1/2}. }$$
(4)

Thus, the condition of Theorem 2.2 is satisfied with the constant

$$\displaystyle{C =\sup _{x}\{\alpha (x)\beta (x)\}.}$$

Clearly, β(x) and α(x) are the smallest possible numbers satisfying (2) and (3). Therefore, sup x {α(x)β(x)} is the smallest possible number satisfying (4) for each positive k and each k-frame x. Thus,

$$\displaystyle{\gamma _{2}(Id) =\sup \{\alpha (x)\beta (x)\},}$$

However, γ 2(Id) = d X (by definition), so the first part of the proof of Theorem 1.4 is finished. □ 

Remark 2.3

In the case where dimX = dimY = n, one may consider only n × n orthogonal matrices and the best constant C in Theorem 2.2 is equivalent to γ 2(u) up to a factor of 4. This was noted independently by Tomczak-Jaegermann and Pisier (private communication, 2000). Since the result was not published we will provide a different argument which is due to Tomczak-Jaegermann.

To this end, we recall several facts regarding absolutely summing operators (see [7, 11]).

Definition 2.4

Let X and Y be Banach spaces. An operator u: X → Y is called 2-summing operator if there exists a constant C such that for all finite sequences {x i } ⊂ X:

$$\displaystyle{\left (\sum _{i=1}^{k}\|ux_{ i}\|^{2}\right )^{1/2} \leq C\sup _{\xi \in X^{{\ast}},\|\xi \|\leq 1}\left (\sum _{i=1}^{k}\vert \xi (x_{ i})\vert ^{2}\right )^{1/2}.}$$

The smallest possible C satisfying the above is denoted by π 2(u) and is called the 2-summing norm of u.

Now we will define a similar concept for an orbit and see how it relates to the definition above. From now on, unless stated otherwise, it is assumed that X is an n-dimensional normed space.

Definition 2.5

Given an operator u: l 2 k → X, denote

$$\displaystyle{\pi _{2}^{(k)}(u) =\sup \left (\sum _{ i=1}^{k}\|uf_{ i}\|^{2}\right )^{1/2},}$$
$$\displaystyle{\delta _{2}^{(k)}(u) =\inf \left (\sum _{ i=1}^{k}\|uf_{ i}\|^{2}\right )^{1/2},}$$

where {f i }1 k runs over all orthonormal bases of l 2 k.

Given an orbit x = { x 1, … x k } ⊂ X we will denote π 2 (k)(x) = π 2 (k)(u), δ 2 (k)(x) = δ (k)(u) where u is defined by

$$\displaystyle{ue_{i} = x_{i},\qquad 1 \leq i \leq k.}$$

Remark 2.6

The standard definition of π 2 (k)(u) slightly differs from definition above. It is defined as the smallest possible constant satisfying

$$\displaystyle{\left (\sum _{i=1}^{k}\|ux_{ i}\|^{2}\right )^{1/2} \leq C\sup _{\xi \in X^{{\ast}},\|\xi \|\leq 1}\left (\sum _{i=1}^{k}\vert \xi (x_{ i})\vert ^{2}\right )^{1/2},}$$

for all x 1, … x k  ∈ X.

By a theorem of Tomczak-Jaegermann [10] we have that for any operator u: l 2 k → X of rank n:

$$\displaystyle{ \pi _{2}^{(n)}(u) \leq \pi _{ 2}(u) \leq 2\pi _{2}^{(n)}(u). }$$
(5)

Since the proof of (5) constructs an orthonormal basis (e j ) of l 2 n that satisfies

$$\displaystyle{\left (\sum _{i=1}^{n}\|ue_{ i}\|^{2}\right )^{1/2} \geq \frac{1} {2}\pi _{2}(u),}$$

we get that inequality (5) holds for our definition of π 2 (n)(u) as well.

An easy consequence of the above is the following lemma:

Lemma 2.7

For each k ≥ n and x = (x 1 ,…x k ) ⊂ X there exists y ∈ O(x) and a subset y ⊂ y of cardinality n such that

$$\displaystyle{\pi _{2}^{(k)}(y) \leq 2\pi _{ 2}^{(n)}(y^{{\prime}}).}$$

Proof

Let u: l 2 k → X be the operator defined by ue i  = x i , and denote E = ker(u) ⊥ . Denote by P: l 2 k → E the orthogonal projection such that u = u |  E P. Let f 1 … f n  ∈ E and f n+1 … f k  ∈ E  ⊥  be another orthonormal basis of l 2 k and denote by y i  = uf i . Clearly,

$$\displaystyle{\pi _{2}^{(k)}(x) \leq \pi _{ 2}(u) =\pi _{2}(u\vert _{E}) \leq 2\pi _{2}^{(n)}(y^{{\prime}})}$$

where y  = (y 1, … y n ). □ 

Since δ 2 (k) is not necessarily convex, denote by \(\hat{\delta }_{2}^{(k)}\) the largest convex function that is smaller than δ 2 (k). The norms π 2 (k) and \(\hat{\delta }_{2}^{(k)}\) are dual norms on L(l 2 k, X) and L(l 2 k, X ). That is

$$\displaystyle{\pi _{2}^{(k)}(u) =\sup \{ \vert trace(uv)\vert: v^{{\ast}}\in L(l_{ 2}^{k},X^{{\ast}}),\hat{\delta _{ 2}^{(k)}}(v^{{\ast}}) \leq 1\}.}$$

The proof of this fact is similar to the proof presented in [11, Proposition 9.9], for the norms π 2 and δ 2.

By a standard duality argument we get the following corollary.

Corollary 2.8

Let u: l 2 k → X be an operator, where k ≥ n. Let E = (ker u) with dim E=n, and let P be the orthogonal projection P: l 2 k → E. Define \(\tilde{u}: E \rightarrow X\) such that \(u =\tilde{ u}P\) . Then we have

$$\displaystyle{\hat{\delta }_{2}^{(n)}(\tilde{u}) \leq 2\delta _{ 2}^{(k)}(u).}$$

Now, we may prove the key lemma required for our goal.

Lemma 2.9

If C satisfies

$$\displaystyle{ \forall x = (x_{1},\ldots x_{n}) \subset X,\quad \pi _{2}^{(n)}(x) \leq C\nu _{ 2}^{(n)}(x), }$$
(6)

then, for all k > n,

$$\displaystyle{ \forall x = (x_{1},\ldots x_{k}) \subset X,\quad \pi _{2}^{(k)}(x) \leq 4C\nu _{ 2}^{(k)}(x), }$$
(7)

Proof

Denote by X m the space of all m-tuples of X. Take x ∈ X n and consider u: l 2 n → X an operator defined by ue i  = x i . Clearly, by (6) and the convexity of \(\hat{\delta }_{2}^{n}\) and π 2 (n)

$$\displaystyle{\pi _{2}^{(n)}(x) \leq C\hat{\delta }_{ 2}^{(n)}(u).}$$

Given k ≥ n take x = (x 1, … x k ), y ∈ O(x) and define operator u as above. As before, denote E = (keru) ⊥  and by P: l 2 k → E the orthogonal projection. Define \(\tilde{u}: E \rightarrow X\) such that \(u =\tilde{ u}P\). Let f 1 … f n  ∈ E and f n+1 … f k  ∈ E  ⊥  be some orthonormal basis of l 2 k. Denote y i  = uf i and y = (y 1, … y k ), y  = (y 1, … y n ). Then,

$$\displaystyle{\pi _{2}^{(k)}(x) =\pi _{ 2}^{(k)}(y) \leq 2\pi _{ 2}^{(n)}(y^{{\prime}})}$$

and

$$\displaystyle{\hat{\delta }_{2}^{(n)}(\tilde{u}) \leq 2\delta _{ 2}^{(k)}(u) =\nu _{ 2}^{(k)}(y) = 2\nu _{ 2}^{(k)}(x).}$$

Thus,

$$\displaystyle{\pi _{2}^{(k)}(x) \leq 2\pi _{ 2}^{(n)}(y^{{\prime}}) \leq 2C\hat{\delta }_{ 2}^{(n)}(\tilde{u}) \leq 4C\nu _{ 2}^{(k)}(x).}$$

 □ 

Now we may finish the second part of main theorem. Let x = (x 1, … x k ). Notice that by (1), for each k

$$\displaystyle{\alpha (x)\beta (x) = \frac{\pi _{2}^{(k)}(x)} {\nu _{2}^{(k)}(x)}.}$$

Applying Lemma 2.9 we get

$$\displaystyle\begin{array}{rcl} \sup _{x\in X^{k}}\alpha (x)\beta (x)& =& \sup _{x\in X^{k}}\frac{\pi _{2}^{(k)}(x)} {\nu _{2}^{(k)}(x)} \leq 4\sup _{x\in X^{n}}\frac{\pi _{2}^{(n)}(x)} {\nu _{2}^{(n)}(x)}{}\\ && {}\\ & =& 4\sup _{x\in X^{n}}\{\alpha (x)\beta (x)\} {}\\ \end{array}$$

and the proof is complete.