Euler product

From HandWiki
Short description: Infinite products of functions indexed by primes

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 a is a bounded multiplicative function, then the Dirichlet series

∑n=1∞a(n)ns

is equal to

∏p∈ℙP(p,s)for Re⁡(s)>1.

where the product is taken over prime numbers p, and P(p, s) is the sum

∑k=0∞a(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) be multiplicative: this says exactly that a(n) is the product of the a(pk) whenever n factors as the product of the powers pk of distinct primes p.

An important special case is that in which a(n) is totally multiplicative, so that P(p, s) is a geometric series. Then

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

as is the case for the Riemann zeta function, where a(n) = 1, 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 m, and the representation theory for GLm.

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), also using the sum of the geometric series, is

∏p∈ℙ(11−1ps)=∏p ∈ ℙ(∑k=0∞1pks)=∑n=1∞1ns=ζ(s).

while for the Liouville function λ(n) = (−1)ω(n), it is

∏p∈ℙ(11+1ps)=∑n=1∞λ(n)ns=ζ(2s)ζ(s).

Using their reciprocals, two Euler products for the Möbius function μ(n) are

∏p∈ℙ(1−1ps)=∑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+1ps1−1ps)=∏p∈ℙ(ps+1ps−1)=ζ(s)2ζ(2s).

Since for even values of s the Riemann zeta function ζ(s) has an analytic expression in terms of a rational multiple of πs, then for even exponents, this infinite product evaluates to a rational number. For example, since ζ(2) = ⁠π2/6⁠, ζ(4) = ⁠π4/90⁠, and ζ(8) = ⁠π8/9450⁠, then

∏p∈ℙ(p2+1p2−1)=53⋅108⋅2624⋅5048⋅122120⋯=ζ(2)2ζ(4)=52,∏p∈ℙ(p4+1p4−1)=1715⋅8280⋅626624⋅24022400⋯=ζ(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=1∞2ω(n)ns=ζ(s)2ζ(2s),

where ω(n) counts the number of distinct prime factors of n, and 2ω(n) is the number of square-free divisors.

If χ(n) is a Dirichlet character of conductor N, so that χ is totally multiplicative and χ(n) only depends on n mod N, and χ(n) = 0 if n is not coprime to N, then

∏p∈ℙ11−χ(p)ps=∑n=1∞χ(n)ns.

Here it is convenient to omit the primes p dividing the conductor N from the product.

Notable constants

Many well known constants have Euler product expansions.

The Leibniz formula for π

π4=∑n=0∞(−1)n2n+1=1−13+15−17+⋯

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=(∏p≡1(mod4)pp−1)(∏p≡3(mod4)pp+1)=34⋅54⋅78⋅1112⋅1312⋯,

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, one finds that

π2=(∏p≡1(mod4)pp+1)(∏p≡3(mod4)pp−1).

Taking the ratio of the previous two products gives

2=(∏p≡1(mod4)p−1p+1)(∏p≡3(mod4)p+1p−1).

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

Other Euler products for known constants include:

∏p>2(1−1(p−1)2)=0.660161...
π4∏p≡1(mod4)(1−1p2)12=0.764223...12∏p≡3(mod4)(1−1p2)−12=0.764223...
∏p(1+1(p−1)2)=2.826419...
  • The strongly carefree constant ×ζ(2)2 OEIS: A065472:
∏p(1−1(p+1)2)=0.775883...
∏p(1−1p(p−1))=0.373955...
∏p(1+1p(p−1))=3152π4ζ(3)=1.943596...
∏p(1−1p(p+1))=0.704442...
and its reciprocal OEIS: A065489:
∏p(1+1p2+p−1)=1.419562...
12+12∏p(1−2p2)=0.661317...
∏p(1−1p2(p+1))=0.881513...
∏p(1+1p2(p−1))=1.339784...
∏p>2(1−p+2p3)=0.723648...
∏p(1−2p−1p3)=0.428249...
∏p(1−3p−2p3)=0.286747...
∏p(1−pp3−1)=0.575959...
∏p(1+3p2−1p(p+1)(p2−1))=2.596536...
∏p(1−3p3+2p4+1p5−1p6)=0.678234...
∏p(1−1p)7(1+7p+1p2)=0.0013176...

Notes

References

  • 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)
  • Apostol, Tom M. (1976), Introduction to analytic number theory, Undergraduate Texts in Mathematics, New York-Heidelberg: Springer-Verlag, ISBN 978-0-387-90163-3  (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) ISBN 0-19-853171-0 (Chapter 17 gives further examples.)
  • George E. Andrews, Bruce C. Berndt, Ramanujan's Lost Notebook: Part I, Springer (2005), ISBN 0-387-25529-X
  • G. Niklasch, Some number theoretical constants: 1000-digit values"