In mathematics, the von Mangoldt function is an arithmetic function named after German mathematician Hans von Mangoldt. It is an example of an important arithmetic function that is neither multiplicative nor additive.
The von Mangoldt function, denoted by, is defined as
Λ(n)=\begin{cases}logp&ifn=pkforsomeprimepandintegerk\ge1,\ 0&otherwise.\end{cases}
The values of for the first nine positive integers (i.e. natural numbers) are
0,log2,log3,log2,log5,0,log7,log2,log3,
which is related to .
The von Mangoldt function satisfies the identity[1] [2]
log(n)=\sumdΛ(d).
The sum is taken over all integers that divide . This is proved by the fundamental theorem of arithmetic, since the terms that are not powers of primes are equal to . For example, consider the case . Then
\begin{align} \sumdΛ(d)&=Λ(1)+Λ(2)+Λ(3)+Λ(4)+Λ(6)+Λ(12)\\ &=Λ(1)+Λ(2)+Λ(3)+Λ\left(22\right)+Λ(2 x 3)+Λ\left(22 x 3\right)\\ &=0+log(2)+log(3)+log(2)+0+0\\ &=log(2 x 3 x 2)\\ &=log(12). \end{align}
By Möbius inversion, we have
Λ(n)=\sumd\mu(d)log\left(
n | |
d |
\right)
Λ(n)=-\sumd\mu(d)log(d) .
For all
x\ge1
\sumn\le
Λ(n) | |
n |
=logx+O(1).
\psi(x)\lec1x,
x\ge1
\psi(x)\gec2x,
The von Mangoldt function plays an important role in the theory of Dirichlet series, and in particular, the Riemann zeta function. For example, one has
log
infty | |
\zeta(s)=\sum | |
n=2 |
Λ(n) | |
log(n) |
1 | |
ns |
, Re(s)>1.
The logarithmic derivative is then[6]
\zeta\prime(s) | |
\zeta(s) |
=
infty | |
-\sum | |
n=1 |
Λ(n) | |
ns |
.
These are special cases of a more general relation on Dirichlet series. If one has
F(s)
infty | |
=\sum | |
n=1 |
f(n) | |
ns |
for a completely multiplicative function, and the series converges for, then
F\prime(s) | |
F(s) |
=-
infty | |
\sum | |
n=1 |
f(n)Λ(n) | |
ns |
converges for .
The second Chebyshev function ψ(x) is the summatory function of the von Mangoldt function:[7]
\psi(x)=
\sum | |
pk\lex |
logp=\sumnΛ(n) .
It was introduced by Pafnuty Chebyshev who used it to show that the true order of the prime counting function
\pi(x)
x/logx
The Mellin transform of the Chebyshev function can be found by applying Perron's formula:
\zeta\prime(s) | |
\zeta(s) |
=-
infty | |
s\int | |
1 |
\psi(x) | |
xs+1 |
dx
which holds for .
Hardy and Littlewood examined the series[8]
infty | |
F(y)=\sum | |
n=2 |
\left(Λ(n)-1\right)e-ny
in the limit . Assuming the Riemann hypothesis, they demonstrate that
F(y)=O\left( | 1 |
\sqrt{y |
In particular this function is oscillatory with diverging oscillations: there exists a value such that both inequalities
F(y)<-
K | |
\sqrt{y |
hold infinitely often in any neighbourhood of 0. The graphic to the right indicates that this behaviour is not at first numerically obvious: the oscillations are not clearly seen until the series is summed in excess of 100 million terms, and are only readily visible when .
The Riesz mean of the von Mangoldt function is given by
\begin{align} \sumn\le\left(1-
n | |
λ |
\right)\deltaΛ(n)&=-
1 | |
2\pii |
c+iinfty | |
\int | |
c-iinfty |
\Gamma(1+\delta)\Gamma(s) | |
\Gamma(1+\delta+s) |
\zeta\prime(s) | |
\zeta(s) |
λsds\\ &=
λ | |
1+\delta |
+\sum\rho
\Gamma(1+\delta)\Gamma(\rho) | |
\Gamma(1+\delta+\rho) |
+\sumncnλ-n. \end{align}
Here, and are numbers characterizing the Riesz mean. One must take . The sum over is the sum over the zeroes of the Riemann zeta function, and
\sumncnλ-n
can be shown to be a convergent series for .
There is an explicit formula for the summatory Mangoldt function
\psi(x)
\psi(x)=x-\sum\zeta(\rho)=0
x\rho | |
\rho |
-log(2\pi).
If we separate out the trivial zeros of the zeta function, which are the negative even integers, we obtain
\psi(x)=x-\sum\zeta(\rho)=0, 0<\Re(\rho)<1
x\rho | -log(2\pi)- | |
\rho |
12log(1-x | |
-2 |
).
In the opposite direction, in 1911 E. Landau proved that for any fixed t > 1[10]
\sum0<\gamma
| ||||
t |
Λ(t)+l{O}(logT)
\limT
1 | |
T |
\sum0<\gamma\cos(\alphalogt)=-
Λ(t) | |
2\pi\sqrt{t |
The Fourier transform of the von Mangoldt function gives a spectrum with spikes at ordinates equal to the imaginary parts of the Riemann zeta function zeros. This is sometimes called a duality.
The functions
Λk(n)=\sum\limitsd\mid\mu(d)logk(n/d),
\mu
k
Λ1
Λ