Inverting the Furstenberg correspondence

From MaRDI portal
Publication:445209

DOI10.3934/DCDS.2012.32.3421zbMATH Open1257.37009arXiv1101.0575OpenAlexW2964318003MaRDI QIDQ445209FDOQ445209

Jeremy Avigad

Publication date: 24 August 2012

Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

Abstract: Given a sequence of subsets A_n of {0,...,n-1}, the Furstenberg correspondence principle provides a shift-invariant measure on Cantor space that encodes combinatorial information about infinitely many of the A_n's. Here it is shown that this process can be inverted, so that for any such measure there are finite sets whose combinatorial properties approximate it arbitarily well. Moreover, we obtain an explicit upper bound on how large n has to be to obtain a sufficiently good approximation. As a consequence of the inversion theorem, we show that every computable invariant measure on Cantor space has a computable generic point. We also present a generalization of the correspondence principle and its inverse to countable discrete amenable groups.


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






Cited In (4)


   Recommendations





This page was built for publication: Inverting the Furstenberg correspondence

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