Kac's Lemma and countable generators for actions of countable groups
Dynamical Systems
2025-10-16 v2
Abstract
Kac's lemma determines the expected return time to a set of positive measure under iterations of an ergodic probability preserving transformations. We introduce the notion of an \emph{allocation} for a probability preserving action of a countable group. Using this notion, we formulate and prove generalization of Kac's lemma for an action of a general countable group, and another generalization that applies to probability preserving equivalence relations. As an application, we provide a short proof for the existence of countable generating partitions for any ergodic action of a countable group.
Cite
@article{arxiv.2410.18488,
title = {Kac's Lemma and countable generators for actions of countable groups},
author = {Tom Meyerovitch and Benjamin Weiss},
journal= {arXiv preprint arXiv:2410.18488},
year = {2025}
}
Comments
12 pages, minor corrections