Hostname: page-component-89b8bd64d-7zcd7 Total loading time: 0 Render date: 2026-05-06T18:29:45.569Z Has data issue: false hasContentIssue false

Strongly mixing systems are almost strongly mixing of all orders

Published online by Cambridge University Press:  13 September 2023

V. BERGELSON
Affiliation:
Department of Mathematics, The Ohio State University, Columbus, OH 43210, USA (e-mail: vitaly@math.ohio-state.edu)
R. ZELADA*
Affiliation:
Department of Mathematics, The Ohio State University, Columbus, OH 43210, USA (e-mail: vitaly@math.ohio-state.edu)
*
Rights & Permissions [Opens in a new window]

Abstract

We prove that any strongly mixing action of a countable abelian group on a probability space has higher-order mixing properties. This is achieved via the utilization of $\mathcal R$-limits, a notion of convergence which is based on the classical Ramsey theorem. $\mathcal R$-limits are intrinsically connected with a new combinatorial notion of largeness which is similar to but has stronger properties than the classical notions of uniform density one and IP$^*$. While the main goal of this paper is to establish a universal property of strongly mixing actions of countable abelian groups, our results, when applied to ${\mathbb {Z}}$-actions, offer a new way of dealing with strongly mixing transformations. In particular, we obtain several new characterizations of strong mixing for ${\mathbb {Z}}$-actions, including a result which can be viewed as the analogue of the weak mixing of all orders property established by Furstenberg in the course of his proof of Szemerédi’s theorem. We also demonstrate the versatility of $\mathcal R$-limits by obtaining new characterizations of higher-order weak and mild mixing for actions of countable abelian groups.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press