1144 CHAPTER 33. FOURIER ANALYSIS IN Rn
∣∣∣∣Kε ∗ f −Kη ∗ f∣∣∣∣
p ≤ ||Kε ∗ ( f −g)||p +∣∣∣∣Kε ∗g−Kη ∗g
∣∣∣∣p
+∣∣∣∣Kη ∗ ( f −g)
∣∣∣∣p
≤ 2A(p,n,B) || f −g||p +∣∣∣∣Kε ∗g−Kη ∗g
∣∣∣∣p .
Choose g such that 2A(p,n,B) || f −g||p ≤ δ/2. Then if ε,η are small enough, Corollary33.4.4 implies the last term is also less than δ/2. Thus, limε→0 Kε ∗ f exists in Lp (Rn).Let T f be the element of Lp (Rn) to which it converges. Then 33.4.54 follows and T isobviously linear because
T (a f +bg) = limε→0
Kε ∗ (a f +bg) = limε→0
(aKε ∗ f +bKε ∗g)
= aT f +bT g.
This proves the theorem.When do conditions 33.4.40-33.4.42 hold? It turns out this happens for K given by the
following.
K (x)≡ Ω(x)|x|n
, (33.4.55)
whereΩ(λx) = Ω(x) for all λ > 0, (33.4.56)
Ω is Lipschitz on Sn−1,∫Sn−1
Ω(x)dσ = 0. (33.4.57)
Theorem 33.4.6 For K given by 33.4.55 - 33.4.57, it follows there exists a constant B suchthat
|K (x)| ≤ B |x|−n, (33.4.58)∫a<|x|<b
K (x)dx = 0, (33.4.59)∫|x|>2|y|
|K (x−y)−K (x)|dx≤ B. (33.4.60)
Consequently, the conclusions of Theorem 33.4.5 hold also.
Proof: 33.4.58 is obvious. To verify 33.4.59,∫a<|x|<b
K (x)dx =∫ b
a
∫Sn−1
Ω(ρw)
ρn ρn−1dσdρ
=∫ b
a
1ρ
∫Sn−1
Ω(w)dσdρ = 0.
It remains to show 33.4.60.
K (x−y)−K (x) = |x−y|−n(
Ω
(x−y|x−y|
)−Ω
(x|x|
))+Ω(x)
(1
|x−y|n− 1|x|n
)(33.4.61)