The Wiener Wintner and Return Times Theorem Along the Primes
Preprint
Abstract
We prove the following Return Times Theorem along the sequence of prime times, the first extension of the Return Times Theorem to arithmetic sequences: For every probability space, $(Ω,ν)$, equipped with a measure-preserving transformation, $T \colon Ω\to Ω$, and every $f \in L^\infty(Ω)$, there exists a set of full probability, $Ω_f \subset Ω$ with $ν(Ω_f) =1$, so that for all $ω\in Ω_f$, for any other probability space $(X,μ)$, equipped with a measure-preserving transformation $S : X \to X$, for any $g \in L^{\infty}(X)$, \begin{align} \frac{1}{N} \sum_{n \leq N} f(T^{p_n} ω) g(S^{p_n} \cdot) \end{align} converges $μ$-almost surely; above, $\{ 2=p_1 < p_2 < \dots \}$ are an enumeration of the primes. The Wiener-Wintner theorem along the primes is an immediate corollary. Our proof lives at the interface of classical Fourier analysis, combinatorial number theory, higher order Fourier analysis, and pointwise ergodic theory, with $U^3$ theory playing an important role; our $U^3$-estimates for \emph{Heath-Brown} models of the von Mangoldt function may be of independent interest.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Divergence of weighted square averages in L1Advances in Mathematics, 2021
- On the Bogolyubov–Ruzsa lemmaAnalysis & PDE, 2012
- Large values of the Gowers-Host-Kra seminormsJournal d'Analyse Mathématique, 2012
- Universally L 1-bad arithmetic sequencesJournal d'Analyse Mathématique, 2011
- An equivalence between inverse sumset theorems and inverse conjectures for theU3normMathematical Proceedings of the Cambridge Philosophical Society, 2010
- Breaking the duality in the return times theoremDuke Mathematical Journal, 2008
- Wiener Wintner Ergodic Theorems2003
- The Hardy-Littlewood Method1997
- Pointwise ergodic theorem along the prime numbersIsrael Journal of Mathematics, 1988
- Harmonic Analysis and Ergodic TheoryAmerican Journal of Mathematics, 1941