Riemann zeta function: Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>David Eppstein
Undid revision 1277879351 by Dchalker (talk) not helpful here either
 
(No difference)

Latest revision as of 09:38, 27 February 2025

Template:Short description

The Riemann zeta function Template:Math plotted with domain coloring.[1]
The pole at z=1 and two zeros on the critical line.

The Riemann zeta function or Euler–Riemann zeta function, denoted by the Greek letter Template:Math (zeta), is a mathematical function of a complex variable defined as ζ(s)=n=11ns=11s+12s+13s+ for Template:Nowrap and its analytic continuation elsewhere.[2]

The Riemann zeta function plays a pivotal role in analytic number theory and has applications in physics, probability theory, and applied statistics.

Leonhard Euler first introduced and studied the function over the reals in the first half of the eighteenth century. 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. This paper also contained the Riemann hypothesis, a conjecture about the distribution of complex zeros of the Riemann zeta function that many mathematicians consider the most important unsolved problem in pure mathematics.[3]

The values of the Riemann zeta function at even positive integers were computed by Euler. The first of them, Template:Math, provides a solution to the Basel problem. In 1979 Roger Apéry proved the irrationality of Template:Math. 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-function|Dirichlet Template:Mvar-functions]] and [[L-function|Template:Mvar-functions]], are known.

Definition

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

The Riemann zeta function Template:Math is a function of a complex variable Template:Math, where Template:Mvar and Template:Mvar are real numbers. (The notation Template:Mvar, Template:Mvar, and Template:Mvar is used traditionally in the study of the zeta function, following Riemann.) When Template:Math, the function can be written as a converging summation or as an integral:

ζ(s)=n=11ns=1Γ(s)0xs1ex1dx,

where

Γ(s)=0xs1exdx

is the gamma function. The Riemann zeta function is defined for other complex values via analytic continuation of the function defined for Template:Math.

Leonhard Euler considered the above series in 1740 for positive integer values of Template:Mvar, and later Chebyshev extended the definition to Re(s)>1.[4]

The above series is a prototypical Dirichlet series that converges absolutely to an analytic function for Template:Mvar such that Template:Math and diverges for all other values of Template:Mvar. Riemann showed that the function defined by the series on the half-plane of convergence can be continued analytically to all complex values Template:Math. For Template:Math, the series is the harmonic series which diverges to Template:Math, and lims1(s1)ζ(s)=1. Thus the Riemann zeta function is a meromorphic function on the whole complex plane, which is holomorphic everywhere except for a simple pole at Template:Math with residue Template:Math.

Euler's product formula

In 1737, 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 Template:Math and the infinite product on the right hand side extends over all prime numbers Template:Mvar (such expressions are called Euler products):

p prime11ps=112s113s115s117s1111s11ps

Both sides of the Euler product formula converge for Template:Math. 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 Template:Math, diverges, Euler's formula (which becomes Template:Math) implies that there are infinitely many primes.[5] Since the logarithm of Template:Math is approximately Template:Math, the formula can also be used to prove the stronger result that the sum of the reciprocals of the primes is infinite. On the other hand, combining that with the sieve of Eratosthenes shows that the density of the set of primes within the set of positive integers is zero.

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

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

Riemann's functional equation

This zeta function satisfies the functional equation ζ(s)=2sπs1 sin(πs2) Γ(1s) ζ(1s) , where Template:Math 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 Template:Mvar and Template:Math, in particular relating even positive integers with odd negative integers. Owing to the zeros of the sine function, the functional equation implies that Template:Math has a simple zero at each even negative integer Template:Math, known as the trivial zeros of Template:Math. When Template:Mvar is an even positive integer, the product Template:Nobr on the right is non-zero because Template:Math has a simple pole, which cancels the simple zero of the sine factor.

Template:Math proof

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.

Equivalencies

An equivalent relationship had been conjectured by Euler over a hundred years earlier, in 1749, for the Dirichlet eta function (the alternating zeta function): η(s) = n=1(1)n+1 ns=(121s) ζ(s).

Incidentally, this relation gives an equation for calculating Template:Math in the region Template:Nobr i.e. ζ(s)=1121s n=1(1)n+1ns  where the η-series is convergent (albeit non-absolutely) in the larger half-plane Template:Math (for a more detailed survey on the history of the functional equation, see e.g. Blagouchine[6][7]).

Riemann also found a symmetric version of the functional equation applying to the Template:Math-function: ξ(s) = 12πs2 s(s1) Γ(s2) ζ(s) , which satisfies: ξ(s)=ξ(1s).

(Riemann's [[Riemann Ξ function|original Template:Math]] was slightly different.)

The  πs/2 Γ(s/2)  factor was not well-understood at the time of Riemann, until John Tate's (1950) thesis, in which it was shown that this so-called "Gamma factor" is in fact the local L-factor corresponding to the Archimedean place, the other factors in the Euler product expansion being the local L-factors of the non-Archimedean places.

Zeros, the critical line, and the Riemann hypothesis

Template:Main

Riemann zeta spiral along the critical line from height 999000 to a million (from red to violet)
The Riemann zeta function has no zeros to the right of Template:Math or (apart from the trivial zeros) to the left of Template:Math (nor can the zeros lie too close to those lines). Furthermore, the non-trivial zeros are symmetric about the real axis and the line Template:Math and, according to the Riemann hypothesis, they all lie on the line Template:Math.
This image shows a plot of the Riemann zeta function along the critical line for real values of Template:Mvar 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.

File:Zeta1000 1005.webm The functional equation shows that the Riemann zeta function has zeros at Template:Nowrap. These are called the trivial zeros. They are trivial in the sense that their existence is relatively easy to prove, for example, from Template:Math 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 important 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 set {s:Re(s)=1/2} is called the critical line. The Riemann hypothesis, considered one of the greatest unsolved problems in mathematics, asserts that all non-trivial zeros are on the critical line. In 1989, Conrey proved that more than 40% of the non-trivial zeros of the Riemann zeta function are on the critical line.[8] This has since been improved to 41.7%.[9]

For the Riemann zeta function on the critical line, see [[Z function|Template:Mvar-function]].

First few nontrivial zeros[10][11]
Zero
1/2 ± 14.134725... i
1/2 ± 21.022040... i
1/2 ± 25.010858... i
1/2 ± 30.424876... i
1/2 ± 32.935062... i
1/2 ± 37.586178... i
1/2 ± 40.918719... i

Number of zeros in the critical strip

Let N(T) be the number of zeros of ζ(s) in the critical strip 0<Re(s)<1, whose imaginary parts are in the interval 0<Im(s)<T. Timothy Trudgian proved that, if T>e, then[12]

|N(T)T2πlogT2πe|0.112logT+0.278loglogT+3.385+0.2T.

The Hardy–Littlewood conjectures

In 1914, G. H. Hardy proved that Template:Math has infinitely many real zeros.[13][14]

Hardy and J. E. Littlewood formulated two conjectures on the density and distance between the zeros of Template:Math on intervals of large positive real numbers. In the following, Template:Math is the total number of real zeros and Template:Math the total number of zeros of odd order of the function Template:Math lying in the interval Template:Math. Template:Numbered list 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 number theory. The prime number theorem is equivalent to the fact that there are no zeros of the zeta function on the Template:Math line.[15] It is also known that zeros do not exist in certain regions slightly to the left of the Template:Math line, known as zero-free regions. For instance, Korobov[16] and Vinogradov[17] independently showed via the Vinogradov's mean-value theorem that for sufficiently large |t|, ζ(σ+it)0 for

σ1c(log|t|)2/3+ε

for any ε>0 and an absolute constant c>0 depending on ε. Asymptotically, this is the largest known zero-free region for the zeta function.

Explicit zero-free regions are also known. Platt and Trudgian[18] verified computationally that ζ(σ+it)0 if σ1/2 and |t|31012. Mossinghoff, Trudgian and Yang proved[19] that zeta has no zeros in the region

σ115.558691log|t|

for Template:Math, which is the largest known zero-free region in the critical strip for 31012<|t|<e64.171027 (for previous results see[20]). Yang[21] showed that ζ(σ+it)0 if

σ1loglog|t|21.233log|t| and |t|3

which is the largest known zero-free region for e170.2<|t|<e4.8105. Bellotti proved[22] (building on the work of Ford[23]) the zero-free region

σ1153.989(log|t|)2/3(loglog|t|)1/3 and |t|3.

This is the largest known zero-free region for fixed |t|exp(4.8105). Bellotti also showed that for sufficiently large |t|, the following better result is known: ζ(σ+it)0 for

σ1148.0718(log|t|)2/3(loglog|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.

Other results

It is known that there are infinitely many zeros on the critical line. Littlewood showed that if the sequence (Template:Math) 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 Template:Math (Template:OEIS2C). The fact that

ζ(s)=ζ(s)

for all complex Template:Math 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 Template:Math.

It is also known that no zeros lie on the line with real part 1.

Specific values

Template:Main For any positive even integer Template:Math, ζ(2n)=|B2n|(2π)2n2(2n)!, where Template:Math is the Template:Math-th Bernoulli number. For odd positive integers, no such simple expression is known, although these values are thought to be related to the algebraic Template:Mvar-theory of the integers; see [[Special values of L-functions|Special values of Template:Mvar-functions]].

For nonpositive integers, one has ζ(n)=Bn+1n+1 for Template:Math (using the convention that Template:Math). In particular, Template:Mvar vanishes at the negative even integers because Template:Math for all odd Template:Mvar other than 1. These are the so-called "trivial zeros" of the zeta function.

Via analytic continuation, one can show that ζ(1)=112 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.[24] Analogously, the particular value ζ(0)=12 can be viewed as assigning a finite result to the divergent series 1 + 1 + 1 + 1 + ⋯.

The value ζ(12)=1.46035450880958681288 is employed in calculating kinetic boundary layer problems of linear kinetic equations.[25][26]

Although ζ(1)=1+12+13+ diverges, its Cauchy principal value limε0ζ(1+ε)+ζ(1ε)2 exists and is equal to the Euler–Mascheroni constant Template:Math.[27]

The demonstration of the particular value ζ(2)=1+122+132+=π26 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?[28] The value ζ(3)=1+123+133+=1.202056903159594285399... is Apéry's constant.

Taking the limit s+ through the real numbers, one obtains ζ(+)=1. But at complex infinity on the Riemann sphere the zeta function has an essential singularity.[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 Template:Math:

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

for every complex number Template:Mvar 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 Template:Mvar is greater than Template:Sfrac.

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.[29] More recent work has included effective versions of Voronin's theorem[30] and extending it to Dirichlet L-functions.[31][32]

Estimates of the maximum of the modulus of the zeta function

Let the functions Template:Math and Template:Math be defined by the equalities

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

Here Template:Mvar is a sufficiently large positive number, Template:Math, Template:Math, Template:Math, Template:Math. Estimating the values Template:Mvar and Template:Mvar from below shows, how large (in modulus) values Template:Math can take on short intervals of the critical line or in small neighborhoods of points lying in the critical strip Template:Math.

The case Template:Math was studied by Kanakanahalli Ramachandra; the case Template:Math, where Template:Math is a sufficiently large constant, is trivial.

Anatolii Karatsuba proved,[33][34] in particular, that if the values Template:Mvar and Template:Math exceed certain sufficiently small constants, then the estimates

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

hold, where Template:Math and Template:Math 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 Template:Math is the increment of an arbitrary continuous branch of Template:Math along the broken line joining the points Template:Math, Template:Math and Template:Math.

There are some theorems on properties of the function Template:Math. Among those results[35][36] are the mean value theorems for Template:Math and its first integral

S1(t)=0tS(u)du

on intervals of the real line, and also the theorem claiming that every interval Template:Math for

HT2782+ε

contains at least

HlnT3eclnlnT

points where the function Template:Math 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.[37] The series

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

converges for Template:Math, while

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

converge even for Template:Math. In this way, the area of convergence can be extended to Template:Math for any negative integer Template:Math.

The recurrence connection is clearly visible from the expression valid for Template:Math enabling further expansion by integration by parts.

ζ(s)=1+1s1s2![ζ(s+1)1]s(s+1)3![ζ(s+2)1]s(s+1)(s+2)3!n=101t3dt(n+t)s+3

Mellin-type integrals

The Mellin transform of a function Template:Math is defined as[38]

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 Template:Mvar is greater than one, we have

Γ(s)ζ(s)=0xs1ex1dx and Γ(s)ζ(s)=12s0xscosh(x)1dx,

where Template:Math denotes the gamma function. By modifying the contour, Riemann showed that

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

for all Template:Mvar[39] (where Template:Mvar denotes the Hankel contour).

We can also find expressions which relate to prime numbers and the prime number theorem. If Template:Math is the prime-counting function, then

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

for values with Template:Math.

A similar Mellin transform involves the Riemann function Template:Math, which counts prime powers Template:Math with a weight of Template:Math, so that

J(x)=π(x1n)n.

Now

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 Template:Math can be recovered from it by Möbius inversion.

Theta functions

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

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 Template:Mvar is greater than 1, but it can be regularized. This gives the following expression for the zeta function, which is well defined for all Template:Mvar 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 Template:Math. It can therefore be expanded as a Laurent series about Template:Math; the series development is then[41]

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

The constants Template:Math 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 Template:Math is the Euler–Mascheroni constant.

Integral

For all Template:Math, Template:Math, the integral relation (cf. Abel–Plana formula)

 ζ(s) = 1 s1 + 1 2+20sin( s arctant ) (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 [37]

ζ(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 Template:Math; that context gives rise to a series expansion in terms of the falling factorial.[42]

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 Template:Mvar of Template:Math and the letter Template:Mvar 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 Template:Math, the trivial zeros at −2, −4, ... due to the gamma function term in the denominator, and the non-trivial zeros at Template:Math. (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 Template:Mvar and Template:Math should be combined.)

Globally convergent series

A globally convergent series for the zeta function, valid for all complex numbers Template:Mvar except Template:Math for some integer Template:Mvar, was conjectured by Konrad Knopp in 1926 [43] and proven by Helmut Hasse in 1930[44] (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.[45]

Hasse also proved the globally converging series

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

in the same publication.[44] Research by Iaroslav Blagouchine[46][43] has found that a similar, equivalent series was published by Joseph Ser in 1926.[47]

In 1997 K. Maślanka gave another globally convergent (except Template:Math) series for the Riemann zeta function:

ζ(s)=1s1k=0(i=1k(is2))Akk!=1s1k=0(1s2)kAkk!

where real coefficients Ak are given by:

Ak=j=0k(1)j(kj)(2j+1)ζ(2j+2)=j=0k(kj)B2j+2π2j+2(2)j(12)j

Here Bn are the Bernoulli numbers and (x)k denotes the Pochhammer symbol.[48][49]

Note that this representation of the zeta function is essentially an interpolation with nodes, where the nodes are points s=2,4,6,, i.e. exactly those where the zeta values are precisely known, as Euler showed. An elegant and very short proof of this representation of the zeta function, based on Carlson's theorem, was presented by Philippe Flajolet in 2006.[50]

The asymptotic behavior of the coefficients Ak is rather curious: for growing k values, we observe regular oscillations with a nearly exponentially decreasing amplitude and slowly decreasing frequency (roughly as k2/3). Using the saddle point method, we can show that

Ak4π3/23κexp(3κ2+π24κ)cos(4π333κ2+3π24κ)

where κ stands for:

κ:=π2k3

(see [51] for details).

On the basis of this representation, in 2003 Luis Báez-Duarte provided a new criterion for the Riemann hypothesis.[52][53][54] Namely, if we define the coefficients ck as

ck:=j=0k(1)j(kj)1ζ(2j+2)

then the Riemann hypothesis is equivalent to

ck=𝒪(k3/4+ε)(ε>0)

Rapidly convergent series

Peter Borwein 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.[55]

Series representation at positive integers via the primorial

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

Here Template:Math is the primorial sequence and Template:Math is Jordan's totient function.[56]

Series representation by the incomplete poly-Bernoulli numbers

The function Template:Mvar can be represented, for Template:Math, by the infinite series

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

where Template:Math, Template:Math is the Template:Mvarth branch of the [[Lambert W function|Lambert Template:Mvar-function]], and Template:Math is an incomplete poly-Bernoulli number.[57]

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.[58]

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)

Thue-Morse sequence

Certain linear combinations of Dirichlet series whose coefficients are terms of the Thue-Morse sequence give rise to identities involving the Riemann Zeta function (Tóth, 2022 [59]). For instance:

n15tn1+3tnn2=4ζ(2)=2π23,n19tn1+7tnn3=8ζ(3),

where (tn)n0 is the nth term of the Thue-Morse sequence. In fact, for all s with real part greater than 1, we have

(2s+1)n1tn1ns+(2s1)n1tnns=2sζ(s).

In nth dimensions

The zeta function can also be represented as an nth amount of integrals:

ζ(n)=[0,1]ndz1dz2dzn1z1z2zn

and it only works for n{1}

Numerical algorithms

A classical algorithm, in use prior to about 1930, proceeds by applying the Euler-Maclaurin formula to obtain, for n and m positive integers,

ζ(s)=j=1n1js+12ns+n1ss1+k=1mTk,n(s)+Em,n(s)

where, letting B2k denote the indicated Bernoulli number,

Tk,n(s)=B2k(2k)!n1s2kj=02k2(s+j)

and the error satisfies

|Em,n(s)|<|s+2m+1σ+2m+1Tm+1,n(s)|,

with σ = Re(s).[60]

A modern numerical algorithm is the Odlyzko–Schönhage algorithm.

Applications

The zeta function occurs in applied statistics including Zipf's law, Zipf–Mandelbrot law, and Lotka's 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.[61]

Musical tuning

In the theory of musical tunings, the zeta function can be used to find equal divisions of the octave (EDOs) that closely approximate the intervals of the harmonic series. For increasing values of t, the value of

|ζ(12+2πiln(2)t)|

peaks near integers that correspond to such EDOs.[62] Examples include popular choices such as 12, 19, and 53.[63]

Infinite series

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

  • n=2(ζ(n)1)=1

In fact the even and odd terms give the two sums

  • n=1(ζ(2n)1)=34

and

  • n=1(ζ(2n+1)1)=14

Parametrized versions of the above sums are given by

  • n=1(ζ(2n)1)t2n=t2t21+12(1πtcot(tπ))

and

  • n=1(ζ(2n+1)1)t2n=t2t2112(ψ0(t)+ψ0(t))γ

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

  • n=1ζ(2n)1nt2n=log(1t2sinc(πt))

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

  • n=2ζ(n)1n=1γ
  • n=1ζ(2n)1n=ln2
  • n=2ζ(n)1n((32)n11)=13lnπ
  • n=1(ζ(4n)1)=78π4(e2π+1e2π1).
  • n=2ζ(n)1n((1+i)n1in)=π4

where denotes the imaginary part of a complex number.

Another interesting series that relates to the natural logarithm of the lemniscate constant is the following

  • n=2[2(1)nζ(n)4nn(1)nζ(n)2nn]=ln(ϖ22)

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,[44] cf. Hurwitz zeta function), which coincides with the Riemann zeta function when Template:Math (the lower limit of summation in the Hurwitz zeta function is 0, not 1), the [[Dirichlet L-function|Dirichlet Template:Mvar-functions]] and the Dedekind zeta function. For other related functions see the articles zeta function and [[L-function|Template:Mvar-function]].

The polylogarithm is given by

Lis(z)=k=1zkks

which coincides with the Riemann zeta function when Template:Math. The Clausen function Template:Math can be chosen as the real or imaginary part of Template:Math.

The Lerch transcendent is given by

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

which coincides with the Riemann zeta function when Template:Math and Template:Math (the lower limit of summation in the Lerch transcendent is 0, not 1).

The multiple zeta functions are defined by

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

One can analytically continue these functions to the Template:Mvar-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

References

Template:Reflist

Sources

Template:Refbegin

Template:Refend

Template:Use dmy dates Template:L-functions-footer Template:Series (mathematics) Template:Bernhard Riemann Template:Authority control

  1. Template:Cite web
  2. 2.0 2.1 Template:Cite journal
  3. Template:Cite web
  4. Template:Cite book
  5. Template:Cite book
  6. Template:Cite conference Template:Cite web
  7. Template:Cite journal
    Template:Cite journal
  8. Template:Cite journal
  9. https://link.springer.com/article/10.1007/s40687-019-0199-8
  10. Template:Cite web
  11. Template:Cite web
  12. Template:Cite journal
  13. Template:Cite journal
  14. Template:Cite journal
  15. Template:Cite journal
  16. Template:Cite journal
  17. Template:Cite journal
  18. Template:Cite journal
  19. Template:Cite journal
  20. Template:Cite journal
  21. Template:Cite journal
  22. Template:Cite journal
  23. Template:Cite journal
  24. Template:Cite book
  25. Template:Cite journal
  26. Further digits and references for this constant are available at Template:OEIS2C.
  27. Template:Cite journal
  28. Template:Cite book
  29. Template:Cite journal Reprinted in Math. USSR Izv. (1975) 9: 443–445.
  30. Template:Cite journal
  31. Template:Cite journal
  32. Template:Cite book
  33. Template:Cite journal
  34. Template:Cite journal
  35. Template:Cite journal
  36. Template:Cite journal
  37. 37.0 37.1 Template:Cite book
  38. Template:Cite journal translated and reprinted in Template:Cite book
  39. Trivial exceptions of values of Template:Mvar that cause removable singularities are not taken into account throughout this article.
  40. Template:Cite book
  41. Template:Cite journal
  42. Template:Cite web
  43. 43.0 43.1 Template:Cite journal
  44. 44.0 44.1 44.2 Template:Cite journal
  45. Template:Cite journal
  46. Template:Cite journal
  47. Template:Cite journal
  48. Template:Cite journal
  49. Template:Cite journal
  50. Template:Cite journal
  51. Template:Cite journal
  52. Template:Cite journal
  53. Template:Cite journal
  54. Template:Cite journal
  55. Template:Cite book
  56. Template:Cite journal
  57. Template:Cite journal
  58. Template:Cite web
  59. Template:Cite journal
  60. Template:Cite journal.
  61. Template:Cite web
  62. Template:Cite web
  63. Template:Cite book
  64. Most of the formulas in this section are from § 4 of J. M. Borwein et al. (2000)