Is This Proof of the Prime Number Theorem Too Simple?

  • Thread starter eljose
  • Start date
  • Tags
    Proof
In summary: The Prime Number Theorem can be restated as the statement that the Chebyschev function (Psi(x)) equals x as x goes to infinity. The Chebyschev function is defined as the sum of the logarithm of the prime numbers up to x. It can also be expressed as a sum over the non-trivial zeros of the Riemann zeta function. One proof of this is to show that the integral of the logarithm of zeta from 1 to x is equal to 2*pi*log(x) as x goes to infinity.
  • #1
eljose
492
0
Prime number theorem is equivalent to the (asymptotic) equality:

[tex] \Psi \sim x [/tex]

Where the "Psi" is Tsebycheff (can,t be a more complicate surname in science?...:biggrin: :biggrin: ) function equal to complex integral:

[tex] \int_{c-i\infty}^{c+i\infty}dsx^{s}\frac{\zeta'(s)}{\zeta(s) s} [/tex]

but a factor [tex] 2i\pi [/tex] then the "proof" should be easy...get an asymptotic expansion using "saddle point2 or "steepest descent" method and check that keeping the first term the integral is asymptotic to "x".

It seems me a too much easy proof ..it,s strange that Hadamard or other didn,t use that trick to proof PNT or that this theorem is so difficult to prove.
 
Physics news on Phys.org
  • #2
what does 'but a factor 2ipi' mean in the middle of a sentence like that?

Once more, I urge you, when making claims like this, to put in a reasonable reference to things that other people are likely not to know. Very few people have any deep knowledge of these asymptotic methds of approximation, and I would hazard almost no one here is in any position to offer any comment upon this at all.
 
Last edited:
  • #3
The 'but a factor of 2ipi' I take it to mean a constant is missing. We actually have:

[tex]\psi(x)=\sum_{n\leq x}\Lambda(n)=\frac{1}{2\pi i}\int_{c-i\infty}^{c+i\infty}-\frac{\zeta'}{\zeta}(s)\frac{x^s}{s}ds[/tex]

c>1, x not an integer, [tex]\Lambda[/tex] the von Mangoldt funtion.
eljose said:
... then the "proof" should be easy...get an asymptotic expansion using "saddle point2 or "steepest descent" method and check that keeping the first term the integral is asymptotic to "x".

How do you propose to do this when x^s=exp^(s*log(x)) and f(s)=s has no critical points? You generally need the exponential part to be oscillating faster and faster and faster while the rest kind of plods along, and the main contribution will come from near this critical point which, alas, you don't have.

So, as always, show how you propose to get around this for your "easy proof".
 
Last edited:
  • #4
But you could express the integral in the form x=exp(t) :

[tex] \int_{c-i\infty}^{c+i\infty}dsF(s)e^{st} [/tex] where t would be t-->oo (Big)

the rest would be to get the asymptotic expansion in a "similar" way to this you used to get an asymptotic expansion for the n! when n is big.
 
  • #5
I was afraid you were going to suggest something like this, given how you thought this kind of substitution somehow made an integral like this easier to approximate numerically. Still no stationary phase to work with that I can see, but you don't worry about stuff like that do you?

If you really think this will work, then just do it. Show your work. No more "you can just do" or "it should be easy to", or any other unfounded predictions. Carry it through and prove to us it will work.
 
  • #6
The problem i have is that i don,t know how to do..for example i could make the substitution s=c+ix so i get and split F(c+ix) into its real and imaginary part so we have:

[tex] \int_{-\infty}^{\inty}dxU(x)e^{ixt}+iV(x)e^{ixt} [/tex]

the integral of the sum is the sum of integral so we finally have:

[tex] \int_{-\infty}^{\infty}dxU(x)e^{ixt} [/tex]

and the same for V(x), to obtain this integral valid for t-->oo you could use "Cauchy,s Stationary Phase Approach" as for big t the exponential oscillates too much or use another asymptotic technique to deal wit Fourier Integrals.
 
  • #7
Looking at the real and complex parts doesn't give you a stationary phase, which is sort of a basic requirement if you hope to apply the stationary phase method.

Once again, replacing x with e^t doesn't help at all. The oscillations are still at a constant rate for a fixed t. Reintroducing x again to mean something else is unnessecarily confusing.
 
  • #8
Making a simple change of variable we have the integral:

[tex] \int_{-\infty}^{\infty}dxG(x)e^{itS(x)} [/tex] t----->oo (1)

where [tex] G(x)=F(c+iS(x))S'(x) [/tex] and S(x) is chosen so:

-S(x) has a Maximum on the real line (-oo,oo)
-S(oo) is different from S(-oo) and they take the value oo or -oo or 0

Then the integral (1) could be evaluated using "Stationary Phase Approach"...
 
Last edited:
  • #9
eljose said:
Making a simple change of variable we have the integral:

So do it. Show me this mystical S(x) that has a maximum and S(x) will take values all the way from -infinity to infinity like your original x does (actually, your second use of x)

Why do you keep using "x" to mean different things? We're up to 3 different uses so far and counting.

eljose said:
Then the integral (1) could be evaluated using "Stationary Phase Approach"...

So do it.
 
  • #10
Oh..then forget it..another question, the Chebycheff function has an "exact" value:

[tex] \sum_{\rho}x^{\rho}/\rho+ln(1-x^{-2}+C+x [/tex]

where C is a real constant of course for big x we could omit the log term :

[tex] \sum_{\rho}x^{\rho}/\rho+C+x [/tex]

My question is..if we consider that the Chebycheff function has the asymptotic behavior x plus a sum on powers of the NOn-trivial zeros then..what would be the asymptotic value of the Prime counting function?..
 
  • #11
Another proof i saw is to prove the equivalence (asymptotic):

[tex] \int_{c-i\infty}^{c+i\infty}ds \frac{log \zeta (s)}{s}= 2i \pi log(x) [/tex]

i read it at the "introduction to..." by tom Apostol, however i don,t know why is true.
 
  • #12
Well, as written it isn't. There's no variable x on the left hand side.

For steepest descent, the general idea is to write the integrand as g(s)*exp(f(s)) where g(s) is slowly varying w.r.t f(s). The integral comes out to be exp(f(s)) evaluated at it's critical points, multiplied by some factors. Using g(s) = zeta'(s)/zeta(s) and f(s) as s*ln(x) - ln(s) would work out fine (has a critical point at s=(1/ln(x)), but it has problems. For starters, it seems to me as though g(s) varies faster than f(s); maybe someone who knows more about the zeta function can comment.

The real problem with steepest descent is bounding the error. You can come up with an approximation but have no idea how close it is. Being off by a constant factor wouldn't matter, but the zeta function variation would.
 
  • #13
Thanks to "Bo temp" Hurkyl, Shmoeand others who criticies me should learn a bit from him instead of warning or making fun of me...

But "Bo temp" as i read you can always deform the contour to an appropiate one in complex plane (this is the thing i didn't understand when reading about steepest descent) , i don't know anything about the error but perhaps to give an 2asymptotic meaning, in the sense that if we call our integral I(x) then we have:

[tex] \frac{\pi(x)}{I(x)}\rightarrow1 [/tex] as x-->oo.
 
  • #14
eljose said:
Thanks to "Bo temp" Hurkyl, Shmoeand others who criticies me should learn a bit from him instead of warning or making fun of me...

Learn what exactly? (and who made fun of you?) Your whole point here was to avoid involving all the zeros of zeta via residues right? If that wasn't your goal, then what was it?

Look where the stationary phase is when you organize things how BoTemp has suggested, it's close to 0. You're going to have to deform your contour past all those zeros in the critical strip, so you aren't avoiding these residues. Once you've got your contour over there, you can just keep pushing it to left and say good riddance, evaluating it exactly modulo horizontal segments which you needed to approximate anyways (picking up contributions from the trivial zeros just gives the log(1-x^(-2)) bit in the explicit formula).

Have you ever looked at a proof of the explicit formula?

eljose said:
... i don't know anything about the error but perhaps to give an 2asymptotic meaning, in the sense that if we call our integral I(x) then we have:

[tex] \frac{\pi(x)}{I(x)}\rightarrow1 [/tex] as x-->oo.

What integral is I(x) here? The one in your first post gives psi(x) *exactly* it's not an asymptotic, so I'm not sure what you mean here.
 

FAQ: Is This Proof of the Prime Number Theorem Too Simple?

How does the proof of PNT differ from previous proofs?

The fast and easy proof of PNT (Prime Number Theorem) differs from previous proofs in that it uses techniques from complex analysis, rather than relying on number theory. This makes the proof more elegant and streamlined, and easier to understand for those with a background in analysis.

Can the proof be easily understood by non-mathematicians?

While the proof may be considered "fast and easy" compared to previous proofs, it still requires a solid understanding of complex analysis and mathematical concepts. It may be challenging for those without a strong mathematical background to fully grasp the proof.

What are the implications of this proof for the field of mathematics?

The fast and easy proof of PNT is a significant advancement in the field of mathematics, as it provides a simpler and more elegant proof of a fundamental result. It also opens up new possibilities for using techniques from complex analysis in other areas of number theory.

Are there any potential limitations or criticisms of this proof?

As with any mathematical proof, there may be potential limitations or criticisms, and it is important for the proof to undergo thorough review and scrutiny by other mathematicians. Additionally, this proof may not provide any new insights or discoveries, but rather a new way of proving a known result.

How might this proof impact other areas of science and technology?

The Prime Number Theorem has applications in various areas of science and technology, such as cryptography and computer science. The fast and easy proof may lead to new developments and advancements in these fields, as well as inspire further research and discoveries in number theory.

Similar threads

Replies
1
Views
1K
Replies
21
Views
8K
Replies
2
Views
2K
Replies
4
Views
2K
  • Poll
Replies
1
Views
5K
Back
Top