
An illustration of a bump function in two variables.
In
mathematics, a
bump function is a function
on a
Euclidean space which is both
smooth (in the sense of having continuous derivatives of all orders) and
compactly supported. The space of all bump functions on
is denoted
or
. The
dual space of this space endowed with a suitable topology is the space of
distributions.
Examples

The function Ψ(x).
The function
given by
\begin{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. This function can be interpreted as the
Gaussian function scaled to fit into the unit disc: the substitution
corresponds to sending
to
A simple example of a bump function in
variables is obtained by taking the product of
copies of the above bump function in one variable, so
Existence of bump functions

An illustration of the sets in the construction.
It is possible to construct bump functions "to specifications". Stated formally, if
is an arbitrary compact set in
n dimensions and
is an
open set containing
there exists a bump function
which is 1 on
and 0 outside of
Since
can be taken to be a very small neighborhood of
this amounts to being able to construct a function that is 1 on
and falls off rapidly to 0 outside of
while still being smooth.
The construction proceeds as follows. One considers a compact neighborhood
of
contained in
so
The
characteristic function of
will be equal to 1 on
and
outside of
so in particular, it will be 1 on
and
outside of
This function is not smooth however. The key idea is to smooth
a bit, by taking the
convolution of
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
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
identity theorem.
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.
The
Fourier transform of a bump function is a
Schwartz function, but cannot be compactly supported unless it is zero, since it is an entire analytic function (see
Paley-Wiener theorem). Because the bump function is infinitely differentiable, its Fourier transform
F(
k) must decay faster than any finite power of 1/
k for a large angular frequency |
k|. The Fourier transform of the particular
bump function above can be analyzed by a
saddle-point method, and decays asymptotically as
for large |
k|.