Euler product

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description In number theory, an Euler product is an expansion of a Dirichlet series into an infinite product indexed by prime numbers. The original such product was given for the sum of all positive integers raised to a certain power as proven by Leonhard Euler. This series and its continuation to the entire complex plane would later become known as the Riemann zeta function.

Definition

In general, if Template:Mvar is a bounded multiplicative function, then the Dirichlet series

n=1a(n)ns

is equal to

pP(p,s)for Re(s)>1.

where the product is taken over prime numbers Template:Mvar, and P(p, s)Script error: No such module "Check for unknown parameters". is the sum

k=0a(pk)pks=1+a(p)ps+a(p2)p2s+a(p3)p3s+

In fact, if we consider these as formal generating functions, the existence of such a formal Euler product expansion is a necessary and sufficient condition that a(n)Script error: No such module "Check for unknown parameters". be multiplicative: this says exactly that a(n)Script error: No such module "Check for unknown parameters". is the product of the a(pk)Script error: No such module "Check for unknown parameters". whenever Template:Mvar factors as the product of the powers pkScript error: No such module "Check for unknown parameters". of distinct primes Template:Mvar.

An important special case is that in which a(n)Script error: No such module "Check for unknown parameters". is totally multiplicative, so that P(p, s)Script error: No such module "Check for unknown parameters". is a geometric series. Then

P(p,s)=11a(p)ps,

as is the case for the Riemann zeta function, where a(n) = 1Script error: No such module "Check for unknown parameters"., and more generally for Dirichlet characters.

Convergence

In practice all the important cases are such that the infinite series and infinite product expansions are absolutely convergent in some region

Re(s)>C,

that is, in some right half-plane in the complex numbers. This already gives some information, since the infinite product, to converge, must give a non-zero value; hence the function given by the infinite series is not zero in such a half-plane.

In the theory of modular forms it is typical to have Euler products with quadratic polynomials in the denominator here. The general Langlands philosophy includes a comparable explanation of the connection of polynomials of degree Template:Mvar, and the representation theory for GLmScript error: No such module "Check for unknown parameters"..

Examples

The following examples will use the notation for the set of all primes, that is:

={p|p is prime}.

The Euler product attached to the Riemann zeta function ζ(s)Script error: No such module "Check for unknown parameters"., also using the sum of the geometric series, is

p(111ps)=p  (k=01pks)=n=11ns=ζ(s).

while for the Liouville function λ(n) = (−1)ω(n)Script error: No such module "Check for unknown parameters"., it is

p(11+1ps)=n=1λ(n)ns=ζ(2s)ζ(s).

Using their reciprocals, two Euler products for the Möbius function μ(n)Script error: No such module "Check for unknown parameters". are

p(11ps)=n=1μ(n)ns=1ζ(s)

and

p(1+1ps)=n=1|μ(n)|ns=ζ(s)ζ(2s).

Taking the ratio of these two gives

p(1+1ps11ps)=p(ps+1ps1)=ζ(s)2ζ(2s).

Since for even values of Template:Mvar the Riemann zeta function ζ(s)Script error: No such module "Check for unknown parameters". has an analytic expression in terms of a rational multiple of πsScript error: No such module "Check for unknown parameters"., then for even exponents, this infinite product evaluates to a rational number. For example, since ζ(2) = Template:SfracScript error: No such module "Check for unknown parameters"., ζ(4) = Template:SfracScript error: No such module "Check for unknown parameters"., and ζ(8) = Template:SfracScript error: No such module "Check for unknown parameters"., then

p(p2+1p21)=5310826245048122120=ζ(2)2ζ(4)=52,p(p4+1p41)=1715828062662424022400=ζ(4)2ζ(8)=76,

and so on, with the first result known by Ramanujan. This family of infinite products is also equivalent to

p(1+2ps+2p2s+)=n=12ω(n)ns=ζ(s)2ζ(2s),

where ω(n)Script error: No such module "Check for unknown parameters". counts the number of distinct prime factors of Template:Mvar, and 2ω(n)Script error: No such module "Check for unknown parameters". is the number of square-free divisors.

If χ(n)Script error: No such module "Check for unknown parameters". is a Dirichlet character of conductor Template:Mvar, so that Template:Mvar is totally multiplicative and χ(n)Script error: No such module "Check for unknown parameters". only depends on n mod NScript error: No such module "Check for unknown parameters"., and χ(n) = 0Script error: No such module "Check for unknown parameters". if Template:Mvar is not coprime to Template:Mvar, then

p11χ(p)ps=n=1χ(n)ns.

Here it is convenient to omit the primes Template:Mvar dividing the conductor Template:Mvar from the product.

Notable constants

Many well known constants have Euler product expansions.

The [[Leibniz formula for π|Leibniz formula for Template:Pi]]

π4=n=0(1)n2n+1=113+1517+

can be interpreted as a Dirichlet series using the (unique) Dirichlet character modulo 4, and converted to an Euler product of superparticular ratios (fractions where numerator and denominator differ by 1):

π4=(p1(mod4)pp1)(p3(mod4)pp+1)=34547811121312,

where each numerator is a prime number and each denominator is the nearest multiple of 4.[1]

Dividing the Euler product for ζ(2)=π26 by the previous product, known as Basel problem, one finds that

π2=(p1(mod4)pp+1)(p3(mod4)pp1).

Taking the ratio of the previous two products gives

2=(p1(mod4)p1p+1)(p3(mod4)p+1p1).

The infinite products must be taken in order of increasing primes.

Other Euler products for known constants include:

p>2(11(p1)2)=0.660161...
π4p1(mod4)(11p2)12=0.764223...12p3(mod4)(11p2)12=0.764223...
p(1+1(p1)2)=2.826419...
p(11(p+1)2)=0.775883...
p(11p(p1))=0.373955...
p(1+1p(p1))=3152π4ζ(3)=1.943596...
p(11p(p+1))=0.704442...
and its reciprocal OEISA065489:
p(1+1p2+p1)=1.419562...
12+12p(12p2)=0.661317...
p(11p2(p+1))=0.881513...
p(1+1p2(p1))=1.339784...
p>2(1p+2p3)=0.723648...
p(12p1p3)=0.428249...
p(13p2p3)=0.286747...
p(1pp31)=0.575959...
p(1+3p21p(p+1)(p21))=2.596536...
p(13p3+2p4+1p51p6)=0.678234...
p(11p)7(1+7p+1p2)=0.0013176...

Notes

<templatestyles src="Reflist/styles.css" />

  1. Script error: No such module "citation/CS1"..

Script error: No such module "Check for unknown parameters".

References

<templatestyles src="Refbegin/styles.css" />

  • G. Polya, Induction and Analogy in Mathematics Volume 1 Princeton University Press (1954) L.C. Card 53-6388 (A very accessible English translation of Euler's memoir regarding this "Most Extraordinary Law of the Numbers" appears starting on page 91)
  • Script error: No such module "citation/CS1". (Provides an introductory discussion of the Euler product in the context of classical number theory.)
  • G.H. Hardy and E.M. Wright, An introduction to the theory of numbers, 5th ed., Oxford (1979) Template:Isbn (Chapter 17 gives further examples.)
  • George E. Andrews, Bruce C. Berndt, Ramanujan's Lost Notebook: Part I, Springer (2005), Template:Isbn
  • G. Niklasch, Some number theoretical constants: 1000-digit values

External links

<templatestyles src="Refbegin/styles.css" />

Template:Authority control