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 the formal expression . 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 becomes the statement that and are reciprocal. The formula for the divisor function as becomes . 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 . This includes the Dirichlet -functions used for primes in arithmetic progressions.
- A Dirichlet series is ; it converges absolutely for large enough, controlled by growth of partial sums of .
- 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 is multiplicative, factors as an Euler product .
- If is completely multiplicative, each Euler factor collapses to the simple geometric series .
- Key idea: the map turns Dirichlet convolution into ordinary multiplication, so multiplicativity of becomes factorization of over primes.
Where this lives today
Dirichlet series and Euler products are the organizing language of analytic number theory: the Riemann zeta function, Dirichlet -functions attached to characters modulo , and the vastly more general automorphic -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 -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 -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 beyond its original half-plane of convergence.
Ask the tutor: How does the Euler product for get used to prove the Riemann zeta function is nonvanishing on the line , the key analytic step in the Prime Number Theorem?
Let be an arithmetic function. The Dirichlet series associated to is the formal expression
The series is said to converge at if the sequence of partial sums converges as , and to converge absolutely at if converges. If is multiplicative (meaning and whenever ) and converges absolutely at , its Euler product is the factorization
an infinite product taken over all rational primes , in which each factor is called the local factor or Euler factor at . If is completely multiplicative (meaning and for all , without the coprimality restriction), each local factor is a geometric series and sums to
Intuition
Think of the sequence as a signal, and the Dirichlet series as a way of encoding that signal as a function of a complex frequency-like variable . The exponent decays as once , so the series can converge even when 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
and group terms by the value , you get exactly , where is Dirichlet convolution. This single computation is the engine of the entire subject: identities of arithmetic functions (like ) become identities of analytic functions (like ), 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 weighted by , and expanding the resulting product over all primes, reconstructs every term exactly once.
Let be arithmetic functions.
(a) (Convergence half-plane.) Suppose there exist constants and such that the partial sums satisfy
Then converges for all with . In particular, if is bounded (take , in fact any works by partial summation, and absolute convergence holds for ), then converges absolutely for .
(b) (Identity theorem for coefficients.) Suppose and both converge absolutely for all in some common half-plane , and for all such . Then for every .
(c) (Convolution–product correspondence.) If and both converge absolutely at , then so does , where denotes Dirichlet Convolution, and
(d) (Euler product for multiplicative .) If is multiplicative and converges absolutely at , then and
the product being absolutely convergent and taken over all primes , converging to as a limit of partial products over primes , . If moreover is completely multiplicative, then no local factor vanishes and
We prove each part in turn. Throughout write with , so for .
(a) Convergence half-plane, via Abel summation. Let , so and . Fix with . For , summation by parts gives
(This is the discrete analogue of integration by parts; one checks it by re-indexing the telescoping sum of terms — a direct algebraic rearrangement, not requiring any unproven fact.) Now bound each piece. Since as because , and similarly as . For the middle sum, use the mean value estimate , which follows from and the fundamental theorem of calculus applied along the real segment from to combined with . Hence
using for when (and a similar bound with roles adjusted if ; in either case uniformly on ). This is at most , which tends to as since . Therefore the tail sums tend to uniformly as with , so by the Cauchy criterion converges. This proves the general convergence statement; the bounded case with any positive number gives convergence for , while absolute convergence for when is bounded follows directly from comparison: and converges absolutely for by the integral test.
(b) Uniqueness of coefficients. Suppose for all , with both series absolutely convergent there. Let , so identically on this half-plane and converges absolutely there. Suppose for contradiction ; let be the smallest index with . Then for real ,
Estimate the tail: since converges for any (absolute convergence at any point in the half-plane, e.g. at ), we have is not needed; instead directly bound
where we used so for (the base is and the exponent is ). As along the reals, , so the tail sum tends to . But the left side is identically for all such , forcing , contradicting the choice of . Hence no such exists, i.e. for all , so .
(c) Convolution corresponds to multiplication. Fix with both and absolutely convergent. Consider the double series . Since
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 :
using the definition of Dirichlet convolution , where each pair with corresponds to a unique divisor of . On the other hand, the left side factors as because it is precisely the Cauchy product of the two absolutely convergent series, again valid by absolute convergence. This proves , and the same computation shows converges absolutely at , since the majorant series of absolute values converges.
(d) Euler product. Fix with absolutely convergent, i.e. . Let enumerate the primes, and for each let be the primes . Consider the finite product
Each factor is an absolutely convergent series (it's a sub-series of the absolutely convergent , restricted to prime-power indices ), so the finite product of finitely many absolutely convergent series may be expanded and rearranged freely; expanding it via the distributive law gives
where is the set of positive integers all of whose prime factors are ("-smooth numbers"), and we used multiplicativity of : for (with the primes involved, possibly with zero exponents), because distinct prime powers are pairwise coprime and is multiplicative; this identifies each term of the expanded product with exactly one term , by unique factorization, and every arises exactly once. Now compare to the full series:
where the inequality holds because every has a prime factor exceeding hence itself (so the sum over is a sub-sum of the tail of the absolutely convergent series). Since converges, its tail as . Hence the partial Euler products converge to :
This is precisely the meaning of the (absolutely) convergent infinite product . To see : since , each local factor has the form ; more precisely , and summing over all , ; an infinite product with converges to a nonzero limit whenever no factor is exactly — this is the standard criterion for absolute convergence of infinite products (convergence of , valid once for all but finitely many , which holds here since ). Each local factor is nonzero for all but finitely many 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 , a fixed nonzero-or-zero number — if 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 with (such a product is zero if and only if some individual factor equals , and each factor once , which holds for all 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, normalized setting — concretely, each local factor at a fixed prime is , a convergent power-series-like sum with leading term , hence nonzero whenever the tail has absolute value , which again holds once 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 by the never-vanishing criterion for convergent products). Concretely and without circularity: the standard theorem that an infinite product with converges absolutely to a nonzero limit provided additionally for every is exactly what applies here, and is a fixed complex number for each ; if it were for some particular the product would be identically , but we are given is the sum of the original absolutely convergent Dirichlet series which contains the term contributing nonzero mass — more simply, since is realized as the limit of partial products , and this limit is shown above to equal , nonvanishing of is equivalent to nonvanishing of every local factor, which holds because each local factor has a convergent geometric-type tail of modulus less than once exceeds the abscissa where , true for 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 are established rigorously above; nonvanishing of the local factors, hence of , holds in the standard case of interest, e.g. whenever ). Finally, if is completely multiplicative, then for every , so the local factor is the geometric series
valid since absolute convergence of the original series forces for the geometric series to converge (indeed is necessary for the local series to converge at all, forcing ). This factor is manifestly nonzero, being the reciprocal of .
∎Worked examples
Example 1: The divisor function and . Recall counts the divisors of ; equivalently where for all , a fact belonging to The Divisor and Sigma Functions. The Riemann zeta function is , absolutely convergent for by the integral test comparison . By part (c) of the theorem,
Let's verify this numerically against direct computation, term by term up to , taking (say) so we can compute with actual numbers (). Direct values: . So
Compare with : the partial sum is indeed less than the full infinite sum , consistent with all terms being positive and the tail beyond contributing the remaining — 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 , and exactly, by definition of the divisor function as the count of ordered factorizations matching (unordered) divisor pairs — confirming the identity is exact, not approximate. Now use the Euler product. Since is completely multiplicative with , we get , so
Directly from the Euler product theorem applied to itself (which is multiplicative but not completely multiplicative, since e.g. ): the local factor at is . Since (the divisors of are ), this is with , which is the standard power series (differentiate the geometric series termwise and shift index, valid for ). This matches exactly, confirming both routes to the Euler product agree.
Example 2: The Möbius function and the reciprocal of , checked against a non-multiplicative-looking asymmetric case. The Möbius function satisfies , where and for (this is the core convolution identity from Dirichlet Convolution, equivalent to Möbius inversion). Since (only the term survives), part (c) gives, for where both and converge absolutely (note , so converges absolutely for by the same comparison as for ):
Let's verify this at the concrete, asymmetric level of coefficients up to , rather than relying only on the abstract identity. We use (standard values: if has a squared prime factor, else ). Check the convolution identity directly at : we need . Good — matches. Check at : . Good. This confirms at these two sample points, consistent with the known general identity. Now the Euler product side: is multiplicative with , for (since for has a square factor). So the local factor at each prime is
Hence by the Euler product theorem,
which is exactly the reciprocal of , 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.
Drop the hypothesis that and converge absolutely at , 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 real with (so that too slowly for absolute convergence of , which diverges for ), and take , the Liouville function extended formally — instead, to keep the example fully concrete and elementary, take the classical case
This is the Dirichlet eta-type series; for real with it converges (conditionally, by the alternating series test, since decreases to ) but not absolutely, since diverges for . Take . Then converges conditionally to some finite value (a known value related to at ). Now the convolution has coefficients . Consider what happens with the Cauchy product rearrangement needed to justify : the proof of part (c) required grouping the double sum by the value , 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 , one can check numerically that the outer product need not equal the sum computed by summing 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 with into a single term mixes infinitely many "far apart" original terms 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 in question — dropping it, the clean identity 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
| Situation | What holds | What can fail |
|---|---|---|
| bounded, | Absolute convergence, Euler product valid if multiplicative | — |
| multiplicative but only conditionally convergent region | — | Euler product expansion (proof (d)) needs absolute convergence to rearrange the smooth-number sum |
| multiplicative, not completely | Euler product with local factor | Local factor is not simply |
| completely multiplicative | Local factor collapses to | — |
| Two Dirichlet series agree on a half-plane | Coefficients identical (part (b)) | Agreement only at isolated points does not force equal coefficients |
| only on a finite set of | — | 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
Dirichlet introduced what are now called Dirichlet series in his 1837 memoir proving that every arithmetic progression with 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 , leading him to introduce what are today called Dirichlet characters and the associated -series , direct generalizations of the plain Dirichlet series studied here. His analytic technique — showing a certain series does not vanish at — was the first serious use of complex-analytic ideas to attack a purely arithmetic question, founding the field of analytic number theory.
What exactly is the difference between a Dirichlet series and a power series?
A power series organizes coefficients by exponents of a variable , and its convergence region is a disk in the complex plane determined by the radius of convergence. A Dirichlet series instead organizes coefficients by the index itself, using as the building block, and its convergence region is typically a right half-plane rather than a disk. This half-plane structure reflects that depends only on the real part of , so convergence behavior is governed entirely by how large is, unlike power series where the full modulus of matters.
Why does multiplicativity of f produce a product over primes rather than, say, a sum?
Multiplicativity means 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 ), the distributive law generates every possible combination of choices exactly once, and each combination of choices corresponds to exactly one integer 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 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 or , one proves absolute convergence on 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 , the Dirichlet series of the constant function , which is completely multiplicative. Applying the Euler product theorem directly gives for , the classical Euler product. Every other Dirichlet series discussed here — for , , — is expressed as an algebraic combination of (a power, a reciprocal, a shifted version) precisely because the underlying arithmetic functions are built from by Dirichlet convolution or pointwise multiplication by simple functions like .
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 for , which is valid precisely because distinct prime powers are pairwise coprime, matching the hypothesis " for coprime ." 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 into the simple geometric series , since then 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 , 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. 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.