SearcharxivSearch

arXiv · 2011.00437

Borel and analytic sets in locales

Abstract

We systematically develop analogs of basic concepts from classical descriptive set theory in the context of pointless topology. Our starting point is to take the elements of the free complete Boolean algebra generated by the frame $\mathcal{O}(X)$ of opens to be the "$\infty$-Borel sets" in a locale $X$. We show that several known results in locale theory may be interpreted in this framework as direct analogs of classical descriptive set-theoretic facts, including e.g., the Lusin separation, Lusin-Suslin, and Baire category theorems for locales; we also prove several extensions of these results. We give a detailed analysis of various notions of image, and prove that a continuous map need not have an $\infty$-Borel image. We introduce the category of "analytic $\infty$-Borel locales" as the regular completion under images of the unary site of locales and $\infty$-Borel maps, and prove analogs of several classical results about analytic sets, such as a boundedness theorem for well-founded analytic relations. We also consider the "positive $\infty$-Borel sets" of a locale, formed from opens without using $\neg$. We in fact work throughout with $\kappa$-copresented $\kappa$-locales and $\kappa$-Borel sets for arbitrary regular $\omega_1 \le \kappa \le \infty$, thereby incorporating the classical context as the special case $\kappa = \omega_1$. The basis for the aforementioned localic results is a detailed study of various known and new methods for presenting $\kappa$-frames, $\kappa$-Boolean algebras, etc. In particular, we introduce a new type of "two-sided posite" for presenting $(\kappa, \kappa)$-frames $A$ (i.e., both $A$ and $A^{op}$ are $\kappa$-frames), and use this to prove a general $\kappa$-ary interpolation theorem for $(\kappa, \kappa)$-frames, which dualizes to the aforementioned separation theorems.

Explore related subjects

Keep this discovery

BibTeXRIS

Ruiyuan Chen. 2020-11-01. Borel and analytic sets in locales. https://arxiv.org/abs/2011.00437

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