Every countably infinite group is almost Ornstein

DOI10.1090/CONM/567/11234MaRDI QIDQ2906450zbMATH OpenOpenAlexFDO

Authors Lewis Bowen

Publication date 5 September 2012

Published in Dynamical Systems and Group Actions (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.4424

zbMATH Keywords

almost OrnsteinBernoulli shiftsentropy

Mathematics Subject Classification ID

Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35)

Abstract: We say that a countable discrete group $G$ is {em almost Ornstein} if for every pair of standard non-two-atom probability spaces $(K,kappa),(L,lambda)$ with the same Shannon entropy, the Bernoulli shifts $Gcc(K^G,kapp{a}^G)$ and $Gcc(L^G,lambd{a}^G)$ are isomorphic.

Review text

A countable group \(G\) is called ``Ornstein if for every pair of probability spaces \(\left( (K,\kappa),(L,\lambda)\right)\) with the same Shannon entropy, the Bernoulli shift \(G\curvearrowright (K^G,\kappa^G)\) is isomorphic to \(G\curvearrowright (L^G,\lambda^G)\). It is well known that no finite group is Ornstein, and every countably infinite amenable group is Ornstein. NEWLINENEWLINENEWLINEIn this paper, the author introduce the concept of ``almost Ornstein. Precisely, a group \(G\) is called ``almost Ornstein if whenever \((K,\kappa),(L,\lambda)\) are standard probability spaces with the same Shannon entropy, neither of which is a two-atom space, then \(G\curvearrowright (K^G,\kappa^G)\) is isomorphic to \(G\curvearrowright (L^G,\lambda^G)\). The main result is that every countably infinite group is almost Ornstein. The main ingredients of the proof of the main theorems are Thouvenot's relative isomorphism theorem for actions of \(\mathbb{Z}\), the fact that the full group of any p.m.p. aperiodic equivalence relation contains an aperiodic automorphism, and a co-induction argument similar in spirit to \textit{A. M. Stepin}'s [Sov. Math., Dokl. 16, 886--889 (1975); translation from Dokl. Akad. Nauk SSSR 223, 300--302 (1975; Zbl 0326.28026)].NEWLINENEWLINEFor the entire collection see [Zbl 1237.37004].

Recommendations

• scientific article; zbMATH DE number 4053970
• Weak isomorphisms between Bernoulli shifts
• Generators and Bernoullian factors for amenable actions and cocycles on their orbits
• scientific article; zbMATH DE number 3998106
• More Polish full groups
• A converse to Dye’s theorem
• Entropy and isomorphism theorems for actions of amenable groups
• Asymptotically Invariant Sequences and Approximate Finiteness
• Finitary random interlacements and the Gaboriau-Lyons problem

Cited in

(24)

• Krieger's finite generator theorem for actions of countable groups. I.
• Finitary random interlacements and the Gaboriau-Lyons problem
• Entropy, Shannon orbit equivalence, and sparse connectivity
• Superrigidity, measure equivalence, and weak Pinsker entropy
• Bernoulli shifts with bases of equal entropy are isomorphic
• Relative entropy and the Pinsker product formula for sofic groups
• Entropy theory for sofic groupoids. I: The foundations
• The work of Lewis Bowen on the entropy theory of non-amenable group actions
• Krieger's finite generator theorem for actions of countable groups. II
• Classification of type III Bernoulli crossed products
• A determinacy approach to Borel combinatorics
• The geometry of model spaces for probability-preserving actions of sofic groups
• EVERY COUNTABLE GROUP HAS THE WEAK ROHLIN PROPERTY
• Sofic entropy of Gaussian actions
• Every action of a nonamenable group is the factor of a small action
• Examples in the entropy theory of countable group actions
• Harmonic models and Bernoullicity
• Global aspects of measure preserving equivalence relations and graphs
• Positive entropy actions of countable groups factor onto Bernoulli shifts
• Conjugacy, orbit equivalence and classification of measure-preserving group actions
• Isomorphisms of Poisson systems over locally compact groups
• Bernoullicity of lopsided principal algebraic actions
• Algebraic dynamical systems from LDPC codes satisfy a strong negation of the weak Pinsker property
• Random permutation matrix models for graph products

This page was built for publication: Every countably infinite group is almost Ornstein

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906450)