Ciprian Demeter, Michael Lacey, Christoph Thiele and I have just uploaded our joint paper, “The Walsh model for Carleson” to the arXiv. This paper (which was recently accepted for publication in Revista Iberoamericana) establishes a simplified model for the key estimate (the “ Carleson estimate”) in another (much longer) paper of ours on the return times theorem of Bourgain, in which the Fourier transform is replaced by its dyadic analogue, the Walsh-Fourier transform. This model estimate is established by the now-standard techniques of time-frequency analysis: one decomposes the expression to be estimated into a sum over tiles, and then uses combinatorial stopping time arguments into group the tiles into trees, and the trees into forests. One then uses (phase-space localised, and frequency-modulated) versions of classical Calderòn-Zygmund theory (or in this particular case, a certain maximal Fourier inequality of Bourgain) to control individual trees and forests, and sums up over the trees and forests using orthogonality methods (excluding an exceptional set if necessary).
Rather than discuss time-frequency analysis in detail here, I thought I would dwell instead on the return times theorem, and sketch how it is connected to the Carleson estimate; this is a more complicated version of the “ Carleson estimate”, which is an estimate which is logically equivalent to Carleson’s famous theorem (and its extension by Hunt) on the almost everywhere convergence of Fourier series.
— The Carleson-Hunt theorem —
Let’s begin with the Carleson-Hunt theorem, which asserts that the Fourier inversion formula
and then extended to by density (here one can use a classical theorem of Riesz that asserts that the Dirichlet operators can be continuously extended to for every ).
The convergence theorem is easy to show if the function f is smooth and rapidly decreasing; the difficulty is to extend it to the rougher functions in . It turns out that the key lies in establishing the maximal inequality
for all test functions f; once one has (1), the Carleson-Hunt theorem follows by a standard approximation argument. (Conversely, by using Stein’s maximal principle, one can show that the Carleson-Hunt theorem is in fact logically equivalent to (1), at least in the range .)
One can recast this estimate in a slightly different manner. Define the Carleson operator
Note that this operator extends the Hilbert transform, which is recovered by restricting to equal zero. It is then not hard to show that the estimate (1) is equivalent to the estimate
— The return times theorem —
Now let us leave Fourier analysis and pass to ergodic theory, which studies the long-time dynamics of measure-preserving systems , thus is a probability space, and is a measure-preserving bijection. One of the fundamental theorems in ergodic theory is, of course, the pointwise (or Birkhoff) ergodic theorem, which asserts that for any function with , the sequence
is convergent as for almost every (as measured with respect to , of course). (If the measure-preserving system is ergodic, then the limit is equal to , but for this discussion we will not be interested in the specific value of the limit.) Just as the Carleson-Hunt theorem (which is a qualitative convergence result) is connected to (2) (which is a quantitative estimate), the pointwise ergodic theorem is connected to an estimate, namely the maximal ergodic theorem
valid for all and . (Actually, the maximal ergodic theorem is a little stronger than this, incorporating a sharp weak (1,1) inequality, but I will not discuss this improvement here.) The maximal ergodic theorem does not directly imply the pointwise ergodic theorem, although it does let deduce the case of the pointwise ergodic theorem from the case by the density argument mentioned earlier. The maximal ergodic theorem is also closely related to the Hardy-Littlewood maximal inequality
where K is some approximation to the identity whose exact value is not important for this discussion. Indeed, one can deduce the former from the latter by Conze’s transference principle.
The pointwise ergodic theorem immediately implies the following extension of itself, namely that for any fixed and every for some , the sequence
converges for almost every . Indeed, to see this one simply applies the pointwise ergodic theorem to the product system with the shift and to the function . However, note that for each individual real number , there is an exceptional set of x for which the sequence (3) fails to converge. Since the set of real numbers is uncountable, it could conceivably happen that there does not exist any x for which (3) converges for all . Nevertheless, this does not happen, thanks to the Wiener-Wintner theorem, which asserts that if for some , then for almost every x in X, the sequence (3) converges for all . This theorem is closely linked to the maximal ergodic theorem-type estimate
or the Hardy-Littlewood maximal type estimate
for , although in this particular case, these apparently stronger estimates follow immediately from their untwisted counterparts (in which throughout) by the triangle inequality.
We motivated the Wiener-Wintner theorem by adjoining an arbitrary circle rotation to the original measure-preserving system . But one could have adjoined a more general system to the original system, leading to the conclusion that for each , , and any measure preserving transformations , , the sequence
converges for almost every x,y.
Motivated by the Wiener-Wintner theorem, one can ask whether one can make the exceptional set uniform in the choice of g, S, y. This is indeed the case, and is Bourgain’s return times theorem: if and one has the duality condition , then for every and it is true that for almost every x in X, the sequence (4) converges for all systems , all , and all y in Y. (In our longer paper, we replaced the duality condition with ; conversely, the claim fails at the double endpoint , as shown by Assani, Buzcolich, and Mauldin.)
The return times theorem is related to the estimate
in much the same way that the pointwise ergodic theorem is related to the maximal ergodic theorem. (Thus, the estimate does not quite imply the convergence result by itself – one would need a “variational” or “upcrossing” version of the estimate for that – but can be used via density arguments to enlarge the range of functions in which convergence holds.)
Just as Conze’s transference principle allows one to deduce the maximal ergodic theorem from the Hardy-Littlewood maximal inequality (which can be viewed as its continuous counterpart over ), the estimate (5) follows from the estimate
The left-hand side here is rather fearsome looking (two norms and two suprema, one of which is over a class of functions rather than a single real number) but we can simplify it a bit by noting that the inner integral is a convolution operator in g, thus the left-hand side is
where is the kernel . The inner supremum is then a maximal Fourier multiplier , where is the Fourier transform of . Recall that Fourier multipliers m(D) have the multiplier norm
motivated by this, we can define the maximal multiplier norm of a sequence as
The return times estimate is then equivalent to the assertion that
It turns out that the Fourier multiplier is roughly a smoothed out version of the Carleson operator , in which one only considers physical scales of order and coarser (or equivalently, frequency scales of order and finer). This can be made precise using wave packet decompositions, which I will not discuss here. Thus the return times estimate is basically equivalent to
On the other hand, from the well-known fact (from Plancherel’s theorem) that the norm of a multiplier m is the same as its supremum norm, the Carleson-Hunt inequality (1) is equivalent to
Thus we see that the return times theorem for q=2 is a maximal version of Carleson’s theorem. Indeed, we prove the return times theorem in the case by adapting the time-frequency proof of Carleson’s theorem due to Lacey and Thiele.
[Update, Dec 12: A missing exponential in a Hardy-Littlewood type maximal estimate has been reinstated; thanks to Richard Oberlin for the correction.]