Carleson's theorem

Template:Short description Template:Distinguish Carleson's theorem is a fundamental result in mathematical analysis establishing the pointwise (Lebesgue) almost everywhere convergence of Fourier series of [[Lp space|Template:Math functions]], proved by Template:Harvs. The name is also often used to refer to the extension of the result by Template:Harvs to Template:Math functions for Template:Math (also known as the Carleson–Hunt theorem) and the analogous results for pointwise almost everywhere convergence of Fourier integrals, which can be shown to be equivalent by transference methods.

Statement of the theorem

The result, as extended by Hunt, can be formally stated as follows:

The analogous result for Fourier integrals is:

History

A fundamental question about Fourier series, asked by Fourier himself at the beginning of the 19th century, is whether the Fourier series of a continuous function converges pointwise to the function.

By strengthening the continuity assumption slightly one can easily show that the Fourier series converges everywhere. For example, if a function has bounded variation then its Fourier series converges everywhere to the local average of the function. In particular, if a function is continuously differentiable then its Fourier series converges to it everywhere. This was proven by Dirichlet, who expressed his belief that he would soon be able to extend his result to cover all continuous functions. Another way to obtain convergence everywhere is to change the summation method. For example, Fejér's theorem shows that if one replaces ordinary summation by Cesàro summation then the Fourier series of any continuous function converges uniformly to the function. Further, it is easy to show that the Fourier series of any Template:Math function converges to it in Template:Math norm.

After Dirichlet's result, several experts, including Dirichlet, Riemann, Weierstrass and Dedekind, stated their belief that the Fourier series of any continuous function would converge everywhere. This was disproved by Paul du Bois-Reymond, who showed in 1876 that there is a continuous function whose Fourier series diverges at one point.

The almost-everywhere convergence of Fourier series for Template:Math functions was postulated by Template:Harvs, and the problem was known as Luzin's conjecture (up until its proof by Template:Harvtxt). Template:Harvtxt showed that the analogue of Carleson's result for Template:Math is false by finding such a function whose Fourier series diverges almost everywhere (improved slightly in 1926 to diverging everywhere). Before Carleson's result, the best known estimate for the partial sums Template:Math of the Fourier series of a function in Template:Math was $$s_n(x)=o(\log (n{)}^{1/p})\text{ almost everywhere}.$$ In other words, the function Template:Math can still grow to infinity at any given point x as one takes more and more terms of the Fourier series into account, though the growth must be quite slow (slower than the logarithm of Template:Math to a small power). This result was proved by Kolmogorov–Seliverstov–Plessner for Template:Math, by G. H. Hardy for Template:Math, and by Littlewood–Paley for Template:Math Template:Harv. This result had not been improved for several decades, leading some experts to suspect that it was the best possible and that Luzin's conjecture was false. Kolmogorov's counterexample in Template:Math was unbounded in any interval, but it was thought to be only a matter of time before a continuous counterexample was found. Carleson said in an interview with Template:Harvtxt that he started by trying to find a continuous counterexample and at one point thought he had a method that would construct one, but realized eventually that his approach could not work. He then tried instead to prove Luzin's conjecture since the failure of his counterexample convinced him that it was probably true.

Carleson's original proof is exceptionally hard to read, and although several authors have simplified the argument there are still no easy proofs of his theorem. Expositions of the original paper Template:Harvtxt include Template:Harvtxt, Template:Harvtxt, Template:Harvtxt, and Template:Harvtxt. Template:Harvs published a new proof of Hunt's extension which proceeded by bounding a maximal operator. This, in turn, inspired a much simplified proof of the L² result by Template:Harvs, explained in more detail in Template:Harvtxt. The books Template:Harvtxt and Template:Harvtxt also give proofs of Carleson's theorem.

Template:Harvtxt showed that for any set of measure 0 there is a continuous periodic function whose Fourier series diverges at all points of the set (and possibly elsewhere). When combined with Carleson's theorem this shows that there is a continuous function whose Fourier series diverges at all points of a given set of reals if and only if the set has measure 0.

The extension of Carleson's theorem to Template:Math for Template:Math was stated to be a "rather obvious" extension of the case Template:Math in Carleson's paper, and was proved by Template:Harvtxt. Carleson's result was improved further by Template:Harvtxt to the space Template:Math and by Template:Harvtxt to the space Template:Math. (Here Template:Math is Template:Math if Template:Math and Template:Math otherwise, and if Template:Math is a function then Template:Math stands for the space of functions Template:Math such that Template:Math is integrable.)

Template:Harvtxt improved Kolmogorov's counterexample by finding functions with everywhere-divergent Fourier series in a space slightly larger than Template:Math. One can ask if there is in some sense a largest natural space of functions whose Fourier series converge almost everywhere. The simplest candidate for such a space that is consistent with the results of Antonov and Konyagin is Template:Math.

The extension of Carleson's theorem to Fourier series and integrals in several variables is made more complicated as there are many different ways in which one can sum the coefficients; for example, one can sum over increasing balls, or increasing rectangles. Convergence of rectangular partial sums (and indeed general polygonal partial sums) follows from the one-dimensional case, but the spherical summation problem is still open for Template:Math.

The Carleson operator

The Carleson operator Template:Math is the non-linear operator defined by $$Cf(x)=\underset{N}{\sup }|\underset{-N}{\overset{N}{\int }}\hat{f}(y)e^{2\pi ixy}dy|$$

It is relatively easy to show that the Carleson–Hunt theorem follows from the boundedness of the Carleson operator from Template:Math to itself for Template:Math. However, proving that it is bounded is difficult, and this was actually what Carleson proved.

See also

• Convergence of Fourier series

References

• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Cite book
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation (Thesis; also: Collected Works, Vol. 1, Moscow, 1953, pp. 48–212)
• Template:Citation "This monograph is a detailed and essentially self-contained treatment of the work of Carleson and Hunt."
• Template:Citation
• Template:Citation
• Template:Eom
• Template:Citation