Mellin transform

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, the Mellin transform is an integral transform that may be regarded as the multiplicative version of the two-sided Laplace transform. This integral transform is closely connected to the theory of Dirichlet series, and is often used in number theory, mathematical statistics, and the theory of asymptotic expansions; it is essentially the same as the Laplace transform and closely related to the Fourier transform, and the theory of the gamma function and allied special functions.

The Mellin transform of a complex-valued function Template:Mvar defined on 𝐑+Γ—=(0,∞) is the function β„³f of complex variable s given (where it exists, see Template:Slink below) by β„³{f}(s)=Ο†(s)=∫0∞xsβˆ’1f(x)dx=βˆ«π‘+Γ—f(x)xsdxx. Notice that dx/x is a Haar measure on the multiplicative group 𝐑+Γ— and x↦xs is a (in general non-unitary) multiplicative character. The inverse transform is β„³βˆ’1{Ο†}(x)=f(x)=12Ο€i∫cβˆ’i∞c+i∞xβˆ’sΟ†(s)ds. The notation implies this is a line integral taken over a vertical line in the complex plane, whose real part c need only satisfy a mild lower bound. Conditions under which this inversion is valid are given in the Mellin inversion theorem.

The transform was introduced in 1859 by Bernhard Riemann.Template:Sfn The transform is named after the Finnish mathematician Hjalmar Mellin, who developed the first rigorous account in paper published 1897 in Acta Societatis Scientiarum Fennicae.[1]

Relationship to other transforms

The two-sided Laplace transform may be defined in terms of the Mellin transform by ℬ{f}(s)=β„³{f(βˆ’ln⁡x)}(s) and conversely we can get the Mellin transform from the two-sided Laplace transform by β„³{f}(s)=ℬ{f(eβˆ’x)}(s).

The Mellin transform may be thought of as integrating using a kernel Template:Mvar with respect to the multiplicative Haar measure, dxx, which is invariant under dilation x↦ax, so that d(ax)ax=dxx; the two-sided Laplace transform integrates with respect to the additive Haar measure Template:Tmath, which is translation invariant, so that Template:Tmath.

We also may define the Fourier transform in terms of the Mellin transform and vice versa; in terms of the Mellin transform and of the two-sided Laplace transform defined above {β„±f}(βˆ’s)={ℬf}(βˆ’is)={β„³f(βˆ’ln⁡x)}(βˆ’is) . We may also reverse the process and obtain {β„³f}(s)={ℬf(eβˆ’x)}(s)={β„±f(eβˆ’x)}(βˆ’is) .

The Mellin transform also connects the Newton series or binomial transform together with the Poisson generating function, by means of the Poisson–Mellin–Newton cycle.

The Mellin transform may also be viewed as the Gelfand transform for the convolution algebra of the locally compact abelian group of positive real numbers with multiplication.

Examples

Cahen–Mellin integral

Template:AnchorThe Mellin transform of the function f(x)=eβˆ’x is Ξ“(s)=∫0∞xsβˆ’1eβˆ’xdx where Ξ“(s) is the gamma function. Ξ“(s) is a meromorphic function with simple poles at Template:Tmath.[2] Therefore, Ξ“(s) is analytic for Template:Tmath. Thus, letting c>0 and zβˆ’s on the principal branch, the inverse transform gives eβˆ’z=12Ο€i∫cβˆ’i∞c+iβˆžΞ“(s)zβˆ’sds.

This integral is known as the Cahen–Mellin integral.[3]

Polynomial functions

Since ∫0∞xadx is not convergent for any value of Template:Tmath, the Mellin transform is not defined for polynomial functions defined on the whole positive real axis. However, by defining it to be zero on different sections of the real axis, it is possible to take the Mellin transform. For example, if f(x)={xax<1,0x>1, then β„³f(s)=∫01xsβˆ’1xadx=∫01xs+aβˆ’1dx=1s+a.

Thus β„³f(s) has a simple pole at s=βˆ’a and is thus defined for Template:Tmath. Similarly, if f(x)={0x<1,xbx>1, then β„³f(s)=∫1∞xsβˆ’1xbdx=∫1∞xs+bβˆ’1dx=βˆ’1s+b. Thus β„³f(s) has a simple pole at s=βˆ’b and is thus defined for Template:Tmath.

Exponential functions

For Template:Tmath, let Template:Tmath. Then β„³f(s)=∫0∞xseβˆ’pxdxx=∫0∞(up)seβˆ’uduu=1ps∫0∞useβˆ’uduu=1psΞ“(s).

Zeta function

It is possible to use the Mellin transform to produce one of the fundamental formulas for the Riemann zeta function, Template:Tmath. Let Template:Tmath. Then β„³f(s)=∫0∞xsβˆ’11exβˆ’1dx=∫0∞xsβˆ’1eβˆ’x1βˆ’eβˆ’xdx=∫0∞xsβˆ’1βˆ‘n=1∞eβˆ’nxdx=βˆ‘n=1∞∫0∞xseβˆ’nxdxx=βˆ‘n=1∞1nsΞ“(s)=Ξ“(s)ΞΆ(s). Thus, ΞΆ(s)=1Ξ“(s)∫0∞xsβˆ’11exβˆ’1dx.

Generalized Gaussian

For Template:Tmath, let f(x)=eβˆ’xp (i.e. f is a generalized Gaussian distribution without the scaling factor.) Then β„³f(s)=∫0∞xsβˆ’1eβˆ’xpdx=∫0∞xpβˆ’1xsβˆ’peβˆ’xpdx=∫0∞xpβˆ’1(xp)(s/p)βˆ’1eβˆ’xpdx=1p∫0∞u(s/p)βˆ’1eβˆ’udu=Ξ“(s/p)p In particular, setting s=1 recovers the following form of the gamma function Ξ“(1+1p)=∫0∞eβˆ’xpdx.

Power series and Dirichlet series

Generally, assuming the necessary convergence, we can connect Dirichlet series and power series F(s)=βˆ‘n=1∞anns,f(z)=βˆ‘n=1∞anzn by this formal identity involving the Mellin transform:[4] Ξ“(s)F(s)=∫0∞xsβˆ’1f(eβˆ’x)dx

Fundamental strip

For Template:Tmath, let the open strip ⟨α,β⟩ be defined to be all sβˆˆβ„‚ such that s=Οƒ+it with Template:Tmath. The fundamental strip of β„³f(s) is defined to be the largest open strip on which it is defined. For example, for a>b the fundamental strip of f(x)={xax<1,xbx>1, is Template:Tmath. As seen by this example, the asymptotics of the function as xβ†’0+ define the left endpoint of its fundamental strip, and the asymptotics of the function as xβ†’+∞ define its right endpoint. To summarize using Big O notation, if f is O(xa) as xβ†’0+ and O(xb) as Template:Tmath, then β„³f(s) is defined in the strip Template:Tmath.Template:Sfnp

An application of this can be seen in the gamma function, Template:Tmath. Since f(x)=eβˆ’x is O(x0) as xβ†’0+ and O(xk) for all Template:Tmath, then Ξ“(s)=β„³f(s) should be defined in the strip Template:Tmath, which confirms that Ξ“(s) is analytic for Template:Tmath.

Properties

The properties in this table may be found in Template:Harvtxt and Template:Harvtxt.

Properties of the Mellin transform
Function Mellin transform Fundamental strip Comments
f(x) f~(s)={β„³f}(s)=∫0∞f(x)xsdxx Ξ±<β„œs<Ξ² Definition
xΞ½f(x) f~(s+Ξ½) Ξ±βˆ’β„œΞ½<β„œs<Ξ²βˆ’β„œΞ½
f(xΞ½) 1|Ξ½|f~(sΞ½) Ξ±<Ξ½βˆ’1β„œs<Ξ² Ξ½βˆˆβ„,Ξ½β‰ 0
f(xβˆ’1) f~(βˆ’s) βˆ’Ξ²<β„œs<βˆ’Ξ±
xβˆ’1f(xβˆ’1) f~(1βˆ’s) 1βˆ’Ξ²<β„œs<1βˆ’Ξ± Involution
f(x)β€Ύ f~(sβ€Ύ)β€Ύ Ξ±<β„œs<Ξ² Here zβ€Ύ denotes the complex conjugate of Template:Tmath.
f(Ξ½x) Ξ½βˆ’sf~(s) Ξ±<β„œs<Ξ² Ξ½>0, Scaling
f(x)ln⁡x f~′(s) Ξ±<β„œs<Ξ²
f′(x) βˆ’(sβˆ’1)f~(sβˆ’1) Ξ±+1<β„œs<Ξ²+1 The domain shift is conditional and requires evaluation against specific convergence behavior.
(ddx)nf(x) (βˆ’1)nΞ“(s)Ξ“(sβˆ’n)f~(sβˆ’n) Ξ±+n<β„œs<Ξ²+n
xf′(x) βˆ’sf~(s) Ξ±<β„œs<Ξ²
(xddx)nf(x) (βˆ’s)nf~(s) Ξ±<β„œs<Ξ²
(ddxx)nf(x) (1βˆ’s)nf~(s) Ξ±<β„œs<Ξ²
∫0xf(y)dy βˆ’sβˆ’1f~(s+1) Ξ±βˆ’1<β„œs<min⁡(Ξ²βˆ’1,0) Valid only if the integral exists.
∫x∞f(y)dy sβˆ’1f~(s+1) max⁡(Ξ±βˆ’1,0)<β„œs<Ξ²βˆ’1 Valid only if the integral exists.
∫0∞f1(xy)f2(y)dyy f~1(s)f~2(s) max⁡(Ξ±1,Ξ±2)<β„œs<min⁡(Ξ²1,Ξ²2) Multiplicative convolution
xμ∫0∞yνf1(xy)f2(y)dy f~1(s+μ)f~2(s+μ+ν+1) Multiplicative convolution (generalized)
xμ∫0∞yΞ½f1(xy)f2(y)dy f~1(s+ΞΌ)f~2(1βˆ’sβˆ’ΞΌ+Ξ½) Multiplicative convolution (generalized)
f1(x)f2(x) 12Ο€i∫cβˆ’i∞c+i∞f~1(r)f~2(sβˆ’r)dr Ξ±2+c<β„œs<Ξ²2+cΞ±1<c<Ξ²1 Multiplication. Only valid if integral exists. See Parseval's theorem below for conditions which ensure the existence of the integral.

Parseval's theorem and Plancherel's theorem

Let f1(x) and f2(x) be functions with well-defined Mellin transforms f~1,2(s)=β„³{f1,2}(s) in the fundamental strips Template:Tmath. Let cβˆˆβ„ with Template:Tmath. If the functions xcβˆ’1/2f1(x) and x1/2βˆ’cf2(x) are also square-integrable over the interval Template:Tmath, then Parseval's formula holds: [5] ∫0∞f1(x)f2(x)dx=12Ο€i∫cβˆ’i∞c+i∞f1~(s)f2~(1βˆ’s)ds The integration on the right hand side is done along the vertical line β„œr=c that lies entirely within the overlap of the (suitable transformed) fundamental strips.

We can replace f2(x) by Template:Tmath. This gives following alternative form of the theorem: Let f1(x) and f2(x) be functions with well-defined Mellin transforms f~1,2(s)=β„³{f1,2}(s) in the fundamental strips Template:Tmath. Let cβˆˆβ„ with Ξ±1<c<Ξ²1 and choose s0βˆˆβ„‚ with Template:Tmath. If the functions xcβˆ’1/2f1(x) and xs0βˆ’cβˆ’1/2f2(x) are also square-integrable over the interval (0,∞), then we have[5] ∫0∞f1(x)f2(x)xs0βˆ’1dx=12Ο€i∫cβˆ’i∞c+i∞f1~(s)f2~(s0βˆ’s)ds We can replace f2(x) by Template:Tmath. This gives following theorem: Let f(x) be a function with well-defined Mellin transform f~(s)=β„³{f}(s) in the fundamental strip Template:Tmath. Let cβˆˆβ„ with Template:Tmath. If the function xcβˆ’1/2f(x) is also square-integrable over the interval Template:Tmath, then Plancherel's theorem holds:[6] ∫0∞|f(x)|2x2cβˆ’1dx=12Ο€βˆ«βˆ’βˆžβˆž|f~(c+it)|2dt

As an isometry on L2 spaces

In the study of Hilbert spaces, the Mellin transform is often posed in a slightly different way. For functions in L2(0,∞) (see [[Lp space|LTemplate:Sup space]]) the fundamental strip always includes Template:Tmath, so we may define a linear operator β„³~ as β„³~:L2(0,∞)β†’L2(βˆ’βˆž,∞), {β„³~f}(s):=12Ο€βˆ«0∞xβˆ’12+isf(x)dx. In other words, we have set {β„³~f}(s):=12Ο€{β„³f}(12+is). This operator is usually denoted by just plain β„³ and called the "Mellin transform", but β„³~ is used here to distinguish from the definition used elsewhere in this article. The Mellin inversion theorem then shows that β„³~ is invertible with inverse β„³~βˆ’1:L2(βˆ’βˆž,∞)β†’L2(0,∞), {β„³~βˆ’1Ο†}(x)=12Ο€βˆ«βˆ’βˆžβˆžxβˆ’12βˆ’isΟ†(s)ds. Furthermore, this operator is an isometry, that is to say β€–β„³~fβ€–L2(βˆ’βˆž,∞)=β€–fβ€–L2(0,∞) for all f∈L2(0,∞) (this explains why the factor of 1/2Ο€ was used).

In probability theory

In probability theory, the Mellin transform is an essential tool in studying the distributions of products of random variables.[7] If Template:Tmath is a random variable, and Template:Tmath denotes its positive part, while Template:Tmath is its negative part, then the Mellin transform of Template:Tmath is defined as[8] β„³X(s)=∫0∞xsdFX+(x)+γ∫0∞xsdFXβˆ’(x), where Template:Tmath is a formal indeterminate with Template:Tmath. This transform exists for all Template:Tmath in some complex strip Template:Tmath, where Template:Tmath.[8]

The Mellin transform β„³X(it) of a random variable Template:Tmath uniquely determines its distribution function Template:Tmath.[8] The importance of the Mellin transform in probability theory lies in the fact that if Template:Tmath and Template:Tmath are two independent random variables, then the Mellin transform of their product is equal to the product of the Mellin transforms of Template:Tmath and Template:Tmath:[9] β„³XY(s)=β„³X(s)β„³Y(s)

Problems with Laplacian in cylindrical coordinate system

In the Laplacian in cylindrical coordinates in a generic dimension (orthogonal coordinates with one angle and one radius, and the remaining lengths) there is always a term: 1rβˆ‚βˆ‚r(rβˆ‚fβˆ‚r)=frr+frr

For example, in 2-D polar coordinates the Laplacian is: βˆ‡2f=1rβˆ‚βˆ‚r(rβˆ‚fβˆ‚r)+1r2βˆ‚2fβˆ‚ΞΈ2 and in 3-D cylindrical coordinates the Laplacian is, βˆ‡2f=1rβˆ‚βˆ‚r(rβˆ‚fβˆ‚r)+1r2βˆ‚2fβˆ‚Ο†2+βˆ‚2fβˆ‚z2.

This term can be treated with the Mellin transform,[10] since: ℳ(r2frr+rfr,r→s)=s2ℳ(f,r→s)=s2F

For example, the 2-D Laplace equation in polar coordinates is the PDE in two variables: r2frr+rfr+fΞΈΞΈ=0 and by multiplication: 1rβˆ‚βˆ‚r(rβˆ‚fβˆ‚r)+1r2βˆ‚2fβˆ‚ΞΈ2=0 with a Mellin transform on radius becomes the simple harmonic oscillator: FΞΈΞΈ+s2F=0 with general solution: F(s,ΞΈ)=C1(s)cos⁡(sΞΈ)+C2(s)sin⁡(sΞΈ)

Now let's impose for example some simple wedge boundary conditions to the original Laplace equation: f(r,βˆ’ΞΈ0)=a(r),f(r,ΞΈ0)=b(r) these are particularly simple for Mellin transform, becoming: F(s,βˆ’ΞΈ0)=A(s),F(s,ΞΈ0)=B(s)

These conditions imposed to the solution particularize it to: F(s,ΞΈ)=A(s)sin⁡(s(ΞΈ0βˆ’ΞΈ))sin⁡(2ΞΈ0s)+B(s)sin⁡(s(ΞΈ0+ΞΈ))sin⁡(2ΞΈ0s)

Now by the convolution theorem for Mellin transform, the solution in the Mellin domain can be inverted: f(r,ΞΈ)=rmcos⁡(mΞΈ)2ΞΈ0∫0∞(a(x)x2m+2rmxmsin⁡(mΞΈ)+r2m+b(x)x2mβˆ’2rmxmsin⁡(mΞΈ)+r2m)xmβˆ’1dx where the following inverse transform relation was employed: β„³βˆ’1(sin⁡(sΟ†)sin⁡(2ΞΈ0s);sβ†’r)=12ΞΈ0rmsin⁡(mΟ†)1+2rmcos⁡(mΟ†)+r2m where m=Ο€2ΞΈ0.

Applications

The Mellin transform is widely used in computer science for the analysis of algorithms[11] because of its scale invariance property. The magnitude of the Mellin Transform of a scaled function is identical to the magnitude of the original function for purely imaginary inputs. This scale invariance property is analogous to the Fourier Transform's shift invariance property. The magnitude of a Fourier transform of a time-shifted function is identical to the magnitude of the Fourier transform of the original function.

This property is useful in image recognition. An image of an object is easily scaled when the object is moved towards or away from the camera.

In quantum mechanics and especially quantum field theory, Fourier space is enormously useful and used extensively because momentum and position are Fourier transforms of each other (for instance, Feynman diagrams are much more easily computed in momentum space). In 2011, A. Liam Fitzpatrick, Jared Kaplan, JoΓ£o Penedones, Suvrat Raju, and Balt C. van Rees showed that Mellin space serves an analogous role in the context of the AdS/CFT correspondence.[12][13][14]

Examples

Table of selected Mellin transforms

Below is a list of interesting examples for the Mellin transform:

Selected Mellin transformsTemplate:Sfnmp
Function f(x) Mellin transform f~(s)=β„³{f}(s) Region of convergence Comment
eβˆ’x Ξ“(s) 0<β„œs<∞
eβˆ’xβˆ’1 Ξ“(s) βˆ’1<β„œs<0
eβˆ’xβˆ’1+x Ξ“(s) βˆ’2<β„œs<βˆ’1 Generally Ξ“(s) is the Mellin transform of[15] Template:Tmath, Template:Nowrap
eβˆ’x2 12Ξ“(12s) 0<β„œs<∞
erfc(x) Ξ“(12(1+s))Ο€s 0<β„œs<∞
eβˆ’(ln⁡x)2 Ο€e14s2 βˆ’βˆž<β„œs<∞
Ξ΄(xβˆ’a) asβˆ’1 βˆ’βˆž<β„œs<∞ a>0,Ξ΄(x) is the Dirac delta function
u(1βˆ’x)={1if0<x<10if1<x<∞ 1s 0<β„œs<∞ u(x) is the Heaviside step function
βˆ’u(xβˆ’1)={0if0<x<1βˆ’1if1<x<∞ 1s βˆ’βˆž<β„œs<0
u(1βˆ’x)xa={xaif0<x<10if1<x<∞ 1s+a βˆ’β„œa<β„œs<∞
βˆ’u(xβˆ’1)xa={0if0<x<1βˆ’xaif1<x<∞ 1s+a βˆ’βˆž<β„œs<βˆ’β„œa
u(1βˆ’x)xaln⁡x={xaln⁡xif0<x<10if1<x<∞ 1(s+a)2 βˆ’β„œa<β„œs<∞
βˆ’u(xβˆ’1)xaln⁡x={0if0<x<1βˆ’xaln⁡xif1<x<∞ 1(s+a)2 βˆ’βˆž<β„œs<βˆ’β„œa
11+x Ο€sin⁡(Ο€s) 0<β„œs<1
11βˆ’x Ο€tan⁡(Ο€s) 0<β„œs<1 The integral uses the Cauchy principal value.
11+x2 Ο€2sin⁡(12Ο€s) 0<β„œs<2
1(1+x)a Ξ“(s)Ξ“(aβˆ’s)Ξ“(a) 0<β„œs<β„œa Binomial series
u(1βˆ’x)(1βˆ’x)aβˆ’1 Ξ“(s)Ξ“(a)Ξ“(s+a) 0<β„œs<∞ β„œa>0
u(xβˆ’1)(1βˆ’x)βˆ’a Ξ“(aβˆ’s)Ξ“(1βˆ’a)Ξ“(1βˆ’s) βˆ’βˆž<β„œs<β„œa β„œa<1
ln⁡(1+x) Ο€ssin⁡(Ο€s) βˆ’1<β„œs<0
ln⁡|1βˆ’x| Ο€scot⁡(Ο€s) βˆ’1<β„œs<0
acot⁡x=Ο€2βˆ’atan⁡x Ο€2scos⁡(Ο€s/2) 0<β„œs<1
sin⁡(x) sin⁡(12Ο€s)Ξ“(s) βˆ’1<β„œs<1
cos⁡(x) cos⁡(12Ο€s)Ξ“(s) 0<β„œs<1
eix eiΟ€s/2Ξ“(s) 0<β„œs<1
J0(x) 2sβˆ’1Ο€sin⁡(Ο€s/2)[Ξ“(s/2)]2 0<β„œs<32 J0(x) is the Bessel function of the first kind.
Y0(x) βˆ’2sβˆ’1Ο€cos⁡(Ο€s/2)[Ξ“(s/2)]2 0<β„œs<32 Y0(x) is the Bessel function of the second kind
K0(x) 2sβˆ’2[Ξ“(s/2)]2 0<β„œs<∞ K0(x) is the modified Bessel function of the second kind

See also

Notes

Template:Reflist

References

Template:Refbegin

Template:Refend

  1. ↑ Template:Cite journal
  2. ↑ Template:Cite book
  3. ↑ Template:Cite journal (See notes therein for further references to Cahen's and Mellin's work, including Cahen's thesis.)
  4. ↑ Template:Cite journal
  5. ↑ 5.0 5.1 Template:Harvtxt.
  6. ↑ Template:Harvtxt.
  7. ↑ Template:Harvtxt
  8. ↑ 8.0 8.1 8.2 Template:Harvtxt
  9. ↑ Template:Harvtxt
  10. ↑ Bhimsen, Shivamoggi, Chapter 6: The Mellin Transform, par. 4.3: Distribution of a Potential in a Wedge, pp. 267–268
  11. ↑ Philippe Flajolet and Robert Sedgewick. The Average Case Analysis of Algorithms: Mellin Transform Asymptotics. Research Report 2956. 93 pages. Institut National de Recherche en Informatique et en Automatique (INRIA), 1996.
  12. ↑ A. Liam Fitzpatrick, Jared Kaplan, Joao Penedones, Suvrat Raju, Balt C. van Rees. "A Natural Language for AdS/CFT Correlators".
  13. ↑ A. Liam Fitzpatrick, Jared Kaplan. "Unitarity and the Holographic S-Matrix"
  14. ↑ A. Liam Fitzpatrick. "AdS/CFT and the Holographic S-Matrix", video lecture.
  15. ↑ Template:Cite book