- Euler product
In
number theory , an Euler product is aninfinite product expansion, indexed byprime number s "p", of aDirichlet series . The name arose from the case of the Riemann zeta-function, where such a product representation was proved byEuler .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 function s, 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"("p""k") when "n" factors as the product of the powers "p""k" of distinct primes "p".An important special case is that in which "a"("n") is
totally multiplicative , so that "P"("p","s") is ageometric series . Then:
as is the case for the Riemann zeta-function, where "a"("n") = 1), and more generally for
Dirichlet character s.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 form s it is typical to have Euler products with quadratic polynomials in the denominator here. The generalLanglands philosophy includes a comparable explanation of the connection of polynomials of degree "m", and therepresentation theory for GL"m".Examples of Euler products
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 is:.
Further products derived from the zeta function are
:
where is the
Liouville function , and:.
Similarly:
where counts the number of distinct prime factors of "n" and the number of square-free divisors.
If is a Dirichlet character of "conductor" , so that is totally multiplicative and only depends on "n" modulo "N", and 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 is the
polylogarithm . For x=1 the product above is justReferences
* 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)"
* "(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-XExternal links
*
*
Wikimedia Foundation. 2010.