Efficient finitary codings by Bernoulli processes
Tom Meyerovitch (Ben-Gurion University)
Thursday, November 7, 2019, 11:10 – 12:00, -101
Recently Uri Gabor refuted an old conjecture stating that any finitary factor of an i.i.d process is finitarly isomorphic to an i.i.d process. Complementing Gabor’s result, in this talk, which is based on work in progress with Yinon Spinka, we will prove that any countable-valued process which is admits a finitary a coding by some i.i.d process furthermore admits an $\epsilon$-efficient finitary coding, for any positive $\epsilon$. Here an ‘’$\epsilon$-efficient coding’’ means that the entropy increase of the coding i.i.d process compared to the (mean) entropy of the coded process is at most $\epsilon$. For processes having finite entropy this in particular implies a finitary i.i.d coding by finite valued processes. As an application we give an affirmative answer to an old question about the existence of finite valued finitary coding of the critical Ising model, posed by van den Berg and Steif in their 1999 paper ‘‘On the Existence and Nonexistence of Finitary Codings for a Class of Random Fields’’.