Quantitative Convergence for Sparse Ergodic Averages in L1

Abstract

We provide a unified framework to proving pointwise convergence of sparse sequences, deterministic and random, at the L1(X) endpoint. Specifically, suppose that \[ an ∈ \ nc , \ k : Σj ≤ k Xj = n\ \ \] where Xj are Bernoulli random variables with expectations E Xj = n-α, and we restrict to 1 < c < 7/6, \ 0 < α < 1/2. Then (almost surely) for any measure-preserving system, (X,μ,T), and any f ∈ L1(X), the ergodic averages \[ 1N Σn ≤ N Tan f \] converge μ-a.e. Moreover, our proof gives new quantitative estimates on the rate of convergence, using jump-counting/variation/oscillation technology, pioneered by Bourgain. This improves on previous work of Urban-Zienkiewicz, and Mirek, who established the above with c = 10011000, \ 3029, respectively, and LaVictoire, who established the random result, all in a non-quantitative setting.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…