Dirichlet series inversion explained

In analytic number theory, a Dirichlet series, or Dirichlet generating function (DGF), of a sequence is a common way of understanding and summing arithmetic functions in a meaningful way. A little known, or at least often forgotten about, way of expressing formulas for arithmetic functions and their summatory functions is to perform an integral transform that inverts the operation of forming the DGF of a sequence. This inversion is analogous to performing an inverse Z-transform to the generating function of a sequence to express formulas for the series coefficients of a given ordinary generating function.

For now, we will use this page as a compendia of "oddities" and oft-forgotten facts about transforming and inverting Dirichlet series, DGFs, and relating the inversion of a DGF of a sequence to the sequence's summatory function. We also use the notation for coefficient extraction usually applied to formal generating functions in some complex variable, by denoting

[n ^{-s} ] D _{f(s)} = : f(n) for any positive integer n \geq 1 , wheneverD _{f(s)} : = \sum _{n} (f(n))/(n ^{s}) , \Re(s) > \sigma _{0,f} ,

denotes the DGF (or Dirichlet series) of f which is taken to be absolutely convergent whenever the real part of s is greater than the abscissa of absolute convergence,

\sigma _{0,f} \in R .

The relation of the Mellin transformation of the summatory function of a sequence to the DGF of a sequence provides us with a way of expressing arithmetic functions

f(n) such that f( 1 ) ≠ 0 , and the corresponding Dirichlet inverse functions, f ^{-1} (n) , by inversion formulas involving the summatory function, defined byS _{f(x)} : = {\sum _{n} }^\prime f(n), \quad \forall x \geq 1.

In particular, provided that the DGF of some arithmetic function f has an analytic continuation to

s \mapsto - s , we can express the Mellin transform of the summatory function of f by the continued DGF formula asl{M}[S _{f](s)} =- (D _{f(-s)})/(s) .

It is often also convenient to express formulas for the summatory functions over the Dirichlet inverse function of f using this construction of a Mellin inversion type problem.

Preliminaries: Notation, conventions and known results on DGFs

DGFs for Dirichlet inverse functions

Recall that an arithmetic function is Dirichlet invertible, or has an inverse

f ^{-1} (n) with respect to Dirichlet convolution such that (f \ast f ^{-1} )(n) = \delta _{n,1} , or equivalently f \ast f ^{-1} = \mu \ast 1 \equiv \varepsilon , if and only if f( 1 ) ≠ 0 . It is not difficult to prove that is D _{f(s)} is the DGF of f and is absolutely convergent for all complex s satisfying \Re(s) > \sigma _{0,f} , then the DGF of the Dirichlet inverse is given by D _{f ^{-1}} (s) = 1 / D _{f(s)} and is also absolutely convergent for all \Re(s) > \sigma _{0,f} . The positive real \sigma _{0,f} associated with each invertible arithmetic function f is called the abscissa of convergence.

We also see the following identities related to the Dirichlet inverse of some function g that does not vanish at one:

\begin{align}(g ^{-1} \ast \mu)(n) & = [n ^{-s} ]\left( (1)/(\zeta(s) D _{g(s)}) \right) \ (g ^{-1} \ast 1 )(n) & = [n ^{-s} ]\left( (\zeta(s))/(D _{g(s)}) \right).\end{align}

Summatory functions

Using the same convention in expressing the result of Perron's formula, we assume that the summatory function of a (Dirichlet invertible) arithmetic function

f , is defined for all real x \geq 0 according to the formulaS _{f(x)} : = {\sum _{n} }^ f(n) = \begin 0, & 0 \leq x < 1 \\ \sum\limits_ f(n), & x \in \mathbb \setminus \mathbb^ \wedge x \geq 1 \\ \sum\limits_ f(n) - \frac, & x \in \mathbb^. \end

We know the following relation between the Mellin transform of the summatory function of f and the DGF of f whenever

\Re(s) > \sigma _{0,f} :D _{f(s)} = s ⋅ \int ^{inf ty} _{1} (S _{f(x)})/(x ^{s+1}) dx.

Some examples of this relation include the following identities involving the Mertens function, or summatory function of the Moebius function, the prime zeta function and the prime-counting function, and the Riemann prime-counting function:

\begin{align} (1)/(\zeta(s)) & = s ⋅ \int ^{inf ty} _{1} (M(x))/(x ^{s+1}) dx \ P(s) & = s ⋅ \int ^{inf ty} _{1} (\pi(x))/(x ^{s+1}) dx \ log \zeta(s) & = s ⋅ \int ^{inf ty} _{0} (\Pi _{0(x)})/(x ^{s+1}) dx.\end{align}

Statements of the integral formula for Dirichlet inversion

Classical integral formula

For any s such that

\sigma : = \Re(s) > \sigma _{0,f} , we have thatf(x) \equiv [x ^{-s} ] D _{f(s)} = \lim _{T} (1)/(2 T) \int ^{T} _{- T} x ^{\sigma+\imath} D _{f(\sigma+\imath} t) dt.

If we write the DGF of f according to the Mellin transform formula of the summatory function of f, then the stated integral formula simply corresponds to a special case of Perron's formula. Another variant of the previous formula stated in Apostol's book provides an integral formula for an alternate sum in the following form for

c,x > 0 and any real \sigma > \sigma _{0,f} - c where we denote \Re(s) : = \sigma :{\sum _{n} }^ \frac = \frac \int_^ D_f(s+z) \frac dz.

Direct proof: from Apostol's book

1. Define the Dirichlet series $f(s)\; =\; \backslash sum\_^\backslash infty\; a\_n\; n^$ and its associated partial sums $F(x)\; =\; \backslash sum\_^x\; a\_n$.
2. Define the function $g(x)\; =\; \backslash sum\_^x\; a\_n\; \backslash lfloor\; x/n\; \backslash rfloor$.
3. Use partial summation to write $F(x)\; =\; \backslash int\_1^x\; g(t)\; dt\; +\; a\_1$.
4. Apply the Euler–Maclaurin summation formula to obtain an approximation for $F(x)$ in terms of $g(x)$ and its derivatives.
5. Express the error term in the approximation as an integral of a certain function $R(u)$ over the interval $[1,\; x]$.
6. Use Abel's summation formula to express $g(x)$ as a sum of integrals involving $f(s)$ and its derivatives.
7. Express the integrals involving $f(s)$ and its derivatives in terms of $R(u)$ and its derivatives.
8. Substitute the results from steps 4, 5, and 7 into the formula from step 3, and simplify to obtain the classical integral formula for Dirichlet inversion.

This proof shows that the function $f(s)$ can be recovered from its associated Dirichlet series by means of an integral, which is known as the classical integral formula for Dirichlet inversion.

Special cases of the formula

If we are interested in expressing formulas for the Dirichlet inverse of f, denoted by

f ^{-1} (n) whenever f( 1 ) ≠ 0 , we write D _{f(s)} = 1 + s ⋅ A _{f(s)} . Then we have by absolute convergence of the DGF for any \Re(s) > \sigma _{0,f} that\begin{align}\int (x ^{\imath})/(D _{f(\sigma+\imath} t)) dt & = \int \left(\sum _{j} (\sigma + \imath t) ^{j} x \sum ^{j} _{k =0} ( -1 ) ^{k} D _{f(\sigma+\imath} t) ^{k} (log ^{j-k} (x))/((j - k)!) \right) dt.\end{align}

Now we can call on integration by parts to see that if we denote by

F ^{(-m)} (x) = \sum _{n} (F ^{(n)} ( 0 ))/(n!) x ^{n+m} x (n!)/((n + m)!) denotes the m ^{th} antiderivative of F, for any fixed non-negative integers k \geq 0 , we have\int (ax + b) ^{k} ⋅ F(ax + b) dx = \sum ^{k} _{j =0} (k!)/(a ⋅ j!) ( -1 ) ^{k-j} t ^{j} F ^{(j+1-k)} (ax + b).

Thus we obtain that

\begin{align}\int ^{T} _{- T} (x ^{\imath})/(D _{f(\sigma+\imath} t)) dt & = (1)/(\imath) \left(\sum _{j} \sum ^{j} _{k =0} \sum ^{k} _{m =0} (k!)/(m!) ( -1 ) ^{m} (\sigma + \imath t) ^{m} \left[D ^{k\right]} _{f} ^{(j+1-k)} (\sigma + \imath t) (log ^{j-k} (x))/((j - k)!) \right) r | ^{t =+ T} _{t =- T} .\end{align}

We also can relate the iterated integrals for the

k ^{th} antiderivatives of F by a finite sum of k single integrals of power-scaled versions of F:F ^{(-k)} (x) = \sum ^{k -1} _{i =0} \binom{k -1 }{i} (( -1 ) ^{i})/((k -1 )!) \int (F(x))/(x ^{i}) dx.

In light of this expansion, we can then write the partially limiting T-truncated Dirichlet series inversion integrals at hand in the form of

\begin{align} (1)/(2 T) \int ^{T} _{- T} (x ^{\imath})/(D _{f(\sigma+\imath} t)) dt & = (1)/(2 T ⋅ \imath) \left(\sum _{j} \sum ^{j} _{k =0} \sum ^{k} _{m =0} \sum ^{j - k} _{n =0} \binom{j - k}{n} (( -1 ) ^{k+n+m} ⋅ k!)/((j - k)! ⋅ m!) (\sigma + \imath t) ^{m} (log ^{j-k} (x))/((j - k)!) \int ^{\sigma + \imath t} _{0} \left[A ^{k\right](v)} _{f} (dv)/(v ^{n}) \right) r | ^{t =+ T} _{t =- T} \ & = (1)/(2 T ⋅ \imath) \left(\sum _{j} \sum ^{j} _{k =0} \sum ^{k} _{m =0} (( -1 ) ^{j-k} ⋅ ( - s) ^{m})/(m!) (log ^{k} (x))/(k!) \int ^{1} _{0} s ⋅ D ^{j - k} _{f} (rs) \left( 1- (1)/(rs) \right) ^{k} dv\right) r | ^{s = \sigma + \imath T} _{s = \sigma - \imath T} \ & = (s\left(e ^{-s} + O _{s(1)\right)})/(2 T ⋅ \imath) \int ^{1} _{0} (x ^{1- (1)/(rs)})/(1+ D _{f(rs)}) dr r | ^{s = \sigma + \imath T} _{s = \sigma - \imath T} \ & = (\left(e ^{-s} + O _{s(1)\right)})/(2 T ⋅ \imath) \int ^{s} _{0} (x ^{1- (1)/(v)})/(1+ D _{f(v)}) dv r | ^{s = \sigma + \imath T} _{s = \sigma - \imath T} .\end{align}

Statements in the language of Mellin transformations

• The Dirichlet generating function of a sequence

a(n) is the Mellin transform of the sequence, evaluated at s =1 : $\backslash sum\_^\backslash infty\; \backslash frac\; =\; \backslash int\_0^\backslash infty\; x^\; \backslash left(\backslash sum\_^\backslash infty\; a\_n\; e^\backslash right)\; dx\; =\; \backslash mathcal(s)$.

• The Dirichlet inverse of a sequence

a(n) is related to the inverse Mellin transform of its generating function: $a\_n\; =\; \backslash frac\; \backslash int\_^\; \backslash frac\; ds$, where c is a real number greater than the abscissa of convergence of the Dirichlet series $\backslash sum\_^\backslash infty\; a\_n/n^s$.

• The Mellin transform of a convolution of two sequences

a(n) and b(n) is the product of their Mellin transforms: $\backslash mathcal(s)\; =\; \backslash mathcal(s)\; \backslash mathcal(s)$.

• If

a(n) is a sequence and f(x) is a function such that the integral $\backslash int\_0^\backslash infty\; \backslash fracdx$ converges absolutely and uniformly for s in some right half plane, then we can define a Dirichlet series by $a\_n\; =\; \backslash frac\backslash int\_0^\backslash infty\; f(x)\; e^dx$, and the Dirichlet series is the Mellin transform of f(x) .

A formal generating-function-like convolution lemma

Suppose that we wish to treat the integrand integral formula for Dirichlet coefficient inversion in powers of

(\imath t) ^{k} where [(\imath t) ^{k} ] F(\sigma + \imath t) = F ^{(k)} )(\sigma) / k! , and then proceed as if we were evaluating a traditional integral on the real line. Then we have that\begin{align}\hat{D} _{f(x;} \sigma, T) & : = \int ^{T} _{- T} x ^{\sigma+\imath} D _{f(\sigma+\imath} t) dt \ & = \sum _{m} \int ^{T} _{- T} x ^{\sigma+\imath} (\imath t) ^{m} (D ^{(m)} _{f} (\sigma))/(m!) \ & = \sum _{m} \int ^{T} _{- T} t ^{2m} x ^{\sigma+\imath} (( -1 ) ^{m} D ^{( 2 m)} _{f} (\sigma))/(( 2 m)!) dt + \imath x \sum _{m} \int ^{T} _{- T} t ^{2m+1} x ^{\sigma+\imath} (( -1 ) ^{m} A ^{(2m+1)} (\sigma))/(( 2 m +1 )!) dt.\end{align}

We require the result given by the following formula, which is proved rigorously by an application of integration by parts, for any non-negative integer

m \geq 0 :\begin{align}\hat{I} _{m(T)} & : = \int ^{T} _{- T} ((\imath t) ^{m})/(m!) x ^{\imath} dt \ & = \sum ^{m} _{r =0} (\left(x ^{\imath} + ( -1 ) ^{r+1} x ^{-\imath} \right) ( - \imath) ^{r+1})/(log ^{k+1-r} (x)) ⋅ (T ^{r})/(r!) \ & = (\cos(T log x))/(T log x) x \sum ^{\lfloor k/ 2 \rfloor} _{r =0} (( -1 ) ^{r+1} T ^{2r})/(log ^{k-2r} (x) ( 2 r)!) + (\sin(T log x))/(T log x) x \sum ^{\lfloor k/ 2 \rfloor} _{r =0} (( -1 ) ^{r+1} T ^{2r+1})/(log ^{k-2r-1} (x) ( 2 r +1 )!) .\end{align}

So the respective real and imaginary parts of our arithmetic function coefficients f at positive integers x satisfy:

\begin{align}\operatorname{Re}(f(x)) & = x ^{\sigma} x \lim _{T} \sum _{m} D ^{( 2 m)} _{f} (\sigma) ⋅ (\hat{I)/(_{2m}) (T)}{ 2 T} \ \operatorname{Im}(f(x)) & = x ^{\sigma} x \lim _{T} \sum _{m} D ^{( 2 m +1 )} _{f} (\sigma) ⋅ (\hat{I)/(_{2m+1}) (T)}{ 2 T}.\end{align}

The last identities suggest an application of the Hadamard product formula for generating functions. In particular, we can work out the following identities which express the real and imaginary parts of our function f at x in the following forms:^[1]

\begin{align}\operatorname{Re}(f(x)) & = \lim _{T} \left[ (x ^{\sigma})/(2 T) x (1)/(2 \pi) \int ^{\pi} _{- \pi} \left(D _{f(\sigma+\imath} T ⋅ e ^{\imath} ) + D _{f(\sigma} - \imath T e ^{\imath} )\right) \left(FUNC(e ^{-\imath} )\right) ds\right] \ \operatorname{Im}(f(x)) & = \lim _{T} \left[ (x ^{\sigma})/(2 T) x (1)/(2 \pi) \int ^{\pi} _{- \pi} \left(D _{f(\sigma+\imath} T ⋅ e ^{\imath} ) - D _{f(\sigma} - \imath T e ^{\imath} \right) ds \right].\end{align}

Notice that in the special case where the arithmetic function f is strictly real-valued, we expect that the inner terms in the previous limit formula are always zero (i.e., for any T).

See also

• • Dirichlet series Dirichlet convolution
  • Dirichlet inverse Arithmetic function
• Multiplicative function
• Dirichlet generating function (DGF)

Notes and References

1. To apply the integral formula for the Hadamard product, we observe that\begin{align}\sum ^{\lfloor k/ 2 \rfloor} _{r =0} (( -1 ) ^{r+1} T ^{2r})/(log ^{k-2r} (x) ( 2 r)!) & =- (1)/(2) [z ^{k]\left( (e ^{\imath})/()} } + \frac \right) \\ \sum_^ \frac & = -\frac[z^{k}]\left(\frac - \frac \right).\end

   From this observation, the formula stated below is now a standard application of the cited integral formula to compute the Hadamard product of two generating functions.