SearcharxivSearch

arXiv · 2405.15111

Invariant uniformization

Abstract

Standard results in descriptive set theory provide sufficient conditions for a Borel set $P \subseteq \mathbb{N}^\mathbb{N} \times \mathbb{N}^\mathbb{N}$ to admit a Borel uniformization, namely, when $P$ has "small" sections or "large" sections. We consider an invariant analogue of these results: Given a Borel equivalence relation $E$ and an $E$-invariant Borel set $P$ with "small" or "large" sections, does $P$ admit an $E$-invariant Borel uniformization? For a given Borel equivalence relation $E$, we show that every $E$-invariant Borel set $P$ with "small" or "large" sections admits an $E$-invariant Borel uniformization if and only if $E$ is smooth. We also compute the definable complexity of counterexamples in the case where $E$ is not smooth, using category, measure, and Ramsey-theoretic methods. We provide two new proofs of a dichotomy of Miller classifying the pairs $(E, P)$ such that $P$ admits an $E$-invariant uniformization, for a Borel equivalence relation $E$ and a Borel $E$-invariant set $P$ with countable sections. In the process, we prove an $\aleph_0$-dimensional $(\mathbb{G}_0, \mathbb{H}_0)$ dichotomy, generalizing dichotomies of Miller and Lecomte. We also show that the set of pairs $(E, P)$ such that $P$ has "large" sections and admits an $E$-invariant Borel uniformization is $\boldsymbol{\Sigma^1_2}$-complete; in particular, there is no analog of Miller's dichotomy for $P$ with "large" sections. Finally, we consider a less strict notion of invariant uniformization, where we select a countable nonempty subset of each section instead of a single point.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander S. Kechris, Michael Wolman. 2024-05-24. Invariant uniformization. https://arxiv.org/abs/2405.15111

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