[Paper Review] A new introduction to the theory of represented spaces

Arno Pauly|arXiv (Cornell University)|Apr 17, 2012

Computability, Logic, AI Algorithms14 citations

TL;DR

This paper offers a concise, abstract introduction to represented spaces—a foundational framework for computability in analysis and measure theory—by characterizing key properties like compactness, overtness, and separation through the computability of specific mappings. It demonstrates that diverse computable mappings often induce equivalent topological properties, unifying concepts across function spaces and subset constructions.

ABSTRACT

Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented spaces is well-known to exhibit a strong topological flavour. We present an abstract and very succinct introduction to the field; drawing heavily on prior work by Escardo, Schroder, and others. Central aspects of the theory are function spaces and various spaces of subsets derived from other represented spaces, and -- closely linked to these -- properties of represented spaces such as compactness, overtness and separation principles. Both the derived spaces and the properties are introduced by demanding the computability of certain mappings, and it is demonstrated that typically various interesting mappings induce the same property.

Motivation & Objective

• To provide a unified, abstract overview of represented spaces as the foundation for computable analysis and measure theory.
• To clarify how topological properties such as compactness and overtness arise from computability conditions on mappings.
• To show that various computable mappings often induce the same structural property, revealing deeper unifying principles.
• To formalize derived spaces like function spaces and subsets using computability constraints, enhancing conceptual clarity.

Proposed method

• Defining represented spaces through the computability of evaluation maps and other canonical mappings.
• Introducing derived spaces (e.g., function spaces, hyperspaces of subsets) by requiring computability of specific canonical mappings.
• Characterizing topological properties (compactness, overtness, separation) via the computability of particular functions.
• Using categorical and constructive principles from prior work by Escardó and Schröder to ground the framework.
• Demonstrating that equivalent properties emerge from different computable mappings, revealing structural equivalences.

Experimental results

Research questions

• RQ1 How can topological properties like compactness and overtness be systematically derived from computability conditions?
• RQ2 What is the role of function spaces and subset constructions in the theory of represented spaces?
• RQ3 Which computable mappings induce the same topological property, and what does this imply for structural unification?
• RQ4 How do separation principles in represented spaces relate to computability of canonical mappings?
• RQ5 In what way do different representations of the same space yield equivalent computability-theoretic behavior?

Key findings

• Topological properties such as compactness and overtness are characterized by the computability of specific canonical mappings.
• Function spaces and hyperspaces of subsets are naturally constructed by requiring computability of evaluation and selection maps.
• Multiple distinct computable mappings often induce the same structural property, indicating deep unifying principles.
• The theory reveals that computability conditions on mappings provide a unifying lens for understanding topological behavior in computable analysis.
• The framework allows for a systematic derivation of properties from computability, enhancing clarity and coherence in represented space theory.