Math 2.0

Harmonic analysis on Euclidean spaces Convergence of Fourier series Theorem

Hunt's extension of Carleson's theorem

Builds on Carleson's theoremLp spaceFourier seriesFourier coefficientAlmost everywhere

Statement

Let 1<p<∞1 < p < \infty. Let f ⁣:ℝ→ℂf \colon \R \to \C be a 2π2\pi-periodic function with ∫−ππ∣f∣p<∞\int_{-\pi}^{\pi} \abs{f}^p < \infty, that is, f∈Lp(𝕋)f \in L^p(\mathbb{T}) (see Lp space). Let SNf(x)=∑k=−NNf^(k)eikxS_N f(x) = \sum_{k=-N}^{N} \hat f(k) e^{ikx} be the partial sums of its Fourier series, where f^(k)\hat f(k) are its Fourier coefficients. Then SNf(x)→f(x)S_N f(x) \to f(x) as N→∞N \to \infty for almost every x∈ℝx \in \R.

Remarks

Hunt proved this in 1968 by extending the method of Carleson's theorem, which is the case p=2p = 2. The key estimate is that the maximal operator f↦sup⁡N∣SNf∣f \mapsto \sup_N \abs{S_N f} is bounded on Lp(𝕋)L^p(\mathbb{T}) for 1<p<∞1 < p < \infty. The theorem is new only for 1<p<21 < p < 2, since Lp(𝕋)⊂L2(𝕋)L^p(\mathbb{T}) \subset L^2(\mathbb{T}) for p≥2p \ge 2. The case p=1p = 1 fails: Kolmogorov's example is an integrable function whose Fourier series diverges everywhere.

Going deeper

For a student

The proof shows that the Carleson maximal operator is bounded on LpL^p for 1<p<∞1 < p < \infty. With the maximal bound, a.e. convergence follows from convergence on the dense class of trigonometric polynomials. The exact borderline between L1L^1 and the spaces LpL^p with p>1p > 1 for almost everywhere convergence is still studied.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Almost everywhere concept
  2. Fourier coefficient concept
  3. Fourier series concept
  4. Lp space concept
  5. Carleson's theorem statement
  6. Hunt's extension of Carleson's theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Carleson%27s_theorem
About this page
TagNAX51M6025
URIm2://NAX51M6025
Kindstatement, theorem
WritingW0 stub
MSC42A20, 42B25
StatusThis copy of the site has no build data. Run m2 status NAX51M6025.
AboutFourier series, Convergence of Fourier series
UsesCarleson's theorem, Lp space, Fourier series, Fourier coefficient, Almost everywhere

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.