- Source: Dirichlet series
In mathematics, a Dirichlet series is any series of the form
∑
n
=
1
∞
a
n
n
s
,
{\displaystyle \sum _{n=1}^{\infty }{\frac {a_{n}}{n^{s}}},}
where s is complex, and
a
n
{\displaystyle a_{n}}
is a complex sequence. It is a special case of general Dirichlet series.
Dirichlet series play a variety of important roles in analytic number theory. The most usually seen definition of the Riemann zeta function is a Dirichlet series, as are the Dirichlet L-functions. It is conjectured that the Selberg class of series obeys the generalized Riemann hypothesis. The series is named in honor of Peter Gustav Lejeune Dirichlet.
Combinatorial importance
Dirichlet series can be used as generating series for counting weighted sets of objects with respect to a weight which is combined multiplicatively when taking Cartesian products.
Suppose that A is a set with a function w: A → N assigning a weight to each of the elements of A, and suppose additionally that the fibre over any natural number under that weight is a finite set. (We call such an arrangement (A,w) a weighted set.) Suppose additionally that an is the number of elements of A with weight n. Then we define the formal Dirichlet generating series for A with respect to w as follows:
D
w
A
(
s
)
=
∑
a
∈
A
1
w
(
a
)
s
=
∑
n
=
1
∞
a
n
n
s
{\displaystyle {\mathfrak {D}}_{w}^{A}(s)=\sum _{a\in A}{\frac {1}{w(a)^{s}}}=\sum _{n=1}^{\infty }{\frac {a_{n}}{n^{s}}}}
Note that if A and B are disjoint subsets of some weighted set (U, w), then the Dirichlet series for their (disjoint) union is equal to the sum of their Dirichlet series:
D
w
A
⊎
B
(
s
)
=
D
w
A
(
s
)
+
D
w
B
(
s
)
.
{\displaystyle {\mathfrak {D}}_{w}^{A\uplus B}(s)={\mathfrak {D}}_{w}^{A}(s)+{\mathfrak {D}}_{w}^{B}(s).}
Moreover, if (A, u) and (B, v) are two weighted sets, and we define a weight function w: A × B → N by
w
(
a
,
b
)
=
u
(
a
)
v
(
b
)
,
{\displaystyle w(a,b)=u(a)v(b),}
for all a in A and b in B, then we have the following decomposition for the Dirichlet series of the Cartesian product:
D
w
A
×
B
(
s
)
=
D
u
A
(
s
)
⋅
D
v
B
(
s
)
.
{\displaystyle {\mathfrak {D}}_{w}^{A\times B}(s)={\mathfrak {D}}_{u}^{A}(s)\cdot {\mathfrak {D}}_{v}^{B}(s).}
This follows ultimately from the simple fact that
n
−
s
⋅
m
−
s
=
(
n
m
)
−
s
.
{\displaystyle n^{-s}\cdot m^{-s}=(nm)^{-s}.}
Examples
The most famous example of a Dirichlet series is
ζ
(
s
)
=
∑
n
=
1
∞
1
n
s
,
{\displaystyle \zeta (s)=\sum _{n=1}^{\infty }{\frac {1}{n^{s}}},}
whose analytic continuation to
C
{\displaystyle \mathbb {C} }
(apart from a simple pole at
s
=
1
{\displaystyle s=1}
) is the Riemann zeta function.
Provided that f is real-valued at all natural numbers n, the respective real and imaginary parts of the Dirichlet series F have known formulas where we write
s
≡
σ
+
i
t
{\displaystyle s\equiv \sigma +it}
:
ℜ
[
F
(
s
)
]
=
∑
n
≥
1
f
(
n
)
cos
(
t
log
n
)
n
σ
ℑ
[
F
(
s
)
]
=
∑
n
≥
1
f
(
n
)
sin
(
t
log
n
)
n
σ
.
{\displaystyle {\begin{aligned}\Re [F(s)]&=\sum _{n\geq 1}{\frac {~f(n)\,\cos(t\log n)~}{n^{\sigma }}}\\\Im [F(s)]&=\sum _{n\geq 1}{\frac {~f(n)\,\sin(t\log n)~}{n^{\sigma }}}\,.\end{aligned}}}
Treating these as formal Dirichlet series for the time being in order to be able to ignore matters of convergence, note that we have:
ζ
(
s
)
=
D
id
N
(
s
)
=
∏
p
prime
D
id
{
p
n
:
n
∈
N
}
(
s
)
=
∏
p
prime
∑
n
∈
N
D
id
{
p
n
}
(
s
)
=
∏
p
prime
∑
n
∈
N
1
(
p
n
)
s
=
∏
p
prime
∑
n
∈
N
(
1
p
s
)
n
=
∏
p
prime
1
1
−
p
−
s
{\displaystyle {\begin{aligned}\zeta (s)&={\mathfrak {D}}_{\operatorname {id} }^{\mathbb {N} }(s)=\prod _{p{\text{ prime}}}{\mathfrak {D}}_{\operatorname {id} }^{\{p^{n}:n\in \mathbb {N} \}}(s)=\prod _{p{\text{ prime}}}\sum _{n\in \mathbb {N} }{\mathfrak {D}}_{\operatorname {id} }^{\{p^{n}\}}(s)\\&=\prod _{p{\text{ prime}}}\sum _{n\in \mathbb {N} }{\frac {1}{(p^{n})^{s}}}=\prod _{p{\text{ prime}}}\sum _{n\in \mathbb {N} }\left({\frac {1}{p^{s}}}\right)^{n}=\prod _{p{\text{ prime}}}{\frac {1}{1-p^{-s}}}\end{aligned}}}
as each natural number has a unique multiplicative decomposition into powers of primes. It is this bit of combinatorics which inspires the Euler product formula.
Another is:
1
ζ
(
s
)
=
∑
n
=
1
∞
μ
(
n
)
n
s
{\displaystyle {\frac {1}{\zeta (s)}}=\sum _{n=1}^{\infty }{\frac {\mu (n)}{n^{s}}}}
where μ(n) is the Möbius function. This and many of the following series may be obtained by applying Möbius inversion and Dirichlet convolution to known series. For example, given a Dirichlet character χ(n) one has
1
L
(
χ
,
s
)
=
∑
n
=
1
∞
μ
(
n
)
χ
(
n
)
n
s
{\displaystyle {\frac {1}{L(\chi ,s)}}=\sum _{n=1}^{\infty }{\frac {\mu (n)\chi (n)}{n^{s}}}}
where L(χ, s) is a Dirichlet L-function.
If the arithmetic function f has a Dirichlet inverse function
f
−
1
(
n
)
{\displaystyle f^{-1}(n)}
, i.e., if there exists an inverse function such that the Dirichlet convolution of f with its inverse yields the multiplicative identity
∑
d
|
n
f
(
d
)
f
−
1
(
n
/
d
)
=
δ
n
,
1
{\textstyle \sum _{d|n}f(d)f^{-1}(n/d)=\delta _{n,1}}
, then the DGF of the inverse function is given by the reciprocal of F:
∑
n
≥
1
f
−
1
(
n
)
n
s
=
(
∑
n
≥
1
f
(
n
)
n
s
)
−
1
.
{\displaystyle \sum _{n\geq 1}{\frac {f^{-1}(n)}{n^{s}}}=\left(\sum _{n\geq 1}{\frac {f(n)}{n^{s}}}\right)^{-1}.}
Other identities include
ζ
(
s
−
1
)
ζ
(
s
)
=
∑
n
=
1
∞
φ
(
n
)
n
s
{\displaystyle {\frac {\zeta (s-1)}{\zeta (s)}}=\sum _{n=1}^{\infty }{\frac {\varphi (n)}{n^{s}}}}
where
φ
(
n
)
{\displaystyle \varphi (n)}
is the totient function,
ζ
(
s
−
k
)
ζ
(
s
)
=
∑
n
=
1
∞
J
k
(
n
)
n
s
{\displaystyle {\frac {\zeta (s-k)}{\zeta (s)}}=\sum _{n=1}^{\infty }{\frac {J_{k}(n)}{n^{s}}}}
where Jk is the Jordan function, and
ζ
(
s
)
ζ
(
s
−
a
)
=
∑
n
=
1
∞
σ
a
(
n
)
n
s
ζ
(
s
)
ζ
(
s
−
a
)
ζ
(
s
−
2
a
)
ζ
(
2
s
−
2
a
)
=
∑
n
=
1
∞
σ
a
(
n
2
)
n
s
ζ
(
s
)
ζ
(
s
−
a
)
ζ
(
s
−
b
)
ζ
(
s
−
a
−
b
)
ζ
(
2
s
−
a
−
b
)
=
∑
n
=
1
∞
σ
a
(
n
)
σ
b
(
n
)
n
s
{\displaystyle {\begin{aligned}&\zeta (s)\zeta (s-a)=\sum _{n=1}^{\infty }{\frac {\sigma _{a}(n)}{n^{s}}}\\[6pt]&{\frac {\zeta (s)\zeta (s-a)\zeta (s-2a)}{\zeta (2s-2a)}}=\sum _{n=1}^{\infty }{\frac {\sigma _{a}(n^{2})}{n^{s}}}\\[6pt]&{\frac {\zeta (s)\zeta (s-a)\zeta (s-b)\zeta (s-a-b)}{\zeta (2s-a-b)}}=\sum _{n=1}^{\infty }{\frac {\sigma _{a}(n)\sigma _{b}(n)}{n^{s}}}\end{aligned}}}
where σa(n) is the divisor function. By specialization to the divisor function d = σ0 we have
ζ
2
(
s
)
=
∑
n
=
1
∞
d
(
n
)
n
s
ζ
3
(
s
)
ζ
(
2
s
)
=
∑
n
=
1
∞
d
(
n
2
)
n
s
ζ
4
(
s
)
ζ
(
2
s
)
=
∑
n
=
1
∞
d
(
n
)
2
n
s
.
{\displaystyle {\begin{aligned}\zeta ^{2}(s)&=\sum _{n=1}^{\infty }{\frac {d(n)}{n^{s}}}\\[6pt]{\frac {\zeta ^{3}(s)}{\zeta (2s)}}&=\sum _{n=1}^{\infty }{\frac {d(n^{2})}{n^{s}}}\\[6pt]{\frac {\zeta ^{4}(s)}{\zeta (2s)}}&=\sum _{n=1}^{\infty }{\frac {d(n)^{2}}{n^{s}}}.\end{aligned}}}
The logarithm of the zeta function is given by
log
ζ
(
s
)
=
∑
n
=
2
∞
Λ
(
n
)
log
(
n
)
1
n
s
,
ℜ
(
s
)
>
1.
{\displaystyle \log \zeta (s)=\sum _{n=2}^{\infty }{\frac {\Lambda (n)}{\log(n)}}{\frac {1}{n^{s}}},\qquad \Re (s)>1.}
Similarly, we have that
−
ζ
′
(
s
)
=
∑
n
=
2
∞
log
(
n
)
n
s
,
ℜ
(
s
)
>
1.
{\displaystyle -\zeta '(s)=\sum _{n=2}^{\infty }{\frac {\log(n)}{n^{s}}},\qquad \Re (s)>1.}
Here, Λ(n) is the von Mangoldt function. The logarithmic derivative is then
ζ
′
(
s
)
ζ
(
s
)
=
−
∑
n
=
1
∞
Λ
(
n
)
n
s
.
{\displaystyle {\frac {\zeta '(s)}{\zeta (s)}}=-\sum _{n=1}^{\infty }{\frac {\Lambda (n)}{n^{s}}}.}
These last three are special cases of a more general relationship for derivatives of Dirichlet series, given below.
Given the Liouville function λ(n), one has
ζ
(
2
s
)
ζ
(
s
)
=
∑
n
=
1
∞
λ
(
n
)
n
s
.
{\displaystyle {\frac {\zeta (2s)}{\zeta (s)}}=\sum _{n=1}^{\infty }{\frac {\lambda (n)}{n^{s}}}.}
Yet another example involves Ramanujan's sum:
σ
1
−
s
(
m
)
ζ
(
s
)
=
∑
n
=
1
∞
c
n
(
m
)
n
s
.
{\displaystyle {\frac {\sigma _{1-s}(m)}{\zeta (s)}}=\sum _{n=1}^{\infty }{\frac {c_{n}(m)}{n^{s}}}.}
Another pair of examples involves the Möbius function and the prime omega function:
ζ
(
s
)
ζ
(
2
s
)
=
∑
n
=
1
∞
|
μ
(
n
)
|
n
s
≡
∑
n
=
1
∞
μ
2
(
n
)
n
s
.
{\displaystyle {\frac {\zeta (s)}{\zeta (2s)}}=\sum _{n=1}^{\infty }{\frac {|\mu (n)|}{n^{s}}}\equiv \sum _{n=1}^{\infty }{\frac {\mu ^{2}(n)}{n^{s}}}.}
ζ
2
(
s
)
ζ
(
2
s
)
=
∑
n
=
1
∞
2
ω
(
n
)
n
s
.
{\displaystyle {\frac {\zeta ^{2}(s)}{\zeta (2s)}}=\sum _{n=1}^{\infty }{\frac {2^{\omega (n)}}{n^{s}}}.}
We have that the Dirichlet series for the prime zeta function, which is the analog to the Riemann zeta function summed only over indices n which are prime, is given by a sum over the Moebius function and the logarithms of the zeta function:
P
(
s
)
:=
∑
p
prime
p
−
s
=
∑
n
≥
1
μ
(
n
)
n
log
ζ
(
n
s
)
.
{\displaystyle P(s):=\sum _{p{\text{ prime}}}p^{-s}=\sum _{n\geq 1}{\frac {\mu (n)}{n}}\log \zeta (ns).}
A large tabular catalog listing of other examples of sums corresponding to known Dirichlet series representations is found here.
Examples of Dirichlet series DGFs corresponding to additive (rather than multiplicative) f are given here for the prime omega functions
ω
(
n
)
{\displaystyle \omega (n)}
and
Ω
(
n
)
{\displaystyle \Omega (n)}
, which respectively count the number of distinct prime factors of n (with multiplicity or not). For example, the DGF of the first of these functions is expressed as the product of the Riemann zeta function and the prime zeta function for any complex s with
ℜ
(
s
)
>
1
{\displaystyle \Re (s)>1}
:
∑
n
≥
1
ω
(
n
)
n
s
=
ζ
(
s
)
⋅
P
(
s
)
,
ℜ
(
s
)
>
1.
{\displaystyle \sum _{n\geq 1}{\frac {\omega (n)}{n^{s}}}=\zeta (s)\cdot P(s),\Re (s)>1.}
If f is a multiplicative function such that its DGF F converges absolutely for all
ℜ
(
s
)
>
σ
a
,
f
{\displaystyle \Re (s)>\sigma _{a,f}}
, and if p is any prime number, we have that
(
1
+
f
(
p
)
p
−
s
)
×
∑
n
≥
1
f
(
n
)
μ
(
n
)
n
s
=
(
1
−
f
(
p
)
p
−
s
)
×
∑
n
≥
1
f
(
n
)
μ
(
n
)
μ
(
gcd
(
p
,
n
)
)
n
s
,
∀
ℜ
(
s
)
>
σ
a
,
f
,
{\displaystyle \left(1+f(p)p^{-s}\right)\times \sum _{n\geq 1}{\frac {f(n)\mu (n)}{n^{s}}}=\left(1-f(p)p^{-s}\right)\times \sum _{n\geq 1}{\frac {f(n)\mu (n)\mu (\gcd(p,n))}{n^{s}}},\forall \Re (s)>\sigma _{a,f},}
where
μ
(
n
)
{\displaystyle \mu (n)}
is the Moebius function. Another unique Dirichlet series identity generates the summatory function of some arithmetic f evaluated at GCD inputs given by
∑
n
≥
1
(
∑
k
=
1
n
f
(
gcd
(
k
,
n
)
)
)
1
n
s
=
ζ
(
s
−
1
)
ζ
(
s
)
×
∑
n
≥
1
f
(
n
)
n
s
,
∀
ℜ
(
s
)
>
σ
a
,
f
+
1.
{\displaystyle \sum _{n\geq 1}\left(\sum _{k=1}^{n}f(\gcd(k,n))\right){\frac {1}{n^{s}}}={\frac {\zeta (s-1)}{\zeta (s)}}\times \sum _{n\geq 1}{\frac {f(n)}{n^{s}}},\forall \Re (s)>\sigma _{a,f}+1.}
We also have a formula between the DGFs of two arithmetic functions f and g related by Moebius inversion. In particular, if
g
(
n
)
=
(
f
∗
1
)
(
n
)
{\displaystyle g(n)=(f\ast 1)(n)}
, then by Moebius inversion we have that
f
(
n
)
=
(
g
∗
μ
)
(
n
)
{\displaystyle f(n)=(g\ast \mu )(n)}
. Hence, if F and G are the two respective DGFs of f and g, then we can relate these two DGFs by the formulas:
F
(
s
)
=
G
(
s
)
ζ
(
s
)
,
ℜ
(
s
)
>
max
(
σ
a
,
f
,
σ
a
,
g
)
.
{\displaystyle F(s)={\frac {G(s)}{\zeta (s)}},\Re (s)>\max(\sigma _{a,f},\sigma _{a,g}).}
There is a known formula for the exponential of a Dirichlet series. If
F
(
s
)
=
exp
(
G
(
s
)
)
{\displaystyle F(s)=\exp(G(s))}
is the DGF of some arithmetic f with
f
(
1
)
≠
0
{\displaystyle f(1)\neq 0}
, then the DGF G is expressed by the sum
G
(
s
)
=
log
(
f
(
1
)
)
+
∑
n
≥
2
(
f
′
∗
f
−
1
)
(
n
)
log
(
n
)
⋅
n
s
,
{\displaystyle G(s)=\log(f(1))+\sum _{n\geq 2}{\frac {(f^{\prime }\ast f^{-1})(n)}{\log(n)\cdot n^{s}}},}
where
f
−
1
(
n
)
{\displaystyle f^{-1}(n)}
is the Dirichlet inverse of f and where the arithmetic derivative of f is given by the formula
f
′
(
n
)
=
log
(
n
)
⋅
f
(
n
)
{\displaystyle f^{\prime }(n)=\log(n)\cdot f(n)}
for all natural numbers
n
≥
2
{\displaystyle n\geq 2}
.
Analytic properties
Given a sequence
{
a
n
}
n
∈
N
{\displaystyle \{a_{n}\}_{n\in \mathbb {N} }}
of complex numbers we try to consider the value of
f
(
s
)
=
∑
n
=
1
∞
a
n
n
s
{\displaystyle f(s)=\sum _{n=1}^{\infty }{\frac {a_{n}}{n^{s}}}}
as a function of the complex variable s. In order for this to make sense, we need to consider the convergence properties of the above infinite series:
If
{
a
n
}
n
∈
N
{\displaystyle \{a_{n}\}_{n\in \mathbb {N} }}
is a bounded sequence of complex numbers, then the corresponding Dirichlet series f converges absolutely on the open half-plane Re(s) > 1. In general, if an = O(nk), the series converges absolutely in the half plane Re(s) > k + 1.
If the set of sums
a
n
+
a
n
+
1
+
⋯
+
a
n
+
k
{\displaystyle a_{n}+a_{n+1}+\cdots +a_{n+k}}
is bounded for n and k ≥ 0, then the above infinite series converges on the open half-plane of s such that Re(s) > 0.
In both cases f is an analytic function on the corresponding open half plane.
In general
σ
{\displaystyle \sigma }
is the abscissa of convergence of a Dirichlet series if it converges for
ℜ
(
s
)
>
σ
{\displaystyle \Re (s)>\sigma }
and diverges for
ℜ
(
s
)
<
σ
.
{\displaystyle \Re (s)<\sigma .}
This is the analogue for Dirichlet series of the radius of convergence for power series. The Dirichlet series case is more complicated, though: absolute convergence and uniform convergence may occur in distinct half-planes.
In many cases, the analytic function associated with a Dirichlet series has an analytic extension to a larger domain.
= Abscissa of convergence
=Suppose
∑
n
=
1
∞
a
n
n
s
0
{\displaystyle \sum _{n=1}^{\infty }{\frac {a_{n}}{n^{s_{0}}}}}
converges for some
s
0
∈
C
,
ℜ
(
s
0
)
>
0.
{\displaystyle s_{0}\in \mathbb {C} ,\Re (s_{0})>0.}
Proposition 1.
A
(
N
)
:=
∑
n
=
1
N
a
n
=
o
(
N
s
0
)
.
{\displaystyle A(N):=\sum _{n=1}^{N}a_{n}=o(N^{s_{0}}).}
Proof. Note that:
(
n
+
1
)
s
−
n
s
=
∫
n
n
+
1
s
x
s
−
1
d
x
=
O
(
n
s
−
1
)
.
{\displaystyle (n+1)^{s}-n^{s}=\int _{n}^{n+1}sx^{s-1}\,dx={\mathcal {O}}(n^{s-1}).}
and define
B
(
N
)
=
∑
n
=
1
N
a
n
n
s
0
=
ℓ
+
o
(
1
)
{\displaystyle B(N)=\sum _{n=1}^{N}{\frac {a_{n}}{n^{s_{0}}}}=\ell +o(1)}
where
ℓ
=
∑
n
=
1
∞
a
n
n
s
0
.
{\displaystyle \ell =\sum _{n=1}^{\infty }{\frac {a_{n}}{n^{s_{0}}}}.}
By summation by parts we have
A
(
N
)
=
∑
n
=
1
N
a
n
n
s
0
n
s
0
=
B
(
N
)
N
s
0
+
∑
n
=
1
N
−
1
B
(
n
)
(
n
s
0
−
(
n
+
1
)
s
0
)
=
(
B
(
N
)
−
ℓ
)
N
s
0
+
∑
n
=
1
N
−
1
(
B
(
n
)
−
ℓ
)
(
n
s
0
−
(
n
+
1
)
s
0
)
=
o
(
N
s
0
)
+
∑
n
=
1
N
−
1
o
(
n
s
0
−
1
)
=
o
(
N
s
0
)
{\displaystyle {\begin{aligned}A(N)&=\sum _{n=1}^{N}{\frac {a_{n}}{n^{s_{0}}}}n^{s_{0}}\\&=B(N)N^{s_{0}}+\sum _{n=1}^{N-1}B(n)\left(n^{s_{0}}-(n+1)^{s_{0}}\right)\\&=(B(N)-\ell )N^{s_{0}}+\sum _{n=1}^{N-1}(B(n)-\ell )\left(n^{s_{0}}-(n+1)^{s_{0}}\right)\\&=o(N^{s_{0}})+\sum _{n=1}^{N-1}{\mathcal {o}}(n^{s_{0}-1})\\&=o(N^{s_{0}})\end{aligned}}}
Proposition 2. Define
L
=
{
∑
n
=
1
∞
a
n
If convergent
0
otherwise
{\displaystyle L={\begin{cases}\sum _{n=1}^{\infty }a_{n}&{\text{If convergent}}\\0&{\text{otherwise}}\end{cases}}}
Then:
σ
=
lim
sup
N
→
∞
ln
|
A
(
N
)
−
L
|
ln
N
=
inf
σ
{
A
(
N
)
−
L
=
O
(
N
σ
)
}
{\displaystyle \sigma =\lim \sup _{N\to \infty }{\frac {\ln |A(N)-L|}{\ln N}}=\inf _{\sigma }\left\{A(N)-L={\mathcal {O}}(N^{\sigma })\right\}}
is the abscissa of convergence of the Dirichlet series.
Proof. From the definition
∀
ε
>
0
A
(
N
)
−
L
=
O
(
N
σ
+
ε
)
{\displaystyle \forall \varepsilon >0\qquad A(N)-L={\mathcal {O}}(N^{\sigma +\varepsilon })}
so that
∑
n
=
1
N
a
n
n
s
=
A
(
N
)
N
−
s
+
∑
n
=
1
N
−
1
A
(
n
)
(
n
−
s
−
(
n
+
1
)
−
s
)
=
(
A
(
N
)
−
L
)
N
−
s
+
∑
n
=
1
N
−
1
(
A
(
n
)
−
L
)
(
n
−
s
−
(
n
+
1
)
−
s
)
=
O
(
N
σ
+
ε
−
s
)
+
∑
n
=
1
N
−
1
O
(
n
σ
+
ε
−
s
−
1
)
{\displaystyle {\begin{aligned}\sum _{n=1}^{N}{\frac {a_{n}}{n^{s}}}&=A(N)N^{-s}+\sum _{n=1}^{N-1}A(n)(n^{-s}-(n+1)^{-s})\\&=(A(N)-L)N^{-s}+\sum _{n=1}^{N-1}(A(n)-L)(n^{-s}-(n+1)^{-s})\\&={\mathcal {O}}(N^{\sigma +\varepsilon -s})+\sum _{n=1}^{N-1}{\mathcal {O}}(n^{\sigma +\varepsilon -s-1})\end{aligned}}}
which converges as
N
→
∞
{\displaystyle N\to \infty }
whenever
ℜ
(
s
)
>
σ
.
{\displaystyle \Re (s)>\sigma .}
Hence, for every
s
{\displaystyle s}
such that
∑
n
=
1
∞
a
n
n
−
s
{\textstyle \sum _{n=1}^{\infty }a_{n}n^{-s}}
diverges, we have
σ
≥
ℜ
(
s
)
,
{\displaystyle \sigma \geq \Re (s),}
and this finishes the proof.
Proposition 3. If
∑
n
=
1
∞
a
n
{\displaystyle \sum _{n=1}^{\infty }a_{n}}
converges then
f
(
σ
+
i
t
)
=
o
(
1
σ
)
{\displaystyle f(\sigma +it)=o\left({\tfrac {1}{\sigma }}\right)}
as
σ
→
0
+
{\displaystyle \sigma \to 0^{+}}
and where it is meromorphic (
f
(
s
)
{\displaystyle f(s)}
has no poles on
ℜ
(
s
)
=
0
{\displaystyle \Re (s)=0}
).
Proof. Note that
n
−
s
−
(
n
+
1
)
−
s
=
s
n
−
s
−
1
+
O
(
n
−
s
−
2
)
{\displaystyle n^{-s}-(n+1)^{-s}=sn^{-s-1}+O(n^{-s-2})}
and
A
(
N
)
−
f
(
0
)
→
0
{\displaystyle A(N)-f(0)\to 0}
we have by summation by parts, for
ℜ
(
s
)
>
0
{\displaystyle \Re (s)>0}
f
(
s
)
=
lim
N
→
∞
∑
n
=
1
N
a
n
n
s
=
lim
N
→
∞
A
(
N
)
N
−
s
+
∑
n
=
1
N
−
1
A
(
n
)
(
n
−
s
−
(
n
+
1
)
−
s
)
=
s
∑
n
=
1
∞
A
(
n
)
n
−
s
−
1
+
O
(
∑
n
=
1
∞
A
(
n
)
n
−
s
−
2
)
⏟
=
O
(
1
)
{\displaystyle {\begin{aligned}f(s)&=\lim _{N\to \infty }\sum _{n=1}^{N}{\frac {a_{n}}{n^{s}}}\\&=\lim _{N\to \infty }A(N)N^{-s}+\sum _{n=1}^{N-1}A(n)(n^{-s}-(n+1)^{-s})\\&=s\sum _{n=1}^{\infty }A(n)n^{-s-1}+\underbrace {{\mathcal {O}}\left(\sum _{n=1}^{\infty }A(n)n^{-s-2}\right)} _{={\mathcal {O}}(1)}\end{aligned}}}
Now find N such that for n > N,
|
A
(
n
)
−
f
(
0
)
|
<
ε
{\displaystyle |A(n)-f(0)|<\varepsilon }
s
∑
n
=
1
∞
A
(
n
)
n
−
s
−
1
=
s
f
(
0
)
ζ
(
s
+
1
)
+
s
∑
n
=
1
N
(
A
(
n
)
−
f
(
0
)
)
n
−
s
−
1
⏟
=
O
(
1
)
+
s
∑
n
=
N
+
1
∞
(
A
(
n
)
−
f
(
0
)
)
n
−
s
−
1
⏟
<
ε
|
s
|
∫
N
∞
x
−
ℜ
(
s
)
−
1
d
x
{\displaystyle s\sum _{n=1}^{\infty }A(n)n^{-s-1}=\underbrace {sf(0)\zeta (s+1)+s\sum _{n=1}^{N}(A(n)-f(0))n^{-s-1}} _{={\mathcal {O}}(1)}+\underbrace {s\sum _{n=N+1}^{\infty }(A(n)-f(0))n^{-s-1}} _{<\varepsilon |s|\int _{N}^{\infty }x^{-\Re (s)-1}\,dx}}
and hence, for every
ε
>
0
{\displaystyle \varepsilon >0}
there is a
C
{\displaystyle C}
such that for
σ
>
0
{\displaystyle \sigma >0}
:
|
f
(
σ
+
i
t
)
|
<
C
+
ε
|
σ
+
i
t
|
1
σ
.
{\displaystyle |f(\sigma +it)|
Formal Dirichlet series
A formal Dirichlet series over a ring R is associated to a function a from the positive integers to R
D
(
a
,
s
)
=
∑
n
=
1
∞
a
(
n
)
n
−
s
{\displaystyle D(a,s)=\sum _{n=1}^{\infty }a(n)n^{-s}\ }
with addition and multiplication defined by
D
(
a
,
s
)
+
D
(
b
,
s
)
=
∑
n
=
1
∞
(
a
+
b
)
(
n
)
n
−
s
{\displaystyle D(a,s)+D(b,s)=\sum _{n=1}^{\infty }(a+b)(n)n^{-s}\ }
D
(
a
,
s
)
⋅
D
(
b
,
s
)
=
∑
n
=
1
∞
(
a
∗
b
)
(
n
)
n
−
s
{\displaystyle D(a,s)\cdot D(b,s)=\sum _{n=1}^{\infty }(a*b)(n)n^{-s}\ }
where
(
a
+
b
)
(
n
)
=
a
(
n
)
+
b
(
n
)
{\displaystyle (a+b)(n)=a(n)+b(n)\ }
is the pointwise sum and
(
a
∗
b
)
(
n
)
=
∑
k
∣
n
a
(
k
)
b
(
n
/
k
)
{\displaystyle (a*b)(n)=\sum _{k\mid n}a(k)b(n/k)\ }
is the Dirichlet convolution of a and b.
The formal Dirichlet series form a ring Ω, indeed an R-algebra, with the zero function as additive zero element and the function δ defined by δ(1) = 1, δ(n) = 0 for n > 1 as multiplicative identity. An element of this ring is invertible if a(1) is invertible in R. If R is commutative, so is Ω; if R is an integral domain, so is Ω. The non-zero multiplicative functions form a subgroup of the group of units of Ω.
The ring of formal Dirichlet series over C is isomorphic to a ring of formal power series in countably many variables.
Derivatives
Given
F
(
s
)
=
∑
n
=
1
∞
f
(
n
)
n
s
{\displaystyle F(s)=\sum _{n=1}^{\infty }{\frac {f(n)}{n^{s}}}}
it is possible to show that
F
′
(
s
)
=
−
∑
n
=
1
∞
f
(
n
)
log
(
n
)
n
s
{\displaystyle F'(s)=-\sum _{n=1}^{\infty }{\frac {f(n)\log(n)}{n^{s}}}}
assuming the right hand side converges. For a completely multiplicative function ƒ(n), and assuming the series converges for Re(s) > σ0, then one has that
F
′
(
s
)
F
(
s
)
=
−
∑
n
=
1
∞
f
(
n
)
Λ
(
n
)
n
s
{\displaystyle {\frac {F^{\prime }(s)}{F(s)}}=-\sum _{n=1}^{\infty }{\frac {f(n)\Lambda (n)}{n^{s}}}}
converges for Re(s) > σ0. Here, Λ(n) is the von Mangoldt function.
Products
Suppose
F
(
s
)
=
∑
n
=
1
∞
f
(
n
)
n
−
s
{\displaystyle F(s)=\sum _{n=1}^{\infty }f(n)n^{-s}}
and
G
(
s
)
=
∑
n
=
1
∞
g
(
n
)
n
−
s
.
{\displaystyle G(s)=\sum _{n=1}^{\infty }g(n)n^{-s}.}
If both F(s) and G(s) are absolutely convergent for s > a and s > b then we have
1
2
T
∫
−
T
T
F
(
a
+
i
t
)
G
(
b
−
i
t
)
d
t
=
∑
n
=
1
∞
f
(
n
)
g
(
n
)
n
−
a
−
b
as
T
∼
∞
.
{\displaystyle {\frac {1}{2T}}\int _{-T}^{T}\,F(a+it)G(b-it)\,dt=\sum _{n=1}^{\infty }f(n)g(n)n^{-a-b}{\text{ as }}T\sim \infty .}
If a = b and ƒ(n) = g(n) we have
1
2
T
∫
−
T
T
|
F
(
a
+
i
t
)
|
2
d
t
=
∑
n
=
1
∞
[
f
(
n
)
]
2
n
−
2
a
as
T
∼
∞
.
{\displaystyle {\frac {1}{2T}}\int _{-T}^{T}|F(a+it)|^{2}\,dt=\sum _{n=1}^{\infty }[f(n)]^{2}n^{-2a}{\text{ as }}T\sim \infty .}
Coefficient inversion (integral formula)
For all positive integers
x
≥
1
{\displaystyle x\geq 1}
, the function f at x,
f
(
x
)
{\displaystyle f(x)}
, can be recovered from the Dirichlet generating function (DGF) F of f (or the Dirichlet series over f) using the following integral formula whenever
σ
>
σ
a
,
f
{\displaystyle \sigma >\sigma _{a,f}}
, the abscissa of absolute convergence of the DGF F
f
(
x
)
=
lim
T
→
∞
1
2
T
∫
−
T
T
x
σ
+
i
t
F
(
σ
+
i
t
)
d
t
.
{\displaystyle f(x)=\lim _{T\rightarrow \infty }{\frac {1}{2T}}\int _{-T}^{T}x^{\sigma +it}F(\sigma +it)dt.}
It is also possible to invert the Mellin transform of the summatory function of f that defines the DGF F of f to obtain the coefficients of the Dirichlet series (see section below). In this case, we arrive at a complex contour integral formula related to Perron's theorem. Practically speaking, the rates of convergence of the above formula as a function of T are variable, and if the Dirichlet series F is sensitive to sign changes as a slowly converging series, it may require very large T to approximate the coefficients of F using this formula without taking the formal limit.
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
{\displaystyle c,x>0}
and any real
ℜ
(
s
)
≡
σ
>
σ
a
,
f
−
c
{\displaystyle \Re (s)\equiv \sigma >\sigma _{a,f}-c}
where we denote
ℜ
(
s
)
:=
σ
{\displaystyle \Re (s):=\sigma }
:
∑
n
≤
x
′
f
(
n
)
n
s
=
1
2
π
i
∫
c
−
i
∞
c
+
i
∞
D
f
(
s
+
z
)
x
z
z
d
z
.
{\displaystyle {\sum _{n\leq x}}^{\prime }{\frac {f(n)}{n^{s}}}={\frac {1}{2\pi i}}\int _{c-i\infty }^{c+i\infty }D_{f}(s+z){\frac {x^{z}}{z}}dz.}
Integral and series transformations
The inverse Mellin transform of a Dirichlet series, divided by s, is given by Perron's formula.
Additionally, if
F
(
z
)
:=
∑
n
≥
0
f
n
z
n
{\textstyle F(z):=\sum _{n\geq 0}f_{n}z^{n}}
is the (formal) ordinary generating function of the sequence of
{
f
n
}
n
≥
0
{\displaystyle \{f_{n}\}_{n\geq 0}}
, then an integral representation for the Dirichlet series of the generating function sequence,
{
f
n
z
n
}
n
≥
0
{\displaystyle \{f_{n}z^{n}\}_{n\geq 0}}
, is given by
∑
n
≥
0
f
n
z
n
(
n
+
1
)
s
=
(
−
1
)
s
−
1
(
s
−
1
)
!
∫
0
1
log
s
−
1
(
t
)
F
(
t
z
)
d
t
,
s
≥
1.
{\displaystyle \sum _{n\geq 0}{\frac {f_{n}z^{n}}{(n+1)^{s}}}={\frac {(-1)^{s-1}}{(s-1)!}}\int _{0}^{1}\log ^{s-1}(t)F(tz)\,dt,\ s\geq 1.}
Another class of related derivative and series-based generating function transformations on the ordinary generating function of a sequence which effectively produces the left-hand-side expansion in the previous equation are respectively defined in.
Relation to power series
The sequence an generated by a Dirichlet series generating function corresponding to:
ζ
(
s
)
m
=
∑
n
=
1
∞
a
n
n
s
{\displaystyle \zeta (s)^{m}=\sum _{n=1}^{\infty }{\frac {a_{n}}{n^{s}}}}
where ζ(s) is the Riemann zeta function, has the ordinary generating function:
∑
n
=
1
∞
a
n
x
n
=
x
+
(
m
1
)
∑
a
=
2
∞
x
a
+
(
m
2
)
∑
a
=
2
∞
∑
b
=
2
∞
x
a
b
+
(
m
3
)
∑
a
=
2
∞
∑
b
=
2
∞
∑
c
=
2
∞
x
a
b
c
+
(
m
4
)
∑
a
=
2
∞
∑
b
=
2
∞
∑
c
=
2
∞
∑
d
=
2
∞
x
a
b
c
d
+
⋯
{\displaystyle \sum _{n=1}^{\infty }a_{n}x^{n}=x+{m \choose 1}\sum _{a=2}^{\infty }x^{a}+{m \choose 2}\sum _{a=2}^{\infty }\sum _{b=2}^{\infty }x^{ab}+{m \choose 3}\sum _{a=2}^{\infty }\sum _{b=2}^{\infty }\sum _{c=2}^{\infty }x^{abc}+{m \choose 4}\sum _{a=2}^{\infty }\sum _{b=2}^{\infty }\sum _{c=2}^{\infty }\sum _{d=2}^{\infty }x^{abcd}+\cdots }
Relation to the summatory function of an arithmetic function via Mellin transforms
If f is an arithmetic function with corresponding DGF F, and the summatory function of f is defined by
S
f
(
x
)
:=
{
∑
n
≤
x
f
(
n
)
,
x
≥
1
;
0
,
0
<
x
<
1
,
{\displaystyle S_{f}(x):={\begin{cases}\sum _{n\leq x}f(n),&x\geq 1;\\0,&0
then we can express F by the Mellin transform of the summatory function at
−
s
{\displaystyle -s}
. Namely, we have that
F
(
s
)
=
s
⋅
∫
1
∞
S
f
(
x
)
x
s
+
1
d
x
,
ℜ
(
s
)
>
σ
a
,
f
.
{\displaystyle F(s)=s\cdot \int _{1}^{\infty }{\frac {S_{f}(x)}{x^{s+1}}}dx,\Re (s)>\sigma _{a,f}.}
For
σ
:=
ℜ
(
s
)
>
0
{\displaystyle \sigma :=\Re (s)>0}
and any natural numbers
N
≥
1
{\displaystyle N\geq 1}
, we also have the approximation to the DGF F of f given by
F
(
s
)
=
∑
n
≤
N
f
(
n
)
n
−
s
−
S
f
(
N
)
N
s
+
s
⋅
∫
N
∞
S
f
(
y
)
y
s
+
1
d
y
.
{\displaystyle F(s)=\sum _{n\leq N}f(n)n^{-s}-{\frac {S_{f}(N)}{N^{s}}}+s\cdot \int _{N}^{\infty }{\frac {S_{f}(y)}{y^{s+1}}}dy.}
See also
General Dirichlet series
Zeta function regularization
Euler product
Dirichlet convolution
References
Apostol, Tom M. (1976), Introduction to analytic number theory, Undergraduate Texts in Mathematics, New York-Heidelberg: Springer-Verlag, ISBN 978-0-387-90163-3, MR 0434929, Zbl 0335.10001
Hardy, G.H.; Riesz, Marcel (1915). The general theory of Dirichlet's series. Cambridge Tracts in Mathematics. Vol. 18. Cambridge University Press.
The general theory of Dirichlet's series by G. H. Hardy. Cornell University Library Historical Math Monographs. {Reprinted by} Cornell University Library Digital Collections
Gould, Henry W.; Shonhiwa, Temba (2008). "A catalogue of interesting Dirichlet series". Miss. J. Math. Sci. 20 (1). Archived from the original on 2011-10-02.
Mathar, Richard J. (2011). "Survey of Dirichlet series of multiplicative arithmetic functions". arXiv:1106.4038 [math.NT].
Tenenbaum, Gérald (1995). Introduction to Analytic and Probabilistic Number Theory. Cambridge Studies in Advanced Mathematics. Vol. 46. Cambridge University Press. ISBN 0-521-41261-7. Zbl 0831.11001.
"Dirichlet series". PlanetMath.
Kata Kunci Pencarian:
- Integral Dirichlet
- Isospektral
- André Weil
- Hipotesis Riemann
- 1 − 2 + 3 − 4 + ⋯
- Deret (matematika)
- Bentuk modular
- Bilangan prima
- Transformasi Laplace
- Teori bilangan
- Dirichlet series
- General Dirichlet series
- Dirichlet L-function
- Series expansion
- Series (mathematics)
- Dirichlet convolution
- Ramanujan tau function
- Generating function
- Peter Gustav Lejeune Dirichlet
- Riemann zeta function
