The Wiener Wintner and Return Times Theorem Along the Primes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912826404110336 |
|---|---|
| author | Fornal, Jan Fragkos, Anastasios Krause, Ben Lacey, Michael Mousavi, Hamed Sun, Yu-Chen |
| author_facet | Fornal, Jan Fragkos, Anastasios Krause, Ben Lacey, Michael Mousavi, Hamed Sun, Yu-Chen |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_10459 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The Wiener Wintner and Return Times Theorem Along the Primes Fornal, Jan Fragkos, Anastasios Krause, Ben Lacey, Michael Mousavi, Hamed Sun, Yu-Chen Dynamical Systems Classical Analysis and ODEs Number Theory 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. |
| title | The Wiener Wintner and Return Times Theorem Along the Primes |
| topic | Dynamical Systems Classical Analysis and ODEs Number Theory |
| url | https://arxiv.org/abs/2601.10459 |