Math 2.0

Number theory Analytic number theory Theorem

Non-vanishing of the zeta function on the line Re s = 1

Builds on Riemann zeta functionEuler product formula

Statement

Let ζ\zeta be the Riemann zeta function. For every complex number s≠1s \ne 1 with Re⁡s≥1\operatorname{Re} s \ge 1, one has ζ(s)≠0\zeta(s) \ne 0. In particular ζ(1+it)≠0\zeta(1 + it) \ne 0 for every real t≠0t \ne 0.

Remarks

For Re⁡s>1\operatorname{Re} s > 1 this follows from the Euler product formula, since a convergent product of nonzero factors is nonzero. For the line Re⁡s=1\operatorname{Re} s = 1, the classical argument uses the inequality 3+4cos⁡θ+cos⁡2θ=2(1+cos⁡θ)2≥03 + 4\cos\theta + \cos 2\theta = 2(1 + \cos\theta)^2 \ge 0. With the Euler product it gives ∣ζ(σ)3 ζ(σ+it)4 ζ(σ+2it)∣≥1\abs{\zeta(\sigma)^3 \, \zeta(\sigma + it)^4 \, \zeta(\sigma + 2it)} \ge 1 for σ>1\sigma > 1. If ζ(1+it)=0\zeta(1 + it) = 0 with t≠0t \ne 0, then as σ→1+\sigma \to 1^+ the left side behaves like (σ−1)−3(σ−1)4→0(\sigma - 1)^{-3} (\sigma - 1)^{4} \to 0, because ζ\zeta has a simple pole at 11 and ζ(1+2it)\zeta(1 + 2it) is finite; this is a contradiction.

Going deeper

For a student

The prime number theorem π(x)∼x/log⁡x\pi(x) \sim x / \log x follows from this non-vanishing by a Tauberian theorem, such as the Wiener–Ikehara theorem, applied to −ζ′(s)/ζ(s)=∑nΛ(n)n−s-\zeta'(s)/\zeta(s) = \sum_n \Lambda(n) n^{-s}. Hadamard and de la Vallée Poussin proved the prime number theorem this way in 1896. Quantitative zero-free regions, such as σ>1−c/log⁡(∣t∣+2)\sigma > 1 - c/\log(\abs{t} + 2), give the prime number theorem with an error term. The same method shows L(1+it,χ)≠0L(1 + it, \chi) \ne 0 for Dirichlet L-functions.

Reading path

To understand this page from the ground up, read these 10 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. Divisibility definition
  2. Riemann zeta function concept
  3. Prime number definition
  4. Euclid's lemma statement
  5. Existence of a prime divisor statement
  6. Prime factorization definition
  7. Existence of prime factorization statement
  8. Fundamental theorem of arithmetic statement
  9. Euler product formula statement
  10. Non-vanishing of the zeta function on the line Re s = 1 statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Prime_number_theorem
About this page
TagCXES7915R7
URIm2://CXES7915R7
Kindstatement, theorem
WritingW0 stub
MSC11M06, 11N05
StatusThis copy of the site has no build data. Run m2 status CXES7915R7.
AboutRiemann zeta function
UsesRiemann zeta function, Euler product formula

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • 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.