SearcharxivSearch

arXiv · 2507.04138

Componentwise Polish groupoids and equivalence relations

Abstract

We study Borel equivalence relations equipped with a uniformly Borel family of Polish topologies on each equivalence class, and more generally, standard Borel groupoids equipped with such a family of topologies on each connected component. Such "componentwise Polish topologies" capture precisely the topological information determined by the Borel structure of a Polish group action, by the Becker--Kechris theorem. We prove that conversely, every abstract such Borel componentwise Polish groupoid obeying suitable axioms admits a Borel equivalence of groupoids to a global open Polish groupoid. Together with known results, this implies that every such groupoid is Borel equivalent to an action groupoid of a Polish group action; in particular, the induced equivalence relations are Borel bireducible. Our results are also valid for Borel groupoids with componentwise quasi-Polish topologies; and under stronger uniformity assumptions, we show that such groupoids in fact themselves admit global quasi-Polish topologies. As a byproduct, we also generalize several standard tools for Polish groups and their actions to the setting of componentwise quasi-Polish groupoids, including Vaught transforms, Effros's theorem on orbits, and the open mapping theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Ruiyuan Chen. 2025-07-05. Componentwise Polish groupoids and equivalence relations. https://arxiv.org/abs/2507.04138

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