Riemann zeta function

From LaTeX CAS translator demo
Jump to navigation Jump to search
Riemann zeta function
The Riemann zeta function ζ(z) plotted with domain coloring.[1]
Basic features
Domain{1}
Codomain
 
Specific values
At zero12
Limit to +1
Value at 2π26
Value at 1112
Value at 20
 
 
The pole at 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 Dirichlet series

ζ(s)=n=11ns,

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.

As a function of a real variable, Leonhard Euler first introduced and studied it in the first half of the eighteenth century without using complex analysis, which was not available at the time. Bernhard Riemann's 1859 article "On the Number of Primes Less Than a Given Magnitude" 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 Roger 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

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 s, σ, and t is used traditionally in the study of the zeta function, following Riemann.)

For the special case where (s)σ>1, the zeta function can be expressed by the following integral:

ζ(s)=1Γ(s)0xs1ex1dxfor(s)σ>1,

where

Γ(s)=0xs1exdx

is the gamma function.

In the case σ > 1, the integral for ζ(s) always converges, and can be simplified to the following infinite series:

ζ(s)=n=1ns=11s+12s+13s+forσ(s)>1.

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 (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

lims1(s1)ζ(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

For any positive even integer 2n:

ζ(2n)=(1)n+1B2n(2π)2n2(2n)!

where B2n is the 2nth Bernoulli number.

For odd positive integers, no such simple expression is known, although these values are thought to be related to the algebraic K-theory of the integers; see Special values of L-functions.

For nonpositive integers, one has

ζ(n)=(1)nBn+1n+1

for n ≥ 0 (using the convention that B1 = −1/2).

In particular, ζ vanishes at the negative even integers because Bm = 0 for all odd m other than 1. These are the so-called "trivial zeros" of the zeta function.

Via analytic continuation, one can show that:

This gives a pretext for assigning a finite value to the divergent series 1 + 2 + 3 + 4 + ⋯, which has been used in certain contexts (Ramanujan summation) such as string theory.[4]
Similarly to the above, this assigns a finite result to the series 1 + 1 + 1 + 1 + ⋯.
This is employed in calculating of kinetic boundary layer problems of linear kinetic equations.[5]
If we approach from numbers larger than 1, this is the harmonic series. But its Cauchy principal value
limε0ζ(1+ε)+ζ(1ε)2
exists which is the Euler–Mascheroni constant γ = 0.5772….
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.
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]
This number is called Apéry's constant.
This appears when integrating Planck's law to derive the Stefan–Boltzmann law in physics.

Taking the limit n, one obtains ζ()=1.

Euler product formula

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

n=11ns=p prime11ps,

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):

p prime11ps=112s113s115s117s1111s11ps

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 p p/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,

p prime(11ps)=(p prime11ps)1=1ζ(s).

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

Riemann's functional equation

The zeta function satisfies the functional equation:

ζ(s)=2sπs1sin(πs2)Γ(1s)ζ(1s),

where Γ(s) is the gamma function. This is an equality of meromorphic functions valid on the whole complex plane. The equation relates values of the Riemann zeta function at the points s and 1 − s, in particular relating even positive integers with odd negative integers. Owing to the zeros of the sine function, the functional equation implies that ζ(s) has a simple zero at each even negative integer s = −2n, known as the trivial zeros of ζ(s). When s is an even positive integer, the product sin(πs/2)Γ(1 − s) on the right is non-zero because Γ(1 − s) has a simple pole, which cancels the simple zero of the sine factor.

Proof of functional equation

A proof of the functional equation proceeds as follows: We observe that if σ>0, then

0x12s1en2πxdx=Γ(s2)nsπs2.

As a result, if σ>1 then

Γ(s2)ζ(s)πs/2=n=10xs21en2πxdx=0xs21n=1en2πxdx.

With the inversion of the limiting processes justified by absolute convergence (hence the stricter requirement on σ)

For convenience, let

ψ(x):=n=1en2πx

Then ζ(s)=πs2Γ(s2)0x12s1ψ(x)dx

Given that n=en2πx=1xn=en2πx

Then 2ψ(x)+1=1x{2ψ(1x)+1}

Hence πs2Γ(s2)ζ(s)=01xs21ψ(x)dx+1xs21ψ(x)dx

This is equivalent to 01xs21{1xψ(1x)+12x12}dx+1xs21ψ(x)dx

Or :

1s11s+01xs232ψ(1x)dx+1xs21ψ(x)dx

So :

πs2Γ(s2)ζ(s)=1s(s1)+1(xs212+xs21)ψ(x)dx

which is convergent for all s, so holds by analytic continuation. Furthermore, the RHS is unchanged if s is changed to 1 − s. Hence

πs2Γ(s2)ζ(s)=π12+s2Γ(12s2)ζ(1s)

which is the functional equation. E. C. Titchmarsh (1986). The Theory of the Riemann Zeta-function (2nd ed.). Oxford: Oxford Science Publications. pp. 21–22. ISBN 0-19-853369-1. Attributed to Bernhard Riemann.

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):

η(s)=n=1(1)n+1ns=(121s)ζ(s).

Incidentally, this relation gives an equation for calculating ζ(s) in the region 0 < Re(s) < 1, i.e.

ζ(s)=1121sn=1(1)n+1ns,

where the η-series is convergent (albeit non-absolutely) in the larger half-plane s > 0 (for a more detailed survey on the history of the functional equation, see e.g. Blagouchine[9][10]).

Riemann also found a symmetric version of the functional equation applying to the xi-function:

ξ(s)=12πs2s(s1)Γ(s2)ζ(s),

which satisfies:

ξ(s)=ξ(1s).

(Riemann's original ξ(t) was slightly different.)

Zeros, the critical line, and the Riemann hypothesis

Apart from the trivial zeros, the Riemann zeta function has no zeros to the right of σ = 1 and to 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 real part (red) and imaginary part (blue) of the Riemann zeta function along the critical line Re(s) = 1/2. The first non-trivial zeros can be seen at Im(s) = ±14.135, ±21.022 and ±25.011.

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 : 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 : 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

In 1914, Godfrey Harold Hardy proved that ζ (1/2 + it) has infinitely many real zeros.

Hardy and John Edensor Littlewood formulated two conjectures on the density and distance between the zeros of ζ (1/2 + it) on intervals of large positive real numbers. In the following, N(T) is the total number of real zeros and N0(T) the total number of zeros of odd order of the function ζ (1/2 + it) lying in the interval (0, T].

  1. For any ε > 0, there exists a T0(ε) > 0 such that when
    TT0(ε) and H=T14+ε,
    the interval (T, T + H] contains a zero of odd order.
  2. For any ε > 0, there exists a T0(ε) > 0 and cε > 0 such that the inequality
    N0(T+H)N0(T)cεH
    holds when
    TT0(ε) and H=T12+ε.

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

Zero-free region

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.[11] A better result[12] that follows from an effective form of Vinogradov's mean-value theorem is that ζ (σ + it) ≠ 0 whenever |t| ≥ 3 and

σ1157.54(log|t|)23(loglog|t|)13.

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.

Other results

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

limn(γn+1γn)=0.

The critical line theorem asserts that a positive proportion of the nontrivial zeros lies on the critical line. (The Riemann hypothesis would imply that this proportion is 1.)

In the critical strip, the zero with smallest non-negative imaginary part is 1/2 + 14.13472514…i (OEISA058303). The fact that

ζ(s)=ζ(s)

for all complex s ≠ 1 implies that the zeros of the Riemann zeta function are symmetric about the real axis. Combining this symmetry with the functional equation, furthermore, one sees that the non-trivial zeros are symmetric about the critical line Re(s) = 1/2.

Various properties

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

Reciprocal

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

1ζ(s)=n=1μ(n)ns

for every complex number s with real part greater than 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

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. The first proof of universality was provided by Sergei Mikhailovitch Voronin in 1975.[13] More recent work has included effective versions of Voronin's theorem[14] and extending it to Dirichlet L-functions.[15][16]

Estimates of the maximum of the modulus of the zeta function

Let the functions F(T;H) and G(s0;Δ) be defined by the equalities

F(T;H)=max|tT|H|ζ(12+it)|,G(s0;Δ)=max|ss0|Δ|ζ(s)|.

Here T is a sufficiently large positive number, 0 < H ≪ ln ln T, s0 = σ0 + iT, 1/2σ0 ≤ 1, 0 < Δ < 1/3. Estimating the values F and G from below shows, how large (in modulus) values ζ(s) can take on short intervals of the critical line or in small neighborhoods of points lying in the critical strip 0 ≤ Re(s) ≤ 1.

The case H ≫ ln ln T was studied by Kanakanahalli Ramachandra; the case Δ > c, where c is a sufficiently large constant, is trivial.

Anatolii Karatsuba proved,[17][18] in particular, that if the values H and Δ exceed certain sufficiently small constants, then the estimates

F(T;H)Tc1,G(s0;Δ)Tc2,

hold, where c1 and c2 are certain absolute constants.

The argument of the Riemann zeta function

The function

S(t)=1πargζ(12+it)

is called the argument of the Riemann zeta function. Here arg ζ(1/2 + it) is the increment of an arbitrary continuous branch of arg ζ(s) along the broken line joining the points 2, 2 + it and 1/2 + it.

There are some theorems on properties of the function S(t). Among those results[19][20] are the mean value theorems for S(t) and its first integral

S1(t)=0tS(u)du

on intervals of the real line, and also the theorem claiming that every interval (T, T + H] for

HT2782+ε

contains at least

HlnT3eclnlnT

points where the function S(t) changes sign. Earlier similar results were obtained by Atle Selberg for the case

HT12+ε.

Representations

Dirichlet series

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

ζ(s)=1s1n=1(n(n+1)snsns)

converges for Re(s) > 0, while

ζ(s)=1s1n=1n(n+1)2(2n+3+s(n+1)s+22n1sns+2)

converges even for Re(s) > −1. In this way, the area of convergence can be extended to Re(s) > −k for any negative integer k.

Mellin-type integrals

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

0f(x)xsdxx

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

Γ(s)ζ(s)=0xs1ex1dx,

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

2sin(πs)Γ(s)ζ(s)=iH(x)s1ex1dx

for all s (where H denotes the Hankel contour).

Starting with the integral formula ζ(n)Γ(n)=0xn1ex1dx, one can show[22] by substitution and iterated differentation for natural k2

0xnex(ex1)kdx=n!(k1)!ζnj=0k2(1jζ)

using the notation of umbral calculus where each power ζr is to be replaced by ζ(r), so e.g. for k=2 we have 0xnex(ex1)2dx=n!ζ(n), while for k=4 this becomes

0xnex(ex1)4dx=n!6(ζn23ζn1+2ζn)=n!ζ(n2)3ζ(n1)+2ζ(n)6.

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

lnζ(s)=s0π(x)x(xs1)dx,

for values with Re(s) > 1.

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

J(x)=π(x1n)n.

Now we have

lnζ(s)=s0J(x)xs1dx.

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

The Riemann zeta function can be given by a Mellin transform[23]

2πs2Γ(s2)ζ(s)=0(θ(it)1)ts21dt,

in terms of Jacobi's theta function

θ(τ)=n=eπin2τ.

However, this integral only converges if the real part of s is greater than 1, but it can be regularized. This gives the following expression for the zeta function, which is well defined for all s except 0 and 1:

πs2Γ(s2)ζ(s)=1s11s+1201(θ(it)t12)ts21dt+121(θ(it)1)ts21dt.

Laurent series

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 is then

ζ(s)=1s1+n=0γnn!(1s)n.

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

γn=limm((k=1m(lnk)nk)(lnm)n+1n+1).

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

Integral

For all sC, s ≠ 1, the integral relation (cf. Abel–Plana formula)

ζ(s)=1s1+12+20sin(sarctant)(1+t2)s/2(e2πt1)dt

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

Rising factorial

Another series development using the rising factorial valid for the entire complex plane is[citation needed]

ζ(s)=ss1n=1(ζ(s+n)1)s(s+1)(s+n1)(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.[24]

Hadamard product

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

ζ(s)=e(log(2π)1γ2)s2(s1)Γ(1+s2)ρ(1sρ)esρ,

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

ζ(s)=πs2ρ(1sρ)2(s1)Γ(1+s2).

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 zeros, i.e. the factors for a pair of zeros of the form ρ and 1 − ρ should be combined.)

Globally convergent series

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

ζ(s)=1121sn=012n+1k=0n(nk)(1)k(k+1)s.

The series appeared in an appendix to Hasse's paper, and was published for the second time by Jonathan Sondow in 1994.[27]

Hasse also proved the globally converging series

ζ(s)=1s1n=01n+1k=0n(nk)(1)k(k+1)s1

in the same publication.[26] Research by Iaroslav Blagouchine[28][25] has found that a similar, equivalent series was published by Joseph Ser in 1926.[29] Other similar globally convergent series include

ζ(s)=1s1n=0Hn+1k=0n(1)k(nk)(k+2)1sζ(s)=1s1{1+n=0Hn+2k=0n(1)k(nk)(k+2)s}ζ(s)=k!(sk)kn=01(n+k)![n+kn]=0n+k1(1)(n+k1)(+1)ks,k=1,2,3,ζ(s)=1s1+n=0|Gn+1|k=0n(1)k(nk)(k+1)sζ(s)=1s1+1n=0Cn+1k=0n(1)k(nk)(k+2)sζ(s)=2(s2)s1ζ(s1)+2n=0(1)nGn+2k=0n(1)k(nk)(k+1)sζ(s)=l=1k1(kl+1)l(sl)lζ(sl)+ksk+kn=0(1)nGn+1(k)k=0n(1)k(nk)(k+1)sζ(s)=(a+1)1ss1+n=0(1)nψn+1(a)k=0n(1)k(nk)(k+1)s,(a)>1ζ(s)=1+(a+2)1ss1+n=0(1)nψn+1(a)k=0n(1)k(nk)(k+2)s,(a)>1ζ(s)=1a+12{ζ(s1,1+a)s1+ζ(s1)+n=0(1)nψn+2(a)k=0n(1)k(nk)(k+1)s},(a)>1

where Hn are the harmonic numbers, [] are the Stirling numbers of the first kind, (sk)k is the Pochhammer symbol, Gn are the Gregory coefficients, G(k)
n
are the Gregory coefficients of higher order, Cn are the Cauchy numbers of the second kind (C1 = 1/2, C2 = 5/12, C3 = 3/8,...), and ψn(a) are the Bernoulli polynomials of the second kind. See Blagouchine's paper.[25]

Peter Borwein has developed an algorithm that applies Chebyshev polynomials to the Dirichlet eta function to produce a very rapidly convergent series suitable for high precision numerical calculations.[30]

Series representation at positive integers via the primorial

ζ(k)=2k2k1+r=2(pr1#)kJk(pr#)k=2,3,.

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

Series representation by the incomplete poly-Bernoulli numbers

The function ζ can be represented, for Re(s) > 1, by the infinite series

ζ(s)=n=0Bn,2(s)(Wk(1))nn!,

where k ∈ {−1, 0}, Wk is the kth branch of the Lambert W-function, and B(μ)
n, ≥2
is an incomplete poly-Bernoulli number.[32]

The Mellin transform of the Engel map

The function :g(x)=x(1+x1)1 is iterated to find the coefficients appearing in Engel expansions.[33]

The Mellin transform of the map g(x) is related to the Riemann zeta function by the formula

01g(x)xs1dx=n=11n+11n(x(n+1)1)xs1dx=n=1ns(s1)+(n+1)s1(n2+2n+1)+ns1sn1s(s+1)s(n+1)=ζ(s+1)s+11s(s+1)

Series representation as a sum of geometric series

In analogy with the Euler product, which can be proven using geometric series, the zeta function for Re(s)>1 can be represented as a sum of geometric series:

ζ(s)=1+n=11ans1,

where an is the n:th not perfect power. [34]

Numerical algorithms

For v=1,2,3, , the Riemann zeta function has for fixed σ0<v and for all σσ0 the following representation in terms of three absolutely and uniformly converging series,[35]ζ(s)=n=1nsw=0v1(nN)ww!enNΓ(1s+v)(1s)Γ(v)N1s+μ=±1Eμ(s)Eμ(s)=(2π)s1Γ(1s)eiμπ2(1s)m=1[ms1w=0v1(s1w)(m+iμ2πN)s1w(iμ2πN)w]where for positive integer s=k one has to take the limit value limskEμ(s). The derivatives of ζ(s) can be calculated by differentiating the above series termwise. From this follows an algorithm which allows to compute, to arbitrary precision, ζ(s) and its derivatives using at most C(ϵ)|τ|12+ϵ summands for any ϵ>0, with explicit error bounds. For ζ(s), these are as follows:

For a given argument s with 0σ2 and 0<t one can approximate ζ(s) to any accuracy δ0.05 by summing the first series to n=3.151vN, E1(s) to m=N and neglecting E1(s), if one chooses v as the next higher integer of the unique solution of xmax(1σ2,0)ln(12+x+τ)=ln8δ in the unknown x, and from this N=1.11(1+12+τv)12. For t=0 one can neglect E1(s) altogether. Under the mild condition τ>53(32+ln8δ) one needs at most 2+81+ln8δ+max(1σ2,0)ln(2τ)τ summands. Hence this algorithm is essentially as fast as the Riemann-Siegel formula. Similar algorithms are possible for Dirichlet L-functions.[35]

In February 2020, Sandeep Tyagi showed that a quantum computer can evaluate ζ(s) in the critical strip with computational complexity that is polylogarithmic in t. Following work by Ghaith Ayesh Hiary, the required exponential sums may be rescaled as t1D, for integer D2. [36]

Applications

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 one method of calculating the Casimir effect. The zeta function is also useful for the analysis of dynamical systems.[37]

Infinite series

The zeta function evaluated at equidistant positive integers appears in infinite series representations of a number of constants.[38]

In fact the even and odd terms give the two sums

and

Parametrized versions of the above sums are given by

and

with |t|<2 and where ψ and γ are the polygamma function and Euler's constant, as well as

all of which are continuous at t=1. Other sums include

where Im denotes the imaginary part of a complex number.

There are yet more formulas in the article Harmonic number.

Generalizations

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

ζ(s,q)=k=01(k+q)s

(the convergent series representation was given by Helmut Hasse in 1930,[26] cf. Hurwitz zeta function), which coincides with the Riemann zeta function when q = 1 (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

Lis(z)=k=1zkks

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

The Lerch transcendent is given by

Φ(z,s,q)=k=0zk(k+q)s

which coincides with the Riemann zeta function when z = 1 and q = 1 (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

ζ(s1,s2,,sn)=k1>k2>>kn>0k1s1k2s2knsn.

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

See also

Notes

  1. "Jupyter Notebook Viewer". Nbviewer.ipython.org. Retrieved 4 January 2017.
  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 8 August 2014.
  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). An Introduction to the Bosonic String. String Theory. I. Cambridge University Press. p. 22. ISBN 978-0-521-63303-1.
  5. Kainz, A. J.; Titulaer, U. M. (1992). "An accurate two-stream moment method for kinetic boundary layer problems of linear kinetic equations". J. Phys. A: Math. Gen. 25 (7): 1855–1874. Bibcode:1992JPhA...25.1855K. doi:10.1088/0305-4470/25/7/026.
  6. Ogilvy, C. S.; Anderson, J. T. (1988). Excursions in Number Theory. Dover Publications. pp. 29–35. ISBN 0-486-25778-9.
  7. Sandifer, Charles Edward (2007). How Euler Did It. Mathematical Association of America. p. 193. ISBN 978-0-88385-563-8.
  8. Nymann, J. E. (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. I. V. Blagouchine The history of the functional equation of the zeta-function. Seminar on the History of Mathematics, Steklov Institute of Mathematics at St. Petersburg, 1 March 2018. PDF
  10. I. V. Blagouchine Rediscovery of Malmsten’s integrals, their evaluation by contour integration methods and some related results. The Ramanujan Journal, vol. 35, no. 1, pp. 21-110, 2014. Addendum: vol. 42, pp. 777–781, 2017. PDF
  11. 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 0670132.
  12. Ford, K. (2002). "Vinogradov's integral and bounds for the Riemann zeta function". Proc. London Math. Soc. 85 (3): 565–633. arXiv:1910.08209. doi:10.1112/S0024611502013655. S2CID 121144007.
  13. Voronin, S. M. (1975). "Theorem on the Universality of the Riemann Zeta Function". Izv. Akad. Nauk SSSR, Ser. Matem. 39: 475–486. Reprinted in Math. USSR Izv. (1975) 9: 443–445.
  14. Ramūnas Garunkštis; Antanas Laurinčikas; Kohji Matsumoto; Jörn Steuding; Rasa Steuding (2010). "Effective uniform approximation by the Riemann zeta-function". Publicacions Matemàtiques. 54 (1): 209–219. doi:10.1090/S0025-5718-1975-0384673-1. JSTOR 43736941.
  15. Bhaskar Bagchi (1982). "A Joint Universality Theorem for Dirichlet L-Functions". Mathematische Zeitschrift. 181 (3): 319–334. doi:10.1007/bf01161980. ISSN 0025-5874. S2CID 120930513.
  16. Steuding, Jörn (2007). Value-Distribution of L-Functions. Lecture Notes in Mathematics. 1877. Berlin: Springer. p. 19. arXiv:1711.06671. doi:10.1007/978-3-540-44822-8. ISBN 978-3-540-26526-9.
  17. 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.
  18. 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. Bibcode:2004IzMat..68.1157K. doi:10.1070/IM2004v068n06ABEH000513.
  19. Karatsuba, A. A. (1996). "Density theorem and the behavior of the argument of the Riemann zeta function". Mat. Zametki (60): 448–449.
  20. Karatsuba, A. A. (1996). "On the function S(t)". Izv. Ross. Akad. Nauk, Ser. Mat. 60 (5): 27–56.
  21. Knopp, Konrad (1945). Theory of Functions. New York, Dover publications. pp. 51–55.
  22. "Evaluating the definite integral..." math.stackexchange.com.
  23. Neukirch, Jürgen (1999). Algebraic number theory. Springer. p. 422. ISBN 3-540-65399-6.
  24. "A series representation for the Riemann Zeta derived from the Gauss-Kuzmin-Wirsing Operator" (PDF). Linas.org. Retrieved 4 January 2017.
  25. 25.0 25.1 25.2 Blagouchine, Iaroslav V. (2018). "Three Notes on Ser's and Hasse's Representations for the Zeta-functions". INTEGERS: The Electronic Journal of Combinatorial Number Theory. 18A: 1–45. arXiv:1606.02044. Bibcode:2016arXiv160602044B.
  26. 26.0 26.1 26.2 Hasse, Helmut (1930). "Ein Summierungsverfahren für die Riemannsche ζ-Reihe" [A summation method for the Riemann ζ series]. Mathematische Zeitschrift (in German). 32 (1): 458–464. doi:10.1007/BF01194645. S2CID 120392534.CS1 maint: unrecognized language (link)
  27. Sondow, Jonathan (1994). "Analytic continuation of Riemann's zeta function and values at negative integers via Euler's transformation of series" (PDF). Proceedings of the American Mathematical Society. 120 (2): 421–424. doi:10.1090/S0002-9939-1994-1172954-7.
  28. Blagouchine, Iaroslav V. (2016). "Expansions of generalized Euler's constants into the series of polynomials in π−2 and into the formal enveloping series with rational coefficients only". Journal of Number Theory. 158: 365–396. arXiv:1501.00740. doi:10.1016/j.jnt.2015.06.012.
  29. Ser, Joseph (1926). "Sur une expression de la fonction ζ(s) de Riemann" [Upon an expression for Riemann's ζ function]. Comptes rendus hebdomadaires des séances de l'Académie des Sciences (in French). 182: 1075–1077.CS1 maint: unrecognized language (link)
  30. Borwein, Peter (2000). "An Efficient Algorithm for the Riemann Zeta Function" (PDF). In Théra, Michel A. (ed.). Constructive, Experimental, and Nonlinear Analysis. Conference Proceedings, Canadian Mathematical Society. 27. Providence, RI: American Mathematical Society, on behalf of the Canadian Mathematical Society. pp. 29–34. ISBN 978-0-8218-2167-1.
  31. Mező, István (2013). "The primorial and the Riemann zeta function". The American Mathematical Monthly. 120 (4): 321.
  32. Komatsu, Takao; Mező, István (2016). "Incomplete poly-Bernoulli numbers associated with incomplete Stirling numbers". Publicationes Mathematicae Debrecen. 88 (3–4): 357–368. arXiv:1510.05799. doi:10.5486/pmd.2016.7361. S2CID 55741906.
  33. "A220335 - OEIS". oeis.org. Retrieved 17 April 2019.
  34. Munkhammar, Joakim (2020). "The Riemann zeta function as a sum of geometric series". The Mathematical Gazette. 104 (561): 527–530. doi:10.1017/mag.2020.110.
  35. 35.0 35.1 Fischer, Kurt (4 March 2017). "The Zetafast algorithm for computing zeta functions". arXiv:1703.01414 [math.NT].
  36. Tyagi, Sandeep (25 February 2020). "Evaluation of exponential sums and Riemann zeta function on quantum computer". arXiv:2002.11094 [quant-ph].
  37. "Work on spin-chains by A. Knauf, et. al". Empslocal.ex.ac.uk. Retrieved 4 January 2017.
  38. Most of the formulas in this section are from § 4 of J. M. Borwein et al. (2000)

References

External links