Average of translates converges to $0$ in $L^p$

42 Views Asked by At

This is from Klenke's Probability Theory, Chapter $7.1$. Suppose that $f\in L^p(\mathbb{R})$ for $p\in (1,\infty)$. Show that if $T:\mathbb{R}\rightarrow \mathbb{R}$ is the map $x\mapsto x+1$, then $$\frac{1}{n}\sum_{k=0}^{n-1} f\circ T^k\rightarrow 0$$

in $L^p(\mathbb{R})$. My first idea was to check that this works for maybe some more specific subspaces of $L^p$ and then appeal to density in some way. I was able to see that it works for the indicator of a closed interval. Then I tried to look at a continuous, compactly supported function, say with support in $[-M,M]$ for some $M\in \mathbb{N}$. Now I think that if you break up $\mathbb{R}$ into intervals like $[-M,M],[-3M,-M],...$ then depending on where $x$ lives, you can sort of bound how high $n$ can go in the sum $\frac{1}{n}\sum_{k=0}^{n-1} f(x+k)$. There is some periodicity happening here I think, but I don't know how to turn this into a precise argument. Furthermore, supposing that this line of reasoning can be followed through, how can I pass from a continuous, compactly supported function to a generic $L^p$ function? If this is not possible, then please let me know a hint towards another strategy.

2

There are 2 best solutions below

0
On BEST ANSWER

Hint: $$\|\frac{1}{n}\sum_{k=0}^{n-1} (f\circ T^k-g\circ T^k)\|_p \leq \|f-g\|.$$ This shows that it is enough to prove the result for $f$ in a dense subset of $L^{p}$. If $f=\chi _{(a,b)}$ then the intervals $(-k,1-k)$ are disjoint and you compute the $L^{p}$ norm of $\frac{1}{n}\sum_{k=0}^{n-1} (f\circ T^k)$ explicitly and see that this norm tends to $0$. Since step functions are dense in $L^{p}(\mathbb R)$ we are done.

1
On

An idea is to decompose $f$ as a sum of a functions with small $\mathbb L^p$-norm and a finite sum of functions whose support is an interval of consecutive integers.

For a function $f\in\mathbb L^p$, let $N$ be an integer and for $-N\leqslant j\leqslant N-1$, let $f_j=f\mathbf{1}_{[j,j+1)}$ and $F=\sum_{j=-N}^{N-1}f_j=f\mathbf{1}_{[-N,N)}$. Since for a function $g$, $\lVert T^kg\rVert_p\leqslant\lVert g\rVert_p$, we have \begin{align} \left\lVert\frac{1}{n}\sum_{k=0}^{n-1} f\circ T^k\right\rVert_p&\leqslant\left\lVert\frac{1}{n}\sum_{k=0}^{n-1} F\circ T^k\right\rVert_p +\sum_{j=-N}^N\left\lVert\frac{1}{n}\sum_{k=0}^{n-1} f_j\circ T^k\right\rVert_p\\ &\leqslant \left\lVert f\mathbf{1}_{\mathbb R\setminus [-N,N)}\right\rVert_p +\sum_{j=-N}^N\left\lVert\frac{1}{n}\sum_{k=0}^{n-1} f_j\circ T^k\right\rVert_p. \end{align} Notice that for each fixed $j$, the functions $f_j\circ T^k$, $0\leqslant k\leqslant n-1$, have a pairwise disjoint support hence $$ \left\lvert \sum_{k=0}^{n-1} f_j\circ T^k\right\rvert^p= \sum_{k=0}^{n-1}\left\lvert f_j\circ T^k\right\rvert^p $$ and it follows that $$ \left\lVert\frac{1}{n}\sum_{k=0}^{n-1} f_j\circ T^k\right\rVert_p^p=n^{-p}\sum_{k=0}^{n-1}\lVert f_j\rVert^p_p\leqslant n^{1-p}\lVert f\rVert_p^p. $$ We thus derived the estimate $$ \left\lVert\frac{1}{n}\sum_{k=0}^{n-1} f\circ T^k\right\rVert_p\leqslant \left\lVert f\mathbf{1}_{\mathbb R\setminus [-N,N)}\right\rVert_p+(2N+1)\lVert f\rVert_pn^{1/p-1} $$ from which we can conclude.