Papers
Topics
Authors
Recent
Search
2000 character limit reached

Krieger's finite generator theorem for actions of countable groups II

Published 14 Jan 2015 in math.DS | (1501.03367v4)

Abstract: We continue the study of Rokhlin entropy, an isomorphism invariant for probability-measure-preserving actions of countable groups introduced in the previous paper. We prove that every free ergodic action with finite Rokhlin entropy admits generating partitions which are almost Bernoulli, strengthening the theorem of Ab\'{e}rt--Weiss that all free actions weakly contain Bernoulli shifts. We then use this result to study the Rokhlin entropy of Bernoulli shifts. Under the assumption that every countable group admits a free ergodic action of positive Rokhlin entropy, we prove that: (i) the Rokhlin entropy of a Bernoulli shift is equal to the Shannon entropy of its base; (ii) Bernoulli shifts have completely positive Rokhlin entropy; and (iii) Gottschalk's surjunctivity conjecture and Kaplansky's direct finiteness conjecture are true.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.