HOME

TheInfoList



OR:

In mathematical analysis, a bump function (also called a test function) is a function f : \Reals^n \to \Reals on a
Euclidean space Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces ...
\Reals^n which is both smooth (in the sense of having continuous derivatives of all orders) and compactly supported. The set of all bump functions with domain \Reals^n forms a vector space, denoted \mathrm^\infty_0(\Reals^n) or \mathrm^\infty_\mathrm(\Reals^n). The dual space of this space endowed with a suitable topology is the space of distributions.


Examples

The function \Psi : \mathbb \to \mathbb given by \Psi(x) = \begin \exp\left( \frac\right), & \text , x, < 1, \\ 0, & \text , x, \geq 1, \end is an example of a bump function in one dimension. Note that the support of this function is the closed interval 1,1/math>. In fact, by definition of support, we have that \operatorname(\Psi):=\overline =\overline, where the closure is taken with respect the Euclidean topology of the real line. 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 \exp\left(-y^2\right) scaled to fit into the unit disc: the substitution y^2 = / corresponds to sending x = \pm 1 to y = \infty. A simple example of a (square) 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) \cdots \Psi(x_n). A radially symmetric bump function in n variables can be formed by taking the function \Psi_n : \Reals^n \to \Reals defined by \Psi_n(\mathbf)=\Psi(, \mathbf, ). This function is supported on the unit ball centered at the origin. For another example, take an h that is positive on (c, d) and zero elsewhere, for example :h(x) = \begin \exp\left(-\frac\right),& c < x < d \\ 0,& \mathrm \end. Smooth transition functions Consider the function :f(x)=\begine^&\textx>0,\\ 0&\textx\le0,\end defined for every real number ''x''. The function :g(x)=\frac,\qquad x\in\mathbb, has a strictly positive denominator everywhere on the real line, hence ''g'' is also smooth. Furthermore, ''g''(''x'') = 0 for ''x'' ≤ 0 and ''g''(''x'') = 1 for ''x'' ≥ 1, hence it provides a smooth transition from the level 0 to the level 1 in the unit interval /nowiki>0, 1/nowiki>. To have the smooth transition in the real interval /nowiki>''a'', ''b''/nowiki> with ''a'' < ''b'', consider the function :\mathbb\ni x\mapsto g\Bigl(\frac\Bigr). For real numbers , the smooth function :\mathbb\ni x\mapsto g\Bigl(\frac\Bigr)\,g\Bigl(\frac\Bigr) equals 1 on the closed interval /nowiki>''b'', ''c''/nowiki> and vanishes outside the open interval (''a'', ''d''), hence it can serve as a bump function. Caution must be taken since, as example, taking \ < \ < \, leads to: :q(x)=\frac which is not an infinitely differentiable function (so, is not "smooth"), so the constraints must be strictly fulfilled. Some interesting facts about the function: :q(x,a)=\frac Are that q\left(x,\frac\right) make smooth transition curves with "almost" constant slope edges (a bump function with true straight slopes is portrayed this Another example). A proper example of a smooth Bump function would be: :u(x)=\begin 1,\text x=0, \\ 0, \text , x, \geq 1, \\ \frac, \text, \end A proper example of a smooth transition function will be: :w(x)=\begin\frac&\text0 where could be noticed that it can be represented also through Hyperbolic functions: :\frac = \frac\left( 1-\tanh\left(\frac \right) \right)


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. Bump functions defined in terms of convolution The construction proceeds as follows. One considers a compact neighborhood V of K contained in U, so K \subseteq V^\circ\subseteq V \subseteq 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. Bump functions defined in terms of a function c : \Reals \to , \infty) with support (-\infty, 0/math> An alternative construction that does not involve convolution is now detailed. It begins by constructing a smooth function f : \Reals^n \to \Reals that is positive on a given open subset U \subseteq \Reals^n and vanishes off of U. This function's support is equal to the closure \overline of U in \Reals^n, so if \overline is compact, then f is a bump function. Start with any smooth function c : \Reals \to \Reals that vanishes on the negative reals and is positive on the positive reals (that is, c = 0 on (-\infty, 0) and c > 0 on (0, \infty), where continuity from the left necessitates c(0) = 0); an example of such a function is c(x) := e^ for x > 0 and c(x) := 0 otherwise. Fix an open subset U of \Reals^n and denote the usual Euclidean norm by \, \cdot\, (so \Reals^n is endowed with the usual Euclidean metric). The following construction defines a smooth function f : \Reals^n \to \Reals that is positive on U and vanishes outside of U. So in particular, if U is relatively compact then this function f will be a bump function. If U = \Reals^n then let f = 1 while if U = \varnothing then let f = 0; so assume U is neither of these. Let \left(U_k\right)_^\infty be an open cover of U by open balls where the open ball U_k has radius r_k > 0 and center a_k \in U. Then the map f_k : \Reals^n \to \Reals defined by f_k(x) = c\left(r_k^2 - \left\, x - a_k\right\, ^2\right) is a smooth function that is positive on U_k and vanishes off of U_k. For every k \in \mathbb, let M_k = \sup \left\, where this supremum is not equal to +\infty (so M_k is a non-negative real number) because \left(\Reals^n \setminus U_k\right) \cup \overline = \Reals^n, the partial derivatives all vanish (equal 0) at any x outside of U_k, while on the compact set \overline, the values of each of the (finitely many) partial derivatives are (uniformly) bounded above by some non-negative real number.The partial derivatives \frac : \Reals^n \to \Reals are continuous functions so the image of the compact subset \overline is a compact subset of \Reals. The supremum is over all non-negative integers 0 \leq p = p_1 + \cdots + p_n \leq k where because k and n are fixed, this supremum is taken over only finitely many partial derivatives, which is why M_k < \infty. The series f ~:=~ \sum_^ \frac converges uniformly on \Reals^n to a smooth function f : \Reals^n \to \Reals that is positive on U and vanishes off of U. Moreover, for any non-negative integers p_1, \ldots, p_n \in \Z, \frac f ~=~ \sum_^ \frac \frac where this series also converges uniformly on \Reals^n (because whenever k \geq p_1 + \cdots + p_n then the kth term's absolute value is \leq \tfrac = \tfrac). This completes the construction. As a corollary, given two disjoint closed subsets A, B of \Reals^n, the above construction guarantees the existence of smooth non-negative functions f_A, f_B : \Reals^n \to [0, \infty) such that for any x \in \Reals^n, f_A(x) = 0 if and only if x \in A, and similarly, f_B(x) = 0 if and only if x \in B, then the function h ~:=~ \frac : \Reals^n \to [0, 1] is smooth and for any x \in \Reals^n, h(x) = 0 if and only if x \in A, h(x) = 1 if and only if x \in B, and 0 < h(x) < 1 if and only if x \not\in A \cup B. In particular, h(x) \neq 0 if and only if x \in \Reals^n \smallsetminus A, so if in addition U := \Reals^n \smallsetminus A is relatively compact in \Reals^n (where A \cap B = \varnothing implies B \subseteq U) then h will be a smooth bump function with support in \overline.


Properties and uses

While bump functions are smooth, the identity theorem prohibits their being analytic unless they vanish identically. Bump functions are often used as mollifiers, as smooth cutoff functions, and to form smooth
partitions of unity In mathematics, a partition of unity on a topological space is a Set (mathematics), set of continuous function (topology), continuous functions from to the unit interval ,1such that for every point x\in X: * there is a neighbourhood (mathem ...
. 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. If the boundaries of the Bump function domain is \partial x, to fulfill the requirement of "smoothness", it has to preserve the continuity of all its derivatives, which leads to the following requirement at the boundaries of its domain: \lim_ \frac f(x) = 0,\,\text n \geq 0, \,n \in \Z The Fourier transform of a bump function is a (real) analytic function, and it can be extended to the whole complex plane: hence it cannot be compactly supported unless it is zero, since the only entire analytic bump function is the zero function (see Paley–Wiener theorem and Liouville's theorem). Because the bump function is infinitely differentiable, its Fourier transform must decay faster than any finite power of 1/k for a large angular frequency , k, . The Fourier transform of the particular bump function \Psi(x) = e^ \mathbf_ from above can be analyzed by a saddle-point method, and decays asymptotically as , k, ^ e^ for large , k, . Steven G. Johnson
Saddle-point integration of ''C'' "bump" functions
arXiv:1508.04376 (2015).


See also

* * * *


Citations


References

* {{DEFAULTSORT:Bump Function Smooth functions Schwartz distributions