You are currently browsing the tag archive for the ‘Carleson’s theorem’ tag.

This set of notes discusses aspects of one of the oldest questions in Fourier analysis, namely the nature of convergence of Fourier series.

If is an absolutely integrable function, its Fourier coefficients are defined by the formula

If is smooth, then the Fourier coefficients are absolutely summable, and we have the Fourier inversion formula where the series here is uniformly convergent. In particular, if we define the partial summation operators then converges uniformly to when is smooth.What if is not smooth, but merely lies in an class for some ? The Fourier coefficients remain well-defined, as do the partial summation operators . The question of convergence in norm is relatively easy to settle:

Exercise 1

- (i) If and , show that converges in norm to . (
Hint:first use the boundedness of the Hilbert transform to show that is bounded in uniformly in .)- (ii) If or , show that there exists such that the sequence is unbounded in (so in particular it certainly does not converge in norm to . (
Hint:first show that is not bounded in uniformly in , then apply the uniform boundedness principle in the contrapositive.)

The question of pointwise almost everywhere convergence turned out to be a significantly harder problem:

Theorem 2 (Pointwise almost everywhere convergence)

Note from Hölder’s inequality that contains for all , so Carleson’s theorem covers the case of Hunt’s theorem. We remark that the precise threshold near between Kolmogorov-type divergence results and Carleson-Hunt pointwise convergence results, in the category of Orlicz spaces, is still an active area of research; see this paper of Lie for further discussion.

Carleson’s theorem in particular was a surprisingly difficult result, lying just out of reach of classical methods (as we shall see later, the result is much easier if we smooth either the function or the summation method by a tiny bit). Nowadays we realise that the reason for this is that Carleson’s theorem essentially contains a *frequency modulation symmetry* in addition to the more familiar translation symmetry and dilation symmetry. This basically rules out the possibility of attacking Carleson’s theorem with tools such as Calderón-Zygmund theory or Littlewood-Paley theory, which respect the latter two symmetries but not the former. Instead, tools from “time-frequency analysis” that essentially respect all three symmetries should be employed. We will illustrate this by giving a relatively short proof of Carleson’s theorem due to Lacey and Thiele. (There are other proofs of Carleson’s theorem, including Carleson’s original proof, its modification by Hunt, and a later time-frequency proof by Fefferman; see Remark 18 below.)

Richard Oberlin, Andreas Seeger, Christoph Thiele, Jim Wright, and I have just uploaded to the arXiv our paper “A variation norm Carleson theorem“, submitted to J. Europ. Math. Soc..

The celebrated Carleson-Hunt theorem asserts that if is an function for some , then the partial Fourier series

of converge to almost everywhere. (The claim fails for , as shown by a famous counterexample of Kolmogorov.) The theorem follows easily from the inequality

(1)

where , and depends only on . Indeed, one first verifies Carleson’s theorem for a dense subclass of (e.g. the space of test functions) and then uses a standard limiting argument involving (1) (this is an example of the trick “give yourself an epsilon of room“).

The Carleson-Hunt theorem shows that converges as for almost every , but does not say much more about the nature of that convergence. One way to measure the strength of the convergence is to introduce the variational norms

for various . For this is the Carleson maximal function ; for this is the total variation of the sequence , which one can verify to be the norm of .

Our main result is to obtain the following variational strengthening of (1)

(2)

whenever and ; these conditions on are optimal. (For those readers familiar with martingales, the relationship of (2) to (1) is analogous to the relationship between Lepingle’s inequality (a variant of the more well known Doob’s inequality) and the Hardy-Littlewood maximal inequality.)

Because a sequence with finite -variation for some finite is necessarily convergent, this leads to a new proof of the Carleson-Hunt theorem without the need for a dense subclass. In particular, we obtain ergodic theory analogues of this result, in the case where no obvious dense subclass is available; more precisely, we obtain a new (and more “quantitative”) proof of a Wiener-Wintner-type theorem (first obtained by Lacey and Terwilleger), namely that given any measure-preserving group on a measure space , and a function for some , one has for almost every that for every real number , the integrals converge as for *every* (not merely almost every ).

The estimate (2) also provides a new proof of a result of Christ and Kiselev on the almost everywhere boundedness of eigenfunctions of Schrodinger operators with potentials with . Unfortunately, due to various endpoint issues, this barely fails to settle the endpoint case , a conjecture known as the nonlinear Carleson conjecture (discussed in this previous post).

The approach here follows the Lacey-Thiele approach to Carleson’s theorem (which is in turn based on an earlier approach of Fefferman), based on linearising the Carleson maximal function by picking the integer which attains the supremum , dividing phase space into “tiles”, and organising these tiles into “trees” and then into “forests” based on the distribution of the phase space “energy” of , together with the “mass” distribution of the graph of the function . One then needs to combine various “Bessel” type bounds on the energy, “Vitali-type” bounds on the mass, and “Calderon-Zygmund” type estimates on the trees together to obtain the result.

In our setting, the main new difficulty is that there are multiple integers associated to each point rather than one, which requires a more detailed analysis of the “multiplicity” of forests that was not present in earlier work. (Also, the Calderon-Zygmund estimates need to be replaced with Lepingle type estimates, though this is a relatively standard change, being first introduced in a paper of Bourgain.)

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.

## Recent Comments