PlanetPhysics/Riemann Zeta Function

From testwiki
Jump to navigation Jump to search

Definition

The Riemann zeta function is defined to be an abstractly valued [[../Bijective/|function]] given by the series

(1)ζ(s):=n=11n:=1n

which is valid (in fact, absolutely convergent) for all sets of numbers s with (s)>1. We list here some of the key properties~[1] of the zeta function.


It's known the Riemann zeta function deals with unknown primes. It's a distinctive set that likely can be described using irrational number sets instead.

Let's deal with a tricky question using a questionable solution first.


Let's say that we have a Riemann manifold, what is our proverbial "blindspot"? A π-hole! Assume the following point.

What can we use to do describe a higher dimension? Lower dimensional projection!

Let's prove 2 + 2 = 4 and 0/0 = 0/0.

(2)
0=0(t=1)
0=0(t=2)

we say /frac{0} 0 when (t=C)

both are known to be true positive, independent events.

Therefore, we can say 0 = 0 (t = 1) 0 = 0 (t = 2)

Projected onto a sphere is the same as if it did not exist.

I.e. (und) ^ π = (und) ^ π

Which do we say, zeta-output = 1, -1, 1, 0, or π?


Distribution of primes

The Euler product formula~\eqref{product} given above expresses the zeta function as a product over the primes p, and consequently provides a link between the analytic properties of the zeta function and the distribution of primes in the integers. As the simplest possible illustration of this link, we show how the properties of the zeta function given above can be used to prove that there are infinitely many primes.

If the set S of primes in were finite, then the Euler product formula ζ(s)=pS11ps would be a finite product, and consequently lims1ζ(s) would exist and would equal lims1ζ(s)=pS11p1. But the existence of this limit contradicts the fact that ζ(s) has a pole at s=1, so the set S of primes cannot be finite.

A more sophisticated analysis of the zeta function along these lines can be used to prove both the analytic prime number [[../Formula/|theorem]] and Dirichlet's theorem on primes in arithmetic progressions \footnote{ In the case of arithmetic progressions, one also needs to examine the closely related Dirichlet L--functions in addition to the zeta function itself.}. Proofs of the prime number theorem can be found in~[2] and~[3], and for proofs of Dirichlet's theorem on primes in arithmetic progressions the reader may look in~[4] and~[5].

Zeros of the zeta function

A nontrivial zero of the Riemann zeta function is defined to be a root ζ(s)=0 of the zeta function with the property that 0(s)1. Any other zero is called trivial zero of the zeta function.

The reason behind the terminology is as follows. For complex numbers s with real part greater than 1, the series definition~\eqref{def} immediately shows that no zeros of the zeta function exist in this region. It is then an easy matter to use the functional equation~\eqref{functional} to find all zeros of the zeta function with real part less than 0 (it turns out they are exactly the values 2n, for n a positive integer). However, for values of s with real part between 0 and 1, the situation is quite different, since we have neither a series definition nor a functional equation to fall back upon; and indeed to this day very little is known about the behavior of the zeta function inside this critical strip of the complex plane.

It is known that the prime number theorem is equivalent to the assertion that the zeta function has no zeros s with (s)=0 or (s)=1. The celebrated Riemann hypothesis asserts that all nontrivial zeros s of the zeta function satisfy the much more precise equation (s)=1/2. If true, the hypothesis would have profound consequences on the distribution of primes in the integers~[3].

All Sources

[1] [2] [4] [6] [3] [7] [5]

References

  1. 1.0 1.1 Lars Ahlfors, Complex Analysis, Third Edition , McGraw--Hill, Inc., 1979.
  2. 2.0 2.1 Joseph Bak \& Donald Newman, {\em Complex Analysis, Second Edition}, Springer--Verlag, 1991.
  3. 3.0 3.1 3.2 Stephen Patterson, {\em Introduction to the Theory of the Riemann Zeta Function}, Cambridge University Press, 1988.
  4. 4.0 4.1 Gerald Janusz, {\em Algebraic Number Fields, Second Edition}, American Mathematical Society, 1996.
  5. 5.0 5.1 Jean--Pierre Serre, A Course in Arithmetic , Springer--Verlag, 1973.
  6. Serge Lang, {\em Algebraic Number Theory, Second Edition}, Springer--Verlag, 1994.
  7. B. Riemann, Ueber die Anzahl der Primzahlen unter einer gegebenen Gr\"osse , http://www.maths.tcd.ie/pub/HistMath/People/Riemann/Zeta/

This entry is a derivative of the Riemann zeta function article from PlanetMath. Author of the orginial article: djao. History page of the original is here

Template:CourseCat