A note on computable étale spaces

Abstract: An étale space over a topological space $Y$ is defined as a local homeomorphism from a topological space $X$ into $Y$. They often come up in topos theory because of the equivalence between sheaves and étale spaces over a space. In this note, we define computable étale spaces over a computable topological space $Y$ within the TTE framework of computable topology, and show they are naturally equivalent to computable functions from $Y$ to $\mathsf{ODS}$, the effective quasi-Polish category of overt-discrete quasi-Polish spaces. More generally, if $\cal C$ is a computable category (or groupoid), then there is an equivalence between computable functors from $\cal C$ to $\mathsf{ODS}$, and computable étale spaces equipped with a computable action by $\cal C$.

• The paper establishes a computable framework for étale spaces within TTE, demonstrating an equivalence between countably based computable étale spaces and computable functor categories.
• It introduces explicit constructions for computable groupoid actions and effective quasi-Polish spaces, ensuring that computability is preserved in all transformations.
• Practical implications include a robust foundation for effective descriptive set theory and computable model theory, bridging classical topology and modern computational logic.

Computable Étale Spaces in the TTE Framework: An Analytical Perspective

Introduction

The paper "A note on computable étale spaces" (2604.27466) provides a detailed development of computable étale spaces within the Type-2 Theory of Effectivity (TTE) and establishes fundamental categorical equivalences relating to computable topology and logic. The investigation is motivated by connections between topos theory, geometric logic, and their effective analogs, particularly the representability of logical theories in terms of categories of topological or algebraic structure equipped with computability constraints.

Background and Context

An étale space over a topological space $Y$ is a local homeomorphism $p\colon X\to Y$, with the classical equivalence between étale spaces and sheaves over $Y$ providing deep connections across topology and logic. In the setting of TTE, computability structures are overlaid onto topological spaces and morphisms, necessitating new definitions of computable analogs of classical constructions.

Following foundational results by Joyal, Tierney, and R. Chen linking toposes, pretoposes, and groupoid actions, the present work advances an effective analog of such results. The core result is an equivalence, in a computable framework, between categories of computable étale spaces with computable groupoid (category) actions and functor categories of computable functors.

Definitions and Technical Framework

The study defines several key structures:

• Quasi-Polish Spaces: Admits presentations as spaces of ideals on a transitive relation $\prec$, with effective (computably enumerable) presentations constituting effective quasi-Polish spaces. A computably overt, computably discrete effective quasi-Polish space is called computable quasi-Polish.
• Computable Categories: These are constructed internally in the category of computable topological spaces, with morphisms, objects, and structure maps given explicitly as computable functions.
• Computable Étale Spaces: These extend the classical notion by requiring the map $p\colon X\to Y$ and the system of local sections to be computable, based on c.e. open covers and computable local inverses.
• Overt Discrete Quasi-Polish Spaces ($\mathcal{O}$): The paper defines an effective quasi-Polish category whose objects are partial equivalence relations, and shows this category captures overt discrete quasi-Polish spaces under effective homeomorphism.

Main Theorem and Proof Structure

Strong categorical equivalence:

For any computable category $\mathcal{C}$, there is an equivalence between:

• The category of countably based computable étale spaces over the objects of $\mathcal{C}$, equipped with computable actions by $\mathcal{C}$;
• The category of computable functors from $\mathcal{C}$ to the category $p\colon X\to Y$0 of overt discrete quasi-Polish spaces.

Detailed Construction

The paper gives functors in both directions, demonstrating full faithfulness and essential surjectivity:

• From computable functors $p\colon X\to Y$1 to étale spaces, the construction realizes each such $p\colon X\to Y$2 as a bundle over the object space of $p\colon X\to Y$3, where the fiber over $p\colon X\to Y$4 is the effective quasi-Polish space dictated by $p\colon X\to Y$5. The groupoid action is computably induced by the action on morphisms.
• From étale spaces with actions to functors, the construction encodes the local data and groupoid action into a functorial assignment of fibers and morphisms in $p\colon X\to Y$6, tracking computability at each step.
• Isomorphisms and natural transformations are tracked through induced constructions, ensuring computability is preserved throughout.
• Special case: For a computable topological space $p\colon X\to Y$7, computable étale spaces over $p\colon X\to Y$8 are equivalent (under this construction) to computable functions from $p\colon X\to Y$9 to objects of $Y$0.

Theorem Statement (Formal)

Let $Y$1 be a computable category. The category of countably based computable $Y$2-sets (étale spaces over $Y$3 with computable action by $Y$4) and the functor category $Y$5 (computable functors from $Y$6 to $Y$7) are equivalent as categories, and this equivalence preserves computability of both objects and morphisms.

Numerical and Structural Claims

• All constructions are effective: computable local homeomorphisms, computable groupoid actions, and computable functors/natural transformations are rigorously specified.
• Equivalence of categories is computability-preserving, meaning not just up to homeomorphism/isomorphism, but in the strong sense that computable points and morphisms are preserved throughout.

Theoretical and Practical Implications

This work elucidates the syntax-semantics correspondence for $Y$8-coherent theories within a computationally robust setting. The equivalence provides a computable version of the 'classifying topos' for such theories, realized as a functor category over an effective quasi-Polish groupoid.

Practical implications include a rigorous foundation for the study of effective sheaf-theoretic or topos-theoretic semantic models within computable settings, with potential utility for effective descriptive set theory, logic, and computable model theory. For example, effective representations of syntactic categories and their models can now be treated within the TTE and quasi-Polish frameworks.

Theoretical implications encompass a foundational result in effective topology and computable mathematics. The explicit relationship between topology, logic, and computability opens pathways for extending computability-theoretic results—such as classifications, invariance, and internalizations—to a broader class of categorical/logical structures.

Future Directions

• Further Internalization: Extension to richer categories of represented spaces, and more general internal categories (beyond quasi-Polish), to accommodate broader logical or geometric settings.
• Algorithmic Aspects: Concrete algorithms for explicit computation with étale spaces, sheaves, and functor categories in the effective setting, potentially impacting computable model theory.
• Logical Applications: Applications to effective descriptive set theory, reverse mathematics, and the computational content of logical deductions within topos-theoretic semantics.
• Complexity Theoretic Refinements: Analysis of the complexity and degree structure of the computable functors and étale spaces involved.

Conclusion

The paper provides a comprehensive theory of computable étale spaces and actions in the TTE framework and demonstrates their categorical equivalence with computable functor categories over effective quasi-Polish categories. This establishes a strong computational analog of classical dualities in topos theory, significantly advancing the interface between logic, effective topology, and computability (2604.27466).