Some equivalence relations which are Borel reducible to isomorphism between separable Banach spaces (Q2382322): Difference between revisions
From MaRDI portal
Latest revision as of 08:45, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some equivalence relations which are Borel reducible to isomorphism between separable Banach spaces |
scientific article |
Statements
Some equivalence relations which are Borel reducible to isomorphism between separable Banach spaces (English)
0 references
9 October 2007
0 references
Gowers' fundamental theorem asserts that the Hilbert space is characterized by the fact that the isomorphism equivalence relation between its infinite-dimensional subspaces has only one class. Quite surprisingly, it is still unknown whether this equivalence relation has infinitely many classes for every Banach space which is not Hilbertian. The present work shows that for natural Banach spaces (namely \(c_0\), \(l_p\) or \(L_p\), with \(1\leq p <2\)), there is a continuum of isomorphism classes and that in fact more is true: namely the isomorphism equivalence relation is greater, in the sense of Borel reducibility, than certain classical equivalence relations, and thus the complexity of the isomorphism relation is high. Quite a lot of work along these lines has been accomplished in the last ten years: for instance, V. Ferenczi, A. Louveau and C. Rosendal have recently shown that the isomorphism relation between separable Banach spaces has maximal complexity among the analytic equivalence relations on Polish spaces. However some important problems remain open: for instance it is still unknown if there is a continuum of isomorphism classes from complemented subspaces of reflexive non-Hilbertian \(L_p\) spaces, although J. Bourgain, H. P. Rosenthal and G. Schechtman showed 30 years ago that there are uncountably many such classes.
0 references
Isomorphism between subspaces
0 references
Borel reducibility
0 references
complexity of equivalence relations.
0 references
0 references
0 references
0 references