Inverting the Furstenberg correspondence
From MaRDI portal
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.
Recommendations
- Uniqueness of a Furstenberg system
- A spectral refinement of the Bergelson-Host-Kra decomposition and new multiple ergodic theorems
- Uncomputably noisy ergodic limits
- An approximate logic for measures
- scientific article; zbMATH DE number 1943999
- The entropy of the Erdős measure for the pseudogolden ratio
- Pointwise theorems for amenable groups
- On a Loeb space constructed from a family of Fölner sets of an amenable group
- The Erdős-Vershik problem for the golden ratio
Cited in
(7)- An ergodic correspondence principle, invariant means and applications
- scientific article; zbMATH DE number 1274186 (Why is no real title available?)
- An approximate logic for measures
- Uniqueness of a Furstenberg system
- Inverting Dirichlet Tessellations
- Finite products sets and minimally almost periodic groups
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
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)
