SearcharxivSearch

arXiv · 2310.04510

One-dimensional definable topological spaces in o-minimal structures

Abstract

We study the properties of topological spaces $(X,\tau)$, where $X$ is a definable set in an o-minimal structure and the topology $\tau$ on $X$ has a basis that is (uniformly) definable. Examples of such spaces include the canonical euclidean topology on definable sets, definable order topologies, definable quotient spaces and definable metric spaces. We use o-minimality to undertake their study in topological terms, focussing here in particular on spaces of dimension one. We present several results, given in terms of piecewise decompositions and existence of definable embeddings and homeomorphisms, for various classes of spaces that are described in terms of classical separation axioms and definable analogues of properties such as separability, compactness and metrizability. For example, we prove that all Hausdorff one-dimensional definable topologies are piecewise the euclidean, discrete, or upper or lower limit topology; we give a characterization of all one-dimensional, regular, Hausdorff definable topologies in terms of spaces that have a lexicographic ordering or a topology generalizing the Alexandrov double of the euclidean topology; and we show that, if the underlying structure expands an ordered field, then any one-dimensional Hausdorff definable topology that is piecewise euclidean is definably homeomorphic to a euclidean space. As applications of these results, we prove definable versions of several open conjectures from set-theoretic topology, due to Gruenhage and Fremlin, on the existence of a 3-element basis for regular, Hausdorff topologies and on the nature of perfectly normal, compact, Hausdorff spaces; we obtain universality results for some classes of Hausdorff and regular topologies; and we characterize when certain metrizable definable topologies admit a definable metric.

Explore related subjects

Keep this discovery

BibTeXRIS

Pablo Andújar Guerrero, Margaret E. M. Thomas. 2023-10-06. One-dimensional definable topological spaces in o-minimal structures. https://arxiv.org/abs/2310.04510

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO