From formulasearchengine
Jump to navigation Jump to search
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 for example 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 (generalized) function.[1] They are also known as Friedrichs mollifiers after Kurt Otto Friedrichs, who introduced them.[2]

Historical notes

Mollifiers were introduced by Kurt Otto Friedrichs in his paper Template:Harv, considered a watershed in the modern theory of partial differential equations.[3] The name of this mathematical object had a curious genesis: Peter Lax tells the whole story of this genesis in his commentary Template:Harv. According to Lax, at that time, the mathematician Donald Alexander Flanders was a colleague of Friedrichs: since he liked to consult colleagues about English usage, he asked Flanders an advice on how to name the smoothing operator he was using.[3] Flanders was a puritan, nicknamed by his friends Moll after Moll Flanders in recognition of his moral qualities: 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.[4]

Previously, Sergei Sobolev used mollifiers in his epoch making 1938 paper,[5] which contains the proof of the Sobolev embedding theorem: Template:Harvtxt himself acknowledged Sobolev's work on mollifiers stating that:-"These mollifiers were introduced by Sobolev and the author...".

It must be pointed out that 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 a linear integral operator are completely determined by its kernel, the name mollfier was inherited by the kernel itself as a result of common usage.


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)Template:Spaces it is compactly supported[6]

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

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

Notes on Friedrichs' definition

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

Note 2. As briefly pointed out in the "Historical notes" section of this entry, originally, the term "mollifier" identified the following convolution operator:[11][12]

where 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 of a variable in ℝn defined by

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 defines a positive and symmetric mollifier.[13]


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.[14]

Smoothing property

For any distribution , the following family of convolutions indexed by the real number

where denotes convolution, is a family of smooth functions.

Approximation of identity

For any distribution , the following family of convolutions indexed by the real number converges to

Support of convolution

For any distribution ,

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


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 and , the limit of the product of a smooth function and a distribution

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 Template:Harv illustrates this concept quite well: however the high number of technical details needed to show what this really means prevent them from being formally detailed in this short description.

Smooth cutoff functions

By convolution of the characteristic function of the unit ball with the smooth function (defined as in Template:EquationNote with ), one obtains the function

which is a smooth function equal to on , with support contained in . This can be seen easily by observing that if and then . Hence for ,


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 .[15] 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


  1. Respect to the topology of the given space of generalized functions.
  2. See Template:Harv.
  3. 3.0 3.1 See the commentary of Peter Lax to the paper Template:Harv in Template:Harv.
  4. Lax Template:Harv writes precisely that:-"On English usage Friedrichs liked to consult his friend and colleague, Donald Flanders, a descendant of puritans and a puritan himself, with the highest standard of his own conduct, noncensorious towards others. In recognition of his moral qualities he was called Moll by his friends. When asked by Friedrichs what to name the smoothing operator, Flander remarked that thei could be named mollifier after himself; Friedrichs was delighted, as on other occasions, to carry this joke into print."
  5. See Template:Harv.
  6. Such as a bump function
  7. See Template:Harv.
  8. As when the paper Template:Harv was published, few years before Laurent Schwartz widespread his work.
  9. Obviously the topology with respect to convergence occurs is the one of the Hilbert or Banach space considered.
  10. See Template:Harv, properties PI, PII, PIII and their consequence PIII0.
  11. 11.0 11.1 Also, in this respect, Template:Harvtxt says:-"The main tool for the proof is a certain class of smoothing operators approximating unity, the "mollifiers".
  12. See Template:Harv, paragraph 2, "Integral operators".
  13. See Template:Harv, 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) = exp(-1/(1-|x|2)) for x ∈ ℝn.
  14. See for example Template:Harv.
  15. A proof of this fact can be found in Template:Harv, Theorem 1.4.1.


  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}. The first paper where mollifiers were introduced.

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}. A paper where the differentiability of solutions of elliptic partial differential equations is investigated by using mollifiers.

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}. A selection from Friedrichs' works with a biography and commentaries of David Isaacson, Fritz John, Tosio Kato, Peter Lax, Louis Nirenberg, Wolfgag Wasow, Harold Weitzner.

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}. The paper where Sergei Sobolev proved his embedding theorem, introducing and using integral operators very similar to mollifiers, without naming them.