Entropy-efficient finitary codings

We show that any finite-entropy, countable-valued finitary factor of an i.i.d. process can also be expressed as a finitary factor of a finite-valued i.i.d. process whose entropy is arbitrarily close to the target process. As an application, we give an affirmative answer to a question of van den Berg and Steif [2] about the critical Ising model on Z. En route, we prove several results about finitary isomorphisms and finitary factors. Our results are developed in a new framework for processes invariant to a permutation group of a countable set satisfying specific properties. This new framework includes all “classical” processes over countable amenable groups and all invariant processes on transitive amenable graphs with “uniquely centered balls”. Some of our results are new already for Z-processes. We prove a relative version of Smorodinsky’s isomorphism theorem for finitely dependent Z-processes. We also extend the Keane–Smorodinsky finitary isomorphism theorem to countable-valued i.i.d. processes and to i.i.d. processes taking values in a Polish space.

[1]  Brandon Seward.  Bernoulli shifts with bases of equal entropy are isomorphic , 2018, Journal of Modern Dynamics.

[2]  Meir Smorodinsky,et al.  Bernoulli schemes of the same entropy are finitarily isomorphic , 1979 .

[4]  Benjamin Weiss,et al.  Entropy and isomorphism theorems for actions of amenable groups , 1987 .

[5]  R. Lyons,et al.  Coupling and Bernoullicity in random-cluster and Potts models , 2001, math/0104174.

[6]  W. Woess,et al.  Random walks on the affine group of local fields and of homogeneous trees , 1994 .

[7]  On the failure of Ornstein theory in the finitary category , 2019, 1909.11453.

[8]  F. Greenleaf.  Amenable actions of locally compact groups , 1969 .

[9]  Amenable actions, free products and a fixed point property , 2005, math/0505197.

[10]  Deux schémas de bernoulli d'alphabet dénombrable et d'entropie infinie sont finitairement isomorphes , 1982 .

[11]  Wolfgang Woess,et al.  Amenability, unimodularity, and the spectral radius of random walks on infinite graphs , 1990 .

[12]  Alberto Marcone,et al.  Extensions of functions which preserve the continuity on the original domain , 2000 .

[13]  Jeffrey E. Steif,et al.  Centrum Voor Wiskunde En Informatica on the Existence and Non-existence of Finitary Codings for a Class of Random Fields , 2022 .

[14]  Benjamin Weiss,et al.  Ergodic theory of amenable group actions. I: The Rohlin lemma , 1980 .

[15]  A. M. Stepin.  Bernoulli shifts on groups and decreasing sequences of partitions , 1976 .

[16]  D. Rudolph.  A Characterization of Those Processes Finitarily Isomorphic to a Bernoulli Shift , 1981 .

[17]  Meir Smorodinsky,et al.  Finitary isomorphisms of irreducible Markov shifts , 1979 .

[18]  Maura Salvatori,et al.  On the norms of group-invariant transition operators on graphs , 1992 .

[19]  L. Bowen.  Every countably infinite group is almost Ornstein , 2011, 1103.4424.

[20]  Karen Ball.  Factors of independent and identically distributed processes with non-amenable group actions , 2005, Ergodic Theory and Dynamical Systems.