Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Multiplication theorem

From Wikipedia, the free encyclopedia
Identity obeyed by many special functions related to the gamma function
This article is about the identity obeyed by special functions related to the gamma function. For the multiplication rule in probability theory, seeIndependence (probability theory).
This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Multiplication theorem" – news ·newspapers ·books ·scholar ·JSTOR
(February 2021) (Learn how and when to remove this message)

Inmathematics, themultiplication theorem is a certain type of identity obeyed by manyspecial functions related to thegamma function. For the explicit case of the gamma function, the identity is a product of values; thus the name. The various relations all stem from the same underlying principle; that is, the relation for one special function can be derived from that for the others, and is simply a manifestation of the same identity in different guises.

Finite characteristic

[edit]

The multiplication theorem takes two common forms. In the first case, a finite number of terms are added or multiplied to give the relation. In the second case, an infinite number of terms are added or multiplied. The finite form typically occurs only for the gamma and related functions, for which the identity follows from ap-adic relation over afinite field. For example, the multiplication theorem for the gamma function follows from theChowla–Selberg formula, which follows from the theory ofcomplex multiplication. The infinite sums are much more common, and follow fromcharacteristic zero relations on the hypergeometric series.

The following tabulates the various appearances of the multiplication theorem for finite characteristic; the characteristic zero relations are given further down. In all cases,n andk are non-negative integers. For the special case ofn = 2, the theorem is commonly referred to as theduplication formula.

Gamma function–Legendre formula

[edit]

The duplication formula and the multiplication theorem for thegamma function are the prototypical examples. The duplication formula for the gamma function is

Γ(z)Γ(z+12)=212zπΓ(2z).{\displaystyle \Gamma (z)\;\Gamma \left(z+{\frac {1}{2}}\right)=2^{1-2z}\;{\sqrt {\pi }}\;\Gamma (2z).}

It is also called theLegendre duplication formula[1] orLegendre relation, in honor ofAdrien-Marie Legendre. The multiplication theorem is

Γ(z)Γ(z+1k)Γ(z+2k)Γ(z+k1k)=(2π)k12k12kz2Γ(kz){\displaystyle \Gamma (z)\;\Gamma \left(z+{\frac {1}{k}}\right)\;\Gamma \left(z+{\frac {2}{k}}\right)\cdots \Gamma \left(z+{\frac {k-1}{k}}\right)=(2\pi )^{\frac {k-1}{2}}\;k^{\frac {1-2kz}{2}}\;\Gamma (kz)}

for integerk ≥ 1, and is sometimes calledGauss's multiplication formula, in honour ofCarl Friedrich Gauss. The multiplication theorem for the gamma functions can be understood to be a special case, for the trivialDirichlet character, of theChowla–Selberg formula.

Sine function

[edit]

Formally similar duplication formulas hold for the sine function, which are rather simple consequences of thetrigonometric identities. Here one has the duplication formula

sin(πx)sin(π(x+12))=12sin(2πx){\displaystyle \sin(\pi x)\sin \left(\pi \left(x+{\frac {1}{2}}\right)\right)={\frac {1}{2}}\sin(2\pi x)}

and, more generally, for any integerk, one has

sin(πx)sin(π(x+1k))sin(π(x+k1k))=21ksin(kπx){\displaystyle \sin(\pi x)\sin \left(\pi \left(x+{\frac {1}{k}}\right)\right)\cdots \sin \left(\pi \left(x+{\frac {k-1}{k}}\right)\right)=2^{1-k}\sin(k\pi x)}

Polygamma function, harmonic numbers

[edit]

Thepolygamma function is thelogarithmic derivative of the gamma function, and thus, the multiplication theorem becomes additive, instead of multiplicative:

kmψ(m1)(kz)=n=0k1ψ(m1)(z+nk){\displaystyle k^{m}\psi ^{(m-1)}(kz)=\sum _{n=0}^{k-1}\psi ^{(m-1)}\left(z+{\frac {n}{k}}\right)}

form>1{\displaystyle m>1}, and, form=1{\displaystyle m=1}, one has thedigamma function:

k[ψ(kz)log(k)]=n=0k1ψ(z+nk).{\displaystyle k\left[\psi (kz)-\log(k)\right]=\sum _{n=0}^{k-1}\psi \left(z+{\frac {n}{k}}\right).}

The polygamma identities can be used to obtain a multiplication theorem forharmonic numbers.

Hurwitz zeta function

[edit]

TheHurwitz zeta function generalizes the polygamma function to non-integer orders, and thus obeys a very similar multiplication theorem:

ksζ(s)=n=1kζ(s,nk),{\displaystyle k^{s}\zeta (s)=\sum _{n=1}^{k}\zeta \left(s,{\frac {n}{k}}\right),}

whereζ(s){\displaystyle \zeta (s)} is theRiemann zeta function. This is a special case of

ksζ(s,kz)=n=0k1ζ(s,z+nk){\displaystyle k^{s}\,\zeta (s,kz)=\sum _{n=0}^{k-1}\zeta \left(s,z+{\frac {n}{k}}\right)}

and

ζ(s,kz)=n=0(s+n1n)(1k)nznζ(s+n,z).{\displaystyle \zeta (s,kz)=\sum _{n=0}^{\infty }{s+n-1 \choose n}(1-k)^{n}z^{n}\zeta (s+n,z).}

Multiplication formulas for the non-principal characters may be given in the form ofDirichlet L-functions.

Periodic zeta function

[edit]

Theperiodic zeta function[2] is sometimes defined as

F(s;q)=m=1e2πimqms=Lis(e2πiq){\displaystyle F(s;q)=\sum _{m=1}^{\infty }{\frac {e^{2\pi imq}}{m^{s}}}=\operatorname {Li} _{s}\left(e^{2\pi iq}\right)}

where Lis(z) is thepolylogarithm. It obeys the duplication formula

21sF(s;q)=F(s,q2)+F(s,q+12).{\displaystyle 2^{1-s}F(s;q)=F\left(s,{\frac {q}{2}}\right)+F\left(s,{\frac {q+1}{2}}\right).}

As such, it is an eigenvector of theBernoulli operator with eigenvalue 21−s. The multiplication theorem is

k1sF(s;kq)=n=0k1F(s,q+nk).{\displaystyle k^{1-s}F(s;kq)=\sum _{n=0}^{k-1}F\left(s,q+{\frac {n}{k}}\right).}

The periodic zeta function occurs in the reflection formula for the Hurwitz zeta function, which is why the relation that it obeys, and the Hurwitz zeta relation, differ by the interchange of s → 1−s.

TheBernoulli polynomials may be obtained as a limiting case of the periodic zeta function, takings to be an integer, and thus the multiplication theorem there can be derived from the above. Similarly, substituting q = log z leads to the multiplication theorem for the polylogarithm.

Polylogarithm

[edit]

The duplication formula takes the form

21sLis(z2)=Lis(z)+Lis(z).{\displaystyle 2^{1-s}\operatorname {Li} _{s}(z^{2})=\operatorname {Li} _{s}(z)+\operatorname {Li} _{s}(-z).}

The general multiplication formula is in the form of aGauss sum ordiscrete Fourier transform:

k1sLis(zk)=n=0k1Lis(zei2πn/k).{\displaystyle k^{1-s}\operatorname {Li} _{s}(z^{k})=\sum _{n=0}^{k-1}\operatorname {Li} _{s}\left(ze^{i2\pi n/k}\right).}

These identities follow from that on the periodic zeta function, taking z = log q.

Kummer's function

[edit]

The duplication formula forKummer's function is

21nΛn(z2)=Λn(z)+Λn(z){\displaystyle 2^{1-n}\Lambda _{n}(-z^{2})=\Lambda _{n}(z)+\Lambda _{n}(-z)}

and thus resembles that for the polylogarithm, but twisted by i.

Bernoulli polynomials

[edit]

For theBernoulli polynomials, the multiplication theorems were given byJoseph Ludwig Raabe in 1851:

k1mBm(kx)=n=0k1Bm(x+nk){\displaystyle k^{1-m}B_{m}(kx)=\sum _{n=0}^{k-1}B_{m}\left(x+{\frac {n}{k}}\right)}

and for theEuler polynomials,

kmEm(kx)=n=0k1(1)nEm(x+nk) for k=1,3,{\displaystyle k^{-m}E_{m}(kx)=\sum _{n=0}^{k-1}(-1)^{n}E_{m}\left(x+{\frac {n}{k}}\right)\quad {\mbox{ for }}k=1,3,\dots }

and

kmEm(kx)=2m+1n=0k1(1)nBm+1(x+nk) for k=2,4,.{\displaystyle k^{-m}E_{m}(kx)={\frac {-2}{m+1}}\sum _{n=0}^{k-1}(-1)^{n}B_{m+1}\left(x+{\frac {n}{k}}\right)\quad {\mbox{ for }}k=2,4,\dots .}

The Bernoulli polynomials may be obtained as a special case of the Hurwitz zeta function, and thus the identities follow from there.

Bernoulli map

[edit]

TheBernoulli map is a certain simple model of adissipativedynamical system, describing the effect of ashift operator on an infinite string of coin-flips (theCantor set). The Bernoulli map is a one-sided version of the closely relatedBaker's map. The Bernoulli map generalizes to ak-adic version, which acts on infinite strings ofk symbols: this is theBernoulli scheme. Thetransfer operatorLk{\displaystyle {\mathcal {L}}_{k}} corresponding to the shift operator on the Bernoulli scheme is given by

[Lkf](x)=1kn=0k1f(x+nk){\displaystyle [{\mathcal {L}}_{k}f](x)={\frac {1}{k}}\sum _{n=0}^{k-1}f\left({\frac {x+n}{k}}\right)}

Perhaps not surprisingly, theeigenvectors of this operator are given by the Bernoulli polynomials. That is, one has that

LkBm=1kmBm{\displaystyle {\mathcal {L}}_{k}B_{m}={\frac {1}{k^{m}}}B_{m}}

It is the fact that the eigenvalueskm<1{\displaystyle k^{-m}<1} that marks this as adissipative system: for a non-dissipativemeasure-preserving dynamical system, the eigenvalues of the transfer operator lie on theunit circle.

One may construct a function obeying the multiplication theorem from anytotally multiplicative function. Letf(n){\displaystyle f(n)} be totally multiplicative; that is,f(mn)=f(m)f(n){\displaystyle f(mn)=f(m)f(n)} for any integersm,n. Define itsFourier series as

g(x)=n=1f(n)exp(2πinx){\displaystyle g(x)=\sum _{n=1}^{\infty }f(n)\exp(2\pi inx)}

Assuming that the sum converges, so thatg(x) exists, one then has that it obeys the multiplication theorem; that is, that

1kn=0k1g(x+nk)=f(k)g(x){\displaystyle {\frac {1}{k}}\sum _{n=0}^{k-1}g\left({\frac {x+n}{k}}\right)=f(k)g(x)}

That is,g(x) is an eigenfunction of Bernoulli transfer operator, with eigenvaluef(k). The multiplication theorem for the Bernoulli polynomials then follows as a special case of the multiplicative functionf(n)=ns{\displaystyle f(n)=n^{-s}}. TheDirichlet characters are fully multiplicative, and thus can be readily used to obtain additional identities of this form.

Characteristic zero

[edit]

The multiplication theorem over a field ofcharacteristic zero does not close after a finite number of terms, but requires aninfinite series to be expressed. Examples include that for theBessel functionJν(z){\displaystyle J_{\nu }(z)}:

λνJν(λz)=n=01n!((1λ2)z2)nJν+n(z),{\displaystyle \lambda ^{-\nu }J_{\nu }(\lambda z)=\sum _{n=0}^{\infty }{\frac {1}{n!}}\left({\frac {(1-\lambda ^{2})z}{2}}\right)^{n}J_{\nu +n}(z),}

whereλ{\displaystyle \lambda } andν{\displaystyle \nu } may be taken as arbitrary complex numbers. Such characteristic-zero identities follow generally from one of many possible identities on the hypergeometric series.

Notes

[edit]
  1. ^Weisstein, Eric W."Legendre Duplication Formula".MathWorld.
  2. ^Apostol,Introduction to analytic number theory, Springer

References

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Multiplication_theorem&oldid=1291535544"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp