The Möbius function is , is zero on integers divisible by a prime square, and is on products of distinct primes.
For , expand over the subsets of its distinct prime divisors. The coefficient of a squarefree divisor is its Möbius function value; nonsquarefree divisors have value zero. At the empty product is one. This identity is the multiplicative cancellation behind Möbius inversion and reciprocal Dirichlet series.
Put . The elementary estimates are
The identities and give the first two bounds. Convolve the harmonic divisor sum with : because , its left side is . Thus . The summed error is .
If arithmetic functions satisfy
then
The Mertens function is the summatory Möbius function
Suppose and . The Möbius divisor-sum identity gives . The exact Dirichlet convolution identity then gives , because its error is a convergent dyadic harmonic sum. Since , the displayed Mertens function bound follows. The classical Prime number theorem error meets the summability condition. This is a deduction from the Chebyshev error itself, without a separate estimate for the reciprocal zeta function.
The classical zero-free region of the Riemann zeta function and a truncated Perron formula give
for some absolute constant . Take contour height and move the Perron contour to .

Ancestors (5)

  1. Arithmetic function
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.