🤖 AI Summary
This paper addresses the conceptual distinction—and need for unified modeling—between verifiability (as an intrinsic property) and verification procedures (as methods) in topology.
Method: We introduce the novel notion of a “machine space” and construct a weak exponential space Σ^{Σ^G} as a topological realization of the Sierpiński exponential Σ^X, establishing evaluation maps via frame semantics and generator composition.
Contribution/Results: We characterize, for the first time, obstructions to the existence of exponential objects using weak exponential structure. Moreover, we provide a purely topological realization of universal quantification over compact spaces—proving its equivalence to finite-step decidability—and thereby expose a fundamental connection between compactness and computational feasibility. Our framework unifies point-set topology, domain theory, and Escardó’s algorithmic topology, confirming that machine spaces always exist and that their non-contractibility characterizes the obstruction to exponentiation.
📝 Abstract
Topology may be interpreted as the study of verifiability, where opens correspond to semi-decidable properties. In this paper we make a distinction between verifiable properties themselves and processes which carry out the verification procedure. The former are simply opens, while we call the latter machines. Given a frame presentation $mathcal{O} X = langle G mid R
angle$ we construct a space of machines $Sigma^{Sigma^G}$ whose points are given by formal combinations of basic machines corresponding to generators in $G$. This comes equipped with an `evaluation' map making it a weak exponential for $Sigma^X$. When it exists, the true exponential $Sigma^X$ occurs as a retract of machine space. We argue this helps explain why some spaces are exponentiable and others not. We then use machine space to study compactness by giving a purely topological version of Escard'o's algorithm for universal quantification over compact spaces in finite time. Finally, we relate our study of machine space to domain theory and domain embeddings.