Bump function

Bump function

In mathematics, a bump function is a function f: {Bbb R}^n o {Bbb R} on a Euclidean space {Bbb R}^n which is both smooth (in the sense of having continuous derivatives of all orders) and compactly supported. The space of all bump functions on {Bbb R}^n is denoted C^infty_0({Bbb R}^n) or C^infty_c({Bbb R}^n). The dual space of this space endowed with a suitable topology is the space of distributions.

Examples

The function Psi:mathbb R o mathbb R given by :Psi(x) = egin{cases}e^{-1/(1-x^2)} & mbox{ for } |x| < 1\0 & mbox{ otherwise} end{cases}is an example of a bump function in one dimension. It is clear from the construction that this function has compact support. The proof of smoothness follows along the same lines as for the related function discussed in the Non-analytic smooth function article.

A simple example of a bump function in n variables is obtained by taking the product of n copies of the above bump function in one variable, so :Phi(x_1, x_2, dots, x_n) = Psi(x_1)Psi(x_2)cdotsPsi(x_n).

Existence of bump functions

It is possible to construct bump functions "to specifications". Stated formally, if K is an arbitrary compact set in "n" dimensions and U is an open set containing K, there exists a bump function phi which is 1 on K and 0 outside of U. Since U can be taken to be a very small neighborhood of K, this amounts to being able to construct a function that is 1 on K and falls off rapidly to 0 outside of K, while still being smooth.

The construction proceeds as follows. One considers a compact neighborhood V of K contained in U, so Ksubset V^o subset V subset U. The characteristic function chi_V of V will be equal to 1 on V and 0 outside of V, so in particular, it will be 1 on K and 0 outside of U. This function is not smooth however. The key idea is to smooth chi_V a bit, by taking the convolution of chi_V with a mollifier. The latter is just a bump function with a very small support and whose integral is 1. Such a mollifier can be obtained, for example, by taking the bump function Phi from the previous section and performing appropriate scalings.

Properties and uses

While bump functions are smooth, they cannot be analytic unless they vanish identically. This is a simple consequence of analytic continuation.

Bump functions are often used as mollifiers, as smooth cutoff functions, and to form smooth partitions of unity. They are the most common class of test functions used in analysis.

The space of bump functions is closed under many operations. For instance, the sum, product, or convolution of two bump functions is again a bump function, and any differential operator with smooth coefficients, when applied to a bump function, will produce another bump function. However, the Fourier transform of a bump function will in general only be a Schwartz function rather than a bump function.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Smooth function — A bump function is a smooth function with compact support. In mathematical analysis, a differentiability class is a classification of functions according to the properties of their derivatives. Higher order differentiability classes correspond to …   Wikipedia

  • Dirac delta function — Schematic representation of the Dirac delta function by a line surmounted by an arrow. The height of the arrow is usually used to specify the value of any multiplicative constant, which will give the area under the function. The other convention… …   Wikipedia

  • Non-analytic smooth function — In mathematics, smooth functions (also called infinitely differentiable functions) and analytic functions are two very important types of functions. One can easily prove that any analytic function of a real argument is smooth. The converse is not …   Wikipedia

  • Reminiscence bump — The reminiscence bump is the tendency for older adults to have increased recollection for events that occurred during their adolescence and early adulthood.[1] It was identified through the study of autobiographical memory and the subsequent… …   Wikipedia

  • Sigmoid function — The logistic curve Plot of the error function …   Wikipedia

  • Multi-function structure — Multi function material is a composite material. The traditional approach to the development of structures is to address the loadcarrying function and other functional requirements separately. Recently, however, there has been increased interest… …   Wikipedia

  • Stalk (sheaf) — The stalk of a sheaf is a mathematical construction capturing the behaviour of a sheaf around a given point.Motivation and definitionSheaves are defined on open sets, but the underlying topological space X consists of points. It is reasonable to… …   Wikipedia

  • Distribution (mathematics) — This article is about generalized functions in mathematical analysis. For the probability meaning, see Probability distribution. For other uses, see Distribution (disambiguation). In mathematical analysis, distributions (or generalized functions) …   Wikipedia

  • 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… …   Wikipedia

  • Peetre theorem — In mathematics, the (linear) Peetre theorem is a result of functional analysis that gives a characterisation of differential operators in terms of their effect on generalized function spaces, and without mentioning differentiation in explicit… …   Wikipedia

Share the article and excerpts

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