Bump function

From testwiki
Revision as of 05:16, 27 February 2025 by imported>Canimayi (β†’growthexperiments-addlink-summary-summary:3|0|0)
(diff) ← Older revision | Latest revision (diff) | Newer revision β†’ (diff)
Jump to navigation Jump to search

Template:Short description

The graph of the bump function (x,y)ℝ2Ψ(r), where r=(x2+y2)1/2 and Ψ(r)=e1/(1r2)𝟏{|r|<1}.

In mathematics, a bump function (also called a test function) is a function f:ℝnℝ on a Euclidean space ℝ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 ℝn forms a vector space, denoted C0(ℝn) or Cc(ℝn). The dual space of this space endowed with a suitable topology is the space of distributions.

Examples

The 1d bump function Ψ(x).

The function Ψ:ℝℝ given by Ψ(x)={exp(1x21), if |x|<1,0, if |x|1,

is an example of a bump function in one dimension. Note that the support of this function is the closed interval [1,1]. In fact, by definition of support, we have that supp(Ψ):={xℝ:Ψ(x)0}=(1,1), 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(y2) scaled to fit into the unit disc: the substitution y2=1/(1x2) corresponds to sending x=±1 to y=.

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 Φ(x1,x2,,xn)=Ψ(x1)Ψ(x2)Ψ(xn).

A radially symmetric bump function in n variables can be formed by taking the function Ψn:ℝnℝ defined by Ψn(𝐱)=Ψ(|𝐱|). 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)={exp(1(xc)(dx)),c<x<d0,otherwise.


Smooth transition functions

The non-analytic smooth function f(x) considered in the article.

Consider the function

f(x)={e1xif x>0,0if x0,

defined for every real number x.


The smooth transition g from 0 to 1 defined here.

The function

g(x)=f(x)f(x)+f(1x),xℝ,

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 [0, 1]. To have the smooth transition in the real interval [a, b] with a < b, consider the function

ℝxg(xaba).

For real numbers Template:Math, the smooth function

ℝxg(xaba)g(dxdc)

equals 1 on the closed interval [b, c] and vanishes outside the open interval (a, d), hence it can serve as a bump function.

Caution must be taken since, as example, taking {a=1}<{b=c=0}<{d=1}, leads to:

q(x)=11+e12|x|x2|x|

which is not an infinitely differentiable function (so, is not "smooth"), so the constraints Template:Math must be strictly fulfilled.

Some interesting facts about the function:

q(x,a)=11+ea(12|x|)x2|x|

Are that q(x,32) 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)={1,if x=0,0,if |x|1,11+e12|x|x2|x|,otherwise,

A proper example of a smooth transition function will be:

w(x)={11+e2x1x2xif 0<x<1,0if x0,1if x1,

where could be noticed that it can be represented also through Hyperbolic functions:

11+e2x1x2x=12(1tanh(2x12(x2x)))

Existence of bump functions

An illustration of the sets in the construction.

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 ϕ 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 KVVU. The characteristic function χ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 χV a bit, by taking the convolution of χ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 Φ from the previous section and performing appropriate scalings.

Bump functions defined in terms of a function c:ℝ[0,) with support (,0]

An alternative construction that does not involve convolution is now detailed. It begins by constructing a smooth function f:ℝnℝ that is positive on a given open subset Uℝn and vanishes off of U.Template:Sfn This function's support is equal to the closure U of U in ℝn, so if U is compact, then f is a bump function.

Start with any smooth function c:ℝℝ that vanishes on the negative reals and is positive on the positive reals (that is, c=0 on (,0) and c>0 on (0,), where continuity from the left necessitates c(0)=0); an example of such a function is c(x):=e1/x for x>0 and c(x):=0 otherwise.Template:Sfn Fix an open subset U of ℝn and denote the usual Euclidean norm by (so ℝn is endowed with the usual Euclidean metric). The following construction defines a smooth function f:ℝnℝ that is positive on U and vanishes outside of U.Template:Sfn So in particular, if U is relatively compact then this function f will be a bump function.

If U=ℝn then let f=1 while if U= then let f=0; so assume U is neither of these. Let (Uk)k=1 be an open cover of U by open balls where the open ball Uk has radius rk>0 and center akU. Then the map fk:ℝnℝ defined by fk(x)=c(rk2xak2) is a smooth function that is positive on Uk and vanishes off of Uk.Template:Sfn For every kβ„•, let Mk=sup{|pfkp1x1pnxn(x)|:xℝn and p1,,pnβ„€ satisfy 0pik and p=ipi}, where this supremum is not equal to + (so Mk is a non-negative real number) because (ℝnUk)Uk=ℝn, the partial derivatives all vanish (equal 0) at any x outside of Uk, while on the compact set Uk, the values of each of the (finitely many) partial derivatives are (uniformly) bounded above by some non-negative real number.[note 1] The series f:=k=1fk2kMk converges uniformly on ℝn to a smooth function f:ℝnℝ that is positive on U and vanishes off of U.Template:Sfn Moreover, for any non-negative integers p1,,pnβ„€,Template:Sfn p1++pnp1x1pnxnf=k=112kMkp1++pnfkp1x1pnxn where this series also converges uniformly on ℝn (because whenever kp1++pn then the kth term's absolute value is Mk2kMk=12k). This completes the construction.

As a corollary, given two disjoint closed subsets A,B of ℝn, the above construction guarantees the existence of smooth non-negative functions fA,fB:ℝn[0,) such that for any xℝn, fA(x)=0 if and only if xA, and similarly, fB(x)=0 if and only if xB, then the function h:=fAfA+fB:ℝn[0,1] is smooth and for any xℝn, h(x)=0 if and only if xA, h(x)=1 if and only if xB, and 0<h(x)<1 if and only if x∉AB.Template:Sfn In particular, h(x)0 if and only if xℝnA, so if in addition U:=ℝnA is relatively compact in ℝn (where AB= implies BU) then h will be a smooth bump function with support in U.

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. 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 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: limxx±dndxnf(x)=0, for all n0,nβ„€

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|.[1] The Fourier transform of the particular bump function Ψ(x)=e1/(1x2)𝟏{|x|<1} from above can be analyzed by a saddle-point method, and decays asymptotically as |k|3/4e|k| for large |k|.[2]

See also

Citations

Template:Reflist Template:Reflist

References


Cite error: <ref> tags exist for a group named "note", but no corresponding <references group="note"/> tag was found

  1. ↑ K. O. Mead and L. M. Delves, "On the convergence rate of generalized Fourier expansions," IMA J. Appl. Math., vol. 12, pp. 247–259 (1973) Template:Doi.
  2. ↑ Steven G. Johnson, Saddle-point integration of C∞ "bump" functions, arXiv:1508.04376 (2015).