Mollifier

Mollifier
A mollifier (top) in dimension one. At the bottom, in red is a function with a corner (left) and sharp jump (right), and in blue is its mollified version.

In mathematics, mollifiers (also known as approximations to the identity) are smooth functions with special properties, used in distribution theory to create sequences of smooth functions approximating nonsmooth (generalized) functions, via convolution. Intuitively, given a function which is rather irregular, by convolving it with a mollifier the function gets "mollified", that is, its sharp features are smoothed, while still remaining close to the original nonsmooth function. They are also known as Friedrichs mollifiers after Kurt Otto Friedrichs, the mathematician who introduced them.

Contents

History

Mollifiers were introduced by Kurt Otto Friedrichs in his paper Friedrichs 1944, pp. 136–139, which is a watershed in the modern theory of partial differential equations.[1] The name of the concept had a curious genesis:[1] at that time Friedrichs was a colleague of the mathematician Donald Alexander Flanders, and since he liked to consult colleagues about English usage, he asked Flanders how to name the smoothing operator he was about to introduce.[2] Flanders was a puritan so his friends nicknamed him Moll after Moll Flanders in recognition of his moral qualities, and he suggested to call the new mathematical concept a "mollifier" as a pun incorporating both Flanders' nickname and the verb 'to mollify', meaning 'to smooth over' in a figurative sense.

Sergei Sobolev had previously used mollifiers in his epoch making 1938 paper containing the proof of the Sobolev embedding theorem,[3] as Friedrichs himself later acknowledged.[4]

There is a little misunderstanding in the concept of mollifier: Friedrichs defined as "mollifier" the integral operator whose kernel is one of the functions nowadays called mollifiers. However, since the properties of an integral operator are completely determined by its kernel, the name mollfier was inherited by the kernel itself as a result of common usage.

Definition

A function undergoing progressive mollification.

Modern (distribution based) definition

Definition 1.. If ϕ is a smooth function on ℝn, n ≥ 1, satisfying the following three requirements

(1)   it is compactly supported (such as a bump function)
(2)  \int_{\mathbb{R}^n}\!\!\!\!\varphi(x)\mathrm{d}x=1
(3)  \lim_{\epsilon\to 0}\varphi_\epsilon(x) = \lim_{\epsilon\to 0}\epsilon^{-n}\varphi(x / \epsilon)=\delta(x)

where δ(x) is the Dirac delta function and the limit must be understood in the space of Schwartz distributions, then ϕ is a mollifier. The function ϕ could satisfy also further conditions:[5] for example, if it satisfies

(4)  ϕ(x) ≥ 0 for all x ∈ ℝn, then it is a positive mollifier
(5)  ϕ(x)=μ( | x | ) for some infinitely differentiable function μ : ℝ+ → ℝ, then it is a symmetric mollifier

Notes on Friedrichs' definition

Note 1. When the theory of distributions was still not widely known nor used,[6] property (3) above was formulated by saying that the convolution of the function \scriptstyle\varphi_\epsilon with a given function belonging to a proper Hilbert or Banach space converges as ε → 0 to this last one:[7] this is exactly what Friedrichs did.[8] This also clarifies why mollifiers are related to approximate identities.[9]

Note 2. As briefly pointed out in the "History" section of this entry, originally, the term "mollifier" identified the following convolution operator:[9][10]

\Phi_\epsilon(f)(x)=\int_{\mathbb{R}^n}\varphi_\epsilon(x-y) f(y)\mathrm{d}y

where \scriptstyle\varphi_\epsilon(x)=\epsilon^{-n}\varphi(x/\epsilon) and ϕ is a smooth function satisfying the first three conditions stated above and one or more supplementary conditions as positivity and symmetry.

Concrete example

Consider the function ϕ(x) of the variablen defined by

\varphi(x) = \begin{cases} e^{-1/(1-|x|^2)}& \text{ if } |x| < 1\\
                 0& \text{ if } |x|\geq 1
                 \end{cases}

It is easily seen that this function is infinitely differentiable, non analytic with vanishing derivative for | x | = 1. Divide this function by its integral over the whole space to get a function ϕ of integral one, which can be used as mollifier as described above: it is also easy to see that ϕ(x) defines a positive and symmetric mollifier.[11]

The function ϕ(x) in dimension one

Properties

All properties of a mollifier are related to its behaviour under the operation of convolution: we list the following ones, whose proofs can be found in every text on distribution theory.[12]

Smoothing property

For any distribution T, the following sequence of convolutions indexed by the real number \epsilon

T_\epsilon = T\ast\varphi_\epsilon

where \ast denotes convolution, is a sequence of smooth functions.

Approximation of identity

For any distribution T, the following sequence of convolutions indexed by the real number \epsilon converges to T

\lim_{\epsilon\to 0}T_\epsilon = \lim_{\epsilon\to 0}T\ast\varphi_\epsilon=T\in D^\prime(\mathbb{R}^n)

Support of convolution

For any distribution T,

\mathrm{supp}T_\epsilon=\mathrm{supp}(T\ast\varphi_\epsilon)\subset\mathrm{supp}T+\mathrm{supp}\varphi_\epsilon

where supp indicates the support in the sense of distributions, and + indicates their Minkowski addition.

Applications

The basic applications of mollifiers is to prove properties valid for smooth functions also in nonsmooth situations:

Product of distributions

In some theories of generalized functions, mollifiers are used to define the multiplication of distributions: precisely, given two distributions S and T, the limit of the product of a smooth function and a distribution

\lim_{\epsilon\to 0}S_\epsilon\cdot T=\lim_{\epsilon\to 0}S\cdot T_\epsilon\overset{\mathrm{def}}{=}S\cdot T

defines (if it exists) their product in various theories of generalized functions.

"Weak=Strong" theorems

Very informally, mollifiers are used to prove the identity of two different kind of extension of differential operators: the strong extension and the weak extension. The paper Friedrichs 1944 illustrates this concept quite well: however the high quantity of technical details needed to show what this really means prevent us from being formally detailed in this short description.

Smooth cutoff functions

By convolution of the characteristic function of the unit ball B1 = {x: | x | < 1} with the smooth function ϕ2 (defined as in (3) with \epsilon = 1/2), one obtains the function


\chi_{B_1,1/2}(x)=\chi_{B_1}\ast\varphi_{1/2}(x)=\int_{\mathbb{R}^n}\!\!\!\chi_{B_1}(x-y)\varphi_{1/2}(y)\mathrm{d}y=\int_{B_{1/2}}\!\!\!
\chi_{B_1}(x-y) \varphi_{1/2}(y)\mathrm{d}y \ \ \ (\because supp(\varphi_{1/2})=B_{1/2})

which is a smooth function equal to 1 on B1 / 2 = {x: | x | < 1 / 2}, with support contained in B3 / 2 = {x: | x | < 3 / 2}. This can be seen easily by observing that if  |x| \leq 1/2 and  |y|\leq 1/2 then  |x-y|\leq 1. Hence for  |x| \leq 1/2 ,


\int_{B_{1/2}}\!\!\!\chi_{B_1}(x-y) \varphi_{1/2}(y)\mathrm{d}y= \int_{B_{1/2}}\!\!\!
 \varphi_{1/2}(y)\mathrm{d}y=1
.

It is easy to see how this construction can be generalized to obtain a smooth function identical to one on a neighbourhood of a given compact set, and equal to zero in every point whose distance from this set is greater than a given \epsilon.[13] Such a function is called a (smooth) cutoff function: those functions are used to eliminate singularities of a given (generalized) function by multiplication. They leave unchanged the value of the (generalized) function they multiply only on a given set, thus modifying its support: also cutoff functions are the basic parts of smooth partitions of unity.

See also

Notes

  1. ^ a b According to Peter Lax in Friedrichs 1986, p. 117, volume 1,
  2. ^ He introduced the term "Mollifier" in the paper Friedrichs 1944, as previously pointed out.
  3. ^ See Sobolev 1938
  4. ^ Precisely he acknowledged this fact in the paper Friedrichs 1953, p. 196
  5. ^ See Giusti 1984, p. 11.
  6. ^ as in the paper Friedrichs 1944, written few years before Laurent Schwartz widespread his work.
  7. ^ Obviously the topology with respect to convergence occurs is the one of the Hilbert or Banach space considered.
  8. ^ See (Friedrichs 1944, pp. 136–138), propeties PI, PII, PIII and their consequence PIII0.
  9. ^ a b Also, in this respect, Friedrichs (1944, pp. 132) says:-"The main tool for the proof is a certain class of smoothing operators approximating unity, the “mollifiers”".
  10. ^ See (Friedrichs 1944, p. 137), paragraph 2, "Integral operators".
  11. ^ See Hörmander 1990, p. 14, lemma 1.2.3.: the example is stated in implicit form by first defining f(t)=exp( − 1 / t) for t ∈ ℝ+, and then considering f(x)=f (1 − | x | 2) for x ∈ ℝn.
  12. ^ See for example Hörmander 1990.
  13. ^ A proof of this fact can be found in Hörmander 1990, p. 25, Theorem 1.4.1.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • mollifier — ⇒MOLLIFIER, verbe trans. Vx., MÉD. Rendre mou. Cela sert à mollifier les humeurs. Un cataplasme pour mollifier une tumeur (Ac. 1798 1878). La pitié détend toutes mes fibres et mollifie mes nerfs (BALZAC, Lys, 1836, p.87). Prononc. et Orth.:[ ].… …   Encyclopédie Universelle

  • mollifier — Mollifier. v. a. Terme de Medecine. Rendre mol & fluide. Cela sert à mollifier les humeurs …   Dictionnaire de l'Académie française

  • Mollifier — Mol li*fi er, n. One who, or that which, mollifies. Bacon. [1913 Webster] …   The Collaborative International Dictionary of English

  • mollifier — Mollifier, act. acut. Faire ou rendre mol, Mollire, Macerare …   Thresor de la langue françoyse

  • mollifier — (mol li fi é), je mollifiais, nous mollifiions, vous mollifiiez ; que je mollifie, que nous mollifiions, que vous mollifiiez, v. a. Terme de médecine peu usité. Rendre mou et fluide. Mollifier un abcès. Mollifier les humeurs. HISTORIQUE    XVIe s …   Dictionnaire de la Langue Française d'Émile Littré

  • MOLLIFIER — v. a. T. de Médec. Rendre mou et fluide. Cela sert à mollifier les humeurs. Un cataplasme pour mollifier une tumeur . MOLLIFIÉ, ÉE. participe …   Dictionnaire de l'Academie Francaise, 7eme edition (1835)

  • mollifier — noun ( s) : one that mollifies vinegar … is itself a prime corrector and mollifier Thomas Fuller …   Useful english dictionary

  • mollifier — See mollifiable. * * * …   Universalium

  • mollifier — noun An approximation to the identity , a smooth function with special properties, used in distribution theory to create sequences of smooth functions approximating nonsmooth (generalized) functions, via convolution …   Wiktionary

  • mollifier — mÉ‘lɪfaɪə(r) n. something that calms or eases, something which pacifies …   English contemporary dictionary

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”