𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A Problem in Discretization Theory Relat
✍ S. Heinrich πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 320 KB πŸ‘ 1 views

## 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

Computable analysis of the abstract Cauc
✍ Klaus Weihrauch; Ning Zhong πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 222 KB πŸ‘ 1 views

## 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

Specifying relations between research an
✍ John Long πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 452 KB

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