Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T14:43:50.315Z Has data issue: false hasContentIssue false

Reducibility of domain representations and Cantor–Weihrauch domain representations

Published online by Cambridge University Press:  01 December 2008

JENS BLANCK*
Affiliation:
Swansea University, Singleton Park, Swansea, SA2 8PP, United Kingdom
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We introduce a notion of reducibility of representations of topological spaces and study some basic properties of this notion for domain representations.

A representation reduces to another if its representing map factors through the other representation. Reductions form a pre-order on representations. A spectrum is a class of representations divided by the equivalence relation induced by reductions. We establish some basic properties of spectra, such as, non-triviality. Equivalent representations represent the same set of functions on the represented space.

Within a class of representations, a representation is universal if all representations in the class reduce to it. We show that notions of admissibility, considered both for domains and within Weihrauch's TTE, are universality concepts in the appropriate spectra. Viewing TTE representations as domain representations, the reduction notion here is a natural generalisation of the one from TTE.

To illustrate the framework, we consider some domain representations of real numbers and show that the usual interval domain representation, which is universal among dense representations, does not reduce to various Cantor domain representations. On the other hand, however, we show that a substructure of the interval domain more suitable for efficient computation of operations is equivalent to the usual interval domain with respect to reducibility.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2008