Uniform syndeticity in multiple recurrence
Abstract
The main theorem of this paper establishes a uniform syndeticity result concerning the multiple recurrence of measure-preserving actions on probability spaces. More precisely, for any integers d,l≥ 1 and any > 0, we prove the existence of δ>0 and K≥ 1 (dependent only on d, l, and ) such that the following holds: Consider a solvable group of derived length l, a probability space (X, μ), and d pairwise commuting measure-preserving -actions T1, …, Td on (X, μ). Let E be a measurable set in X with μ(E) ≥ . Then, K many (left) translates of equation* \γ∈ μ(T1γ-1(E) T2γ-1 Tγ-11(E) ·s Tγ-1d Tγ-1d-1 … Tγ-11(E))≥ δ \ equation* cover . This result extends and refines uniformity results by Furstenberg and Katznelson. As a combinatorial application, we obtain the following uniformity result. For any integers d,l≥ 1 and any > 0, there are δ>0 and K≥ 1 (dependent only on d, l, and ) such that for all finite solvable groups G of derived length l and any subset E⊂ Gd with m d(E)≥ (where m is the uniform measure on G), we have that K-many (left) translates of multline* \g∈ G m d(\(a1,…,an)∈ Gd (a1,…,an),(ga1,a2,…,an),…,(ga1,ga2,…, gan)∈ E\)≥ δ \ multline* cover G. The proof of our main result is a consequence of an ultralimit version of Austin's amenable ergodic Szem\'eredi theorem.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.