arXiv · 1907.08507
A Short Proof of Bernoulli Disjointness via the Local Lemma
Abstract
Recently, Glasner, Tsankov, Weiss, and Zucker showed that if $Γ$ is an infinite discrete group, then every minimal $Γ$-flow is disjoint from the Bernoulli shift $2^Γ$. Their proof is somewhat involved; in particular, it invokes separate arguments for different classes of groups. In this note, we give a short and self-contained proof of their result using purely combinatorial methods applicable to all groups at once. Our proof relies on the Lovász Local Lemma, an important tool in probabilistic combinatorics that has recently found several applications in the study of dynamical systems.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Anton Bernshteyn. 2020-04-27. A Short Proof of Bernoulli Disjointness via the Local Lemma. https://arxiv.org/abs/1907.08507
Cite the original work for its findings. Save a collection to share your selection of sources.