Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

Voted

MLQ
2007

83views more MLQ 2007»

Computing the complexity of the relation of isometry between separable Banach spaces

15 years 2 months ago

Computing the complexity of the relation of isometry between separable Banach spaces

Download math.univ-lyon1.fr

We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation is Borel bireducible to the universal relation for Borel actions of Polish groups.

Julien Melleray

Real-time Traffic

Borel Actions | Borel Complexity | MLQ 2007 | Separable Banach Spaces |

claim paper

Related Content

» Active Learning by Spherical Subdivision

» Measures of Diversity for Populations and Distances Between Individuals with Highly Reorga...

» Toward Learning Gaussian Mixtures with Arbitrary Separation

» A Class of Photometric Invariants Separating Material from Shape and Illumination

» DFinder A Tool for Compositional Deadlock Detection and Verification

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MLQ
Authors	Julien Melleray

Comments (0)