Dirichlet Series Inversion
   HOME

TheInfoList



OR:

In
analytic number theory In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Diric ...
, a Dirichlet series, or
Dirichlet generating function In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series ...
(DGF), of a sequence is a common way of understanding and summing
arithmetic functions In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function ''f''(''n'') whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their de ...
in a meaningful way. A little known, or at least often forgotten about, way of expressing formulas for arithmetic functions and their
summatory function In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function ''f''(''n'') whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their d ...
s 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 In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary seri ...
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 ^D_f(s) =: f(n) for any positive integer n \geq 1, whenever :D_f(s) := \sum_ \frac, \quad \Re(s) > \sigma_, 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_ \in \mathbb. 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) \neq 0, and the corresponding
Dirichlet inverse In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet. Definition If f , g : \mathbb\to\mathbb are two arithmetic f ...
functions, f^(n), by inversion formulas involving the summatory function, defined by :S_f(x) := ^\prime f(n), \quad \forall x \geq 1. In particular, provided that the DGF of some arithmetic function ''f'' has an
analytic continuation In complex analysis, a branch of mathematics, analytic continuation is a technique to extend the domain of definition of a given analytic function. Analytic continuation often succeeds in defining further values of a function, for example in a new ...
to s \mapsto -s, we can express the Mellin transform of the summatory function of ''f'' by the continued DGF formula as :\mathcal _fs) = -\frac. It is often also convenient to express formulas for the summatory functions over the
Dirichlet inverse In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet. Definition If f , g : \mathbb\to\mathbb are two arithmetic f ...
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^(n) with respect to Dirichlet convolution such that (f \ast f^)(n) = \delta_, or equivalently f \ast f^ = \mu \ast 1 \equiv \varepsilon, if and only if f(1) \neq 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_, then the DGF of the Dirichlet inverse is given by D_(s) = 1 / D_f(s) and is also absolutely convergent for all \Re(s) > \sigma_. The positive real \sigma_ associated with each invertible arithmetic function ''f'' is called the
abscissa of convergence In the field of mathematical analysis, a general Dirichlet series is an infinite series that takes the form of : \sum_^\infty a_n e^, where a_n, s are complex numbers and \ is a strictly increasing sequence of nonnegative real numbers that tends t ...
. We also see the following identities related to the
Dirichlet inverse In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet. Definition If f , g : \mathbb\to\mathbb are two arithmetic f ...
of some function ''g'' that does not vanish at one: :\begin(g^ \ast \mu)(n) & = ^left(\frac\right) \\ (g^ \ast 1)(n) & = ^left(\frac\right).\end


Summatory functions

Using the same convention in expressing the result of
Perron's formula In mathematics, and more particularly in analytic number theory, Perron's formula is a formula due to Oskar Perron to calculate the sum of an arithmetic function, by means of an inverse Mellin transform. Statement Let \ be an arithmetic function, a ...
, we assume that the summatory function of a (Dirichlet invertible) arithmetic function f, is defined for all real x \geq 0 according to the formula :S_f(x) := ^ 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_: :D_f(s) = s \cdot \int_1^ \frac dx. Some examples of this relation include the following identities involving the Mertens function, or summatory function of the
Moebius function Moebius, Möbius or Mobius may refer to: People * August Ferdinand Möbius (1790–1868), German mathematician and astronomer * Theodor Möbius (1821–1890), German philologist * Karl Möbius (1825–1908), German zoologist and ecologist * Paul ...
, the
prime zeta function In mathematics, the prime zeta function is an analogue of the Riemann zeta function, studied by . It is defined as the following infinite series, which converges for \Re(s) > 1: :P(s)=\sum_ \frac=\frac+\frac+\frac+\frac+\frac+\cdots. Properties ...
and the
prime-counting function In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number ''x''. It is denoted by (''x'') (unrelated to the number ). History Of great interest in number theory is t ...
, and the Riemann
prime-counting function In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number ''x''. It is denoted by (''x'') (unrelated to the number ). History Of great interest in number theory is t ...
: :\begin\frac & = s \cdot \int_1^ \frac dx \\ P(s) & = s \cdot \int_1^ \frac dx \\ \log \zeta(s) & = s \cdot \int_0^ \frac dx.\end


Statements of the integral formula for Dirichlet inversion


Classical integral formula

For any ''s'' such that \sigma := \Re(s) > \sigma_, we have that :f(x) \equiv ^D_f(s) = \lim_ \frac \int_^T x^ 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 In mathematics, and more particularly in analytic number theory, Perron's formula is a formula due to Oskar Perron to calculate the sum of an arithmetic function, by means of an inverse Mellin transform. Statement Let \ be an arithmetic function, a ...
. 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_-c where we denote \Re(s) := \sigma: :^ \frac = \frac \int_^ D_f(s+z) \frac dz.


Direct proof: from Apostol's book

# Define the Dirichlet series f(s) = \sum_^\infty a_n n^ and its associated partial sums F(x) = \sum_^x a_n. # Define the function g(x) = \sum_^x a_n \lfloor x/n \rfloor. # Use partial summation to write F(x) = \int_1^x g(t) dt + a_1. # Apply the Euler–Maclaurin summation formula to obtain an approximation for F(x) in terms of g(x) and its derivatives. # Express the error term in the approximation as an integral of a certain function R(u) over the interval
, x The comma is a punctuation mark that appears in several variants in different languages. It has the same shape as an apostrophe or single closing quotation mark () in many typefaces, but it differs from them in being placed on the baseline o ...
/math>. # Use Abel's summation formula to express g(x) as a sum of integrals involving f(s) and its derivatives. # Express the integrals involving f(s) and its derivatives in terms of R(u) and its derivatives. # 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 In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet. Definition If f , g : \mathbb\to\mathbb are two arithmetic f ...
of ''f'', denoted by f^(n) whenever f(1) \neq 0, we write D_f(s) = 1 + s \cdot A_f(s). Then we have by absolute convergence of the DGF for any \Re(s) > \sigma_ that :\begin\int \frac \,dt & = \int \left(\sum_ (\sigma+\imath t)^ \times \sum_^ (-1)^k D_f(\sigma+\imath t)^k \frac\right) \, dt.\end Now we can call on
integration by parts In calculus, and more generally in mathematical analysis, integration by parts or partial integration is a process that finds the integral of a product of functions in terms of the integral of the product of their derivative and antiderivative. ...
to see that if we denote by F^(x) = \sum_ \frac x^ \times \frac denotes the m^
antiderivative In calculus, an antiderivative, inverse derivative, primitive function, primitive integral or indefinite integral of a function is a differentiable function whose derivative is equal to the original function . This can be stated symbolically ...
of ''F'', for any fixed non-negative integers k \geq 0, we have :\int (ax+b)^k \cdot F(ax+b) \, dx = \sum_^ \frac (-1)^ t^j F^(ax+b). Thus we obtain that :\begin\int_^T \frac \, dt & = \frac \left(\sum_ \sum_^j \sum_^k \frac (-1)^m (\sigma+\imath t)^ \left _f^k\right(\sigma+\imath t) \frac\right) \Biggr, _^.\end We also can relate the iterated integrals for the k^ antiderivatives of ''F'' by a finite sum of ''k'' single integrals of power-scaled versions of ''F'': :F^(x) = \sum_^ \binom \frac \int \frac \, 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\frac \int_^T \frac \, dt & = \frac \left(\sum_ \sum_^ \sum_^k \sum_^ \binom \frac (\sigma+\imath t)^ \frac \int_^ \left _f^k\rightv) \frac \right) \Biggr, _^ \\ & = \frac \left(\sum_ \sum_^ \sum_^k \frac \frac \int_0^1 s \cdot D_f^(rs) \left(1-\frac\right)^k \, dv\right) \Biggr, _^ \\ & = \frac \int_0^ \frac dr \Biggr, _^ \\ & = \frac \int_0^ \frac \, dv \Biggr, _^.\end


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: \sum_^\infty \frac = \int_0^\infty x^ \left(\sum_^\infty a_n e^\right) dx = \mathcal(s). * The Dirichlet inverse of a sequence a(n) is related to the inverse Mellin transform of its generating function: a_n = \frac \int_^ \frac ds, where c is a real number greater than the abscissa of convergence of the Dirichlet series \sum_^\infty a_n/n^s. * The Mellin transform of a
convolution In mathematics (in particular, functional analysis), convolution is a operation (mathematics), mathematical operation on two function (mathematics), functions ( and ) that produces a third function (f*g) that expresses how the shape of one is ...
of two sequences a(n) and b(n) is the product of their Mellin transforms: \mathcal(s) = \mathcal(s) \mathcal(s). * If a(n) is a sequence and f(x) is a function such that the integral \int_0^\infty \fracdx converges absolutely and uniformly for s in some right half plane, then we can define a Dirichlet series by a_n = \frac\int_0^\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)^F(\sigma+\imath t) = F^)(\sigma) / k!, and then proceed as if we were evaluating a traditional integral on the real line. Then we have that :\begin\hat_f(x; \sigma, T) & := \int_^T x^ D_f(\sigma+\imath t)\, dt \\ & = \sum_ \int_^ x^ (\imath t)^m \frac \\ & = \sum_ \int_^T t^ x^ \frac\,dt + \imath \times \sum_ \int_^T t^ x^ \frac \,dt.\end We require the result given by the following formula, which is proved rigorously by an application of
integration by parts In calculus, and more generally in mathematical analysis, integration by parts or partial integration is a process that finds the integral of a product of functions in terms of the integral of the product of their derivative and antiderivative. ...
, for any non-negative integer m \geq 0: :\begin\hat_m(T) & := \int_^ \frac x^ \,dt \\ & = \sum_^ \frac \cdot \frac \\ & = \frac \times \sum_^ \frac + \frac \times \sum_^ \frac.\end So the respective real and imaginary parts of our arithmetic function coefficients ''f'' at positive integers ''x'' satisfy: :\begin\operatorname(f(x)) & = x^ \times \lim_ \sum_ D_f^(\sigma) \cdot \frac \\ \operatorname(f(x)) & = x^ \times \lim_ \sum_ D_f^(\sigma) \cdot \frac.\end 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:To apply the integral formula for the Hadamard product, we observe that :\begin\sum_^ \frac & = -\frac ^kleft(\frac + \frac \right) \\ \sum_^ \frac & = -\frac ^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. :\begin\operatorname(f(x)) & = \lim_ \left frac \times \frac \int_^ \left(D_f(\sigma+\imath T \cdot e^) + D_f(\sigma - \imath T e^)\right) \left(FUNC(e^)\right) \, ds\right\\ \operatorname(f(x)) & = \lim_ \left frac \times \frac \int_^\pi \left(D_f(\sigma+\imath T \cdot e^) - D_f(\sigma - \imath T e^\right) () \, ds \right\end 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 In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet. Definition If f , g : \mathbb\to\mathbb are two arithmetic f ...
* Arithmetic function * Multiplicative function * Dirichlet generating function (DGF)


Notes


References

*{{Apostol IANT Number theory Analytic number theory Integer sequences