Searcharxiv⌕ Search

arXiv · math/0005150

Banach embedding properties of non-commutative L^p-spaces

Abstract

Let N and M be von Neumann algebras. It is proved that L^p(N) does not Banach embed in L^p(M) for N infinite, M finite, 1 < or = p < 2. The following considerably stronger result is obtained (which implies this, since the Schatten p-class C_p embeds in L^p(N) for N infinite). Theorem: Let 1 < or = p < 2 and let X be a Banach space with a spanning set (x_{ij}) so that for some C < or = 1: (i) any row or column is C-equivalent to the usual ell^2-basis; (ii) (x_{i_k,j_k}) is C-equivalent to the usual ell^p-basis, for any i_1 < i_2 < ... and j_1 < j_2 < ... . Then X is not isomorphic to a subspace of L^p(M), for M finite. Complements on the Banach space structure of non-commutative L^p-spaces are obtained, such as the p-Banach-Saks property and characterizations of subspaces of L^p(M) containing ell^p isomorphically. The spaces L^p(N) are classified up to Banach isomorphism, for N infinite-dimensional, hyperfinite and semifinite, 1 < or = p< infty, p not= 2. It is proved that there are exactly thirteen isomorphism types; the corresponding embedding properties are determined for p < 2 via an eight level Hasse diagram. It is also proved for all 1 < or = p < infty that L^p(N) is completely isomorphic to L^p(M) if N and M are the algebras associated to free groups, or if N and M are injective factors of type III_lambda and III_{lambda'} for 0 < lambda, lambda' < or = 1.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

U. Haagerup, H. P. Rosenthal, F. A. Sukochev. 2000-05-15. Banach embedding properties of non-commutative L^p-spaces. https://arxiv.org/abs/math/0005150

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On a characterization of spaces satisfying open mapping and equivalent theorems

We study open-mapping, continuous-inverse and closed-graph properties for maps whose domain and range belong to the same class of Hausdorff topological vector spaces. Quotient and graph stability imply equivalence of these properties. In the locally convex setting, we characterize barrelled infra-Pták spaces and barrelled Pták spaces as largest classes determined by the closed-graph property, Banach test spaces and appropriate nearly-open image conditions.

math.FA↗

A family of matrix flows converging to normal matrices

The celebrated Antezana-Pujals-Stojanoff Theorem states that the iterated Aluthge transforms of an arbitrary matrix converge to a normal matrix. We introduce a family of matrix flows that share this convergence property by defining them through ordinary differential equations. The family includes a continuous analogue of the Aluthge transform, as well as a differential equation discussed by Haagerup in the context of II$_1$ factors. We also examine the same type of flows in the setting of Hilbert space operators equipped with unitarily invariant norms.

math.FA↗

A Novel Two-Parameter Penalty: Relaxation Degree Analysis and Sparse Signal Recovery

In this article, we introduce a nonconvex two-parameter penalty function $P_{a,p}$, parameterized by $a\in(0,\infty)$ and $p\in(0,1]$, and the relaxation degree RD$_P$ for a separable nonconvex penalty function $P$. Based on $P_{a,p}$, we further propose the $P_{a,p}$ minimization framework for sparse signal recovery. This framework generalizes the TL1 minimization model established by S. Zhang and J. Xin (corresponding to the special case $p=1$) and provides a unified family of nonconvex penalty functions for sparse signal recovery. Using the sparse convex-combination technique, we establish both exact and stable sparse signal recovery under the restricted isometry property (RIP). To efficiently solve the resulting nonconvex optimization problem, we apply a modified iteratively re-weighted least squares method and the difference of convex functions algorithm (DCA) to develop the IRLSTLp algorithm for unconstrained $P_{a,p}$ minimization and prove some convergence results. Finally, numerical experiments compare recovery and runtime against single- and double-loop baselines, examine sensitivity to $(a,p)$, and assess the empirical correlation between RD$_{P_{a,p}}$ and recovery within the proposed family.

math.FA↗