Abel Summation

In analytic number theory, one often studies sums of the form

number-theorybook

Motivation

In analytic number theory, one often studies sums of the form

$$ \sum_{n\leq x} a_n f(n), $$

where $a_n$ is an arithmetic sequence and $f(x)$ is a smooth function. Direct estimation of such sums is frequently difficult. Abel summation transforms the problem into one involving partial sums of the coefficients $a_n$.

This method is the discrete analogue of integration by parts. It is one of the basic tools connecting arithmetic information with analytic estimates.

Partial Sums

Let

$$ A(x)=\sum_{n\leq x} a_n. $$

The function $A(x)$ records the cumulative behavior of the sequence $a_n$. Abel summation expresses weighted sums in terms of $A(x)$ rather than the individual coefficients.

Suppose $f$ has a continuous derivative on $[1,x]$. Then

$$ \sum_{n\leq x} a_n f(n) = A(x)f(x) - \int_1^x A(t)f'(t),dt. $$

This identity is called Abel summation formula or partial summation.

It converts a discrete sum into an integral involving the partial sums $A(t)$.

Derivation

Let

$$ S(x)=\sum_{n\leq x} a_n f(n). $$

Since

$$ a_n=A(n)-A(n-1), $$

we may write

$$ S(x) = \sum_{n\leq x} (A(n)-A(n-1))f(n). $$

Expanding gives

$$ S(x) = \sum_{n\leq x} A(n)f(n) - \sum_{n\leq x} A(n-1)f(n). $$

After shifting indices and rearranging terms,

$$ S(x) = A(x)f(x) - \sum_{n<x} A(n)(f(n+1)-f(n)). $$

Approximating the finite difference by the derivative of $f$ leads to the integral form

$$ \sum_{n\leq x} a_n f(n) = A(x)f(x) - \int_1^x A(t)f'(t),dt. $$

This formula mirrors integration by parts:

$$ \int u,dv = uv - \int v,du. $$

Harmonic Numbers

Take

$$ a_n=1. $$

Then

$$ A(x)=\lfloor x\rfloor. $$

Choose

$$ f(x)=\frac1x. $$

Abel summation gives

$$ \sum_{n\leq x}\frac1n = \frac{\lfloor x\rfloor}{x} + \int_1^x \frac{\lfloor t\rfloor}{t^2},dt. $$

Since $\lfloor t\rfloor \sim t$, the integral behaves like

$$ \int_1^x \frac{dt}{t} = \log x. $$

Thus the harmonic numbers satisfy

$$ \sum_{n\leq x}\frac1n = \log x + O(1). $$

This recovers the logarithmic growth of the harmonic series.

Prime Counting Example

Let

$$ \pi(x)=\sum_{p\leq x}1 $$

denote the prime counting function. To study reciprocal sums over primes,

$$ \sum_{p\leq x}\frac1p, $$

take

$$ a_n= \begin{cases} 1,& n\text{ prime},\ 0,& \text{otherwise}, \end{cases} $$

so that

$$ A(x)=\pi(x). $$

Using $f(x)=1/x$, Abel summation gives

$$ \sum_{p\leq x}\frac1p = \frac{\pi(x)}x + \int_2^x \frac{\pi(t)}{t^2},dt. $$

If one inserts the approximation

$$ \pi(t)\sim \frac{t}{\log t}, $$

then the integral becomes approximately

$$ \int_2^x \frac{dt}{t\log t} = \log\log x + O(1). $$

Hence

$$ \sum_{p\leq x}\frac1p \sim \log\log x. $$

This is one of the classical applications of Abel summation.

Dirichlet Series

Abel summation is closely related to Dirichlet series. Consider

$$ \sum_{n=1}^{\infty}\frac{a_n}{n^s}. $$

Define

$$ A(x)=\sum_{n\leq x} a_n. $$

Applying Abel summation with

$$ f(x)=x^{-s}, $$

one obtains

$$ \sum_{n\leq x}\frac{a_n}{n^s} = \frac{A(x)}{x^s} + s\int_1^x \frac{A(t)}{t^{s+1}},dt. $$

This formula connects analytic properties of Dirichlet series with growth estimates for partial sums.

Much of analytic number theory depends on controlling $A(x)$ and then translating that information into properties of generating functions.

Importance

Abel summation is one of the central transformation tools in analytic number theory. It converts discrete arithmetic information into continuous analytic form.

The method appears throughout the subject:

  • estimation of harmonic sums,
  • prime number theory,
  • Dirichlet series,
  • Fourier coefficients,
  • lattice point problems,
  • divisor sums.

Its importance comes from a simple principle: partial sums often contain smoother and more accessible information than individual arithmetic terms.