Math 2.0

Functional analysis Theorem

Approximation by convolution with mollifiers

Builds on MollifierConvolutionLp spaceSmooth functionContinuous function

Statement

Let φ\varphi be a mollifier on ℝn\R^n, let φε(x)=ε−nφ(x/ε)\varphi_\varepsilon(x) = \varepsilon^{-n} \varphi(x/\varepsilon) for ε>0\varepsilon > 0, and let ff be a locally integrable function on ℝn\R^n. Put fε=φε∗ff_\varepsilon = \varphi_\varepsilon * f, the convolution fε(x)=∫ℝnφε(x−y)f(y) dyf_\varepsilon(x) = \int_{\R^n} \varphi_\varepsilon(x - y) f(y) \, dy. Then:

  1. fεf_\varepsilon is a smooth function, and ∂αfε=(∂αφε)∗f\partial^\alpha f_\varepsilon = (\partial^\alpha \varphi_\varepsilon) * f for every multi-index α\alpha.
  2. If ff vanishes almost everywhere outside a closed set KK, then fεf_\varepsilon vanishes outside {x:dist⁡(x,K)≤ε}\set{x : \operatorname{dist}(x, K) \le \varepsilon}.
  3. If ff is continuous, then fε→ff_\varepsilon \to f uniformly on every compact set as ε→0\varepsilon \to 0.
  4. If f∈Lp(ℝn)f \in L^p(\R^n) with 1≤p<∞1 \le p < \infty, then ∥fε∥Lp≤∥f∥Lp\norm{f_\varepsilon}_{L^p} \le \norm{f}_{L^p} and ∥fε−f∥Lp→0\norm{f_\varepsilon - f}_{L^p} \to 0 as ε→0\varepsilon \to 0.

Remarks

Part 1 follows by differentiating under the integral sign, which is allowed because φε\varphi_\varepsilon has bounded derivatives and compact support. Part 2 holds because φε(x−y)=0\varphi_\varepsilon(x - y) = 0 when ∣x−y∣>ε\abs{x - y} > \varepsilon. For parts 3 and 4, write fε(x)−f(x)=∫φε(y)(f(x−y)−f(x))dyf_\varepsilon(x) - f(x) = \int \varphi_\varepsilon(y) \big( f(x - y) - f(x) \big) dy, an average of differences over ∣y∣≤ε\abs{y} \le \varepsilon. For continuous ff, uniform continuity on compact sets makes it small. For f∈Lpf \in L^p, Minkowski's integral inequality bounds its norm by sup⁡∣y∣≤ε∥f(⋅−y)−f∥Lp\sup_{\abs{y} \le \varepsilon} \norm{f(\cdot - y) - f}_{L^p}. This tends to 00 by the continuity of translation in LpL^p. The bound ∥fε∥Lp≤∥f∥Lp\norm{f_\varepsilon}_{L^p} \le \norm{f}_{L^p} is Young's convolution inequality with ∥φε∥L1=1\norm{\varphi_\varepsilon}_{L^1} = 1.

Consequence: for 1≤p<∞1 \le p < \infty the bump functions are dense in Lp(ℝn)L^p(\R^n). Indeed, first cut ff off to a large ball, then mollify, and use parts 1, 2 and 4.

Part 4 fails for p=∞p = \infty. If ff is the indicator function of [0,∞)[0, \infty) on ℝ\R, then each fεf_\varepsilon is continuous, so ∥fε−f∥L∞≥1/2\norm{f_\varepsilon - f}_{L^\infty} \ge 1/2 for all ε\varepsilon.

Going deeper

For a student

This theorem is the workhorse behind density arguments in analysis. To prove an identity or an inequality for all f∈Lpf \in L^p or all ff in a Sobolev space, one proves it for smooth functions and passes to the limit. Mollification commutes with weak derivatives, ∂α(φε∗f)=φε∗∂αf\partial^\alpha (\varphi_\varepsilon * f) = \varphi_\varepsilon * \partial^\alpha f, so the same argument shows that smooth functions are dense in Wk,p(ℝn)W^{k,p}(\R^n). At a Lebesgue point of ff, fε(x)→f(x)f_\varepsilon(x) \to f(x), so the convergence also holds almost everywhere.

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. Continuous function concept
  2. Convolution concept
  3. Lp space concept
  4. Mollifier concept
  5. Smooth function concept
  6. Approximation by convolution with mollifiers statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Mollifier
About this page
TagYBYE4TBNJV
URIm2://YBYE4TBNJV
Kindstatement, theorem
WritingW0 stub
MSC46E35, 42B35, 46E30
StatusThis copy of the site has no build data. Run m2 status YBYE4TBNJV.
AboutMollifier
UsesMollifier, Convolution, Lp space, Smooth function, Continuous function

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.