Abstract
In this paper we prove computable versions of Urysohn’s lemma and the Tietze-Urysohn extension theorem for computable metric spaces. We use the TTE approach to computable analysis where objects are represented by finite or infinite sequences of symbols and computations transform sequences of symbols to sequences of symbols. The theorems hold for standard representations of the metric space, the set of real numbers, the set of closed subsets and the set of continuous functions. We show that there are computable procedures determining the continuous functions from the initial data (closed sets, continuous functions). The paper generalizes results by Yasugi, Mori and Tsujii in two ways: (1) The Tietze-Urysohn extension applies not only to “strictly effectively σ-compact co-r.e.” sets but to all co-r.e. closed sets. (2) Not only computable functions exist for computable sets and functions, respectively, but there are computable procedures which determine continuous functions from arbitrary closed sets and continuous functions, respectively. These procedures, however, are not extensional on the names under consideration, and so they induce merely multi-valued computable functions on the objects.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Vasco Brattka and Klaus Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65–93, 1999.
J. Dieudonné. Foundations of Modern Analysis. Academic Press, New York, 1960.
Ryszard Engelking. General Topology, volume 6 of Sigma series in pure mathematics. Heldermann, Berlin, 1989.
Christoph Kreitz and Klaus Weihrauch. Theory of representations. Theoretical Computer Science, 38:35–53, 1985.
Takakazu Mori, Yoshiki Tsujii, and Mariko Yasugi. Computability structures on metric spaces. In Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, and Ian H. Witten, editors, Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, pages 351–362, Singapore, 1997. Springer. Proceedings of DMTCS’96.
Marian B. Pour-El and J. Ian Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.
Klaus Weihrauch. Computability on computable metric spaces. Theoretical Computer Science, 113:191–210, 1993. Fundamental Study.
Klaus Weihrauch. Computable Analysis. Springer, Berlin, 2000.
Klaus Weihrauch and Ulrich Schreiber. Embedding metric spaces into cpo’s. Theoretical Computer Science, 16:5–24, 1981.
Mariko Yasugi, Takakazu Mori, and Yoshiki Tsujii. Effective properties of sets and functions in metric spaces with computability structure. Theoretical Computer Science, 219:467–486, 1999.
Qing Zhou. Computable real-valued functions on recursive open and closed subsets of Euclidean space. Mathematical Logic Quarterly, 42:379–409, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weihrauch, K. (2001). On Computable Metric Spaces Tietze-Urysohn Extension Is Computable. In: Blanck, J., Brattka, V., Hertling, P. (eds) Computability and Complexity in Analysis. CCA 2000. Lecture Notes in Computer Science, vol 2064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-45335-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42197-9
Online ISBN: 978-3-540-45335-2
eBook Packages: Springer Book Archive