Riemann zeta function

From Wikipedia, the free encyclopedia
Jump to: navigation, search
The Riemann Zeta Function \zeta(z) represented in a rectangular region of the complex plane. It is generated as a Matplotlib plot using a version of the Domain coloring method.[1]
A view of the Riemann Zeta Function showing the pole z=1, and two zeros on the critical line.

The Riemann zeta function or Euler–Riemann zeta function, ζ(s), is a function of a complex variable s that analytically continues the sum of the infinite series \sum_{n=1}^\infty\frac{1}{n^s}, which converges when the real part of s is greater than 1. More general representations of ζ(s) for all s are given below. The Riemann zeta function plays a pivotal role in analytic number theory and has applications in physics, probability theory, and applied statistics.

This function, as a function of a real argument, was introduced and studied by Leonhard Euler in the first half of the eighteenth century without using complex analysis, which was not available at that time. Bernhard Riemann in his article "On the Number of Primes Less Than a Given Magnitude" published in 1859 extended the Euler definition to a complex variable, proved its meromorphic continuation and functional equation and established a relation between its zeros and the distribution of prime numbers.[2]

The values of the Riemann zeta function at even positive integers were computed by Euler. The first of them, ζ(2), provides a solution to the Basel problem. In 1979 Apéry proved the irrationality of ζ(3). The values at negative integer points, also found by Euler, are rational numbers and play an important role in the theory of modular forms. Many generalizations of the Riemann zeta function, such as Dirichlet series, Dirichlet L-functions and L-functions, are known.

Definition[edit]

Bernhard Riemann's article on the number of primes below a given magnitude.

The Riemann zeta function ζ(s) is a function of a complex variable s = σ + it. (The notation with s, σ, and t is traditionally used in the study of the ζ-function, following Riemann.)

The following infinite series converges for all complex numbers s with real part greater than 1, and defines ζ(s) in this case:


\zeta(s) =
\sum_{n=1}^\infty n^{-s} =
\frac{1}{1^s} + \frac{1}{2^s} + \frac{1}{3^s} + \cdots \;\;\;\;\;\;\; \sigma = \mathfrak{R}(s) > 1.
\!

It can also be defined by the integral

 \zeta(s) = \frac{1}{\Gamma(s)} \int_{0}^{\infty} \frac{x ^ {s-1}}{e ^ x - 1} \mathrm{d}x

The Riemann zeta function is defined as the analytic continuation of the function defined for σ > 1 by the sum of the preceding series.

Leonhard Euler considered the above series in 1740 for positive integer values of s, and later Chebyshev extended the definition to real s > 1.[3]

The above series is a prototypical Dirichlet series that converges absolutely to an analytic function for s such that σ > 1 and diverges for all other values of s. Riemann showed that the function defined by the series on the half-plane of convergence can be continued analytically to all complex values s ≠ 1. For s = 1 the series is the harmonic series which diverges to +∞, and

 \lim_{s\to 1}(s-1)\zeta(s)=1.

Thus the Riemann zeta function is a meromorphic function on the whole complex s-plane, which is holomorphic everywhere except for a simple pole at s = 1 with residue 1.

Specific values[edit]

Riemann zeta function for real s > 1

For any positive even integer 2n:

 \zeta(2n) = \frac{(-1)^{n+1}B_{2n}(2\pi)^{2n}}{2(2n)!}

where B2n is a Bernoulli number.

For negative integers, one has

\zeta(-n)=-\frac{B_{n+1}}{n+1}

for n ≥ 1, so in particular ζ vanishes at the negative even integers because Bm = 0 for all odd m other than 1. For odd positive integers, no such simple expression is known.

Via analytic continuation, one can show that

\zeta(-1) = -\frac{1}{12}
gives a way to assign a finite result to the divergent series 1 + 2 + 3 + 4 + · · ·, which can be useful in certain contexts such as string theory.[4]
\zeta(0) = -\frac{1}{2};\!
\zeta(1/2) \approx -1.4603545\!   (sequence A059750 in OEIS)
This is employed in calculating of kinetic boundary layer problems of linear kinetic equations.[5]
\zeta(1) = 1 + \frac{1}{2} + \frac{1}{3} + \cdots = \infty;\!
if we approach from numbers larger than 1. Then this is the harmonic series. But its principal value
 \lim_{\varepsilon \to 0} \frac{\zeta(1+\varepsilon)+\zeta(1-\varepsilon)}{2}
exists which is the Euler–Mascheroni constant \gamma = 0.5772\ldots.
\zeta(3/2) \approx 2.612;\!   (sequence A078434 in OEIS)
This is employed in calculating the critical temperature for a Bose–Einstein condensate in a box with periodic boundary conditions, and for spin wave physics in magnetic systems.
\zeta(2) = 1 + \frac{1}{2^2} + \frac{1}{3^2} + \cdots = \frac{\pi^2}{6} \approx 1.645;\!   (sequence A013661 in OEIS)
The demonstration of this equality is known as the Basel problem. The reciprocal of this sum answers the question: What is the probability that two numbers selected at random are relatively prime?[6]
\zeta(3) = 1 + \frac{1}{2^3} + \frac{1}{3^3} + \cdots \approx 1.202;\!   (sequence A002117 in OEIS)
This is called Apéry's constant.
\zeta(4) = 1 + \frac{1}{2^4} + \frac{1}{3^4} + \cdots = \frac{\pi^4}{90} \approx 1.0823;\!   (sequence A0013662 in OEIS)
This appears when integrating Planck's law to derive the Stefan–Boltzmann law in physics.

Euler product formula[edit]

The connection between the zeta function and prime numbers was discovered by Euler, who proved the identity

\sum_{n=1}^\infty\frac{1}{n^s} = \prod_{p \text{ prime}} \frac{1}{1-p^{-s}},

where, by definition, the left hand side is ζ(s) and the infinite product on the right hand side extends over all prime numbers p (such expressions are called Euler products):

\prod_{p \text{ prime}} \frac{1}{1-p^{-s}} = \frac{1}{1-2^{-s}}\cdot\frac{1}{1-3^{-s}}\cdot\frac{1}{1-5^{-s}}\cdot\frac{1}{1-7^{-s}}\cdot\frac{1}{1-11^{-s}} \cdots \frac{1}{1-p^{-s}} \cdots.

Both sides of the Euler product formula converge for Re(s) > 1. The proof of Euler's identity uses only the formula for the geometric series and the fundamental theorem of arithmetic. Since the harmonic series, obtained when s = 1, diverges, Euler's formula (which becomes \textstyle\prod_pp/(p-1)) implies that there are infinitely many primes.[7]

The Euler product formula can be used to calculate the asymptotic probability that s randomly selected integers are set-wise coprime. Intuitively, the probability that any single number is divisible by a prime (or any integer), p is 1/p. Hence the probability that s numbers are all divisible by this prime is 1/ps, and the probability that at least one of them is not is 1 − 1/ps. Now, for distinct primes, these divisibility events are mutually independent because the candidate divisors are coprime (a number is divisible by coprime divisors n and m if and only if it is divisible by nm, an event which occurs with probability 1/(nm)). Thus the asymptotic probability that s numbers are coprime is given by a product over all primes,

\prod_p^\infty \left(1-\frac{1}{p^s}\right) = \left( \prod_p^\infty \frac{1}{1-p^{-s}} \right)^{-1} = \frac{1}{\zeta(s)}.

(More work is required to derive this result formally.)[8]

The functional equation[edit]

The Riemann zeta function satisfies the functional equation (known as the Riemann functional equation or Riemann's functional equation)


\zeta(s) = 2^s\pi^{s-1}\ \sin\left(\frac{\pi s}{2}\right)\ \Gamma(1-s)\ \zeta(1-s)
\!,

where Γ(s) is the gamma function, which is an equality of meromorphic functions valid on the whole complex plane. This equation relates values of the Riemann zeta function at the points s and 1 − s. The functional equation (owing to the properties of the sine function) implies that ζ(s) has a simple zero at each even negative integer s = −2n — these are known as the trivial zeros of ζ(s). For s an even positive integer, the product sin(πs/2)Γ(1−s) is regular and the functional equation relates the values of the Riemann zeta function at odd negative integers and even positive integers.

The functional equation was established by Riemann in his 1859 paper On the Number of Primes Less Than a Given Magnitude and used to construct the analytic continuation in the first place. An equivalent relationship had been conjectured by Euler over a hundred years earlier, in 1749, for the Dirichlet eta function (alternating zeta function)


\eta(s)= \sum_{n=1}^\infty \frac{(-1)^{n+1}}{n^s} = (1-{2^{1-s}})\zeta(s).

Incidentally, this relation is interesting also because it actually exhibits ζ(s) as a Dirichlet series (of the η-function) which is convergent (albeit non-absolutely) in the larger half-plane σ > 0 (not just σ > 1), up to an elementary factor.

Riemann also found a symmetric version of the functional equation (which he assigned the letter ξ [small xi]), given by first defining

\xi(s) = \frac{1}{2}\pi^{-s/2}s(s-1)\Gamma\left(\frac{s}{2}\right)\zeta(s).\!

The functional equation is then given by

\xi(s) = \xi(1 - s).\!

(Riemann defined a similar but different function which he called ξ(t).)

Zeros, the critical line, and the Riemann hypothesis[edit]

Main article: Riemann hypothesis
Apart from the trivial zeros, the Riemann zeta function doesn't have any zero on the right of σ=1 and on the left of σ=0 (neither can the zeros lie too close to those lines). Furthermore, the non-trivial zeros are symmetric about the real axis and the line σ = 1/2 and, according to the Riemann Hypothesis, they all lie on the line σ = 1/2.
This image shows a plot of the Riemann zeta function along the critical line for real values of t running from 0 to 34. The first five zeros in the critical strip are clearly visible as the place where the spirals pass through the origin.

The functional equation shows that the Riemann zeta function has zeros at −2, −4, ... . These are called the trivial zeros. They are trivial in the sense that their existence is relatively easy to prove, for example, from sin(πs/2) being 0 in the functional equation. The non-trivial zeros have captured far more attention because their distribution not only is far less understood but, more importantly, their study yields impressive results concerning prime numbers and related objects in number theory. It is known that any non-trivial zero lies in the open strip {s ∈ C : 0 < Re(s) < 1}, which is called the critical strip. The Riemann hypothesis, considered one of the greatest unsolved problems in mathematics, asserts that any non-trivial zero s has Re(s) = 1/2. In the theory of the Riemann zeta function, the set {s ∈ C : Re(s) = 1/2} is called the critical line. For the Riemann zeta function on the critical line, see Z-function.

The Hardy–Littlewood conjectures[edit]

In 1914, Godfrey Harold Hardy proved that \zeta\bigl(\tfrac{1}{2}+it\bigr) has infinitely many zeros.

Hardy and John Edensor Littlewood formulated two conjectures on the density and distance between the zeros of \zeta\bigl(\tfrac{1}{2}+it\bigr) on intervals of large positive real numbers. In the following, N(T) is the total number of real zeros and N_0(T) the total number of zeros of odd order of the function \zeta\bigl(\tfrac{1}{2}+it\bigr) lying in the interval (0,T].

  1. For any \varepsilon > 0, there exists a T_0(\varepsilon) > 0 such that when T \geq T_0(\varepsilon) and H=T^{0.25+\varepsilon}, the interval (T,T+H] contains a zero of odd order.
  2. For any \varepsilon > 0, there exists a T_0(\varepsilon) > 0 and c_\varepsilon > 0 such that the inequality N_0(T+H)-N_0(T) \geq c_\varepsilon H holds when T \geq T_0(\varepsilon) and H=T^{0.5+\varepsilon}.

These two conjectures opened up new directions in the investigation of the Riemann zeta function.

Other results[edit]

The location of the Riemann zeta function's zeros is of great importance in the theory of numbers. The prime number theorem is equivalent to the fact that there are no zeros of the zeta function on the Re(s) = 1 line.[9] A better result[10] that follows from an effective form of Vinogradov's mean-value theorem is that ζ(σ + it) ≠ 0 whenever | t | ≥ 3 and

\sigma\ge 1-\frac{1}{57.54(\log{|t|})^{2/3}(\log{\log{|t|}})^{1/3}}.\!

The strongest result of this kind one can hope for is the truth of the Riemann hypothesis, which would have many profound consequences in the theory of numbers.

It is known that there are infinitely many zeros on the critical line. Littlewood showed that if the sequence (γn) contains the imaginary parts of all zeros in the upper half-plane in ascending order, then

\lim_{n\rightarrow\infty}\left(\gamma_{n+1}-\gamma_n\right)=0.\!

The critical line theorem asserts that a positive percentage of the nontrivial zeros lies on the critical line.

In the critical strip, the zero with smallest non-negative imaginary part is 1/2 + i14.13472514... (OEISA058303). Directly from the functional equation one sees that the non-trivial zeros are symmetric about the axis Re(s) = 1/2. Furthermore, the fact that \zeta(s)=\overline{\zeta(\overline{s})} for all complex s ≠ 1 implies that the zeros of the Riemann zeta function are symmetric about the real axis.

Various properties[edit]

For sums involving the zeta-function at integer and half-integer values, see rational zeta series.

Reciprocal[edit]

The reciprocal of the zeta function may be expressed as a Dirichlet series over the Möbius function μ(n):


\frac{1}{\zeta(s)} = \sum_{n=1}^\infty \frac{\mu(n)}{n^s}
\!

for every complex number s with real part > 1. There are a number of similar relations involving various well-known multiplicative functions; these are given in the article on the Dirichlet series.

The Riemann hypothesis is equivalent to the claim that this expression is valid when the real part of s is greater than 1/2.

Universality[edit]

The critical strip of the Riemann zeta function has the remarkable property of universality. This zeta-function universality states that there exists some location on the critical strip that approximates any holomorphic function arbitrarily well. Since holomorphic functions are very general, this property is quite remarkable.

Estimates of the maximum of the modulus of the zeta function[edit]

Let the functions F(T;H) and G(s_{0};\Delta) be defined by the equalities

 F(T;H) = \max_{|t-T|\le H}\bigl|\zeta\bigl(\tfrac{1}{2}+it\bigr)\bigr|,\quad G(s_{0};\Delta) = \max_{|s-s_{0}|\le\Delta}|\zeta(s)|.

Here T is a sufficiently large positive number, 0<H\ll \ln\ln T, s_{0} = \sigma_{0}+iT, \tfrac{1}{2}\le\sigma_{0}\le 1, 0<\Delta < \tfrac{1}{3}. Estimating the values F and G from below shows, how large (in modulus) values \zeta(s) can take on short intervals of the critical line or in small neighborhoods of points lying in the critical strip 0\le Re \ s\le 1.

The case H\gg \ln\ln T was studied by Ramachandra; the case \Delta
> c, where c is a sufficiently large constant, is trivial.

Karatsuba proved,[11][12] in particular, that if the values H and \Delta exceed certain sufficiently small constants, then the estimates

 F(T;H) \ge T^{- c_1},\quad G(s_0; \Delta) \ge T^{-c_2},

hold, where c_1, c_2 are certain absolute constants.

The argument of the Riemann zeta-function[edit]

The function S(t) = \frac{1}{\pi}\arg{\zeta\bigl(\tfrac{1}{2}+it\bigr)} is called the argument of the Riemann zeta function. Here \arg{\zeta\bigl(\tfrac{1}{2}+it\bigr)} is the increment of an arbitrary continuous branch of \arg\zeta(s) along the broken line joining the points 2, 2+it and \tfrac{1}{2}+it There are some theorems on properties of the function S(t). Among those results[13][14] are the mean value theorems for S(t) and its first integral S_1(t) = \int_0^t S(u)du on intervals of the real line, and also the theorem claiming that every interval (T,T+H] for H \ge T^{27/82+\varepsilon} contains at least

 H(\ln T)^{1/3}e^{-c\sqrt{\ln\ln T}}

points where the function S(t) changes sign. Earlier similar results were obtained by Atle Selberg for the case H\ge T^{1/2+\varepsilon}.

Representations[edit]

Dirichlet series[edit]

An extension of the area of convergence can be obtained by rearranging the original series. The series

\zeta(s)=\frac{1}{s-1}\sum_{n=1}^\infty \left(\frac{n}{(n+1)^s}-\frac{n-s}{n^s}\right)

converges for \Re s> 0, while

\zeta(s) =\frac{1}{s-1}\sum_{n=1}^\infty\frac{n(n+1)}{2}\left(\frac{2n+3+s}{(n+1)^{s+2}}-\frac{2n-1-s}{n^{s+2}}\right)

converges even for \Re s> -1. In this way, the area of convergence can be extended to \Re s>-k for any k\in \{1,2,3,\dots\}.

Mellin transform[edit]

The Mellin transform of a function ƒ(x) is defined as

 \int_0^\infty f(x)x^{s-1}\, dx,

in the region where the integral is defined. There are various expressions for the zeta-function as a Mellin transform. If the real part of s is greater than one, we have

\Gamma(s)\zeta(s) =\int_0^\infty\frac{x^{s-1}}{e^x-1}\,dx,

where Γ denotes the Gamma function. By modifying the contour, Riemann showed that

2\sin(\pi s)\Gamma(s)\zeta(s) =i\oint_C \frac{(-x)^{s-1}}{e^x-1}\,dx

for all s, where the contour C starts and ends at +∞ and circles the origin once.

We can also find expressions which relate to prime numbers and the prime number theorem. If π(x) is the prime-counting function, then

\log \zeta(s) = s \int_0^\infty \frac{\pi(x)}{x(x^s-1)}\,dx,

for values with Re(s) > 1.

A similar Mellin transform involves the Riemann prime-counting function J(x), which counts prime powers pn with a weight of 1/n, so that

J(x) = \sum \frac{\pi(x^{1/n})}{n}.

Now we have

\log \zeta(s) = s\int_0^\infty J(x)x^{-s-1}\,dx.

These expressions can be used to prove the prime number theorem by means of the inverse Mellin transform. Riemann's prime-counting function is easier to work with, and π(x) can be recovered from it by Möbius inversion.

Theta functions[edit]

The Riemann zeta function can be given formally by a divergent Mellin transform

2\pi^{-s/2}\Gamma(s/2)\zeta(s) = \int_0^\infty \theta(it)t^{s/2-1}\,dt,

in terms of Jacobi's theta function

\theta(\tau)= \sum_{n=-\infty}^\infty \exp(\pi i n^2\tau).

However this integral does not converge for any value of s and so needs to be regularized: this gives the following expression for the zeta function:


\begin{align}
& {}\quad \pi^{-s/2}\Gamma(s/2)\zeta(s) \\[6pt]
& = \frac{1}{s-1}-\frac{1}{s} +\frac{1}{2} \int_0^1 \left(\theta(it)-t^{-1/2}\right)t^{s/2-1}\,dt + \frac{1}{2}\int_1^\infty (\theta(it)-1)t^{s/2-1}\,dt.
\end{align}

Laurent series[edit]

The Riemann zeta function is meromorphic with a single pole of order one at s = 1. It can therefore be expanded as a Laurent series about s = 1; the series development then is

\zeta(s)=\frac{1}{s-1}+\sum_{n=0}^\infty \frac{(-1)^n}{n!} \gamma_n \; (s-1)^n.

The constants γn here are called the Stieltjes constants and can be defined by the limit

 \gamma_n = \lim_{m \rightarrow \infty}
{\left[\left(\sum_{k = 1}^m \frac{(\log k)^n}{k}\right) - \frac{(\log m)^{n+1}}{n+1}\right]}.

The constant term γ0 is the Euler–Mascheroni constant.

Integral[edit]

For all s\in\mathbb{C}\setminus\{1\} the integral relation (cf. Abel–Plana formula)

\zeta(s) = \frac{2^{s-1}}{s-1}-2^s\!\int_0^{\infty}\!\!\!\frac{\sin(s\arctan t)}{(1+t^2)^\frac{s}{2}(\mathrm{e}^{\pi\,t}+1)}\,\mathrm{d}t,

holds true, which may be used for a numerical evaluation of the zeta-function.[15]

Rising factorial[edit]

Another series development using the rising factorial valid for the entire complex plane is

\zeta(s) = \frac{s}{s-1} - \sum_{n=1}^\infty \left(\zeta(s+n)-1\right)\frac{s(s+1)\cdots(s+n-1)}{(n+1)!}.\!

This can be used recursively to extend the Dirichlet series definition to all complex numbers.

The Riemann zeta function also appears in a form similar to the Mellin transform in an integral over the Gauss–Kuzmin–Wirsing operator acting on xs−1; that context gives rise to a series expansion in terms of the falling factorial.

Hadamard product[edit]

For other uses, see Matrix multiplication.

On the basis of Weierstrass's factorization theorem, Hadamard gave the infinite product expansion

\zeta(s) = \frac{e^{(\log(2\pi)-1-\gamma/2)s}}{2(s-1)\Gamma(1+s/2)} \prod_\rho \left(1 - \frac{s}{\rho} \right) e^{s/\rho},\!

where the product is over the non-trivial zeros ρ of ζ and the letter γ again denotes the Euler–Mascheroni constant. A simpler infinite product expansion is

\zeta(s) = \pi^{s/2} \frac{\prod_\rho \left(1 - \frac{s}{\rho} \right)}{2(s-1)\Gamma(1+s/2)}.\!

This form clearly displays the simple pole at s = 1, the trivial zeros at −2, −4, ... due to the gamma function term in the denominator, and the non-trivial zeros at s = ρ (To ensure convergence in the latter formula, the product should be taken over "matching pairs" of zeroes, i.e. the factors for a pair of zeroes of the form ρ and 1 − ρ should be combined.)

Logarithmic derivative on the critical strip[edit]


{\pi \frac{dN}{dx} (x) = \frac{1}{2i}\frac{d}{dx}\bigl(\log(\zeta(1/2 + ix)) - \log(\zeta(1/2 - ix))\bigr)- \frac{2}{1+4x^2} - \sum_{n=0}^\infty \frac{2n + 1/2}{(2n + 1/2)^2 +x^2}}

where  \frac{dN(x)}{dx} = \sum_\rho \delta (x-\rho) is the density of zeros of ζ on the critical strip 0 < Re(s) < 1 (δ is the Dirac delta distribution, and the sum is over the nontrivial zeros ρ of ζ).

Globally convergent series[edit]

A globally convergent series for the zeta function, valid for all complex numbers s except s = 1 + in/log(2) for some integer n, was conjectured by Konrad Knopp and proved by Helmut Hasse in 1930 (cf. Euler summation):

\zeta(s)=\frac{1}{1-2^{1-s}}
\sum_{n=0}^\infty \frac {1}{2^{n+1}}
\sum_{k=0}^n {n \choose k} \frac{(-1)^k}{(k+1)^{s}}.\!

The series only appeared in an Appendix to Hasse's paper, and did not become generally known until it was rediscovered more than 60 years later (see Sondow, 1994).

Hasse also proved the globally converging series

\zeta(s)=\frac 1{s-1}\sum_{n=0}^\infty \frac 1{n+1}\sum_{k=0}^n {n\choose k}\frac{(-1)^k}{(k+1)^{s-1}}

in the same publication.

Peter Borwein has shown a very rapidly convergent series suitable for high precision numerical calculations. The algorithm, making use of Chebyshev polynomials, is described in the article on the Dirichlet eta function.

Series representation at positive integers via the primorial[edit]

 \zeta(k)=\frac{2^k}{2^k-1}+\sum_{r=2}^\infty\frac{(p_{r-1}\#)^k}{J_k(p_r\#)}\quad(k=2,3,\dots).

Here pn# is the primorial sequence and Jk is Jordan's totient function.[16]

Applications[edit]

The zeta function occurs in applied statistics (see Zipf's law and Zipf–Mandelbrot law).

Zeta function regularization is used as one possible means of regularization of divergent series and divergent integrals in quantum field theory. In one notable example, the Riemann zeta-function shows up explicitly in the calculation of the Casimir effect. The zeta function is also useful for the analysis of dynamical systems.[17]

Infinite series[edit]

The zeta function evaluated at positive integers appears in infinite series representations of a number of constants.[18] There are more formulas in the article Harmonic number.


1=\sum_{n=2}^{\infty}(\zeta(n)-1).
  In fact the even and odd terms give the two sums   
\sum_{n=1}^{\infty}(\zeta(2n)-1)=\tfrac34
  and   
\sum_{n=1}^{\infty}(\zeta(2n+1)-1)=\tfrac14.

\log 2=\sum_{n=1}^{\infty}\frac{\zeta(2n)-1}{n}.

1-\gamma=\sum_{n=2}^{\infty}\frac{\zeta(n)-1}{n}
  where γ is Euler's constant.

\log \pi=\sum_{n=2}^{\infty}\frac{(2(\tfrac32)^n-3)(\zeta(n)-1)}{n}.

\frac{\pi}{4}=\sum_{n=2}^{\infty}\frac{\zeta(n)-1}{n}\mathfrak{I}((1+i)^n-(1+i^n))
  where \mathfrak{I}   represents the imaginary part of a complex number.

Some zeta series evaluate to more complicated expressions


\sum_{n=1}^{\infty}\frac{\zeta(2n)-1}{2^{2n}} = \frac16.

\sum_{n=1}^{\infty}\frac{\zeta(2n)-1}{4^{2n}} = \frac{13}{30}-\frac{\pi}{8}.

\sum_{n=1}^{\infty}\frac{\zeta(2n)-1}{8^{2n}} = \frac{61}{126}-\frac{\pi}{16}(\sqrt2+1).

\sum_{n=1}^{\infty}(\zeta(4n)-1) = \frac78-\frac{\pi}{4}\left(\frac{e^{2\pi}+1}{e^{2\pi}-1}\right).

Generalizations[edit]

There are a number of related zeta functions that can be considered to be generalizations of the Riemann zeta function. These include the Hurwitz zeta function

\zeta(s,q) = \sum_{k=0}^\infty \frac{1}{(k+q)^s}

(the convergent series representation was given by Helmut Hasse in 1930,[19] cf. Hurwitz zeta function), which coincides with the Riemann zeta function when q = 1 (note that the lower limit of summation in the Hurwitz zeta function is 0, not 1), the Dirichlet L-functions and the Dedekind zeta-function. For other related functions see the articles Zeta function and L-function.

The polylogarithm is given by

\mathrm{Li}_s(z) = \sum_{k=1}^\infty {z^k \over k^s}\!

which coincides with the Riemann zeta function when z = 1.

The Lerch transcendent is given by

\Phi(z, s, q) = \sum_{k=0}^\infty
\frac { z^k} {(k+q)^s}\!

which coincides with the Riemann zeta function when z = 1 and q = 1 (note that the lower limit of summation in the Lerch transcendent is 0, not 1).

The Clausen function Cls(θ) that can be chosen as the real or imaginary part of Lis(e ).

The multiple zeta functions are defined by

\zeta(s_1,s_2,\ldots,s_n) = \sum_{k_1>k_2>\cdots>k_n>0} k_1^{-s_1}k_2^{-s_2}\cdots k_n^{-s_n}.\!

One can analytically continue these functions to the n-dimensional complex space. The special values of these functions are called multiple zeta values by number theorists and have been connected to many different branches in mathematics and physics.

See also[edit]

Notes[edit]

  1. ^ http://nbviewer.ipython.org/github/empet/Math/blob/master/DomainColoring.ipynb
  2. ^ This paper also contained the Riemann hypothesis, a conjecture about the distribution of complex zeros of the Riemann zeta function that is considered by many mathematicians to be the most important unsolved problem in pure mathematics.Bombieri, Enrico. "The Riemann Hypothesis – official problem description" (PDF). Clay Mathematics Institute. Retrieved 2014-08-08. 
  3. ^ Devlin, Keith (2002). The Millennium Problems: The Seven Greatest Unsolved Mathematical Puzzles of Our Time. New York: Barnes & Noble. pp. 43–47. ISBN 978-0-7607-8659-8. 
  4. ^ Polchinski, Joseph (1998). String Theory, Volume I: An Introduction to the Bosonic String. Cambridge University Press. p. 22. ISBN 978-0-521-63303-1. 
  5. ^ A J Kainz and U M Titulaer, An accurate two-stream moment method for kinetic boundary layer problems of linear kinetic equations, pp. 1855-1874, J. Phys. A: Mathem. and General, V 25, No 7, 1992
  6. ^ C. S. Ogilvy & J. T. Anderson Excursions in Number Theory, pp. 29–35, Dover Publications Inc., 1988 ISBN 0-486-25778-9
  7. ^ Charles Edward Sandifer, How Euler did it, The Mathematical Association of America, 2007, p. 193. ISBN 978-0-88385-563-8
  8. ^ J. E. Nymann (1972). "On the probability that k positive integers are relatively prime". Journal of Number Theory 4 (5): 469–473. Bibcode:1972JNT.....4..469N. doi:10.1016/0022-314X(72)90038-8. 
  9. ^ Diamond, Harold G. (1982), "Elementary methods in the study of the distribution of prime numbers", Bulletin of the American Mathematical Society 7 (3): 553–89, doi:10.1090/S0273-0979-1982-15057-1, MR 670132 .
  10. ^ Ford, K. (2002). "Vinogradov's integral and bounds for the Riemann zeta function". Proc. London Math. Soc. 85 (3): 565–633. doi:10.1112/S0024611502013655. 
  11. ^ Karatsuba, A. A. (2001). "Lower bounds for the maximum modulus of ζ(s) in small domains of the critical strip". Mat. Zametki (70:5): 796–798. 
  12. ^ Karatsuba, A. A. (2004). "Lower bounds for the maximum modulus of the Riemann zeta function on short segments of the critical line". Izv. Ross. Akad. Nauk, Ser. Mat. (68:8): 99–104. 
  13. ^ Karatsuba, A. A. (1996). "Density theorem and the behavior of the argument of the Riemann zeta function". Mat. Zametki (60:3): 448–449. 
  14. ^ Karatsuba, A. A. (1996). "On the function S(t)". Izv. Ross. Akad. Nauk, Ser. Mat. (60:5): 27–56. 
  15. ^ Mathematik-Online-Kurs: Numerik – Numerische Integration der Riemannschen Zeta-Funktion
  16. ^ Mező, István (2013). "The primorial and the Riemann zeta function". The American Mathematical Monthly 120 (4): 321. 
  17. ^ "Dynamical systems and number theory". 
  18. ^ Unless otherwise noted, the formulas in this section are from § 4 of J. M. Borwein et al. (2000)
  19. ^ Hasse, Helmut (1930). "Ein Summierungsverfahren für die Riemannsche ζ-Reihe". Mathematische Zeitschrift 32 (1): 458–464. doi:10.1007/BF01194645 

References[edit]

External links[edit]