Math 2.0

Harmonic analysis on Euclidean spaces Singular integrals and Calderón–Zygmund theory Theorem

Calderón–Zygmund theorem

Builds on Singular integral operatorLp spaceWeak Lp spaceCalderón–Zygmund lemmaMarcinkiewicz interpolation theorem

Statement

Let n≥1n \ge 1 and let KK be a locally integrable function on ℝn∖{0}\R^n \setminus \set{0}. Assume that there is a constant AA such that:

  1. ∣K(x)∣≤A∣x∣−n\abs{K(x)} \le A\abs{x}^{-n} for all x≠0x \ne 0;
  2. ∫∣x∣≥2∣y∣∣K(x−y)−K(x)∣ dx≤A\int_{\abs{x} \ge 2\abs{y}} \abs{K(x - y) - K(x)} \, dx \le A for all y≠0y \ne 0;
  3. ∫r<∣x∣<RK(x) dx=0\int_{r < \abs{x} < R} K(x) \, dx = 0 for all 0<r<R0 < r < R.

For ε>0\varepsilon > 0, let Tεf(x)=∫∣y∣>εK(y)f(x−y) dyT_\varepsilon f(x) = \int_{\abs{y} > \varepsilon} K(y) f(x - y) \, dy. Then for each 1<p<∞1 < p < \infty there is a constant CC, depending only on nn and pp, such that ∥Tεf∥Lp(ℝn)≤CA∥f∥Lp(ℝn)for all f∈Lp(ℝn) and ε>0.\norm{T_\varepsilon f}_{L^p(\R^n)} \le C A \norm{f}_{L^p(\R^n)} \quad \text{for all } f \in L^p(\R^n) \text{ and } \varepsilon > 0. Moreover, the operators TεT_\varepsilon are of weak type (1,1)(1, 1), uniformly in ε\varepsilon.

Remarks

The proof has three steps. The three conditions together give a uniform bound on the Fourier transforms of the truncated kernels, hence a uniform L2L^2 bound by the Plancherel theorem. The Calderón–Zygmund lemma splits ff into a bounded good part and a bad part with mean zero on disjoint cubes. Condition 2 controls the operator on the bad part away from the cubes, and this gives the weak type (1,1)(1, 1) bound. The Marcinkiewicz interpolation theorem then gives 1<p≤21 < p \le 2, and duality gives 2≤p<∞2 \le p < \infty.

Example: on ℝ\R, K(x)=1πxK(x) = \frac{1}{\pi x} satisfies condition 1 with A=1/πA = 1/\pi, and condition 3 because KK is odd. For condition 2, ∣K(x−y)−K(x)∣=∣y∣π∣x∣∣x−y∣≤2∣y∣πx2\abs{K(x - y) - K(x)} = \frac{\abs{y}}{\pi \abs{x}\abs{x - y}} \le \frac{2\abs{y}}{\pi x^2} when ∣x∣≥2∣y∣\abs{x} \ge 2\abs{y}, whose integral is 2/π2/\pi. So the truncated Hilbert transforms are bounded on Lp(ℝ)L^p(\R) uniformly in ε\varepsilon, which recovers the M. Riesz theorem.

The cancellation condition 3 is needed. For K(x)=∣x∣−nK(x) = \abs{x}^{-n}, conditions 1 and 2 hold, but Tεf(x)T_\varepsilon f(x) grows like log⁡(1/ε)\log(1/\varepsilon) for ff equal to 11 near xx. The conclusion fails for p=1p = 1 and p=∞p = \infty, as already for the Hilbert transform.

Going deeper

For a student

This is the central theorem of the theory of singular integral operators. Its method, an L2L^2 bound, the Calderón–Zygmund decomposition and interpolation, also proves the Hörmander–Mikhlin multiplier theorem and the bounds for maximal functions. It extends to non-convolution operators, the Calderón–Zygmund operators, once an L2L^2 bound is known; the T(1) theorem gives a test for that L2L^2 bound.

Reading path

To understand this page from the ground up, read these 12 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. Borel sigma-algebra concept
  2. Euclidean space object
  3. Lebesgue integral concept
  4. Lp space concept
  5. Outer measure concept
  6. Sigma-finite measure concept
  7. Singular integral operator concept
  8. Weak Lp space concept
  9. Lebesgue measure object
  10. Marcinkiewicz interpolation theorem statement
  11. Calderón–Zygmund lemma statement
  12. Calderón–Zygmund theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Singular_integral_operators_of_convolution_type
About this page
TagAE1HJ8D8GV
URIm2://AE1HJ8D8GV
Kindstatement, theorem
WritingW0 stub
MSC42B20
StatusThis copy of the site has no build data. Run m2 status AE1HJ8D8GV.
AboutSingular integral operator
UsesSingular integral operator, Lp space, Weak Lp space, Calderón–Zygmund lemma, Marcinkiewicz interpolation theorem

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.