An effective version of the Stone duality

Abstract: The paper studies computability-theoretic aspects of topological $T_0$-spaces. We introduce effective versions of the notions of a countable $c$-poset and a (second-countable) topological space with base. Based on this, we prove an effective version of the known Stone-type duality between the category $\mathbf{AS}$ (whose objects are almost semispectral spaces with base and whose morphisms are spectral mappings) and the category $\mathbf{DP}$ (whose objects are distributive $c$-posets and whose morphisms are strict mappings). Namely, we show that for an arbitrary set $Z\subseteq ω$, this duality is preserved when one restricts to objects which have $Z$-computably enumerable presentations only. Following this approach, we establish several results in computable topology. We prove that every degree spectrum of a countable algebraic structure can be realized as the degree spectrum of a topological space with base. We show that for any non-zero natural number $N$, there is a computable topological space with base that has precisely $N$-many computable copies, up to effective spectral homeomorphisms.

• The paper presents an effective version of Stone duality by establishing a computable equivalence between distributive c-posets and almost spectral spaces with base.
• It leverages computable presentations to align degree spectra of countable algebraic structures with those of topological spaces, ensuring matching enumeration complexities.
• The paper demonstrates computable control over morphisms and computable dimensions, enabling a systematic classification of spectral properties in effective topology.

An Effective Version of the Stone Duality: Synthesis and Analysis

Introduction and Background

This paper presents a computability-theoretic generalization of Stone duality, integrating computable structure theory and effective topology within the context of distributive posets and $T_0$-spaces. The classical Stone duality establishes a contravariant equivalence between the category of distributive lattices and the category of spectral spaces, with morphisms in each category corresponding appropriately. Recent trends in computable topology and the effective content of mathematical dualities motivate the formulation of dualities that are robust under computable presentations and morphisms.

This work rigorously formalizes effective analogues of key objects (e.g., distributive $c$-posets, spectral spaces with base) and functorial relationships, and demonstrates that the dualities persist at the level of enumerable and computable structures. A major consequence is the identification of tight correspondences between degree spectra of countable algebraic structures and spectral spaces with base, and the construction of computable topological spaces with prescribed computable dimension.

Stone-Type Duality for Distributive $c$-Posets and Topological Spaces

The authors abstract the notion of distributivity in posets via algebraic closure operators, defining a distributive $c$-poset as a triple $\mathcal{P} = (P, \leq, \varphi)$ where $\langle P, \leq\rangle$ is a poset and $\varphi$ is an algebraic closure operator satisfying strong alignment with the order structure. Spectral spaces with base are specified as almost semispectral $T_0$-spaces equipped with a basis of compact open sets. The categorical framework features:

• Category $\mathbf{DP}$: objects are distributive $c$-posets; morphisms are strict mappings (inverse images of prime ideals are prime).
• Category $c$0: objects are almost semispectral spaces with base; morphisms are spectral (inverse images of basic open sets are basic).

The spectrum construction associates to each distributive $c$1-poset $c$2 the space $c$3 whose points are prime ideals and whose topology is generated by subbasic open sets indexed by elements of $c$4. This construction is functorial and sets up the core of the dual equivalence.

The main classical result (Theorem 5.5 in [S1]) is that two contravariant functors—$c$5 (assigning to a space its basis as a $c$6-poset) and $c$7 (assigning to a $c$8-poset its spectrum)—establish a categorical duality between $c$9 and $c$0.

Effective Presentations and Duality

The core contribution of the paper is the "effectivization" of Stone duality. The effective setting incorporates complexity-theoretic constraints and enumeration reducibility. The authors introduce:

• $c$1-computably enumerable (c.e.) $c$2-posets: $c$3 and $c$4 are $c$5-c.e., and the closure operator $c$6 is a generalized enumeration operator relative to $c$7.
• $c$8-c.e. spaces with base: Given a countable basis $c$9, a surjection $c$0 with effectively enumerable properties (distinctness and inclusion among basis elements) forms the core.

A critical technical result (Theorem~\ref{prop:complexity-presentations}) asserts that the effective properties are preserved across the duality functors: a $c$1-poset has a $c$2-c.e.\ presentation if and only if its dual topological space has a $c$3-c.e.\ presentation (and vice versa for computability rather than just enumerable presentations). The proof systematically constructs effective counterparts using computable bijections and shows that the presentation complexities match.

Consequently, the full subcategories of $c$4 and $c$5 consisting of effectively presented objects are dually equivalent (Corollary~\ref{C:Stone-Z}).

Degree Spectra of Structures and Spaces

The paper leverages the above dualities to address degree spectra, a central concept in computable structure theory. For a countable structure $c$6, $c$7 collects all Turing degrees arising as degrees of presentations isomorphic to $c$8. The authors generalize this to $c$9-posets and, crucially, to topological spaces with base.

Theorem~\ref{theo:degree-spectra} establishes that every degree spectrum of an automorphically nontrivial countable structure is realized as the degree spectrum of a suitable second-countable topological space with base. The construction relies on recasting structures as posets (via Hirschfeldt et al.'s coding [HKSS]) and equipping these with effective closure operators, which are then dualized to spectral spaces.

The degree spectrum equivalence is robust under the duality functors: for an almost semispectral space $\mathcal{P} = (P, \leq, \varphi)$0, the degree spectrum of $\mathcal{P} = (P, \leq, \varphi)$1 coincides with that of its dual $\mathcal{P} = (P, \leq, \varphi)$2-poset (Proposition~\ref{prop:deg-sp}).

Computable Dimension and Morphisms

A particularly strong assertion is that of control over computable dimension: for each finite $\mathcal{P} = (P, \leq, \varphi)$3, there exists a computable topological space with base that admits exactly $\mathcal{P} = (P, \leq, \varphi)$4 non-isomorphic computable copies, classified by effective spectral homeomorphism (Corollary~\ref{cor:comp-dim}). This result is enabled by the transfer of Goncharov's theorem from structure theory to topology using the effective duality.

Effective morphisms (spectral maps and strict mappings) are precisely characterized through computable functions on basis indices, ensuring that the functorial correspondence between morphisms in both categories is computable (Lemma~\ref{lem:morphisms}). The duality thus extends beyond objects to (effective) morphisms, reinforcing the computable categorical equivalence.

Extensions and Subcategories

The framework is expanded to several important subcategories corresponding to distributive (meet/join/lattice) semilattices and spaces with multiplicative/additive bases. For each, the authors provide effective versions of dualities and demonstrate preservation of structure and degree spectra in these constrained settings (Theorem~\ref{theo:semi_lattices}, Corollary~\ref{corol:lattices-spectra}).

An explicit example is provided in which the degree spectrum of a second-countable almost spectral space is precisely the collection of noncomputable degrees (Corollary~\ref{corol:Slaman-Wehner}), contrasting with restrictions on spectra for Stone spaces arising in Boolean algebra duality.

Implications and Future Directions

The establishment of effective dualities between distributive $\mathcal{P} = (P, \leq, \varphi)$5-posets and almost semispectral spaces with base represents a significant consolidation of computable structure theory and effective topology. This work enables the systematic study of topological spaces through degree-theoretic invariants, demonstrates the computable realization of complex spectra, and clarifies the interplay between algebraic and topological complexity.

These results invite further investigation along several axes:

• Extension to uncountable Polish spaces: While many results currently pertain to countable bases, the extension to broader classes (notably, effective Polish spaces) is unresolved and potentially rich.
• Classification of degree spectra: The precise relationship between spectra for different types of spaces and algebras, especially under transformations such as homeomorphism versus isomorphism, remains only partially understood.
• Effective Categorical Logic: This framework illuminates the landscape for developing further computable analogues of classical categorical equivalences across algebra, topology, and logic.

Conclusion

This paper provides a comprehensive and detailed theory of effective Stone-type dualities for distributive $\mathcal{P} = (P, \leq, \varphi)$6-posets and almost semispectral spaces with base, aligning notions of computable enumerability, presentations, morphisms, and degree spectra on both sides of the duality. The techniques and results unify and extend the reach of computability-theoretic methods in topology and algebra, elucidating the computational content of classical dualities and their invariants, and yield new explicit constructions and classification results in effective topology (2604.04492).