Computable copies of ℓ p 1

DOI10.3233/COM-160065zbMATH Open1472.03042arXiv1504.04664MaRDI QIDQ4601032FDOQ4601032

Authors: Timothy H. McNicholl 

Publication date: 18 January 2018

Published in: Computability (Search for Journal in Brave)

Abstract: �egin{abstract} Suppose $p$ is a computable real so that $pgeq1$. It is shown that the halting set can compute a surjective linear isometry between any two computable copies of $el{l}^p$. It is also shown that this result is optimal in that when $peq2$ there are two computable copies of $el{l}^p$ with the property that any oracle that computes a linear isometry of one onto the other must also compute the halting set. Thus, $el{l}^p$ is $Delt{a}_2^0$-categorical and is computably categorical if and only if $p=2$. It is also shown that there is a computably categorical Banach space that is not a Hilbert space and that $el{l}^p$ is linearly isometric to a computable Banach space if and only if $p$ is computable. These results hold in both the real and complex case.

Full work available at URL: https://arxiv.org/abs/1504.04664

Recommendations

• The isometry degree of a computable copy of ℓ p 1
• The isometry degree of a computable copy of \(\ell^p\)
• L^p‐Computability
• scientific article; zbMATH DE number 5064948
• L p -Computability in Recursive Analysis
• \(sQ_1\)-degrees of computably enumerable sets
• Computability and the Connes embedding problem
• Computability on Subsets of Locally Compact Spaces
• Computability of Følner sets
• On \(p\)-reducibility of computable numerations

zbMATH Keywords

computable analysiscomputable model theory\(\ell^p\) spaces

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Computable structure theory, computable model theory (03C57) Sequence spaces (including Köthe sequence spaces) (46A45) Applications of computability and recursion theory (03D80)

Cited In (18)

• A semilattice of degrees of computable metrics
• New degree spectra of Polish spaces
• Computing on the Banach space C [ 0 , 1 ]
• Degrees of and lowness for isometric isomorphism
• Analytic computable structure theory and \(L^p\) spaces
• Computability of Polish spaces up to homeomorphism
• Computable analysis and classification problems
• Computably and punctually universal spaces
• The isometry degree of a computable copy of \(\ell^p\)
• Computable presentations of C*-algebras
• Analytic computable structure theory and \(L^p\)-spaces. II
• Computable reducibility of metrics on the reals
• Computing the exponent of a Lebesgue space
• Title not available (Why is that?)
• The isometry degree of a computable copy of ℓ p 1
• Computable Stone spaces
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computability is an Open Problem

This page was built for publication: Computable copies of ℓ p 1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601032)