SearcharxivSearch

arXiv · 2105.04989

Strong ergodicity phenomena for Bernoulli shifts of bounded algebraic dimension

Abstract

The algebraic dimension of a Polish permutation group $Q\leq \mathrm{Sym}(\mathbb{N})$ is the smallest $n\in\omega$, so that for all $A\subseteq \mathbb{N}$ of size $n+1$, the orbit of every $a\in A$ under the pointwise stabilizer of $A\setminus\{a\}$ is finite. We study the Bernoulli shift $P\curvearrowright \mathbb{R}^{\mathbb{N}}$ for various Polish permutation groups $P$ and we provide criteria under which the $P$-shift is generically ergodic relative to the injective part of the $Q$-shift, when $Q$ has algebraic dimension $\leq n$. We use this to show that the sequence of pairwise $*$-reduction-incomparable equivalence relations defined in [KP21] is a strictly increasing sequence in the Borel reduction hierarchy. We also use our main theorem to exhibit an equivalence relation of pinned cardinal $\aleph_1^{+}$ which strongly resembles the equivalence relation of pinned cardinal $\aleph_1^{+}$ from [Zap11], but which does not Borel reduce to the latter. It remains open whether they are actually incomparable under Borel reductions. Our proofs rely on the study of symmetric models whose symmetries come from the group $Q$. We show that when $Q$ is "locally finite" -- e.g. when $Q=\mathrm{Aut}(\mathcal{M})$, where $\mathcal{M}$ is a locally finite countable structure with no algebraicity -- the corresponding symmetric model admits a theory of supports which is analogous to that in the basic Cohen model.

Explore related subjects

Keep this discovery

BibTeXRIS

Aristotelis Panagiotopoulos, Assaf Shani. 2021-05-11. Strong ergodicity phenomena for Bernoulli shifts of bounded algebraic dimension. https://arxiv.org/abs/2105.04989

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