Proof of the Euler product formula for the Riemann zeta function

Proof of the Euler product formula for the Riemann zeta function

We will prove that the following formula holds::egin{align} \\zeta(s) & = 1+frac{1}{2^s}+frac{1}{3^s}+frac{1}{4^s}+frac{1}{5^s}+ cdots \\ & = prod_{p} frac{1}{1-p^{-s \\ end{align}

where ζ denotes the Riemann zeta function and the product extends over all prime numbers "p".

[
Eratosthenes used to sieve out prime numbers is employed in this proof.]

Proof of the Euler product formula

This sketch of a proof only makes use of simple algebra that most high school students can understand. This was originally the method by which Euler discovered the formula. There is a certain sieving property that we can use to our advantage:

:zeta(s) = 1+frac{1}{2^s}+frac{1}{3^s}+frac{1}{4^s}+frac{1}{5^s}+ cdots

:frac{1}{2^s}zeta(s) = frac{1}{2^s}+frac{1}{4^s}+frac{1}{6^s}+frac{1}{8^s}+frac{1}{10^s}+ cdots

Subtracting the second from the first we remove all elements that have a factor of 2:

:left(1-frac{1}{2^s} ight)zeta(s) = 1+frac{1}{3^s}+frac{1}{5^s}+frac{1}{7^s}+frac{1}{9^s}+frac{1}{11^s}+frac{1}{13^s}+ cdots

Repeating for the next term:

:frac{1}{3^s}left(1-frac{1}{2^s} ight)zeta(s) = frac{1}{3^s}+frac{1}{9^s}+frac{1}{15^s}+frac{1}{21^s}+frac{1}{27^s}+frac{1}{33^s}+ cdots

Subtracting again we get:

:left(1-frac{1}{3^s} ight)left(1-frac{1}{2^s} ight)zeta(s) = 1+frac{1}{5^s}+frac{1}{7^s}+frac{1}{11^s}+frac{1}{13^s}+frac{1}{17^s}+ cdots

where all elements having a factor of 3 or 2 (or both) are removed.

It can be seen that the right side is being sieved. Repeating infinitely we get:

: cdots left(1-frac{1}{11^s} ight)left(1-frac{1}{7^s} ight)left(1-frac{1}{5^s} ight)left(1-frac{1}{3^s} ight)left(1-frac{1}{2^s} ight)zeta(s) = 1

Dividing both sides by everything but the zeta(s) we obtain:

: zeta(s) = frac{1}{left(1-frac{1}{2^s} ight)left(1-frac{1}{3^s} ight)left(1-frac{1}{5^s} ight)left(1-frac{1}{7^s} ight)left(1-frac{1}{11^s} ight) cdots }

This can be written more concisely as an infinite product over all primes "p":

:zeta(s);=;prod_{p} (1-p^{-s})^{-1}.

To make this proof rigorous, we need only observe that when Re(s) > 1, the sieved right-hand side approaches 1, which follows immediately from the convergence of the Dirichlet series for zeta(s).

An interesting result can be found for zeta(1)

: cdots left(1-frac{1}{11} ight)left(1-frac{1}{7} ight)left(1-frac{1}{5} ight)left(1-frac{1}{3} ight)left(1-frac{1}{2} ight)zeta(1) = 1 which can also be written as,: cdots left(frac{10}{11} ight)left(frac{6}{7} ight)left(frac{4}{5} ight)left(frac{2}{3} ight)left(frac{1}{2} ight)zeta(1) = 1 which is, : left(frac{... 10.6.4.2.1}{... 11.7.5.3.2} ight)zeta(1) = 1 as,zeta(1) = 1+frac{1}{2}+frac{1}{3}+frac{1}{4}+frac{1}{5}+ cdots

thus,

: 1+frac{1}{2}+frac{1}{3}+frac{1}{4}+frac{1}{5}+ cdots ;=; left(frac{... 11.7.5.3.2}{... 10.6.4.2.1} ight)

We know that the left-hand side of the equation diverges to infinity therefore the numerator on the right-hand side (the series of primes) must also be infinite for divergence.

Another proof

Each factor (for a given prime "p") in the product above can be expanded to a geometric series consisting of the reciprocal of "p" raised to multiples of "s", as follows

:frac{1}{1-p^{-s = 1 + frac{1}{p^s} + frac{1}{p^{2s + frac{1}{p^{3s + cdots + frac{1}{p^{ks + cdots

When zeta(s) > 1, left|p^{-s} ight| < 1 and this series converges absolutely. Hence we may take a finite number of factors, multiply them together, and rearrange terms. Taking all the primes "p" up to some prime number limit "q", we have

:left|zeta(s) - prod_{p le q}left(frac{1}{1-p^{-s ight) ight| < sum_{n=q+1}^infty frac{1}{n^sigma}

where &sigma; is the real part of "s". By the fundamental theorem of arithmetic, the partial product when expanded out gives a sum consisting of those terms frac{1}{n^s} where "n" is a product of primes less than or equal to "q". The inequality results from the fact that therefore only integers larger than "q" can fail to appear in this expanded out partial product. Since the difference between the partial product and &zeta;("s") goes to zero when &sigma; > 1, we have convergence in this region.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Riemann zeta function — ζ(s) in the complex plane. The color of a point s encodes the value of ζ(s): dark colors denote values close to zero and hue encodes the value s argument. The white spot at s = 1 is the pole of the zeta function; the black spots on the… …   Wikipedia

  • Proof that the sum of the reciprocals of the primes diverges — In the third century BC, Euclid proved the existence of infinitely many prime numbers. In the 18th century, Leonhard Euler proved a stronger statement: the sum of the reciprocals of all prime numbers diverges. Here, we present a number of proofs… …   Wikipedia

  • Riemann hypothesis — 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 …   Wikipedia

  • Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal …   Wikipedia

  • Gamma function — For the gamma function of ordinals, see Veblen function. The gamma function along part of the real axis In mathematics, the gamma function (represented by the capital Greek letter Γ) is an extension of the factorial function, with its… …   Wikipedia

  • Divergence of the sum of the reciprocals of the primes — The sum of the reciprocals of all prime numbers diverges, that is: This was proved by Leonhard Euler in 1737, and strengthens Euclid s 3rd century BC result that there are infinitely many prime numbers. There is a variety of proofs of Euler s… …   Wikipedia

  • Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… …   Wikipedia

  • Divisor function — σ0(n) up to n = 250 Sigma function σ …   Wikipedia

  • Leonhard Euler — Infobox Scientist name = Leonhard Euler|box width = 300px |200px image width = 200px caption = Portrait by Johann Georg Brucker birth date = birth date|df=yes|1707|4|15 birth place = Basel, Switzerland death date = 18 September (O.S 7 September)… …   Wikipedia

  • Dirichlet L-function — In mathematics, a Dirichlet L series is a function of the form Here χ is a Dirichlet character and s a complex variable with real part greater than 1. By analytic continuation, this function can be extended to a meromorphic function on the whole… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”