ConceptComplete

Euler Products and Multiplicativity

Euler products reveal the profound connection between additive structure (summing over integers) and multiplicative structure (products over primes), forming the heart of analytic number theory.

DefinitionEuler Product

A Dirichlet series F(s)=βˆ‘n=1∞an/nsF(s) = \sum_{n=1}^{\infty} a_n/n^s has an Euler product if it can be written as:

F(s)=∏p primeFp(s)F(s) = \prod_{p \text{ prime}} F_p(s)

where Fp(s)F_p(s) depends only on the prime pp. This holds when ana_n is multiplicative.

TheoremEuler Product for Multiplicative Functions

If ff is a multiplicative arithmetic function and F(s)=βˆ‘n=1∞f(n)/nsF(s) = \sum_{n=1}^{\infty} f(n)/n^s converges absolutely for β„œ(s)>Οƒ\Re(s) > \sigma, then:

F(s)=∏p(1+f(p)ps+f(p2)p2s+f(p3)p3s+⋯ )F(s) = \prod_{p} \left(1 + \frac{f(p)}{p^s} + \frac{f(p^2)}{p^{2s}} + \frac{f(p^3)}{p^{3s}} + \cdots \right)

If ff is completely multiplicative:

F(s)=∏p11βˆ’f(p)pβˆ’sF(s) = \prod_{p} \frac{1}{1 - f(p)p^{-s}}
ExampleClassical Euler Products
  • Zeta function: ΞΆ(s)=∏p11βˆ’pβˆ’s\zeta(s) = \prod_{p} \frac{1}{1 - p^{-s}} (for β„œ(s)>1\Re(s) > 1)
  • Reciprocal zeta: 1ΞΆ(s)=∏p(1βˆ’pβˆ’s)=βˆ‘n=1∞μ(n)ns\frac{1}{\zeta(s)} = \prod_{p} (1 - p^{-s}) = \sum_{n=1}^{\infty} \frac{\mu(n)}{n^s}
  • Totient: ΞΆ(sβˆ’1)ΞΆ(s)=βˆ‘n=1βˆžΟ†(n)ns=∏p1βˆ’pβˆ’s1βˆ’p1βˆ’s\frac{\zeta(s-1)}{\zeta(s)} = \sum_{n=1}^{\infty} \frac{\varphi(n)}{n^s} = \prod_{p} \frac{1 - p^{-s}}{1 - p^{1-s}}

The Euler product for ΞΆ(s)\zeta(s) immediately proves the infinitude of primes: if there were finitely many primes, the right side would be a finite product, but the left side has a pole at s=1s=1.

DefinitionLogarithmic Derivative

Taking the logarithmic derivative of an Euler product reveals prime information:

βˆ’ΞΆβ€²(s)ΞΆ(s)=βˆ‘n=1βˆžΞ›(n)ns-\frac{\zeta'(s)}{\zeta(s)} = \sum_{n=1}^{\infty} \frac{\Lambda(n)}{n^s}

where Ξ›(n)\Lambda(n) is the von Mangoldt function:

Ξ›(n)={log⁑pifΒ n=pkΒ forΒ primeΒ p0otherwise\Lambda(n) = \begin{cases} \log p & \text{if } n = p^k \text{ for prime } p \\ 0 & \text{otherwise} \end{cases}
ExamplePrime Number Theorem Connection

The Prime Number Theorem (Ο€(x)∼x/log⁑x\pi(x) \sim x/\log x) is equivalent to:

βˆ‘p≀x1∼xlog⁑x\sum_{p \leq x} 1 \sim \frac{x}{\log x}

Using partial summation and the Wiener-Ikehara theorem, this reduces to showing:

ΞΆβ€²(s)ΞΆ(s)=βˆ’βˆ‘n=1βˆžΞ›(n)ns\frac{\zeta'(s)}{\zeta(s)} = -\sum_{n=1}^{\infty} \frac{\Lambda(n)}{n^s}

has a simple pole at s=1s=1 and extends holomorphically to β„œ(s)=1\Re(s) = 1.

Remark

Euler products encode the Fundamental Theorem of Arithmetic (unique prime factorization) in analytic form. Each prime contributes independently, and the product structure mirrors the multiplicative nature of integers.

The Euler product philosophyβ€”that global properties of integers reflect local properties at each primeβ€”pervades modern number theory, from L-functions to the Langlands program.