Norm convergence of continuous-time polynomial multiple ergodic averages

preprint2016arXivOpen access

Abstract

For a jointly measurable probability-preserving action τ:RD↷(X,μ)τ:\mathbb{R}^D\curvearrowright (X,μ) and a tuple of polynomial maps pi:R→RDp_i:\mathbb{R}\to \mathbb{R}^D, i=1,2,...,ki=1,2,...,k, the multiple ergodic averages 1T∫0T(f1∘τp1(t))(f2∘τp2(t))...(fk∘τpk(t)) dt \frac{1}{T}\int_0^T (f_1\circ τ^{p_1(t)})(f_2\circ τ^{p_2(t)})... (f_k\circ τ^{p_k(t)})\,\mathrm{d} t converge in L2(μ)L^2(μ) as T→∞T \to \infty for any f1,f2,...,fk∈L∞(μ)f_1,f_2,...,f_k \in L^\infty(μ). This confirms the continuous-time analog of the conjectured norm convergence of discrete polynomial multiple ergodic averages, which in is its original formulation remains open in most cases. A proof of convergence can be given based on the idea of passing up to a sated extension of (X,μ,τ)(X,μ,τ) in order to find simple characteristic factors, similarly to the recent development of this idea for the study of related discrete-time averages, together with a new inductive scheme on tuples of polynomials. The new induction scheme becomes available upon changing the time variable in the above integral by some fractional power, and provides an alternative to Bergelson's PET induction, which has been the mainstay of positive results in this area in the past.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.