Euler product
From Wikipedia, the free encyclopedia
In mathematics, an Euler product is an infinite product expansion, indexed by prime numbers p, of a Dirichlet series. The name arose from the case of the Riemann zeta-function, where such a product representation was proved by Euler.
In general, a Dirichlet series of the form
where a(n) is a multiplicative function of n may be written as
where P(p,s) is the sum
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) when 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
as is the case for the Riemann zeta-function, where a(n) = 1), and more generally for Dirichlet characters.
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.
The Euler product attached to the Riemann zeta function, using also the sum of the geometric series, is
.
An Euler product for the Möbius function μ(n) is
.
Further products derived from the zeta function are
where λ(n) = ( − 1)Ω(n) is the Liouville function, and
.
Similarly
where ω(n) counts the number of distinct prime factors of n and 2ω(n) 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 modulo N, and χ(n) = 0 if n is not coprime to N then
.
Here it is convenient to omit the primes p dividing the conductor N from the product.
Ramanujan in his notebooks tried to generalize the Euler product for Zeta function in the form:
s > 1
where Li_s (x) is the Polylogarithm for x=1 the product above is just 1 / ζ(s)
searching for a way to obtain prime powers as roots of a certain function f(x, s).
- G. Polya, Induction and Analogy in Mathematics Volume 1 (1954) Princeton University Press 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)
- Tom M. Apostol, Introduction to Analytic Number Theory, (1976) Springer-Verlag, New York. ISBN 0-387-90163-9 (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.))'
- 'Ramanujan lost notebook'[[1]]
- Euler product on PlanetMath
- Eric W. Weisstein, Euler Product at MathWorld.





