Inverting the Furstenberg correspondence

2011/01/03 by Jeremy Avigad, Avigad, Jeremy
Mathematics · #03F60 #37A45 #Combinatorics (math.CO) #Dynamical Systems (math.DS) #FOS: Mathematics #math.CO #math.DS #msc:03F60 #msc:37A45

paper · pdf · doi:10.48550/arxiv.1101.0575

arxiv created 2012/02/01 · arxiv updated 2012/02/03

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.

Related

• An inverse of Furstenberg's correspondence principle and applications to nice recurrence
• An inverse of Furstenberg's correspondence principle and applications to van der Corput sets
• An ergodic correspondence principle, invariant means and applications
• Furstenberg sets in finite fields: Explaining and improving the Ellenberg-Erman proof
• Geometry in the Furstenberg Conjecture