MathLabs
TheoremProved

Euler product formula for ζ(s)

Statement

For Re(s)>1\mathrm{Re}(s)>1, the Riemann zeta function satisfies ζ(s)=∑n=1∞1ns=∏p11−p−s\zeta(s)=\displaystyle\sum_{n=1}^\infty \frac{1}{n^s} = \prod_p \frac{1}{1-p^{-s}}, the product ranging over all primes pp.

Why is it true?

Because every positive integer factors uniquely into primes, summing 1/ns1/n^s over all nn is the same as choosing, for each prime independently, how many times it appears in nn — exactly what the geometric series ∑k≥0p−ks=(1−p−s)−1\sum_{k\ge0} p^{-ks} = (1-p^{-s})^{-1} encodes for each prime.

Proof sketch

Expand each factor (1−p−s)−1=∑k≥0p−ks(1-p^{-s})^{-1}=\sum_{k\ge0}p^{-ks} as a geometric series (valid for Re(s)>1\mathrm{Re}(s)>1). Multiplying these series over all primes p≤Np\le N and using unique factorization, every integer n≤Nn\le N appears exactly once as a term n−sn^{-s} in the expansion; the remaining terms (from integers with a prime factor >N>N, or products beyond NN) form a tail that vanishes as N→∞N\to\infty, giving ζ(s)=∏p(1−p−s)−1\zeta(s)=\prod_p(1-p^{-s})^{-1}.

Stated by

Proved by

Topics that use this theorem

Related theorems

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Leonhard Euler (1737). Variae observationes circa series infinitas
  2. Tom M. Apostol (1976). Introduction to Analytic Number Theory · DOI:10.1007/978-1-4757-5579-4