Math 2.0

Number theory Theorem

Perron's formula

Builds on Dirichlet seriesAbsolute convergenceInverse Mellin transform

Statement

Let a ⁣:{1,2,3,… }→ℂa \colon \set{1, 2, 3, \dots} \to \C and let F(s)=∑n≥1a(n)n−sF(s) = \sum_{n \ge 1} a(n) n^{-s} be its Dirichlet series. Let σa\sigma_a be the abscissa of absolute convergence of FF, assume σa<∞\sigma_a < \infty, and let c>max⁡(0,σa)c > \max(0, \sigma_a). For x>0x > 0, let A∗(x)=∑n<xa(n)+12a(x)A^*(x) = \sum_{n < x} a(n) + \frac{1}{2} a(x), where the last term is present only when xx is an integer. Then for every x>0x > 0, A∗(x)=lim⁡T→∞12πi∫c−iTc+iTF(s) xss ds.A^*(x) = \lim_{T \to \infty} \frac{1}{2\pi i} \int_{c - iT}^{c + iT} F(s) \, \frac{x^{s}}{s} \, ds.

Remarks

The proof rests on the discontinuous integral. Fix c>0c > 0, and for y>0y > 0 let I(y)=lim⁡T→∞12πi∫c−iTc+iTyss dsI(y) = \lim_{T \to \infty} \frac{1}{2\pi i} \int_{c - iT}^{c + iT} \frac{y^{s}}{s} \, ds. Then I(y)=1I(y) = 1 for y>1y > 1, I(1)=1/2I(1) = 1/2, and I(y)=0I(y) = 0 for 0<y<10 < y < 1. For y>1y > 1 one closes the path to the left and picks up the residue 11 at s=0s = 0; for y<1y < 1 one closes it to the right, where there is no pole. One applies this with y=x/ny = x/n to each term a(n)n−sa(n) n^{-s} and exchanges sum and limit. The exchange uses the explicit error bound of the discontinuous integral and the absolute convergence of FF on Re⁡s=c\operatorname{Re} s = c. The limit cannot be replaced by an absolutely convergent integral in general. For F=1F = 1, that is a(1)=1a(1) = 1 and a(n)=0a(n) = 0 otherwise, the integrand xs/sx^{s}/s has modulus of order 1/∣s∣1/\abs{s} on the line. Example: take a=Λa = \Lambda, the von Mangoldt function, so that F(s)=−ζ′(s)/ζ(s)F(s) = -\zeta'(s)/\zeta(s), and take c>1c > 1. Then the formula expresses the Chebyshev function ψ(x)\psi(x) as a contour integral. Shifting the contour to the left and collecting the residue xx at s=1s = 1 is the route to the prime number theorem.

Going deeper

For a student

The formula is an inverse Mellin transform: by the Mellin representation of Dirichlet series, F(s)/sF(s)/s is the Mellin transform at −s-s of the summatory function. In practice one uses a truncated version with an explicit error term in TT and xx, then moves the line of integration to the left of Re⁡s=1\operatorname{Re} s = 1. The poles of F(s)xs/sF(s) x^{s}/s then give the main terms, and bounds for FF in the critical strip control the error. This is how the prime number theorem and its explicit formulas are derived from properties of the zeta function.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Absolute convergence concept
  2. Dirichlet series concept
  3. Inverse Mellin transform concept
  4. Perron's formula statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Perron%27s_formula
About this page
TagEJ556BJNFM
URIm2://EJ556BJNFM
Kindstatement, theorem
WritingW0 stub
MSC11M41, 11N37, 44A15
StatusThis copy of the site has no build data. Run m2 status EJ556BJNFM.
AboutDirichlet series
UsesDirichlet series, Absolute convergence, Inverse Mellin transform
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.