Mellin transform

From The Right Wiki
Jump to navigationJump to search

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 closely related to the Laplace transform and the Fourier transform, and the theory of the gamma function and allied special functions. The Mellin transform of a complex-valued function f defined on R+×=(0,) is the function f of complex variable s given (where it exists, see Fundamental strip below) by {f}(s)=φ(s)=0xs1f(x)dx=R+×f(x)xsdxx. Notice that dx/x is a Haar measure on the multiplicative group R+× and xxs is a (in general non-unitary) multiplicative character. The inverse transform is {1φ}(x)=f(x)=12πicic+ixsφ(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 is named after the Finnish mathematician Hjalmar Mellin, who introduced it in a paper published 1897 in Acta Societatis Scientiarum Fennicæ.[1]

Relationship to other transforms

The two-sided Laplace transform may be defined in terms of the Mellin transform by {f}(s)={f(lnx)}(s) and conversely we can get the Mellin transform from the two-sided Laplace transform by {f}(s)={f(ex)}(s). The Mellin transform may be thought of as integrating using a kernel xs with respect to the multiplicative Haar measure, dxx, which is invariant under dilation xax, so that d(ax)ax=dxx; the two-sided Laplace transform integrates with respect to the additive Haar measure dx, which is translation invariant, so that d(x+a)=dx. 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(lnx)}(is). We may also reverse the process and obtain {f}(s)={f(ex)}(s)={f(ex)}(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

The Mellin transform of the function f(x)=ex is Γ(s)=0xs1exdx where Γ(s) is the gamma function. Γ(s) is a meromorphic function with simple poles at z=0,1,2,.[2] Therefore, Γ(s) is analytic for (s)>0. Thus, letting c>0 and zs on the principal branch, the inverse transform gives ez=12πicic+iΓ(s)zsds. This integral is known as the Cahen–Mellin integral.[3]

Polynomial functions

Since 0xadx is not convergent for any value of a, 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)=01xs1xadx=01xs+a1dx=1s+a. Thus f(s) has a simple pole at s=a and is thus defined for (s)>a. Similarly, if f(x)={0x<1,xbx>1, then f(s)=1xs1xbdx=1xs+b1dx=1s+b. Thus f(s) has a simple pole at s=b and is thus defined for (s)<b.

Exponential functions

For p>0, let f(x)=epx. Then f(s)=0xsepxdxx=0(up)seuduu=1ps0useuduu=1psΓ(s).

Zeta function

It is possible to use the Mellin transform to produce one of the fundamental formulas for the Riemann zeta function, ζ(s). Let f(x)=1ex1. Then f(s)=0xs11ex1dx=0xs1ex1exdx=0xs1n=1enxdx=n=10xsenxdxx=n=11nsΓ(s)=Γ(s)ζ(s). Thus, ζ(s)=1Γ(s)0xs11ex1dx.

Generalized Gaussian

For p>0, let f(x)=exp (i.e. f is a generalized Gaussian distribution without the scaling factor.) Then f(s)=0xs1expdx=0xp1xspexpdx=0xp1(xp)s/p1expdx=1p0us/p1eudu=Γ(s/p)p. In particular, setting s=1 recovers the following form of the gamma function Γ(1+1p)=0expdx.

Power series and Dirichlet series

Generally, assuming necessary convergence, we can connect Dirichlet series and related power series F(s)=n=1anns,f(z)=n=1anzn by the formal identity involving Mellin transform:[4] Γ(s)F(s)=0xs1f(ex)dx

Fundamental strip

For α,β, let the open strip α,β be defined to be all s such that s=σ+it with α<σ<β. 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 a,b. As seen by this example, the asymptotics of the function as x0+ 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 x0+ and O(xb) as x+, then f(s) is defined in the strip a,b.[5] An application of this can be seen in the gamma function, Γ(s). Since f(x)=ex is O(x0) as x0+ and O(xk) for all k, then Γ(s)=f(s) should be defined in the strip 0,+, which confirms that Γ(s) is analytic for (s)>0.

Properties

The properties in this table may be found in Bracewell (2000) and Erdélyi (1954).

Properties of the Mellin transform
Function Mellin transform Fundamental strip Comments
f(x) f~(s)={f}(s)=0f(x)xsdxx α<s<β Definition
xνf(x) f~(s+ν) αν<s<βν
f(xν) 1|ν|f~(sν) α<ν1s<β ν,ν0
f(x1) f~(s) β<s<α
x1f(x1) f~(1s) 1β<s<1α Involution
f(x) f~(s) α<s<β Here z denotes the complex conjugate of z.
f(νx) νsf~(s) α<s<β ν>0, Scaling
f(x)lnx f~(s) α<s<β
f(x) (s1)f~(s1) α+1<s<β+1 The domain shift is conditional and requires evaluation against specific convergence behavior.
(ddx)nf(x) (1)nΓ(s)Γ(sn)f~(sn) α+n<s<β+n
xf(x) sf~(s) α<s<β
(xddx)nf(x) (s)nf~(s) α<s<β
(ddxx)nf(x) (1s)nf~(s) α<s<β
0xf(y)dy s1f~(s+1) α1<s<min(β1,0) Valid only if the integral exists.
xf(y)dy s1f~(s+1) max(α1,0)<s<β1 Valid only if the integral exists.
0f1(xy)f2(y)dyy f~1(s)f~2(s) max(α1,α2)<s<min(β1,β2) Multiplicative convolution
xμ0yνf1(xy)f2(y)dy f~1(s+μ)f~2(s+μ+ν+1) Multiplicative convolution (generalized)
xμ0yνf1(xy)f2(y)dy f~1(s+μ)f~2(1sμ+ν) Multiplicative convolution (generalized)
f1(x)f2(x) 12πicic+if~1(r)f~2(sr)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 α1,2<s<β1,2. Let c with max(α1,1β2)<c<min(β1,1α2). If the functions xc1/2f1(x) and x1/2cf2(x) are also square-integrable over the interval (0,), then Parseval's formula holds: [6] 0f1(x)f2(x)dx=12πicic+if1~(s)f2~(1s)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 f2(x)xs01. 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 α1,2<s<β1,2. Let c with α1<c<β1 and choose s0 with α2<s0c<β2. If the functions xc1/2f1(x) and xs0c1/2f2(x) are also square-integrable over the interval (0,), then we have [6] 0f1(x)f2(x)xs01dx=12πicic+if1~(s)f2~(s0s)ds We can replace f2(x) by f1(x). This gives following theorem: Let f(x) be a function with well-defined Mellin transform f~(s)={f}(s) in the fundamental strip α<s<β. Let c with α<c<β. If the function xc1/2f(x) is also square-integrable over the interval (0,), then Plancherel's theorem holds:[7] 0|f(x)|2x2c1dx=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) the fundamental strip always includes 12+i, so we may define a linear operator ~ as ~:L2(0,)L2(,), {~f}(s):=12π0x12+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πx12isφ(s)ds. Furthermore, this operator is an isometry, that is to say ~fL2(,)=fL2(0,) for all fL2(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.[8] If X is a random variable, and X+ = max{X,0} denotes its positive part, while X − = max{−X,0} is its negative part, then the Mellin transform of X is defined as[9] X(s)=0xsdFX+(x)+γ0xsdFX(x), where γ is a formal indeterminate with γ2 = 1. This transform exists for all s in some complex strip D = {s : a ≤ Re(s) ≤ b} , where a ≤ 0 ≤ b.[9] The Mellin transform X(it) of a random variable X uniquely determines its distribution function FX.[9] The importance of the Mellin transform in probability theory lies in the fact that if X and Y are two independent random variables, then the Mellin transform of their product is equal to the product of the Mellin transforms of X and Y:[10] 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: 1rr(rfr)=frr+frr For example, in 2-D polar coordinates the Laplacian is: 2f=1rr(rfr)+1r22fθ2 and in 3-D cylindrical coordinates the Laplacian is, 2f=1rr(rfr)+1r22fφ2+2fz2. This term can be treated with the Mellin transform,[11] since: (r2frr+rfr,rs)=s2(f,rs)=s2F For example, the 2-D Laplace equation in polar coordinates is the PDE in two variables: r2frr+rfr+fθθ=0 and by multiplication: 1rr(rfr)+1r22fθ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θ00(a(x)x2m+2rmxmsin(mθ)+r2m+b(x)x2m2rmxmsin(mθ)+r2m)xm1dx where the following inverse transform relation was employed: 1(sin(sφ)sin(2θ0s);sr)=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[12] 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.[13][14][15]

Examples

Table of selected Mellin transforms

Following list of interesting examples for the Mellin transform can be found in Bracewell (2000) and Erdélyi (1954):

Selected Mellin transforms
Function f(x) Mellin transform f~(s)={f}(s) Region of convergence Comment
ex Γ(s) 0<s<
ex1 Γ(s) 1<s<0
ex1+x Γ(s) 2<s<1 And generally Γ(s) is the Mellin transform of[16] exn=0N1(1)nn!xn, for N<s<N+1
ex2 12Γ(12s) 0<s<
erfc(x) Γ(12(1+s))πs 0<s<
e(lnx)2 πe14s2 <s<
δ(xa) as1 <s< a>0,δ(x) is the Dirac delta function.
u(1x)={1if0<x<10if1<x< 1s 0<s< u(x) is the Heaviside step function
u(x1)={0if0<x<11if1<x< 1s <s<0
u(1x)xa={xaif0<x<10if1<x< 1s+a a<s<
u(x1)xa={0if0<x<1xaif1<x< 1s+a <s<a
u(1x)xalnx={xalnxif0<x<10if1<x< 1(s+a)2 a<s<
u(x1)xalnx={0if0<x<1xalnxif1<x< 1(s+a)2 <s<a
11+x πsin(πs) 0<s<1
11x πtan(πs) 0<s<1
11+x2 π2sin(12πs) 0<s<2
ln(1+x) πssin(πs) 1<s<0
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) 2s1πsin(πs/2)[Γ(s/2)]2 0<s<32 J0(x) is the Bessel function of the first kind.
Y0(x) 2s1πcos(πs/2)[Γ(s/2)]2 0<s<32 Y0(x) is the Bessel function of the second kind
K0(x) 2s2[Γ(s/2)]2 0<s< K0(x) is the modified Bessel function of the second kind

See also

Notes

  1. Mellin, Hj. "Zur Theorie zweier allgemeinen Klassen bestimmter Integrale". Acta Societatis Scientiarum Fennicæ. XXII, N:o 2: 1–75.
  2. Whittaker, E.T.; Watson, G.N. (1996). A Course of Modern Analysis. Cambridge University Press.
  3. Hardy, G. H.; Littlewood, J. E. (1916). "Contributions to the Theory of the Riemann Zeta-Function and the Theory of the Distribution of Primes". Acta Mathematica. 41 (1): 119–196. doi:10.1007/BF02422942. (See notes therein for further references to Cahen's and Mellin's work, including Cahen's thesis.)
  4. Wintner, Aurel (1947). "On Riemann's Reduction of Dirichlet Series to Power Series". American Journal of Mathematics. 69 (4): 769–789. doi:10.2307/2371798.
  5. Flajolet, P.; Gourdon, X.; Dumas, P. (1995). "Mellin transforms and asymptotics: Harmonic sums" (PDF). Theoretical Computer Science. 144 (1–2): 3–58. doi:10.1016/0304-3975(95)00002-e.
  6. 6.0 6.1 Titchmarsh (1948, p. 95).
  7. Titchmarsh (1948, p. 94).
  8. Galambos & Simonelli (2004, p. 15)
  9. 9.0 9.1 9.2 Galambos & Simonelli (2004, p. 16)
  10. Galambos & Simonelli (2004, p. 23)
  11. Bhimsen, Shivamoggi, Chapter 6: The Mellin Transform, par. 4.3: Distribution of a Potential in a Wedge, pp. 267–8
  12. 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.
  13. A. Liam Fitzpatrick, Jared Kaplan, Joao Penedones, Suvrat Raju, Balt C. van Rees. "A Natural Language for AdS/CFT Correlators".
  14. A. Liam Fitzpatrick, Jared Kaplan. "Unitarity and the Holographic S-Matrix"
  15. A. Liam Fitzpatrick. "AdS/CFT and the Holographic S-Matrix", video lecture.
  16. Jacqueline Bertrand, Pierre Bertrand, Jean-Philippe Ovarlez. The Mellin Transform. The Transforms and Applications Handbook, 1995, 978-1420066524. ffhal-03152634f

References

External links