Computing the complexity of the relation of isometry between separable Banach spaces
β Scribed by Julien Melleray
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 114 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [2], MayerβWolf [5], and Weaver [8]. We show that this relation is Borel bireducible to the universal relation for Borel actions of Polish groups. (Β© 2007 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
π SIMILAR VOLUMES
## Introduction. The theory of discrete approximation serves as a framework of approximation and discretization methods for the numerical solution of functional equations. This theory allows a unified functional-analytic treatment of these methods. It was developed by several authors (see e.g. the
## Abstract We study computability of the abstract linear Cauchy problem equation image where __A__ is a linear operator, possibly unbounded, on a Banach space __X__. We give necessary and sufficient conditions for __A__ such that the solution operator __K__: __x__ β¦ __u__ of the problem (1) is c
The aim of this paper is to propose such a specification . Frameworks for specifying relations are proposed for : disciplines ; the human -computer interaction (HCI) general design problem ; and validation . The frameworks are used to model , and so to specify , the relations : between HCI research