SearcharxivSearch

arXiv · 1204.0829

Finite generators for countable group actions in the Borel and Baire category settings

Abstract

For a continuous action of a countable discrete group $G$ on a Polish space $X$, a countable Borel partition $P$ of $X$ is called a generator if $G \cdot P := \{ gC : g \in G, C \in P \}$ generates the Borel $\sigma$-algebra of $X$. For $G = Z$, the Kolmogorov--Sinai theorem gives a measure-theoretic obstruction to the existence of finite generators: they do not exist in the presence of an invariant probability measure with infinite entropy. It was asked by Benjamin Weiss in the late 80s whether the nonexistence of any invariant probability measure guarantees the existence of a finite generator. We show that the answer is positive (in fact, there is a 32-generator) for an arbitrary countable group $G$ and $\sigma$-compact $X$ (in particular, for locally compact $X$). We also show that any continuous aperiodic action of $G$ on an arbitrary Polish space admits a 4-generator on a comeager set, thus giving a positive answer to a question of Alexander Kechris asked in the mid-90s. Furthermore, assuming a positive answer to Weiss's question for arbitrary Polish spaces and $G = Z$, we prove the following dichotomy: every aperiodic Borel action of $Z$ on a Polish space $X$ admits either an invariant probability measure of infinite entropy or a finite generator. As an auxiliary lemma, we prove the following statement, which may be of independent interest: every aperiodic Borel action of a countable group $G$ on a Polish space $X$ admits a $G$-equivariant Borel map to the aperiodic part of the shift action of $G$ on $2^G$. We also obtain a number of other related results, among which is a criterion for the nonexistence of non-meager weakly wandering sets for continuous actions of $Z$. A consequence of this is a negative answer to a question asked by Eigen--Hajian--Nadkarni, which was also independently answered by Benjamin Miller.

Explore related subjects

Keep this discovery

BibTeXRIS

Anush Tserunyan. 2012-04-03. Finite generators for countable group actions in the Borel and Baire category settings. https://arxiv.org/abs/1204.0829

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