Sideway
output.to from Sideway
Draft for Information Only

Content

Riemann Zeta Function
 The Riemann Zeta Function
 Introduction to the Zeta Function
 Convergence of 𝜁(𝑠)
 Analytic Continuation of the Zeta Function
 The Zeros of the Zeta Function
 The Riemann Hypothesis
 The Power of Complex Analysis
 The Prime Counting Function
 A Brief History of πœ‹(π‘₯)
 How is 𝜁(𝑠) Related to Prime Number
 The Riemann Zeta Function and Prime Numbers
 The Riemann Hypothesis and Prime Numbers
 Final Remarks

source/reference:
https://www.youtube.com/channel/UCaTLkDn9_1Wy5TRYfVULYUw/playlists

Riemann Zeta Function

The Riemann Zeta Function

  • The zeta function was first introduced by Leonhard Euler (1707-1708), who used it in the study of prime numbers.
  • In particular, Euler used its properties to show that  βˆ‘𝑝 prime1𝑝 diverges.
  • This shows in particular, that there are infinitely many primes, but also some information about their distribution.
  • Bernhard Riemann (1826-1866) used this function (a century after Euler) to obtain results on the asymptotic distribution of prime numbers.
  • And Riemann zeta function is usually along with the Riemann hypothesis to specify it's relation to prime numbers.

Introduction to the Zeta Function

Recall βˆžβˆ‘π‘›=11𝑛 diverges (harmonic series), but βˆžβˆ‘π‘›=11𝑛𝑠 converges for all 𝑠>1. That is βˆžβˆ‘π‘›=11𝑛𝑠≀1+∞∫11π‘₯𝑠𝑑π‘₯=1+11βˆ’π‘ 1π‘₯π‘ βˆ’1∞|1  =1βˆ’11βˆ’π‘   =π‘ π‘ βˆ’1 for (𝑠>1)

Now consider π‘ βˆˆβ„‚ instead of π‘ βˆˆβ„ DefinitionFor π‘ βˆˆβ„‚ with Re 𝑠>1, the zeta function is defined as 𝜁(𝑠)=βˆžβˆ‘π‘›=11𝑛𝑠
  • It is traditional to call the complex variable "𝑠" instead of "𝑧".
  • What is 𝑛𝑠 for π‘ βˆˆβ„‚? Note that for real 𝑠, we have that 𝑛𝑠=β„―ln 𝑛𝑠=ℯ𝑠 ln 𝑛, so define 𝑛𝑠=ℯ𝑠 log 𝑛=ℯ𝑠 ln 𝑛 for π‘ βˆˆβ„‚

Convergence of 𝜁(𝑠)

Does βˆžβˆ‘π‘›=11𝑛𝑠 converge for Re 𝑠>1?

Since 𝑛𝑠=ℯ𝑠 ln 𝑛, we have that |𝑛𝑠|=ℯ𝑠 ln 𝑛=β„―Re 𝑠 ln 𝑛=𝑛Re 𝑠. Thus βˆžβˆ‘π‘›=11𝑛𝑠=βˆžβˆ‘π‘›=11𝑛Re 𝑠, and since Re 𝑠>1, the series on the right converges. Thus βˆžβˆ‘π‘›=11𝑛𝑠 converges absolutely in {Re 𝑠>1}.

In fact, the convergence is uniform in {Re 𝑠β‰₯π‘Ÿ} for any π‘Ÿ>1, and this can be used to show that 𝜁(𝑠) is analytic in {Re 𝑠β‰₯1}

Analytic Continuation of the Zeta Function

One can now show the following (this theorem goes back to Riemann): TheoremThe zeta function has an analytic continuation into β„‚\{1}, and this continuation satisfies that 𝜁(𝑠)β†’βˆž as 𝑠→1.

Slightly easier to construct is an extension to the right half plane {Re 𝑠>0}, minus the point 1, and we outline this construction here.

Motivation in ℝ: π‘βˆ‘π‘›=11𝑛𝑠=𝑁+1∫11π‘₯𝑠𝑑π‘₯+π‘βˆ‘π‘›=1𝛿𝑛(𝑠) where 𝛿𝑛(𝑠)=1π‘›π‘ βˆ’π‘›+1∫11π‘₯𝑠𝑑π‘₯.

That is π‘βˆ‘π‘›=11𝑛𝑠 β†’πœ(𝑠) =𝑁+1∫11π‘₯𝑠𝑑π‘₯ β†’1/(π‘ βˆ’1) +π‘βˆ‘π‘›=1𝛿𝑛(𝑠), where 𝛿𝑛(𝑠)=1π‘›π‘ βˆ’π‘›+1∫11π‘₯𝑠𝑑π‘₯.

Observe that π‘βˆ‘π‘›=1𝛿𝑛(𝑠) is analytic in {Re 𝑠>0}. One can show that π‘βˆ‘π‘›=1𝛿𝑛(𝑠) converges, as π‘β†’βˆž, to an analytic function 𝐻(𝑠) in {Re 𝑠>0}. Thus 𝜁(𝑠)=1π‘ βˆ’1+𝐻(𝑠) holds for Re 𝑠>1,(*) where

  • 𝐻(𝑠) is analytic in {Re 𝑠>0}.
  • 𝑠↦1π‘ βˆ’1 is analytic in {Re 𝑠>0}\{1}

Therefore (*) can be used to define the zeta function in all of {Re 𝑠>0}\{1}.

This definition agrees with the original definition in {Re 𝑠>1}.

Riemann was actually able to extend the zeta function to an analytic function in all of β„‚\{1}

The Zeros of the Zeta Function

Of much interest are the zeros of the zeta function, i.e. those π‘ βˆˆβ„‚, for which 𝜁(𝑠)=0.

One can show: TheoremThe only zeros of the zeta function outside of the strip {0≀Re 𝑠≀1} are at the negative even integers, βˆ’2, βˆ’4, βˆ’6,β‹―

  • The zeros at βˆ’2, βˆ’4, βˆ’6,β‹― are often called the "trivial zeros", and the region to be studied remains the strip {0≀Re 𝑠≀1}.
  • A key result is that zeta has no zeros on the line {Re 𝑠=1}, this is an essential fact in the proof of the prime number theorem.
  • From the fact that zeta has no zeros on {Re 𝑠=1}, it can easily be deduced that it has no zeros on {Re 𝑠=0} either, via a functional equation.

The Riemann Hypothesis

In Riemann's seminal paper in which he proved the analytic continuation of the zeta function to β„‚\{1}, Riemann initiated important insights into the distribution of prime numbers. In this paper, Riemann expressed his belief in the veracity of the following: Conjecture (Riemann Hypothesis)In the strip {0≀Re 𝑠≀1}, all zeros of 𝜁 are on the line {Re 𝑠=12}

Much research has been done in attempts to prove this conjecture:

  • 𝜁(𝑠) has infinitely many zeros in {0<Re 𝑠<1}.
  • The asymptotic distribution of the zeros of 𝜁 in {0<Re 𝑠<1} is known.
  • At least one third of the zeros in {0<Re 𝑠<1} lie on the critical line {Re 𝑠=12}.
  • Trillions of zeros of zeta have been calculated - so far all of them lie on the critical line.
  • Numerical evidence and much research point to the validity of this conjecture, but it is to this day unproved and remains one of the most famous unsolved problems in mathematics.
  • The Riemann Hypothesis is on the list of seven "Millennium Prize Problems" (declared by the Clay Mathematics Institute in 2000). Only one of these has been solved so far (as of summer 2013) - the so-called Poincare Conjecture (by Grigori Perelman).
  • the riemann Hypothesis has strong implications on the distribution of prime numbers and on the growth of many other important arithmetic functions. It would greatly sharpen many number-theoretic results.

The Power of Complex Analysis

Complex analysis is an extremely powerful field. This is demonstrated for example, by the ability to prove a deep theorem in number theory, the Prime Number Theorem, using complex analysis.

The Prime Counting Function

Let πœ‹(π‘₯)=number of primes less than or equal to π‘₯. This function is called the prime counting function. Example: πœ‹(1)=0 πœ‹(2)=1 πœ‹(3)=2 πœ‹(4)=2 πœ‹(5)=3 πœ‹(6)=3 πœ‹(7)=πœ‹(8)=πœ‹(9)=πœ‹(10)=4 πœ‹(11)=πœ‹(12)=5 β‹― It seems impossible to find an explicit formula for πœ‹(π‘₯). One thus studies the asymptotic behavior of πœ‹(π‘₯) as π‘₯ becomes very large. Theorem (Prime Number Theorem)πœ‹(π‘₯)~π‘₯ln π‘₯ as π‘₯β†’βˆž. Note: The symbol "~" means that the quotient of the two quantities approaches 1 as π‘₯β†’βˆž, i.e. πœ‹(π‘₯)π‘₯/ln π‘₯β†’1 as π‘₯β†’βˆž.

A Brief History of πœ‹(π‘₯)

  • Euler (around 1740) discovered the connection between the zeta function 𝜁(𝑠) (for real values of 𝑠) and the distribution of prime numbers.
  • 60 years later, Legendre and Gauss conjectured the prime number theorem, after numerical calculations.
  • Another 60 years later, Tchebychev showed that there are constants 𝐴,𝐡 (with 0<𝐴<𝐡) such that 𝐴π‘₯ln π‘₯β‰€πœ‹(π‘₯)≀𝐡π‘₯ln π‘₯.
  • In 1859, Riemann published his seminal paper "On the Number of Primes Less Than a Given Magnitude". In this paper Riemann constructed the analytic continuation of the zeta function and introduced revolutionary ideas, connection its zeros to the distribution of prime numbers.
  • Hadamard and de la Vallee Poussin used these ideas and independently proved the Prime Number Theorem in 1896.
  • The main step in their proof is to establish that 𝜁(𝑠) has no zeros on {Re 𝑠=1}.

How is 𝜁(𝑠) Related to Prime Number

Euler discovered:𝜁(𝑠)= βˆπ‘11βˆ’π‘βˆ’π‘  where the (infinite!) product is over all primes. Proof 𝜁(𝑠)=11𝑠+12𝑠+13𝑠+14𝑠+15𝑠+16𝑠+17𝑠+β‹―  = 1+12𝑠+14𝑠+β‹―1+13𝑠+19𝑠+β‹―1+15𝑠+125𝑠+β‹―1+17𝑠+149𝑠+β‹―β‹―  = βˆπ‘βˆžβˆ‘π‘˜=01π‘π‘˜π‘   = βˆπ‘
1
1βˆ’1𝑝𝑠

The Riemann Zeta Function and Prime Numbers

𝜁(𝑠)= βˆπ‘
1
1βˆ’1𝑝𝑠
Note:

  • This product formula shows that 𝜁(𝑠)β‰ 0 for Re 𝑠>1.
  • The key step in the proof of the prime number theorem is that 𝜁 has no zeros on {Re 𝑠=1}.
  • The details of the proof of the prime number theorem go beyond the introduction scrope.
  • The prime number theorem says that πœ‹(π‘₯)~π‘₯ln π‘₯, but it doesn't have any information about the difference πœ‹(π‘₯)βˆ’π‘₯ln π‘₯.
  • However, the prime number theorem can also be written as πœ‹(π‘₯)~Li(π‘₯), where Li(π‘₯)=π‘₯∫21ln 𝑑𝑑𝑑 is the (offset) logarithmic integral function

The Riemann Hypothesis and Prime Numbers

  • The proofs of the prime number theorem by Hadamard and de la Vallee Poussin actually show that πœ‹(π‘₯)=Li(π‘₯)+error term, where the error term grows to infinity at a controlled rate.
  • von Koch (in 1902) was able to give best possible bounds on the error term, assuming the Riemann hypothesis is true. Schoenfeld (in 1976) made this precise and proved that the Riemann hypothesis is equivalent to |πœ‹(π‘₯)βˆ’li(π‘₯)|<π‘₯ln π‘₯8πœ‹, where li(π‘₯)=π‘₯∫01ln 𝑑𝑑𝑑 is the (un-offset) logarithmic integral function, related to Li(π‘₯) via Li(π‘₯)=li(π‘₯)βˆ’li(2).

the veracity of the Riemann Hypothesis would therefore imply further results about the distribution of prime numbers, in particular, they'd be distributed beautifully regtularly about there "expected" locations.

Final Remarks

  • Complex numbers, algebra, geometry and topology in the complex plane, complex functions;
  • complex dynamics, Julia sets of quadratic polynomials, the Mandelbrot set, conjecture of local connectedness of its boundary;
  • complex differentiation, the Cauchy-Riemann equations, analytic ufnctions;
  • Conformal mappings, inverse functions, Mobius transformations, the Riemann mapping theorem;
  • Complex integration Cauchy theory and consequences (such as Liouville's theorem, the maximum principle, etc.)
  • Complex series, power (Taylor) series, the Riemann zeta function and its relation to prime numbers, and the Riemann Hypothesis.

Β©sideway

ID: 190500007 Last Updated: 5/7/2019 Revision: 0


Latest Updated LinksValid XHTML 1.0 Transitional Valid CSS!Nu Html Checker Firefox53 Chromena IExplorerna
IMAGE

Home 5

Business

Management

HBR 3

Information

Recreation

Hobbies 8

Culture

Chinese 1097

English 339new

Travel 8new

Reference 79

Computer

Hardware 251

Software

Application 213

Digitization 32

Latex 52

Manim 205

KB 1

Numeric 19

Programming

Web 289

Unicode 504

HTML 66

CSS 65

SVG 46

ASP.NET 270

OS 431

DeskTop 7

Python 72

Knowledge

Mathematics

Formulas 8

Set 1

Logic 1

Algebra 84

Number Theory 206

Trigonometry 31

Geometry 34

Coordinate Geometry 2

Calculus 67

Complex Analysis 21

Engineering

Tables 8

Mechanical

Mechanics 1

Rigid Bodies

Statics 92

Dynamics 37

Fluid 5

Fluid Kinematics 5

Control

Process Control 1

Acoustics 19

FiniteElement 2

Natural Sciences

Matter 1

Electric 27

Biology 1

Geography 1


Copyright © 2000-2024 Sideway . All rights reserved Disclaimers last modified on 06 September 2019