Misplaced Pages

Multiplication theorem

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Legendre duplication formula) 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, see Independence (probability theory).
This article needs additional citations for verification. Please help improve this article by adding 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)

In mathematics, the multiplication theorem is a certain type of identity obeyed by many special functions related to the gamma 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

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 a p-adic relation over a finite field. For example, the multiplication theorem for the gamma function follows from the Chowla–Selberg formula, which follows from the theory of complex multiplication. The infinite sums are much more common, and follow from characteristic 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 and k are non-negative integers. For the special case of n = 2, the theorem is commonly referred to as the duplication formula.

Gamma function–Legendre formula

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

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

It is also called the Legendre duplication formula or Legendre relation, in honor of Adrien-Marie Legendre. The multiplication theorem is

Γ ( z ) Γ ( z + 1 k ) Γ ( z + 2 k ) ⋯ Γ ( z + k − 1 k ) = ( 2 π ) k − 1 2 k 1 − 2 k z 2 Γ ( k z ) {\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 integer k ≥ 1, and is sometimes called Gauss's multiplication formula, in honour of Carl Friedrich Gauss. The multiplication theorem for the gamma functions can be understood to be a special case, for the trivial Dirichlet character, of the Chowla–Selberg formula.

Sine function

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

sin ⁡ ( π x ) sin ⁡ ( π ( x + 1 2 ) ) = 1 2 sin ⁡ ( 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 integer k, one has

sin ⁡ ( π x ) sin ⁡ ( π ( x + 1 k ) ) ⋯ sin ⁡ ( π ( x + k − 1 k ) ) = 2 1 − k sin ⁡ ( 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

The polygamma function is the logarithmic derivative of the gamma function, and thus, the multiplication theorem becomes additive, instead of multiplicative:

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

for m > 1 {\displaystyle m>1} , and, for m = 1 {\displaystyle m=1} , one has the digamma function:

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

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

Hurwitz zeta function

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

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

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

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

and

ζ ( s , k z ) = ∑ n = 0 ∞ ( s + n − 1 n ) ( 1 − k ) n z n ζ ( 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 of Dirichlet L-functions.

Periodic zeta function

The periodic zeta function is sometimes defined as

F ( s ; q ) = ∑ m = 1 ∞ e 2 π i m q m s = Li s ⁡ ( e 2 π i q ) {\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 the polylogarithm. It obeys the duplication formula

2 1 − s F ( s ; q ) = F ( s , q 2 ) + F ( s , q + 1 2 ) . {\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 the Bernoulli operator with eigenvalue 2. The multiplication theorem is

k 1 − s F ( s ; k q ) = ∑ n = 0 k − 1 F ( s , q + n k ) . {\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.

The Bernoulli polynomials may be obtained as a limiting case of the periodic zeta function, taking s 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

The duplication formula takes the form

2 1 − s Li s ⁡ ( z 2 ) = Li s ⁡ ( z ) + Li s ⁡ ( − 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 a Gauss sum or discrete Fourier transform:

k 1 − s Li s ⁡ ( z k ) = ∑ n = 0 k − 1 Li s ⁡ ( z e i 2 π 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

The duplication formula for Kummer's function is

2 1 − n Λ n ( − z 2 ) = Λ 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

For the Bernoulli polynomials, the multiplication theorems were given by Joseph Ludwig Raabe in 1851:

k 1 − m B m ( k x ) = ∑ n = 0 k − 1 B m ( x + n k ) {\displaystyle k^{1-m}B_{m}(kx)=\sum _{n=0}^{k-1}B_{m}\left(x+{\frac {n}{k}}\right)}

and for the Euler polynomials,

k − m E m ( k x ) = ∑ n = 0 k − 1 ( − 1 ) n E m ( x + n k )  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

k − m E m ( k x ) = − 2 m + 1 ∑ n = 0 k − 1 ( − 1 ) n B m + 1 ( x + n k )  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

The Bernoulli map is a certain simple model of a dissipative dynamical system, describing the effect of a shift operator on an infinite string of coin-flips (the Cantor set). The Bernoulli map is a one-sided version of the closely related Baker's map. The Bernoulli map generalizes to a k-adic version, which acts on infinite strings of k symbols: this is the Bernoulli scheme. The transfer operator L k {\displaystyle {\mathcal {L}}_{k}} corresponding to the shift operator on the Bernoulli scheme is given by

[ L k f ] ( x ) = 1 k ∑ n = 0 k − 1 f ( x + n k ) {\displaystyle (x)={\frac {1}{k}}\sum _{n=0}^{k-1}f\left({\frac {x+n}{k}}\right)}

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

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

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

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

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

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

1 k ∑ n = 0 k − 1 g ( x + n k ) = 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 eigenvalue f(k). The multiplication theorem for the Bernoulli polynomials then follows as a special case of the multiplicative function f ( n ) = n − s {\displaystyle f(n)=n^{-s}} . The Dirichlet characters are fully multiplicative, and thus can be readily used to obtain additional identities of this form.

Characteristic zero

The multiplication theorem over a field of characteristic zero does not close after a finite number of terms, but requires an infinite series to be expressed. Examples include that for the Bessel function J ν ( z ) {\displaystyle J_{\nu }(z)} :

λ − ν J ν ( λ z ) = ∑ n = 0 ∞ 1 n ! ( ( 1 − λ 2 ) z 2 ) n J ν + 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

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

References

Categories: