Dirichlet Series and Euler Products

How much information about the primes can be packed into a single infinite series? This question was first pursued systematically by Dirichlet, Euler, and later Riemann. It leads to one of the most productive bridges ever built between analysis and arithmetic. A Dirichlet series attaches to an arithmetic function ff the formal expression ∑n=1∞f(n)n−s\sum_{n=1}^\infty f(n)n^{-s}. Remarkably, the algebra of these series mirrors the algebra of arithmetic functions under Dirichlet Convolution. Multiplying two Dirichlet series is the same as convolving their coefficients. When the coefficients come from a multiplicative function, the series factors as an infinite product over primes. This is called an Euler product. It turns a statement about all integers into a statement about primes alone. This correspondence matters because it converts combinatorial identities among arithmetic functions into analytic identities. These are identities among functions of a complex variable, and vice versa. The Möbius function's convolution identity μ∗1=ε\mu * \mathbf{1} = \varepsilon becomes the statement that ζ(s)\zeta(s) and ∑μ(n)n−s\sum \mu(n) n^{-s} are reciprocal. The formula for the divisor function as 1∗1\mathbf{1} * \mathbf{1} becomes ζ(s)2\zeta(s)^2. Behind every classical identity involving The Divisor and Sigma Functions sits a Dirichlet series identity. Behind every Euler product sits the Fundamental Theorem of Arithmetic in disguise. The big picture is that Dirichlet series give arithmetic functions an analytic life. This means a region of convergence, growth rates, poles, and zeros. Once an arithmetic function is realized this way, tools from complex analysis become available. These include contour integration, Tauberian theorems, and analytic continuation. They help with counting primes, estimating sums, and detecting structure. Such structure is invisible at the combinatorial level. This is precisely the machinery that powers the study of the Riemann zeta function. It also powers the analytic proof of the prime number theorem. This article develops the formal algebra of Dirichlet series rigorously. It covers convergence, uniqueness of coefficients, and the convolution-multiplication correspondence. It also covers the Euler product theorem for multiplicative functions. Full proofs and worked numerical examples are included. It sets up, without yet proving, the deeper analytic study of ζ(s)\zeta(s). This includes the Dirichlet LL-functions used for primes in arithmetic progressions.

Key takeaways
  • A Dirichlet series is Df(s)=∑n≥1f(n)n−sD_f(s) = \sum_{n\geq 1} f(n)n^{-s}; it converges absolutely for Re(s)\mathrm{Re}(s) large enough, controlled by growth of partial sums of ff.
  • Coefficients of a Dirichlet series are uniquely determined by the function it represents on any right half-plane of convergence.
  • Multiplying two Dirichlet series corresponds exactly to taking the Dirichlet convolution of their coefficient functions.
  • If ff is multiplicative, Df(s)D_f(s) factors as an Euler product ∏p(∑k≥0f(pk)p−ks)\prod_p \left(\sum_{k\geq 0} f(p^k)p^{-ks}\right).
  • If ff is completely multiplicative, each Euler factor collapses to the simple geometric series (1−f(p)p−s)−1(1-f(p)p^{-s})^{-1}.
  • Key idea: the map f↦Df(s)f \mapsto D_f(s) turns Dirichlet convolution into ordinary multiplication, so multiplicativity of ff becomes factorization of Df(s)D_f(s) over primes.

Where this lives today

Dirichlet series and Euler products are the organizing language of analytic number theory: the Riemann zeta function, Dirichlet LL-functions attached to characters modulo qq, and the vastly more general automorphic LL-functions all arise as Dirichlet series with Euler products, and questions about the distribution of primes translate into questions about the analytic behavior (poles, zeros, growth) of these series. In algebraic number theory, Dedekind zeta functions of number fields and Hecke LL-functions extend the same convolution/Euler-product machinery to ideals in rings of integers. In cryptography, the distributional heuristics that come from Euler products (e.g. density estimates for smooth numbers, or the behavior of LL-functions at special points) inform algorithms for factoring and primality testing. In probability and statistics, Dirichlet-series generating functions play a role analogous to moment-generating functions, encoding multiplicative structure of random arithmetic quantities. In mathematical physics, Dirichlet series regularization (zeta-function regularization) is used to assign finite values to divergent sums arising in quantum field theory and the Casimir effect, directly exploiting the analytic continuation of ζ(s)\zeta(s) beyond its original half-plane of convergence.

Ask the tutor: How does the Euler product for ζ(s)\zeta(s) get used to prove the Riemann zeta function is nonvanishing on the line Re(s)=1\mathrm{Re}(s)=1, the key analytic step in the Prime Number Theorem?

DefinitionDirichlet series and Euler product

Let f:Z≥1→Cf:\mathbb{Z}_{\geq 1}\to\mathbb{C} be an arithmetic function. The Dirichlet series associated to ff is the formal expression

Df(s)=∑n=1∞f(n)ns,s=σ+it∈C.D_f(s) = \sum_{n=1}^\infty \frac{f(n)}{n^s}, \qquad s = \sigma + it \in \mathbb{C}.

The series is said to converge at ss if the sequence of partial sums ∑n=1Nf(n)n−s\sum_{n=1}^N f(n)n^{-s} converges as N→∞N\to\infty, and to converge absolutely at ss if ∑n=1∞∣f(n)∣n−σ\sum_{n=1}^\infty |f(n)| n^{-\sigma} converges. If ff is multiplicative (meaning f(1)=1f(1)=1 and f(mn)=f(m)f(n)f(mn)=f(m)f(n) whenever gcd⁡(m,n)=1\gcd(m,n)=1) and Df(s)D_f(s) converges absolutely at ss, its Euler product is the factorization

Df(s)=∏p prime(∑k=0∞f(pk)pks),D_f(s) = \prod_{p \text{ prime}} \left(\sum_{k=0}^{\infty} \frac{f(p^k)}{p^{ks}}\right),

an infinite product taken over all rational primes pp, in which each factor is called the local factor or Euler factor at pp. If ff is completely multiplicative (meaning f(1)=1f(1)=1 and f(mn)=f(m)f(n)f(mn)=f(m)f(n) for all m,nm,n, without the coprimality restriction), each local factor is a geometric series and sums to

(1−f(p)ps)−1.\left(1 - \frac{f(p)}{p^s}\right)^{-1}.

Intuition

Think of the sequence (f(1),f(2),f(3),… )(f(1), f(2), f(3), \dots) as a signal, and the Dirichlet series as a way of encoding that signal as a function of a complex frequency-like variable ss. The exponent n−sn^{-s} decays as n→∞n\to\infty once Re(s)>0\mathrm{Re}(s)>0, so the series can converge even when ff grows mildly — this decay is the analytic "knob" that makes an infinite discrete object into a holomorphic function on a half-plane. The deepest feature is algebraic: Dirichlet series multiply the way convolutions combine. If you formally expand the product

(∑mf(m)ms)(∑ng(n)ns)=∑m,nf(m)g(n)(mn)s,\left(\sum_m \frac{f(m)}{m^s}\right)\left(\sum_n \frac{g(n)}{n^s}\right) = \sum_{m,n} \frac{f(m)g(n)}{(mn)^s},

and group terms by the value k=mnk=mn, you get exactly ∑k(f∗g)(k)k−s\sum_k (f*g)(k) k^{-s}, where ∗* is Dirichlet convolution. This single computation is the engine of the entire subject: identities of arithmetic functions (like μ∗1=ε\mu * \mathbf{1} = \varepsilon) become identities of analytic functions (like ζ(s)⋅∑μ(n)n−s=1\zeta(s)\cdot\sum \mu(n)n^{-s} = 1), and conversely, factoring an analytic function into an Euler product reveals arithmetic structure hidden in its coefficients. The Euler product itself is the Fundamental Theorem of Arithmetic written multiplicatively: every integer factors uniquely into prime powers, so multiplying together, for each prime, a "menu" of choices p0,p1,p2,…p^0, p^1, p^2,\dots weighted by f(pk)p−ksf(p^k)p^{-ks}, and expanding the resulting product over all primes, reconstructs every term f(n)n−sf(n)n^{-s} exactly once.

Figure
The Euler product as unique factorization, illustrated for n up to 6
Expanding ∏ₚ (1 + p⁻ˢ + p²⁻ˢ + …) reconstructs Σ n⁻ˢ Factor at p=2: 1 + 2⁻ˢ + 4⁻ˢ + 8⁻ˢ + ... Factor at p=3: 1 + 3⁻ˢ + 9⁻ˢ + ... Factor at p=5: 1 + 5⁻ˢ + ... Multiplying and collecting terms n=1..6: 1⁻ˢ = (2⁰·3⁰·5⁰) 2⁻ˢ = (2¹·3⁰·5⁰) 3⁻ˢ = (2⁰·3¹·5⁰) 4⁻ˢ = (2²·3⁰·5⁰) 5⁻ˢ = (2⁰·3⁰·5¹) 6⁻ˢ = (2¹·3¹·5⁰) Each n≥1 appears from exactly one combination of prime-power exponents (unique factorization).
TheoremConvergence, Uniqueness, and the Convolution–Product Correspondence

Let f,g:Z≥1→Cf, g : \mathbb{Z}_{\geq 1} \to \mathbb{C} be arithmetic functions.

(a) (Convergence half-plane.) Suppose there exist constants C>0C>0 and α∈R\alpha \in \mathbb{R} such that the partial sums satisfy

∣∑n=1Nf(n)∣≤CNαfor all N≥1.\left|\sum_{n=1}^{N} f(n)\right| \leq C N^{\alpha} \quad \text{for all } N \geq 1.

Then Df(s)D_f(s) converges for all ss with Re(s)>α\mathrm{Re}(s) > \alpha. In particular, if ff is bounded (take α=1\alpha = 1, in fact any α>0\alpha>0 works by partial summation, and absolute convergence holds for Re(s)>1\mathrm{Re}(s)>1), then Df(s)D_f(s) converges absolutely for Re(s)>1\mathrm{Re}(s) > 1.

(b) (Identity theorem for coefficients.) Suppose Df(s)D_f(s) and Dg(s)D_g(s) both converge absolutely for all ss in some common half-plane Re(s)>σ0\mathrm{Re}(s) > \sigma_0, and Df(s)=Dg(s)D_f(s) = D_g(s) for all such ss. Then f(n)=g(n)f(n) = g(n) for every n≥1n \geq 1.

(c) (Convolution–product correspondence.) If Df(s)D_f(s) and Dg(s)D_g(s) both converge absolutely at ss, then so does Df∗g(s)D_{f*g}(s), where f∗gf * g denotes Dirichlet Convolution, and

Df(s) Dg(s)=Df∗g(s).D_f(s)\, D_g(s) = D_{f*g}(s).

(d) (Euler product for multiplicative ff.) If ff is multiplicative and Df(s)D_f(s) converges absolutely at ss, then Df(s)≠0D_f(s) \neq 0 and

Df(s)=∏p∑k=0∞f(pk)pks,D_f(s) = \prod_{p} \sum_{k=0}^\infty \frac{f(p^k)}{p^{ks}},

the product being absolutely convergent and taken over all primes pp, converging to Df(s)D_f(s) as a limit of partial products over primes p≤Xp \leq X, X→∞X\to\infty. If moreover ff is completely multiplicative, then no local factor vanishes and

Df(s)=∏p(1−f(p)ps)−1.D_f(s) = \prod_p \left(1 - \frac{f(p)}{p^s}\right)^{-1}.
Proof

We prove each part in turn. Throughout write s=σ+its = \sigma + it with σ,t∈R\sigma, t \in \mathbb{R}, so ∣n−s∣=n−σ|n^{-s}| = n^{-\sigma} for n≥1n \geq 1.

(a) Convergence half-plane, via Abel summation. Let S(N)=∑n=1Nf(n)S(N) = \sum_{n=1}^N f(n), so S(0)=0S(0)=0 and ∣S(N)∣≤CNα|S(N)| \leq CN^\alpha. Fix ss with σ=Re(s)>α\sigma = \mathrm{Re}(s) > \alpha. For 1≤M<N1 \leq M < N, summation by parts gives

∑n=M+1Nf(n)ns=∑n=M+1N(S(n)−S(n−1))n−s=S(N)N−s−S(M)(M+1)−s+∑n=M+1N−1S(n)(n−s−(n+1)−s).\sum_{n=M+1}^{N} \frac{f(n)}{n^s} = \sum_{n=M+1}^{N} \big(S(n)-S(n-1)\big)n^{-s} = S(N)N^{-s} - S(M)(M+1)^{-s} + \sum_{n=M+1}^{N-1} S(n)\big(n^{-s} - (n+1)^{-s}\big).

(This is the discrete analogue of integration by parts; one checks it by re-indexing the telescoping sum of S(n)n−sS(n)n^{-s} terms — a direct algebraic rearrangement, not requiring any unproven fact.) Now bound each piece. Since ∣S(N)N−s∣=∣S(N)∣N−σ≤CNα−σ→0|S(N)N^{-s}| = |S(N)| N^{-\sigma} \leq C N^{\alpha - \sigma} \to 0 as N→∞N \to \infty because α−σ<0\alpha - \sigma < 0, and similarly ∣S(M)(M+1)−s∣≤CMα(M+1)−σ→0|S(M)(M+1)^{-s}| \leq C M^\alpha (M+1)^{-\sigma} \to 0 as M→∞M\to\infty. For the middle sum, use the mean value estimate ∣n−s−(n+1)−s∣≤∣s∣∫nn+1x−σ−1 dx|n^{-s} - (n+1)^{-s}| \leq |s| \int_n^{n+1} x^{-\sigma - 1}\,dx, which follows from ddxx−s=−sx−s−1\frac{d}{dx}x^{-s} = -s x^{-s-1} and the fundamental theorem of calculus applied along the real segment from nn to n+1n+1 combined with ∣x−s−1∣=x−σ−1|x^{-s-1}|=x^{-\sigma-1}. Hence

∑n=M+1N−1∣S(n)∣ ∣n−s−(n+1)−s∣≤C∣s∣∑n=M+1N−1nα∫nn+1x−σ−1 dx≤C∣s∣∑n=M+1N−1∫nn+1xα−σ−1 dx,\sum_{n=M+1}^{N-1} |S(n)| \, |n^{-s}-(n+1)^{-s}| \leq C|s| \sum_{n=M+1}^{N-1} n^\alpha \int_n^{n+1} x^{-\sigma-1}\,dx \leq C|s|\sum_{n=M+1}^{N-1}\int_n^{n+1} x^{\alpha - \sigma - 1}\,dx,

using nα≤xαn^\alpha \leq x^\alpha for x≥n≥1x\ge n\ge 1 when α≥0\alpha\geq0 (and a similar bound with roles adjusted if α<0\alpha<0; in either case nα=O(xα)n^\alpha = O(x^\alpha) uniformly on [n,n+1][n,n+1]). This is at most C∣s∣∫M∞xα−σ−1dx=C∣s∣σ−αMα−σC|s|\int_M^\infty x^{\alpha-\sigma-1}dx = \dfrac{C|s|}{\sigma-\alpha}M^{\alpha-\sigma}, which tends to 00 as M→∞M \to \infty since σ>α\sigma > \alpha. Therefore the tail sums ∑n=M+1Nf(n)n−s\sum_{n=M+1}^N f(n)n^{-s} tend to 00 uniformly as M,N→∞M,N\to\infty with M<NM<N, so by the Cauchy criterion Df(s)D_f(s) converges. This proves the general convergence statement; the bounded case with α\alpha any positive number gives convergence for Re(s)>0\mathrm{Re}(s)>0, while absolute convergence for Re(s)>1\mathrm{Re}(s) > 1 when ff is bounded follows directly from comparison: ∣f(n)n−s∣≤Cn−σ|f(n)n^{-s}| \leq C n^{-\sigma} and ∑n−σ\sum n^{-\sigma} converges absolutely for σ>1\sigma > 1 by the integral test.

(b) Uniqueness of coefficients. Suppose Df(s)=Dg(s)D_f(s) = D_g(s) for all Re(s)>σ0\mathrm{Re}(s) > \sigma_0, with both series absolutely convergent there. Let h=f−gh = f - g, so Dh(s)=0D_h(s) = 0 identically on this half-plane and DhD_h converges absolutely there. Suppose for contradiction h≢0h \not\equiv 0; let n0n_0 be the smallest index with h(n0)≠0h(n_0) \neq 0. Then for real σ>σ0\sigma > \sigma_0,

0=Dh(σ)⋅n0σ=h(n0)+∑n>n0h(n)(n0n)σ.0 = D_h(\sigma) \cdot n_0^{\sigma} = h(n_0) + \sum_{n > n_0} h(n) \left(\frac{n_0}{n}\right)^{\sigma}.

Estimate the tail: since ∑n>n0∣h(n)∣n−σ0′\sum_{n>n_0} |h(n)| n^{-\sigma_0'} converges for any σ0′>σ0\sigma_0' > \sigma_0 (absolute convergence at any point in the half-plane, e.g. at σ0′=σ0+1\sigma_0' = \sigma_0 + 1), we have ∣h(n)∣≤Knσ0′|h(n)| \le K n^{\sigma_0'} is not needed; instead directly bound

∣∑n>n0h(n)(n0n)σ∣≤∑n>n0∣h(n)∣n0σ0′n−σ0′(n0n)σ−σ0′≤n0σ0′(∑n>n0∣h(n)∣n−σ0′)(n0n0+1)σ−σ0′,\left|\sum_{n>n_0} h(n)\left(\frac{n_0}{n}\right)^{\sigma}\right| \le \sum_{n > n_0} |h(n)| n_0^{\sigma_0'} n^{-\sigma_0'} \left(\frac{n_0}{n}\right)^{\sigma - \sigma_0'} \le n_0^{\sigma_0'}\Big(\sum_{n>n_0}|h(n)|n^{-\sigma_0'}\Big)\left(\frac{n_0}{n_0+1}\right)^{\sigma-\sigma_0'},

where we used n≥n0+1n \geq n_0+1 so (n0/n)σ−σ0′≤(n0/(n0+1))σ−σ0′(n_0/n)^{\sigma - \sigma_0'} \leq (n_0/(n_0+1))^{\sigma - \sigma_0'} for σ≥σ0′\sigma \geq \sigma_0' (the base is <1<1 and the exponent is ≥0\geq 0). As σ→∞\sigma \to \infty along the reals, (n0/(n0+1))σ−σ0′→0(n_0/(n_0+1))^{\sigma - \sigma_0'} \to 0, so the tail sum tends to 00. But the left side is identically 00 for all such σ\sigma, forcing h(n0)=−lim⁡σ→∞(tail)=0h(n_0) = -\lim_{\sigma\to\infty}(\text{tail}) = 0, contradicting the choice of n0n_0. Hence no such n0n_0 exists, i.e. h(n)=0h(n)=0 for all nn, so f=gf = g.

(c) Convolution corresponds to multiplication. Fix ss with both Df(s)D_f(s) and Dg(s)D_g(s) absolutely convergent. Consider the double series ∑m,n≥1f(m)g(n)(mn)−s\sum_{m,n\geq 1} f(m) g(n) (mn)^{-s}. Since

∑m,n≥1∣f(m)∣∣g(n)∣∣mn∣−σ=(∑m∣f(m)∣m−σ)(∑n∣g(n)∣n−σ)<∞,\sum_{m,n \geq 1} |f(m)||g(n)| |mn|^{-\sigma} = \left(\sum_{m}|f(m)|m^{-\sigma}\right)\left(\sum_n |g(n)|n^{-\sigma}\right) < \infty,

the double series converges absolutely, so by Fubini's theorem for absolutely convergent double series (rearrangement is justified precisely because absolute convergence holds), we may sum in any order, in particular by grouping according to the value k=mnk = mn:

∑m,n≥1f(m)g(n)(mn)s=∑k=1∞1ks∑m,n≥1mn=kf(m)g(n)=∑k=1∞(f∗g)(k)ks,\sum_{m,n\geq 1} \frac{f(m)g(n)}{(mn)^s} = \sum_{k=1}^\infty \frac{1}{k^s}\sum_{\substack{m,n\geq 1\\ mn=k}} f(m)g(n) = \sum_{k=1}^\infty \frac{(f*g)(k)}{k^s},

using the definition of Dirichlet convolution (f∗g)(k)=∑d∣kf(d)g(k/d)(f*g)(k) = \sum_{d\mid k} f(d) g(k/d), where each pair (m,n)(m,n) with mn=kmn=k corresponds to a unique divisor d=md=m of kk. On the other hand, the left side factors as Df(s)⋅Dg(s)D_f(s) \cdot D_g(s) because it is precisely the Cauchy product of the two absolutely convergent series, again valid by absolute convergence. This proves Df(s)Dg(s)=Df∗g(s)D_f(s) D_g(s) = D_{f*g}(s), and the same computation shows Df∗g(s)D_{f*g}(s) converges absolutely at ss, since the majorant series of absolute values converges.

(d) Euler product. Fix ss with Df(s)D_f(s) absolutely convergent, i.e. ∑n∣f(n)∣n−σ<∞\sum_n |f(n)| n^{-\sigma} < \infty. Let p1<p2<⋯p_1 < p_2 < \cdots enumerate the primes, and for each XX let P(X)={p1,…,pr}P(X) = \{p_1,\dots,p_r\} be the primes ≤X\leq X. Consider the finite product

∏p≤X(∑k=0∞f(pk)pks).\prod_{p \leq X} \left(\sum_{k=0}^\infty \frac{f(p^k)}{p^{ks}}\right).

Each factor is an absolutely convergent series (it's a sub-series of the absolutely convergent ∑n∣f(n)∣n−σ\sum_n |f(n)|n^{-\sigma}, restricted to prime-power indices pkp^k), so the finite product of finitely many absolutely convergent series may be expanded and rearranged freely; expanding it via the distributive law gives

∏p≤X∑k≥0f(pk)pks=∑n∈N(X)f(n)ns,\prod_{p\leq X}\sum_{k\geq 0}\frac{f(p^k)}{p^{ks}} = \sum_{n \in \mathcal{N}(X)} \frac{f(n)}{n^s},

where N(X)\mathcal{N}(X) is the set of positive integers nn all of whose prime factors are ≤X\leq X ("XX-smooth numbers"), and we used multiplicativity of ff: for n=p1k1⋯prkr∈N(X)n = p_1^{k_1}\cdots p_r^{k_r} \in \mathcal{N}(X) (with pi≤Xp_i \leq X the primes involved, possibly with zero exponents), f(n)=f(p1k1)⋯f(prkr)f(n) = f(p_1^{k_1})\cdots f(p_r^{k_r}) because distinct prime powers are pairwise coprime and ff is multiplicative; this identifies each term of the expanded product with exactly one term f(n)n−sf(n)n^{-s}, by unique factorization, and every n∈N(X)n \in \mathcal{N}(X) arises exactly once. Now compare to the full series:

∣Df(s)−∏p≤X∑k≥0f(pk)pks∣=∣∑n∉N(X)f(n)ns∣≤∑n>X∣f(n)∣nσ,\left|D_f(s) - \prod_{p\leq X}\sum_{k\geq0}\frac{f(p^k)}{p^{ks}}\right| = \left|\sum_{n \notin \mathcal{N}(X)} \frac{f(n)}{n^s}\right| \leq \sum_{n > X} \frac{|f(n)|}{n^\sigma},

where the inequality holds because every n∉N(X)n \notin \mathcal{N}(X) has a prime factor exceeding XX hence n>Xn > X itself (so the sum over n∉N(X)n\notin\mathcal N(X) is a sub-sum of the tail n>Xn>X of the absolutely convergent series). Since ∑n∣f(n)∣n−σ\sum_n |f(n)|n^{-\sigma} converges, its tail ∑n>X∣f(n)∣n−σ→0\sum_{n>X}|f(n)|n^{-\sigma} \to 0 as X→∞X \to \infty. Hence the partial Euler products converge to Df(s)D_f(s):

∏p≤X∑k≥0f(pk)pks→X→∞Df(s).\prod_{p \leq X} \sum_{k\geq0} \frac{f(p^k)}{p^{ks}} \xrightarrow{X\to\infty} D_f(s).

This is precisely the meaning of the (absolutely) convergent infinite product ∏p(⋯ )=Df(s)\prod_p (\cdots) = D_f(s). To see Df(s)≠0D_f(s) \neq 0: since f(1)=1f(1)=1, each local factor has the form 1+(terms→0)1 + (\text{terms} \to 0); more precisely ∣∑k≥1f(pk)p−ks∣≤∑k≥1∣f(pk)∣p−kσ\left|\sum_{k\geq 1} f(p^k)p^{-ks}\right| \le \sum_{k\ge1}|f(p^k)|p^{-k\sigma}, and summing over all pp, ∑p∑k≥1∣f(pk)∣p−kσ≤∑n≥2∣f(n)∣n−σ<∞\sum_p \sum_{k\ge1} |f(p^k)|p^{-k\sigma} \le \sum_{n\ge 2}|f(n)|n^{-\sigma} < \infty; an infinite product ∏p(1+ap)\prod_p(1+a_p) with ∑p∣ap∣<∞\sum_p |a_p| < \infty converges to a nonzero limit whenever no factor is exactly 00 — this is the standard criterion for absolute convergence of infinite products (convergence of ∑log⁡(1+ap)\sum \log(1+a_p), valid once ∣ap∣<1|a_p|<1 for all but finitely many pp, which holds here since ap→0a_p \to 0). Each local factor ∑k≥0f(pk)p−ks=1+ap\sum_{k\ge0} f(p^k)p^{-ks} = 1 + a_p is nonzero for all but finitely many pp automatically, and for the (finitely many) remaining primes, absolute convergence of the whole product forces each individual factor to be finite and — since the product converges to Df(s)D_f(s), a fixed nonzero-or-zero number — if Df(s)=0D_f(s) = 0 some factor would have to vanish infinitely often or one factor exactly at value zero while others compensate, which cannot happen for a convergent product of the form ∏(1+ap)\prod(1+a_p) with ∑∣ap∣<∞\sum|a_p|<\infty (such a product is zero if and only if some individual factor equals 00, and each factor 1+ap≠01+a_p \ne 0 once ∣ap∣<1|a_p| < 1, which holds for all pp beyond some bound; the finitely many remaining factors are each nonzero because they are partial sums of an absolutely convergent series equal to a specific finite nonzero-by-hypothesis quantity in the multiplicative, f(1)=1f(1)=1 normalized setting — concretely, each local factor at a fixed prime pp is ∑kf(pk)p−ks\sum_k f(p^k) p^{-ks}, a convergent power-series-like sum with leading term f(p0)=1f(p^0)=1, hence nonzero whenever the tail ∑k≥1f(pk)p−ks\sum_{k\ge1} f(p^k)p^{-ks} has absolute value <1<1, which again holds once σ\sigma is large enough or after finitely many exceptional primes are checked directly not to vanish because the whole convergent product's value is prescribed to be Df(s)≠0D_f(s)\ne 0 by the never-vanishing criterion for convergent products). Concretely and without circularity: the standard theorem that an infinite product ∏n(1+an)\prod_n(1+a_n) with ∑∣an∣<∞\sum|a_n| <\infty converges absolutely to a nonzero limit provided additionally 1+an≠01 + a_n \ne 0 for every nn is exactly what applies here, and 1+ap=∑kf(pk)p−ks1+a_p = \sum_k f(p^k)p^{-ks} is a fixed complex number for each pp; if it were 00 for some particular pp the product would be identically 00, but we are given Df(s)D_f(s) is the sum of the original absolutely convergent Dirichlet series which contains the term f(1)⋅1−s=1f(1) \cdot 1^{-s} = 1 contributing nonzero mass — more simply, since Df(s)D_f(s) is realized as the limit of partial products ∏p≤X(⋯ )\prod_{p \le X}(\cdots), and this limit is shown above to equal Df(s)D_f(s), nonvanishing of Df(s)D_f(s) is equivalent to nonvanishing of every local factor, which holds because each local factor ∑kf(pk)p−ks\sum_k f(p^k)p^{-ks} has a convergent geometric-type tail of modulus less than 11 once σ\sigma exceeds the abscissa where ∣f(p)p−s∣+∣f(p2)p−2s∣+⋯<1|f(p)p^{-s}| + |f(p^2)p^{-2s}|+\cdots < 1, true for σ\sigma large and extendable to the full domain of absolute convergence by analytic continuation of the never-vanishing property along the connected domain of absolute convergence (this final refinement is standard but inessential to the multiplicativity statement itself, so we record it as: the product formula and its convergence to Df(s)D_f(s) are established rigorously above; nonvanishing of the local factors, hence of Df(s)D_f(s), holds in the standard case of interest, e.g. whenever ∣f(p)∣≤1|f(p)|\le 1). Finally, if ff is completely multiplicative, then f(pk)=f(p)kf(p^k) = f(p)^k for every k≥0k \geq 0, so the local factor is the geometric series

∑k=0∞f(p)kpks=∑k=0∞(f(p)ps)k=(1−f(p)ps)−1,\sum_{k=0}^\infty \frac{f(p)^k}{p^{ks}} = \sum_{k=0}^\infty \left(\frac{f(p)}{p^s}\right)^k = \left(1 - \frac{f(p)}{p^s}\right)^{-1},

valid since absolute convergence of the original series forces ∣f(p)p−s∣<1|f(p)p^{-s}| < 1 for the geometric series to converge (indeed ∣f(pk)∣p−kσ→0|f(p^k)|p^{-k\sigma} \to 0 is necessary for the local series to converge at all, forcing ∣f(p)p−s∣<1|f(p)p^{-s}|<1). This factor is manifestly nonzero, being the reciprocal of 1−f(p)p−s≠01 - f(p)p^{-s} \neq 0. ■\blacksquare

∎

Worked examples

Example 1: The divisor function d(n)d(n) and ζ(s)2\zeta(s)^2. Recall d(n)=∑d∣n1d(n) = \sum_{d \mid n} 1 counts the divisors of nn; equivalently d=1∗1d = \mathbf 1 * \mathbf 1 where 1(n)=1\mathbf 1(n) = 1 for all nn, a fact belonging to The Divisor and Sigma Functions. The Riemann zeta function is ζ(s)=D1(s)=∑nn−s\zeta(s) = D_{\mathbf 1}(s) = \sum_n n^{-s}, absolutely convergent for Re(s)>1\mathrm{Re}(s) > 1 by the integral test comparison ∑n−σ≍∫1∞x−σdx\sum n^{-\sigma} \asymp \int_1^\infty x^{-\sigma}dx. By part (c) of the theorem,

Dd(s)=D1∗1(s)=D1(s)2=ζ(s)2,Re(s)>1.D_d(s) = D_{\mathbf 1 * \mathbf 1}(s) = D_{\mathbf 1}(s)^2 = \zeta(s)^2, \qquad \mathrm{Re}(s) > 1.

Let's verify this numerically against direct computation, term by term up to n=6n=6, taking (say) s=2s=2 so we can compute with actual numbers (ζ(2)=π2/6≈1.644934\zeta(2) = \pi^2/6 \approx 1.644934). Direct values: d(1)=1, d(2)=2, d(3)=2, d(4)=3, d(5)=2, d(6)=4d(1)=1,\ d(2)=2,\ d(3)=2,\ d(4)=3,\ d(5)=2,\ d(6)=4. So

∑n=16d(n)n2=1+24+29+316+225+436=1+0.5+0.2222+0.1875+0.08+0.1111≈2.1008.\sum_{n=1}^6 \frac{d(n)}{n^2} = 1 + \frac{2}{4} + \frac{2}{9} + \frac{3}{16} + \frac{2}{25} + \frac{4}{36} = 1 + 0.5 + 0.2222 + 0.1875 + 0.08 + 0.1111 \approx 2.1008.

Compare with ζ(2)2≈1.6449342≈2.70581\zeta(2)^2 \approx 1.644934^2 \approx 2.70581: the partial sum 2.10082.1008 is indeed less than the full infinite sum 2.705812.70581, consistent with all terms being positive and the tail beyond n=6n=6 contributing the remaining ≈0.605\approx 0.605 — a sanity check, not a proof, but it confirms the identity is at least directionally consistent, and one can check the exact combinatorial identity underlying it directly: expanding ζ(s)2=(∑mm−s)(∑nn−s)=∑kk−s#{(m,n):mn=k}\zeta(s)^2 = \left(\sum_m m^{-s}\right)\left(\sum_n n^{-s}\right) = \sum_k k^{-s}\#\{(m,n): mn=k\}, and #{(m,n):mn=k}=d(k)\#\{(m,n):mn=k\} = d(k) exactly, by definition of the divisor function as the count of ordered factorizations k=mnk=mn matching (unordered) divisor pairs — confirming the identity is exact, not approximate. Now use the Euler product. Since 1\mathbf{1} is completely multiplicative with 1(p)=1\mathbf 1(p)=1, we get ζ(s)=∏p(1−p−s)−1\zeta(s) = \prod_p (1-p^{-s})^{-1}, so

Dd(s)=ζ(s)2=∏p(1−p−s)−2.D_d(s) = \zeta(s)^2 = \prod_p (1-p^{-s})^{-2}.

Directly from the Euler product theorem applied to dd itself (which is multiplicative but not completely multiplicative, since e.g. d(4)=3≠d(2)2=4d(4)=3 \ne d(2)^2=4): the local factor at pp is ∑k≥0d(pk)p−ks\sum_{k\ge0} d(p^k)p^{-ks}. Since d(pk)=k+1d(p^k)=k+1 (the divisors of pkp^k are 1,p,…,pk1,p,\dots,p^k), this is ∑k≥0(k+1)xk\sum_{k\ge0}(k+1)x^k with x=p−sx=p^{-s}, which is the standard power series (1−x)−2(1-x)^{-2} (differentiate the geometric series ∑xk=(1−x)−1\sum x^k = (1-x)^{-1} termwise and shift index, valid for ∣x∣<1|x|<1). This matches (1−p−s)−2(1-p^{-s})^{-2} exactly, confirming both routes to the Euler product agree.

Example 2: The Möbius function and the reciprocal of ζ(s)\zeta(s), checked against a non-multiplicative-looking asymmetric case. The Möbius function μ(n)\mu(n) satisfies μ∗1=ε\mu * \mathbf 1 = \varepsilon, where ε(1)=1\varepsilon(1)=1 and ε(n)=0\varepsilon(n)=0 for n>1n>1 (this is the core convolution identity from Dirichlet Convolution, equivalent to Möbius inversion). Since Dε(s)=∑nε(n)n−s=1D_\varepsilon(s) = \sum_n \varepsilon(n)n^{-s} = 1 (only the n=1n=1 term survives), part (c) gives, for Re(s)>1\mathrm{Re}(s)>1 where both DμD_\mu and ζ\zeta converge absolutely (note ∣μ(n)∣≤1|\mu(n)|\le1, so Dμ(s)D_\mu(s) converges absolutely for Re(s)>1\mathrm{Re}(s)>1 by the same comparison as for ζ\zeta):

Dμ(s)⋅ζ(s)=1⟹Dμ(s)=1ζ(s),Re(s)>1.D_\mu(s) \cdot \zeta(s) = 1 \quad\Longrightarrow\quad D_\mu(s) = \frac{1}{\zeta(s)}, \qquad \mathrm{Re}(s) > 1.

Let's verify this at the concrete, asymmetric level of coefficients up to n=10n=10, rather than relying only on the abstract identity. We use μ(1)=1,μ(2)=−1,μ(3)=−1,μ(4)=0,μ(5)=−1,μ(6)=1,μ(7)=−1,μ(8)=0,μ(9)=0,μ(10)=1\mu(1)=1, \mu(2)=-1,\mu(3)=-1,\mu(4)=0,\mu(5)=-1,\mu(6)=1,\mu(7)=-1,\mu(8)=0,\mu(9)=0,\mu(10)=1 (standard values: μ(n)=0\mu(n)=0 if nn has a squared prime factor, else (−1)#prime factors(-1)^{\#\text{prime factors}}). Check the convolution identity directly at n=10n=10: we need ∑d∣10μ(d)⋅1=μ(1)+μ(2)+μ(5)+μ(10)=1+(−1)+(−1)+1=0=ε(10)\sum_{d\mid 10}\mu(d)\cdot 1 = \mu(1)+\mu(2)+\mu(5)+\mu(10) = 1 + (-1) + (-1) + 1 = 0 = \varepsilon(10). Good — matches. Check at n=1n=1: μ(1)=1=ε(1)\mu(1) = 1 = \varepsilon(1). Good. This confirms (μ∗1)(n)=ε(n)(\mu * \mathbf 1)(n) = \varepsilon(n) at these two sample points, consistent with the known general identity. Now the Euler product side: μ\mu is multiplicative with μ(p)=−1\mu(p) = -1, μ(pk)=0\mu(p^k) = 0 for k≥2k \geq 2 (since pkp^k for k≥2k\ge2 has a square factor). So the local factor at each prime is

∑k=0∞μ(pk)p−ks=1−p−s+0+0+⋯=1−1ps.\sum_{k=0}^\infty \mu(p^k) p^{-ks} = 1 - p^{-s} + 0 + 0 + \cdots = 1 - \frac{1}{p^s}.

Hence by the Euler product theorem,

Dμ(s)=∏p(1−1ps),D_\mu(s) = \prod_p \left(1 - \frac{1}{p^s}\right),

which is exactly the reciprocal of ζ(s)=∏p(1−p−s)−1\zeta(s) = \prod_p (1-p^{-s})^{-1}, matching the convolution computation above via a completely independent route (the Euler product), a strong internal consistency check that both derivations — convolution-based and Euler-product-based — agree.

CounterexampleWhy absolute convergence is needed for the convolution correspondence

Drop the hypothesis that Df(s)D_f(s) and Dg(s)D_g(s) converge absolutely at ss, and require only conditional convergence; then the rearrangement argument underlying part (c) of the theorem can fail, and indeed the product of two convergent series need not equal the series of the convolution — its very convergence can fail. Consider ss real with 0<s≤1/20 < s \leq 1/2 (so that n−s→0n^{-s} \to 0 too slowly for absolute convergence of ∑n−s\sum n^{-s}, which diverges for s≤1s\le 1), and take f=g=λf = g = \lambda, the Liouville function extended formally — instead, to keep the example fully concrete and elementary, take the classical case

f(n)=g(n)=(−1)n−11, i.e. Df(s)=∑n=1∞(−1)n−1ns.f(n) = g(n) = \frac{(-1)^{n-1}}{1}, \text{ i.e. } D_f(s) = \sum_{n=1}^\infty \frac{(-1)^{n-1}}{n^s}.

This is the Dirichlet eta-type series; for real ss with 0<s≤10 < s \le 1 it converges (conditionally, by the alternating series test, since n−sn^{-s} decreases to 00) but not absolutely, since ∑n−s\sum n^{-s} diverges for s≤1s \le 1. Take s=1/2s = 1/2. Then Df(1/2)=∑(−1)n−1n−1/2D_f(1/2) = \sum (-1)^{n-1} n^{-1/2} converges conditionally to some finite value L≈0.6049L \approx 0.6049 (a known value related to (1−21−s)ζ(s)(1-2^{1-s})\zeta(s) at s=1/2s=1/2). Now the convolution h=f∗fh = f * f has coefficients h(k)=∑d∣k(−1)d−1(−1)k/d−1h(k) = \sum_{d \mid k} (-1)^{d-1}(-1)^{k/d - 1}. Consider what happens with the Cauchy product rearrangement needed to justify Df(s)2=Dh(s)D_f(s)^2 = D_h(s): the proof of part (c) required grouping the double sum ∑m,nf(m)f(n)(mn)−s\sum_{m,n} f(m)f(n)(mn)^{-s} by the value mn=kmn=k, which is only guaranteed to preserve the sum's value when the double series converges absolutely (this is precisely where Fubini's rearrangement theorem for double series is invoked, and it requires absolute convergence — a conditionally convergent double series can be rearranged to any value, or to diverge, by Riemann-series-type phenomena extended to double-indexed sums). Concretely, at s=1/2s=1/2, one can check numerically that the outer product L2≈0.60492≈0.3659L^2 \approx 0.6049^2 \approx 0.3659 need not equal the sum ∑kh(k)k−1/2\sum_k h(k) k^{-1/2} computed by summing kk in increasing order, term by term, because the latter series's convergence and value are sensitive to the order of summation whenever only conditional convergence is available — the rearrangement implicit in collecting all pairs (m,n)(m,n) with mn=kmn=k into a single term h(k)h(k) mixes infinitely many "far apart" original terms f(m)f(n)f(m)f(n) together, exactly the kind of regrouping that is licensed by Fubini/absolute-convergence but not by conditional convergence alone. This is why the theorem's hypothesis in part (c) explicitly demands absolute convergence at the point ss in question — dropping it, the clean identity Df(s)Dg(s)=Df∗g(s)D_f(s)D_g(s) = D_{f*g}(s) is no longer guaranteed to hold, and establishing it (when it happens to hold) requires a separate, delicate argument (Abel summation across the whole double array), not the simple rearrangement used in the proof above.

Scope, edge cases & common traps

SituationWhat holdsWhat can fail
ff bounded, Re(s)>1\mathrm{Re}(s)>1Absolute convergence, Euler product valid if ff multiplicative—
ff multiplicative but only conditionally convergent region—Euler product expansion (proof (d)) needs absolute convergence to rearrange the smooth-number sum
ff multiplicative, not completelyEuler product with local factor ∑kf(pk)p−ks\sum_k f(p^k)p^{-ks}Local factor is not simply (1−f(p)p−s)−1(1-f(p)p^{-s})^{-1}
ff completely multiplicativeLocal factor collapses to (1−f(p)p−s)−1(1-f(p)p^{-s})^{-1}—
Two Dirichlet series agree on a half-planeCoefficients identical (part (b))Agreement only at isolated points does not force equal coefficients
f=gf=g only on a finite set of nn—Series can still differ everywhere as functions; uniqueness needs a full half-plane

The mathematician behind it

Origins · 1 minPeter Gustav Lejeune Dirichlet and how this was discovered
PG
Peter Gustav Lejeune Dirichlet
1805–1859 · Prussia, 19th-century analytic number theory

Dirichlet introduced what are now called Dirichlet series in his 1837 memoir proving that every arithmetic progression a,a+q,a+2q,…a, a+q, a+2q,\dots with gcd⁡(a,q)=1\gcd(a,q)=1 contains infinitely many primes — the theorem now known by his name and previewed in Primes in Arithmetic Progressions: Statement. To detect primes in a fixed residue class, he needed functions that could separate residues modulo qq, leading him to introduce what are today called Dirichlet characters and the associated LL-series L(s,χ)=∑nχ(n)n−sL(s,\chi) = \sum_n \chi(n) n^{-s}, direct generalizations of the plain Dirichlet series studied here. His analytic technique — showing a certain series does not vanish at s=1s=1 — was the first serious use of complex-analytic ideas to attack a purely arithmetic question, founding the field of analytic number theory.

History
- 1737: Euler proves the divergence of ∑1/p\sum 1/p over primes using the product ∏p(1−p−1)−1\prod_p (1-p^{-1})^{-1}, an early ancestor of the Euler product for ζ(s)\zeta(s) at s=1s=1.
- 1837: Dirichlet proves the infinitude of primes in arithmetic progressions using LL-series, introducing the general Dirichlet series framework.
- 1859: Riemann's memoir extends ζ(s)\zeta(s) to a function of a complex variable and studies its analytic continuation and functional equation.
- 1896: Hadamard and de la Vallée Poussin independently prove the Prime Number Theorem, using nonvanishing of ζ(s)\zeta(s) on Re(s)=1\mathrm{Re}(s)=1.
- 1937: Selberg-era and later refinements deepen the analytic theory of general Dirichlet series and their Euler products in the study of automorphic LL-functions.
What exactly is the difference between a Dirichlet series and a power series?

A power series ∑anzn\sum a_n z^n organizes coefficients by exponents of a variable zz, and its convergence region is a disk in the complex plane determined by the radius of convergence. A Dirichlet series ∑f(n)n−s\sum f(n) n^{-s} instead organizes coefficients by the index nn itself, using n−s=e−slog⁡nn^{-s} = e^{-s\log n} as the building block, and its convergence region is typically a right half-plane Re(s)>σ0\mathrm{Re}(s) > \sigma_0 rather than a disk. This half-plane structure reflects that ∣n−s∣=n−Re(s)|n^{-s}| = n^{-\mathrm{Re}(s)} depends only on the real part of ss, so convergence behavior is governed entirely by how large Re(s)\mathrm{Re}(s) is, unlike power series where the full modulus of zz matters.

Why does multiplicativity of f produce a product over primes rather than, say, a sum?

Multiplicativity means ff is completely determined by its values on prime powers, and the Fundamental Theorem of Arithmetic says every integer is a unique product of prime powers. When you expand a product of independent "menus" (one menu per prime, each menu being the sub-series ∑kf(pk)p−ks\sum_k f(p^k)p^{-ks}), the distributive law generates every possible combination of choices exactly once, and each combination of choices corresponds to exactly one integer nn by unique factorization. This is fundamentally a multiplicative, not additive, correspondence, because integers combine via multiplication of their prime-power components, so the generating identity naturally takes the form of a product, not a sum, over primes.

Does every Dirichlet series with multiplicative coefficients have an Euler product for all s where it converges?

The Euler product theorem as proved here requires absolute convergence at the point ss in question; this is not a cosmetic restriction but is used essentially in the rearrangement argument (comparing partial products over smooth numbers to the full sum). At points of merely conditional convergence, the rearrangement can fail and the Euler product formula is not automatically justified — the counterexample in this article illustrates exactly this kind of failure for the related convolution-product correspondence. In practice, for series like ζ(s)\zeta(s) or L(s,χ)L(s,\chi), one proves absolute convergence on Re(s)>1\mathrm{Re}(s) > 1 first, establishes the Euler product there, and only afterward extends the function itself by analytic continuation to a larger domain, where the Euler product expansion generally no longer literally converges as a product.

How does this connect to the Riemann zeta function specifically?

The Riemann zeta function is precisely ζ(s)=D1(s)\zeta(s) = D_{\mathbf 1}(s), the Dirichlet series of the constant function 1(n)=1\mathbf{1}(n)=1, which is completely multiplicative. Applying the Euler product theorem directly gives ζ(s)=∏p(1−p−s)−1\zeta(s) = \prod_p (1-p^{-s})^{-1} for Re(s)>1\mathrm{Re}(s) > 1, the classical Euler product. Every other Dirichlet series discussed here — for d(n)d(n), μ(n)\mu(n), σ(n)\sigma(n) — is expressed as an algebraic combination of ζ(s)\zeta(s) (a power, a reciprocal, a shifted version) precisely because the underlying arithmetic functions are built from 1\mathbf 1 by Dirichlet convolution or pointwise multiplication by simple functions like n↦nn \mapsto n.

Why is the coprimality condition in "multiplicative" essential for the Euler product, and what happens for completely multiplicative functions?

The Euler product theorem's proof crucially uses multiplicativity to write f(n)=f(p1k1)⋯f(prkr)f(n) = f(p_1^{k_1}) \cdots f(p_r^{k_r}) for n=p1k1⋯prkrn = p_1^{k_1}\cdots p_r^{k_r}, which is valid precisely because distinct prime powers are pairwise coprime, matching the hypothesis "f(mn)=f(m)f(n))f(mn)=f(m)f(n)) for coprime m,nm,n." Complete multiplicativity is a strictly stronger condition (no coprimality needed at all), and it is exactly what allows each local factor to collapse from a generic power series ∑kf(pk)p−ks\sum_k f(p^k)p^{-ks} into the simple geometric series (1−f(p)p−s)−1(1-f(p)p^{-s})^{-1}, since then f(pk)=f(p)kf(p^k) = f(p)^k exactly, without any extra combinatorial input.

Can two different arithmetic functions have Dirichlet series that agree only on part of the plane, not everywhere?

No, not if both series converge absolutely throughout a common half-plane and agree there — the uniqueness theorem proved above forces the coefficients to be identical for all nn, hence the two Dirichlet series are the same series and agree everywhere either converges. What can happen is more subtle: two functions could have Dirichlet series agreeing at isolated points by coincidence without being identical, but this does not contradict the theorem because the hypothesis is agreement throughout a half-plane, not at isolated points; the smallest-index argument in the proof genuinely needs the full half-plane of agreement to extract information about every coefficient.

What role does Dirichlet convolution play if Dirichlet series can just be manipulated directly as functions?

Dirichlet convolution is the arithmetic (coefficient-level) shadow of ordinary multiplication of Dirichlet series; each perspective illuminates the other. Some identities are easiest to prove combinatorially at the level of convolution (e.g. μ∗1=ε\mu * \mathbf{1} = \varepsilon via a binomial-coefficient argument), then transported to the analytic side via the correspondence proved here. Conversely, some identities are easiest to see analytically (e.g. a functional equation or an Euler product factorization) and are then used to deduce combinatorial facts about the convolution structure of arithmetic functions, illustrating why both languages are kept and used together rather than one replacing the other.

Before this

Where this leads