## Riemann Hypothesis Proved? 454

Theodore Logan writes

*"Has the Riemann Hypothesis finally been proved? The proof is a couple of months old, and to the best of my knowledge a Swedish newspaper is the only one to take up the story yet, so there is certainly a possibility that this is a hoax, or a less than watertight proof. But if it turns out to be the real thing, it will, apart from winning the authors eternal fame and glory for finding the holy Grail of modern math, provide them with a cool $1 million as they claim the first Millennium Prize."*We had a story a while back about this as well.
## Riemann hypothesis (Score:5, Funny)

## um... (Score:4, Funny)

"A proof of the Riemann's hypothesis (RH) about the non-trivial zeros of the Riemann zeta-function is presented. It is based on the construction of an infinite family of operators D^{(k,l)} in one dimension, and their respective eigenfunctions \psi_s (t), parameterized by continuous real indexes k and l. Orthogonality of the eigenfunctions is connected to the zeros of the Riemann zeta-function. Due to the fundamental Gauss-Jacobi relation and the Riemann fundamental relation Z (s') = Z (1-s'), one can show that there is a direct concatenation among the following symmetries, t goes to 1/t, s goes to \beta - s (\beta a real), and s' goes to 1 - s', which establishes a one-to-one correspondence between the label s of one orthogonal state to a unique vacuum state, and a zero s' of the \zeta. It is shown that the RH is a direct consequence of these symmetries, by arguing in particular that an exclusion of a continuum of the zeros of the Riemann zeta function results in the discrete set of the zeros located at the points s_n = 1/2 + i \lambda_n in the complex plane."What the fuck?

## Re:um... (Score:2)

## Re:um... (Score:5, Informative)

-- shayborg

## gosh, gee willakers (Score:4, Funny)

This [dgl.com] provides a pretty good layperson's overview of the problem, as well as why it's relevant.While the linked site

doesprovide a layman's interpretation of the topic, when you first click to that page you are presented with:Two Plus Two Equals FourThought we had all been trolled... :)

## In that case -- Yay! I win a million dollars! (Score:3, Funny)

The Riemann hypothesis asserts that all interesting solutions of the equation z(s) = 0 lie on a straight line.Well, graphing s versus z(s), if z(s) is always zero, then obviously all values of s solving that equation lie on the s axis, which is a straight line. QED.

Sheesh. That wasn't so hard.

## Re:In that case -- Yay! I win a million dollars! (Score:4, Informative)

I.e., s, which is a complex number, has two parts - a 'real' part and an 'imaginary' part. Thus, z(s) for any complex s returns zero - according to this proof - if s.r (the 'real' part) and s.i (the 'imaginary' part) lie along a certain straight line.

Make more sense now?

## Attempt at putting it in more layman's terms. (Score:5, Informative)

A proof of the Riemann's hypothesis (RH) about the non-trivial zeros of the Riemann zeta-function is presented.We are going to show you beyond a shadow of a doubt that the non-trivial zeros of the zeta-function are of the form 1/2 +- i*theta_n.

It is based on the construction of an infinite family of operators D^{(k,l)} in one dimension, and their respective eigenfunctions \psi_s (t), parameterized by continuous real indexes k and l.To do this, we are going to use the operators D^{(k,1)} and their respective vectors \psi_s (t), such that using D^{(k,1)} on \psi_s (t) will produce k*(\psi_s (t)), where k is some non-zero constant. Unfortunately though, we have to show a way to product all of these operators. So the "construction of" the operators will be contained within the proof.

Orthogonality of the eigenfunctions is connected to the zeros of the Riemann zeta-function.These \psi_s (t) vectors are also all at "right-angles" to eachother. So their cross products = 0.

Due to the fundamental Gauss-Jacobi relation and the Riemann fundamental relation Z (s') = Z (1-s'), one can show that there is a direct concatenation among the following symmetries, t goes to 1/t, s goes to \beta - s (\beta a real), and s' goes to 1 - s', which establishes a one-to-one correspondence between the label s of one orthogonal state to a unique vacuum state, and a zero s' of the \zeta.Z(s') = Z(1-s') is true. Thus, we can show that there is a connection between the follwing symmetries:

t goes to 1/t,

s goes to \beta -s (where beta is a real number),

and s' goes to 1 - s'

In Q.M. we can show then a correspondence between one of these orthogonal states to a unique vacuum state (from Quantum Mechanics), and thus a solution of the zeta function.

It is shown that the RH is a direct consequence of these symmetries, by arguing in particular that an exclusion of a continuum of the zeros of the Riemann zeta function results in the discrete set of the zeros located at the points s_n = 1/2 + i \lambda_n in the complex plane.From these neat little tricks, we can show that the Riemann Hypothesis must be true, because these things are true.

## Re:Attempt at putting it in more layman's terms. (Score:3, Funny)

Honestly, you basically just translated that gobbledeegook from Latin to French for me. I still don't really understand what it all means, but I shall now do what I have done in the past for articles related to extremely complex mathematical hypothesis (hypothesese?)... I'll just nod my head, tell myself "Sure! But of course!" and move on to look for more "+5 Funny" comments.

Then maybe get back to work too.

## Re:Attempt at putting it in more layman's terms. (Score:2, Funny)

Ah, c'est une belle langue. vous devriez apprendre francais autrefois. ^_^

(I know, it's an anglicism, but it's good enough.)

## Re:Attempt at putting it in more layman's terms. (Score:5, Funny)

We are going to show you beyond a shadow of a doubt that the non-trivial zeros of the zeta-function are of the form 1/2 +- i*theta_n.I was with you right up to the point where you started typing.

To do this, we are going to use the operators D^{(k,1)} and their respective vectors \psi_s (t), such that using D^{(k,1)} on \psi_s (t) will produce k*(\psi_s (t)), where k is some non-zero constant. Unfortunately though, we have to show a way to product all of these operators. So the "construction of" the operators will be contained within the proof.ERROR: STACK OVERFLOW! SYSTEM POWERING DOWN...

## I heard two laymen discussing this... (Score:5, Funny)

Construction Worker Joe:

I think the non-trivial zeros of the zeta-function are of the form 1/2 +- i*theta_nConstruction Worker Larry:

I agree. It's clear when you consider the operators D^{(k,1)} and their respective vectors \psi_s (t)Construction Worker Joe:

Of course, so long as using D^{(k,1)} on \psi_s (t) will produce k*(\psi_s (t))Construction Worker Larry:

Yeah. Joe, you'd better make sure the Eigenvectors of those two boards you're nailing together have a dot product of zero. The last time the boards weren't orthogonal, the boss had a fit!Construction Worker Joe:

Yeah, whatever. Hey, check out that girl's hyperbolic curves!## Re:I heard two laymen discussing this... (Score:4, Funny)

## Re:I heard two laymen discussing this... (Score:3, Funny)

Construction Boss wanders off...

Construction worker Larry: Stupid pointy haired fuck, doesn't know that the dot product of two perpendicular vectors is 0.

Construction worker Joe: Yeah, hell, the fucking cross product isn't even a scalar!

Construction worker Larry: (in a serious tone) Now be fair, he could have meant (snicker) the zero vector. (snicker)

Construction worker Joe: (laughing) I suppose if I was sliding the nail along the stud.

the scene devolves into derisive snickering.

## Re:I heard two laymen discussing this... (Score:3, Funny)

## Re:Attempt at putting it in more layman's terms. (Score:3, Funny)

Frink:Here is an ordinary square --Wiggum:Whoa, whoa, slow down, egghead.Frink:-- but suppose we extend the square beyond the two dimensions of our universe, along the hypothetical Z axis, there.Everyone:(gasps)Frink:This forms a three-dimensional object known as a "cube", or a "Frinkahedron" in honor of its discoverer.Homer:Help me! Are you helping me, or are you going on and on?Frink:Oh, right. And, of course, within, we find the doomed individual.## Re:Attempt at putting it in more layman's terms. (Score:2, Informative)

I mean dot product... Sorry about that.

(for those of the unitiatied)

dot product means

A . B = sum(a_n*b_n), for all n.

cross product is something completely different.

## Re:Attempt at putting it in more layman's terms. (Score:5, Interesting)

you have an equation

f(x) = x(x-2)

now, x=0 is a trivial zero, because well anything times 0 is zero, so it's trivial, let's ignore it.

while, x=2 is a non-trivial zero, because it is unusual.

(to the mathies out there: I know, I know, this isn't 100% accurate, but it's a good approximation as to what trivial and non-trivial mean.)

## Re:Attempt at putting it in more layman's terms. (Score:3, Funny)

Doctor Hibbert:Homer, I'm afraid you'll have to undergo a coronary bypass operation.Homer:Say it in English, Doc.Doctor Hibbert:You're going to need open-heart surgery.Homer:Spare me your medical mumbo-jumbo.Doctor Hibbert:We're going to cut you open and tinker with your ticker.Homer:Could you dumb it down a shade?## Re:um... (Score:2)

EVERYONE is using that damn word now to explain something. Buisness people, marketing people, GET OVER IT!!!!

## Re:um... (Score:5, Funny)

(/me lobbies for the changing of "Off-Topic" moderation to "Orthogonal to Topic")

## Re:um... (Score:4, Insightful)

Please, I get enough of that kind of attitude on TV,

in movies,

at work,

at home,

at church,

at the bus stop,

in stores,

at the DMV,

in restaurants,

under my bed

and standing next to ANYONE who has vowels in their names.

Thank you.

## Re:um... (Score:4, Informative)

It has been years since I studied this, and even then I didn't fully understood it. So if there are any mathematicians reading this out there, please feel free to correct any misconceptions I might have.

Reimans hypothesis basically states that there is a correleation between the distribution of prime numbers (how many numbers are in between each of them) and a complex function (complex in the sense that it deals with imaginary numbers). In theory, you could use this complex function to predict the space there is between one prime number and the next one. Therefore you could use this function to predict which would be the next prime number given any other.

One possible field of appliction is encryption, which strongly relies on the mapping of this numbers.

## Re:um... (Score:3, Interesting)

this doesnt, however effect quantum encryption, which is entirely hardware driven and is based more on the fact that you cannot 'sniff' the data due to some quantum effects.

still, i think the proof is bogus... they posted in hep-th, which is for mathematical physicists, not number theorists. its even called 'steps towards a final proof'. i dont even have time to read it...

## Re:um... (Score:5, Insightful)

So if it could be used to break encryption keys as you say,

we would not need a proof to start doing so. We could just use itnowto generate keys; and its effectiveness would be evident. So no, I don't think that the proof of Riemann's Hypothesis has any sort of bearing on encryption algorithms.Now it

couldbe that some of the techniques used in the proof itself could provide some insights into prime factorization methods. But again, we don't need a proof itself to get those insights, we just need the techniques themselves.## GREAT SCOTT!!! (Score:5, Funny)

## Wow ... (Score:3, Informative)

-- shayborg

## No one noticed this? (Score:5, Interesting)

The arXiv will post nearly anything that resembles a mathematical paper-they don't do any refereeing. However, they apparently use the "general mathematics" section for papers that seem crankish like this one. And the fact that it took more than six months for this proof to make the news is proof that absolutely no one reads that section.

I haven't looked at the proof yet, but I'm worried that it will be at best a "physicist's proof"-a series of claims deduced by using some sort of physical reasoning that is not mathematically rigorous, since it seems to have been written by physicists, and is in the physics section.

## Re:No one noticed this? (Score:5, Informative)

For example, in the _very first_ equation, he introduces an "operator", and conveniently forgets to mention what space this operator is supposed toact on. A Banach space? A Hilbert Space? We should not have to _guess_ what algebraic structure they're using.

YAW.

## Translation (Score:5, Funny)

Classic matteproblem able have got a solution

One of mathematics superb olösta problem, the so call Riemannhypotesen, able now have got a solution, 144 year after that that Bernhard Riemann publish sina mind if a special equation, as in its luck is förknippad with primtalen.If the really am exposing themselves that certificates am holding able they two problemlösarna so småningom give a receipt out one million dollar in reward.

Year 1900 was gathering the world most outstanding mathematics to a conference in Paris. Wonder that present David Hilbert, the terms rankings mathematical think, 23 problem as sedan arrived that affect mathematics wonder heal 1900- digits, and than today. One of these problem each Riemannhypotesen, and defiance superb efforts has it stay olöst. IN November 2002 publish yet Carlos Castro from Clark Atlanta University, Atlanta, America, and Jorge Mahecha from University perceive Antioquia, Centre queue, Colombia a one proposal to solution.

The reward on one million dollaras exhibitor of American Clay Mathematics Institute sheep they yet nots out traitor one year behind publication. This for that second mathematics bark poll term that police accomplishment and watch if the really is accurate.- About this is truly is the a grand sensation. This is a creature of problem as am claiming great effort entrance a eventual solution able verify. Tusentals mathematics the world over will pounce this and inspect certificates with a magnifier, says Andes Karlqvist, mathematics, professor in data and manager for Polarforskningssekretariatet.

He am declaring that certainof Hilberts problem rather is problemområden than separate problem. A bit had also word if under these term as gone. If now Riemannhypotesen is absolved so is tens of they 23 problems absolved, seven is olösta, five is part absolved and one is nots inferior current.Under Andes Karlqvist each Hilbert really grand within sits precinct, with him was concluding a epok. He each the lastly as had survey over heal the mathematical science.

Mathematics have the latestdecade deployed very quickly, and the cheers article one aid as it olds 1900- digits mathematics nots be able anticipate datorn. Day all prompt and major datorer able manipulate huge amount speech and on short term make computations as formerly each impossible for a mans although he/ she was working a good deal currency with sina figure.With datorernas helphad certain problem absolved, as fyrfärgsproblemet. The says that the nots ring up to more than four various colours for that färglägga a maps so that nots area with a common limit had same colour. One datorprogram had systematic gone through all conceivable alternative.Andes Karlqvist deem yetthat the find one philosophy dilemma with this: inquiring is if husband bark accept evidence in form of one datorprogram. He am believing that wes now am standing before one kulturskifte within mathematics. Wonder the next decade am arriving the that evolve radically, and the because they all efficient datorerna.Bengal Jonsson

## Re:Translation (Score:2)

For everybody else, I speak Swedish as well, and it so sounds like a Swede who can't speak proper English, and adding Swedish words in the middle of everything.

No offense to the original poster, and bork bork bork everyone.

## Re:Translation (Score:2)

## From a Swede (Score:4, Informative)

Slashdot them to hell. It's my university, they can take it.

## Human Translation (Score:5, Informative)

Here's a human translation:

Classical Math Problem May Be SolvedOne of the great unsolved problems of mathematics, the so called Riemann Hypothesis, may have a solution 144 years after Bernhard Riemann published his idea of a special equation, related to prime numbers.If the proof does turn out to be correct, the two problem solvers may be eventually be able to collect a one million dollar reward.

In the year 1900, the world's leading mathematicians gathered for a conference in Paris. During the conference, David Hilbert, the leading mind of mathematics at the time, presented 23 problems which would affect mathematics for the ensuing century, and yet today. One of these problems was the Riemann hypothesis, and despite great effort it has remained unsolved. However, in November of 2002, Carlos Castro of Clark Atlanta University, Atlanta, USA, and Jorge Mahecha of the University of Antioquia, Medellin, Colombia published a proposed solution.

They won't be able to collect the one million dollar reward offered by the american Clay Mathematics Institute until one year after publication. This is to allow other mathematicians time to check the result, and verify its correctness.

- If this is true, then it is a sensational. This is a class of problems which requires much work before a possible solution can be confirmed. Thousands of mathematicians all over the world will cast themselves at this, and examine the evidence in minute detail, says Anders Karlqvist, mathematician, professor of informatics and head of the Polar Research Secretariat.

He explains that certain of Hilberts problems are problem areas rather than individual problems. Some have also been reformulated. If the Riemann Hypothesis is solved, then ten of the 23 problems are solved, seven are unsolved, five are partially solved, and one is no longer relevant.

According to Anders Karlqvist, Hilbert was a great man within his field, and a great period ended with him. He was the last man to have an overview of all the fields of mathematics.

Mathematics have developed very rapidly during the latest decades, thanks to an aid that the mathematicians of the early 20th century couldn't predict - the computer. The ever faster and larger computers of today can handle vast quantities of numbers and quickly make calculations that used to be impossible for a person even if he or she spent an entire lifetime.

With the help of computers, certain problems have been solved, such as the four color problem. It says that at most four different colors are neccessary to colour a map, so that areas with a common border don't have the same color. A computer program has systematically gone through all possible combinations.

Anders Karlqvist thinks that this involves a philosophical dilemma: should proofs in the form of computer programs be accepted? He believes that we stand before a culture shift within mathematics. During the coming decade mathematics will develop radically due to the increasingly efficient computers.

Bengt Jonsson## Will they get the prize? (Score:3, Insightful)

They won't be able to collect the one million dollar reward offered by the american Clay Mathematics Institute until one year after publication. This is to allow other mathematicians time to check the result, and verify its correctness.And, what if the standard of refutation? Is it enough to claim "oh, this proof is all just handwaving", or "this proof is worthless, it uses a physicists approach", or does any detractor need to precisely pinpoint where the error is "on page 13, where they get from equation 63 to 64, they effectively multiply both sides with zero"?

Indeed, it appears that most mathematicians don't take the proof seriously, which also means that nobody is taking the time to check it through... Thus ironically, our hoaxters may be able to collect... which will turn out very embarrassing to the contest board, if 5 years from now some bored math student goes through it line by line, trying out all possible interpretations, and does find the error(s)...

## Re:Will they get the prize? (Score:3, Insightful)

And, what if the standard of refutation? Is it enough to claim "oh, this proof is all just handwaving", or "this proof is worthless, it uses a physicists approach", or does any detractor need to precisely pinpoint where the error is "on page 13, where they get from equation 63 to 64, they effectively multiply both sides with zero"?"There is a saying sometimes employed by cruel mathematicians to describe illucid 'proofs': "This isn't right. This isn't even wrong."

Having said that, it surely would be nice to see 'exactly where it goes wrong'. For simple arguments a standard "the first error is on page t, line s" will suffice. More convenient is to find a claim to which an explicit counterexample can be constructed, that is, to show that the proof (if valid) leads to a contradiction - of course this works best when the proof is not reductio ad absurdum

Finally, we should always remember that the burden of "proof" is on the "prover" - it's not anyone else's responsibility if the paper isn't even written in what we'd call mathematics. (Naturally it has no chance of being published in a print journal if it's in that state, which is a necessary condition for the awarding of the prize.)

(The rest is a slightly tangential discussion of two common problems arising from extremely imprecise methods, aka "handwaving".)

Here's a gratuitous example:

Prop.There are more real numbers than integers."Proof."Consider the interval [n,n+1) for arbitrary integer n. In this interval there is one integer, but a slew of reals, eg, n+1/2, n+pi/4, and so forth. So, there are more reals than integers.Of course this proposition is true but the proof is nonsense, since we can "derive" by mimickery

Prop.There are more rational numbers than integers.which is just false.

This is a pretty simplistic example and doubtless the author of the purported proof of RH is using much more sophisticated handwaving, for which I'll produce another analogy:

Prop.2 has no proper factorisation."Proof."The only integers dividing 2 are 1, -1, 2, -2, the former two being units and the latter two the number and an associate.This proposition falls into the "not even wrong" category. Why? -- because to write down the word "factorisation" begs the question: in what ring (ie, algebraic context)? Absolutely, 2 is irreducible in the integers. But not in the Gaussian integers:

Prop.2 is not irreducible in the Gaussian integers.Proof.We see easily that 2 = (1+i)(1-i). Each factor of the RHS has norm 2, so neither is a unit, and in fact 1+i is a Gaussian prime, and 1-i = (-i)(1+i) is also a Gaussian prime.The error in the first proposition about 2 was that it made no reference to the context of the discussion. This is the sort of handwaving that occurs in the "proof" of RH. We can see it really makes a difference - in one context the prop. was true, and in another false; sometimes even to utter the word "factorisation" is to already condemn oneself to the "not even wrong" bin.

## Re:Will they get the prize? (Score:3, Insightful)

Prop. 2 has no proper factorisation.This proposition falls into the "not even wrong" category. Why? -- because to write down the word "factorisation" begs the question: in what ring (ie, algebraic context)? Absolutely, 2 is irreducible in the integers. But not in the Gaussian integers:Context is everything. And in the absence of meaningful context, assume the most simple meaning of factorisation is intended, i.e. decomposition into plain vanilla

positive real integers.Not specifying context is by itself not necessarily an error. It's just sloppy writing, and makes the proof harder to read (the reader has to figure out what exactly is meant). Not specifying context only becomes an error if you start mixing to contradictory meanings. For example, if in your "factorization of 2 problem", you start two lines of reasoning, one in which you limit yourself to integers, and one in which you allow complex numbers.

A smart reader (and who also has lots of time on his hands...) may check out the proof by trying out the various possible contexts. Either he finds one context where the whole proof makes sense, or he does indeed find an incorrect mixing ("on page 10, the authors work in the algebraic context of simple integers, while on page 15 they work in the context of Gaussian integers"). Of course, the problem here is that the thing is so sloppily written, with so

manyunderspecified contexts that nobody is really willing to invest any time debugging it...## Re:Translation (Score:5, Funny)

its luck is förknippad with primtalen.I suppose if I were about to win a million dollars, my luck would be förknippad with primtalen, too.

## You can help (Score:5, Interesting)

## Re:You can help (Score:3, Insightful)

## Re:You can help (Score:3, Insightful)

You might want to mention that to the people who finally proved the 4 colour conjecture a few years back then.

And anyway, even if you couldn't find a proof of this theorem through pure number crunching, you may be able to find a counter-example, which would be equally interesting.

## Re:You can help (Score:2)

## Re:You can help (Score:3, Informative)

Sure you might find a counterexample instead of a proof. But all the OP said was that you wouldn't find a proof.

## Re:You can help (Score:2)

Of course, this isn't how the ZetaGrid people are doing it.

## My personal opinion... (Score:2)

Why would you spend your spare CPU cycles on something like this? Why not put them more towards protein folding [stanford.edu] or an AIDS cure [fightaidsathome.org] or even evolutionary research [evolutiona...search.net]... something that would/might benefit humanity? Or is finding a proof/disproof to this hypothesis going to benefit us somehow?

## The proof is... (Score:5, Funny)

## Don't get too excited yet... (Score:5, Informative)

## Not first millenium prize? (Score:3, Interesting)

## Statement of the hypothesis (Score:5, Informative)

Definition of the zeta function:There is something called Riemann's zeta function: it is a function of a single complex variable. It is defined as zeta(z) = 1^(-z)+2^(-z)+3^(-z)+... (ad infinitum) You can easily see that zeta(z), as defined, converges if and only if Re(z)>1 (real part of z). However, the function is defined for all complex z using something called the analytic continuation: basically there is a unique way to extend zeta(z) for re(z) < 1 in such a way that derivatives of all orders exist at all points.The hypothesis states that all (nontrivial) zeroes of the zeta function occur on the line Re(z) = 1/2.

If proved, it has immense implications in many areas of pure and applied mathematics. For instance, in number theory: it would say a lot about the distribution of prime numbers.

The stature of the problem can be seen from the fact that it was one of the 23 problems which would shape the mathematical progress of the 20th century that David Hilbert drew up in his lecture at the 1900 Paris congress of mathematicians.

## HINT: Go read the comments on the previous article (Score:5, Informative)

by njj (133128) on Tuesday July 02, @12:05PM (#3808279)

(http://www.csv.warwick.ac.uk/~marem/

If you can't explain something in ordinary words to a layman, then you really don't understand it.

I'm about halfway through writing up my PhD thesis on some applications of homological algebra to knot theory and low-dimensional geometric topology (provisional title liber rerum dementiae, but it'll probably end up being called something more mathematically appropriate).

In principle, yes, I could explain the details of my research to a suitably motivated layman. But I suspect it would take rather a long time.

You see, and this really isn't meant to sound arrogant, supercilious, or dismissive, university-level mathematics is pretty damned difficult, and the details of most cutting-edge research really doesn't make sense until you've spent several years learning the background (the mindset, the language, the fundamental concepts).

My current area of research is essentially the applications of homological algebra to knot theory and low-dimensional geometric topology. To explain this to a non-mathematician, I'd first have to teach them a lot of background stuff (group theory, a bit of stuff about rings and modules, point set topology, basic algebraic topology (the fundamental group, (co)homology theory), some geometric topology (basic course in knot theory, some stuff about 3-manifolds), a bit of category theory, and some homological algebra (broad overview of the (co)homology theory of groups and algebras)).

It's taken me nearly nine years (3-year BA, 1-year MSc specialising in topology and knot theory, plus nearly five years doing a (part-time) PhD) to get to this point myself. If I were a bit cleverer (or didn't have a `proper' job as well) I might have been able to shave a couple of years off that.

My friend Steve has a physics degree. I managed, in ten minutes one evening, with much handwaving, to give him some idea of what my thesis is all about. It helped that he knew what a group was already though. But for me to explain it fully to him would probably necessitate him doing at least one mathematics degree first. And that's not really something I'd wish on one of my friends

Now this really isn't meant in an arrogant way, and I hope you won't read it like that, but Euclid was right: There is no royal road to geometry.

I can have a go at explaining the Riemann hypothesis, though. To fully understand what it's about and why it's so damned difficult you'll need to do an advanced course in complex analysis (which isn't my field either).

A complex number is a sort of two-dimensional number, which you can regard as a point in a plane (the `complex plane' or `argand diagram'). You add them together coordinate-wise, and you multiply them together in a weird manner which involves something which behaves like a `square root of -1' (engineers also like to think of it as a sort of 90-degree phase-shift operator, I'm told).

There's a particular function (`Riemann's zeta function') defined on the complex plane (it takes one complex number as input and returns one complex number). For some complex numbers (`the zeros of the function'), the value of this function is zero.

The `trivial' zeros occur at the points -2, -4, -6,

The `non-trivial' zeros (that is, all the other points for which zeta is zero) all seem to occur on the line parallel to the vertical axis that intersects the horizontal axis at +0.5. Indeed, nobody's ever found one which doesn't.

The Riemann Hypothesis is that *all* the non-trivial zeros lie on this line. It's known to be true for the first (large number which temporarily escapes me), but it turns out to be phenomenally difficult to prove that it's true in every case.

Now that's the basic idea, but it doesn't (and I can't - it's not my field) explain *why* it's so difficult that some of the greatest minds (Hardy, Littlewood, Ramanujan, etc) of the past 150 years have failed to prove it, and why the Clay institute are willing to pay a million dollars to someone who can.

- nicholas (we don't just sit around doing big sums, you know

## Grammer different? (Score:2)

## Re:Grammer different? (Score:3, Informative)

"Usage Note: Prove has two past participles: proved and proven. Proved is the older form. Proven is a variant. The Middle English spellings of prove included preven, a form that died out in England but survived in Scotland, and the past participle proven, a form that probably rose by analogy with verbs like weave, woven and cleave, cloven. Proven was originally used in Scottish legal contexts, such as The jury ruled that the charges were not proven. In the 20th century, proven has made inroads into the territory once dominated by proved, so that now the two forms compete on equal footing as participles. However, when used as an adjective before a noun, proven is now the more common word: a proven talent."

Go figure.

KFG

## Heh (Score:4, Interesting)

The Riemann hypothesis isn't exactly the most practical of problems, but many people have spent decades working on it (and some have gone insane). It's good that it is finally put to rest.

## This proof has already gone down in flames (Score:5, Informative)

I know the editors of this site mean well, but what we have here is a link to a site that defines the Riemann Hypothesis in very abstract terms, a link to a LANL preprint from two completely unknown researchers

deposited there in November 2002, and a link to an obscure Swedish newspaper from almost two weeks ago, and no other supporting material. So my BS meter is running at 5.The odds that "this is the one!" given that pedigree would seem to be really tiny. But the clincher for me is the following web page dedicated to would-be proofs of the Riemnann Hypothesis [ex.ac.uk] whose important text is (and I quote):

And the Castro and Mahecha preprint (and another grandiosely titled preprint by Mahecha) is linked to from there. Now my BS meter is running at about 9. So now I check for messages abou this at deja.com in the sci.math group. [google.com] Read the thread yourself; it's pretty entertaining.

So, with my BS meter running at 11, the work having been submitted for coming up on 6 months, and no indication whatsoever that this is real, I suggest it is false.

And I also suggest that Slashdot might wish to consider contacting a real mathematician to filter their potential stories on mathematics, since I can't tell you the last time one of these "is X finally proven?" stories has panned out.

## Re:This proof has already gone down in flames (Score:5, Informative)

1. SvD isn't an "obscure" Swedish newspaper. It's the biggest, counting readers in if not millions so at least hundreds of thousands. They seldom print bogus.

2. That the proof hasn't been verified yet doesn't mean it can't be correct.

3. The sci.math discussion doesn't really say anything about the validity of the proof, only that, as you say, the paper seems to not have been proof-read very well, etc.

But, I agree that in essence you have reasonable complaints. BS meter at 11 is quite high, though. Mine is at about 5. 11 is reserved for make-money-fast schemes and herbal viagra.

Oh, and one more thing. An AI posted a translation of the article [slashdot.org] that seems to have gone largely unnoticed. (Just in case there is someone in here who isn't fluent in Swedish.)

## Re:This proof has already gone down in flames (Score:4, Informative)

While I have no doubt that SvD is of singular value to almost everybody (especially for its largest entries on the diagonal), the fact is that it comes from Sweden makes it orthogonal to our concerns. (Sorry about that...)

Here in the US, you have to understand that unless you share a border with Iraq, we just don't have time to be interested in you these days. :-)

True enough, but see below, and the fact that if *I* had a proof of the Riemann Hypothesis, I probably wouldn't submit it to the high energy physics and "general math" sections of xarchiv.

Actually, the discussion basically says that nobody could read the thing and that it was chock full of typos. Once again, if I had a proof of the Riemann Hypothesis, I would probably make very certain that it was free of such interest-busting material. A mathematician can feel free to correct me, but I am assuming that while raw papers (especially from non-native speakers of the language the paper is submitted in) can be tough to get through, you usually *do* detect the high quality of the real work at some point pretty early on, and if you don't, you assume the worst.

In the thread I referenced, a physicist chimed in with the observation that one of the co-authors (Castro) was not taken seriously in his own field of physics, which makes it even less plausible that the math in this paper would be new and inspiriational.

Unfortunately, the Clay Math Prize has kind of made proving the Riemann Hypothesis a "make-money-fast" scheme. :-)

Or to put it another way, here's the plan of attack I believe the authors had:

## Re:This proof has already gone down in flames (Score:5, Interesting)

While I have no doubt that SvD is of singular value to almost everybody (especially for its largest entries on the diagonal), the fact is that it comes from Sweden makes it orthogonal to our concerns. (Sorry about that...)I don't understand what you mean by this, or if you are even being serious. If a newspaper is respected, generally trustworthy and read by a large amount of people on a daily basis, where is happens to be located should of course be of no relevance.

If you mean to say that the reason that the rest of the media isn't catching on is that the only story so far has been in a Swedish newspaper, I don't object. But if you're saying that being run in a non-US newspaper makes the story less likely to be true, I think you are a little confused.

True enough, but see below, and the fact that if *I* had a proof of the Riemann Hypothesis, I probably wouldn't submit it to the high energy physics and "general math" sections of xarchiv.Recently, as in the last couple of years, the most promising contributions to RH related stuff has come from high energy physics, and many people, both in math and in physics, believe that this is the approach that will eventually bear fruit. If indeed a final proof would be more physics than number theory (perhaps the proof of the RH would only be a corrollary of some completely un-number theoretic line of reasoning) wouldn't it be reasonable to publish it in a physics journal? That it has implications for number theory isn't enough of a reason to publish it in a number theoretical journal, mostly because the readers of it would not be able to determine whether it was correct or not.

In the thread I referenced, a physicist chimed in with the observation that one of the co-authors (Castro) was not taken seriously in his own field of physics, which makes it even less plausible that the math in this paper would be new and inspiriational.This is serious, agreed. I don't think I read that post.

Unfortunately, the Clay Math Prize has kind of made proving the Riemann Hypothesis a "make-money-fast" scheme.Only for amateurs. But those have been trying to prove it, as well as Fermat's last theorem, Goldbach's conjecture, the twin prime conjecture etc. for a long time already. Serious researchers, on the other hand, very rarely put their reputation at stake if they don't believe they have something of real value. They know flaws will be detected, and they know that they would never win any prize with an unsound proof.

But, like I said (in the write up, even), there is a clear possibility that this isn't the real thing. I only think you're overstating your case.

## Re:This proof has already gone down in flames (Score:3, Flamebait)

I wasn't. It was a joke. A really bad joke. Sorry about that. :-)

It isn't, except that it is. The problem I have here is with accepting "generally trustworthy" as a blanket statement that applies equally to things we know newspapers are usually pretty good at (politics, current issues, scandals, crimes, and the like) and areas where we (or at least I) do not have high confidence in their abilities. High-level mathematics clearly falls into the second category; I am not certain I would trust *any* newspaper account of this. Fort that matter, I can get specific here. The translation of the article you pointed us to includes this:

Now, the problem here is that

some random author or another submitting a paper that claims to solve an important math problem like this is really not newsworthy.It really does happen almost all of the time, and yet the writer of this story seems to be innocent of this fact. Indeed, if the author had asked for comment or advice from any mathematician about this particular attempt, I'm sure the answer would have been "we see five or six of these a year". Actually, the fact that this is a *good* newspaper makes the point even more strongly: despite their expertise, they really didn't know how to evaluate this as a news story. That's the problem.OK, now that's interesting, and I did not in fact know that. And there is no question that new lines of attack can come from unusual places. I do feel that these new lines often offer themselves up in somewhat more propitious circumstances. So if a high energy physicicst had teamed up with an important number theorist to do the paper, and it was based on the kind of insight that is taken for granted in one community but not the other (e.g., "interesting; in our work we rewrite the integral *this* way and then prove these bounds...")

Well, the term "amateur" is always a relative thing. So it would be easy to see why a non-famous high energy physicist might spend a lot more time on something like RH after the prize money is publicized given that the chances of hitting on this or on any round of funding these days in physics might be the same lottery odds. :-( So a detectable number of physicists entered the field of cognitive neuroscience when the SSC went down, not necessarily for the big bucks, but to try and work on a challenging problem where there was some hope of funding. Results were mixed.

Plus, I can report that a couple of definitely professional mathematicians I have met do (prviately) admit that the Clay Prize money has actually attracted their attention to the prize problems, if only just to take a brief whack at them and see if anything new falls into place.

I have pretty high confidence that the current attempt has basically already joined all of the other failed attempts. There are so many of these, and this does share many disturbing similarities with them. Thanks for your comments, though; I really had no idea that high energy physics had any implications for RH until I read your post.

## Re:This proof has already gone down in flames (Score:5, Insightful)

There must be hunderds of these "final proof of Riemann hypothesis" claims on the web. It is sad that /. editors but urges them on to more recklessness.

"a Swedish newspaper is the only one to take up the story yet"doesn't inspire caution in the## The last time I remember was Fermats last Theorem. (Score:3, Interesting)

http://www.missouri.edu/~cst398/fermat/contents

## BS meter (Score:3, Informative)

## Re:your message is only flamebait (Score:4, Interesting)

Now, I really did. My favorite quote from it is the part where Aaron Bergman notes, "I also hope that math people realize that us physicists only read Castro's papers for humor purposes."

That's not what I see. What I see is that they figure out among themselves that some really non-standard usages of mathematical terminology happen in physics, and that whether you use "ln" or "log" to refer to the notion of a natural log might reflect where you went to school or what calculator you used...idle chit-chat, really.

No, my "clincher" would be that a link to this appears on the same page as work by the illlustrious Archimedes Plutonium. [newphys.se] Really, you just don't know how damning this is, do you?

## An Explaination of what this means (Score:5, Informative)

## Will some mathematician... (Score:2, Interesting)

## sci.math, High Energy Physics? (Score:2, Interesting)

Note that the paper was submitted to the "High Energy Physics" archive, not the "Mathematics" archive. The abstract has some physics jargon, too. What this means for the proof I cannot say.

## Breaking Encryption? (Score:2, Interesting)

If it becomes simple to factor the product of prime numbers, current digital encryption software will be worthless.How does this make encryption software worthless? Being able to unfactor the primes wouldn't seem to me like it would automagically be the solution to cracking an encryption key, etc. Even a program could unencrypt a document by guessing various keys etc through prime factorization (I'm assuming that is what this is about), how would it know which solution is right?

## Re:Breaking Encryption? (Score:3, Insightful)

## Re:Breaking Encryption? (Score:3, Informative)

Quantum encryption, IMO, is the answer - if you even *try* to decrypt it, you muck it up and both the sender and receiver know about it.

## What is it good for? (Score:3, Insightful)

How many prime numbers are there less than a given number.

It doesn't take much thought to work out why that would be handy in say cryptography.

But most complex maths starts for it's own sake. You build the tools in the knowledge that eventually someone is going to use them, and inevitably they always do.

I read about advances in nano-technology all the time. What's the point, no-one's using them? But without them now we wouldn't have cool stuff in 20 years. Same goes for maths. I would have thought nerds of all people would get that point.

## oh Riemann you're so fine... (Score:5, Funny)

"A proof of the Riemann's hypothesis (RH) about the non-trivial zeros of the Riemann zeta-function is presented. It is based on the construction of an infinite family of operators D^{(k,l)} in one dimension, and their respective eigenfunctions \psi_s (t), parameterized by continuous real indexes k and l. Orthogonality of the eigenfunctions is connected to the zeros of the Riemann zeta-function. Due to the fundamental Gauss-Jacobi relation and the Riemann fundamental relation Z (s') = Z (1-s'), one can show that there is a direct concatenation among the following symmetries, t goes to 1/t, s goes to \beta - s (\beta a real), and s' goes to 1 - s', which establishes a one-to-one correspondence between the label s of one orthogonal state to a unique vacuum state, and a zero s' of the \zeta. It is shown that the RH is a direct consequence of these symmetries, by arguing in particular that an exclusion of a continuum of the zeros of the Riemann zeta function results in the discrete set of the zeros located at the points s_n = 1/2 + i \lambda_n in the complex plane."That is the

WORSTpickup line I have ever heard.## *siiiigh* (Score:3, Offtopic)

Maybe in yet

anothertwo or three years I will be able to understand WTF they are talking about. . . .## But.... (Score:3, Funny)

Eu4ria

## only 1 million? (Score:2)

## So if this is proven to be true... (Score:3, Funny)

## Ok for the laymans (Score:2, Insightful)

Almost all "good" encryption uses prime numbers. If someone can figure out how to factor prime numbers, or find a quick way to determine a prime number, then all the fancy encryption in the world wont help because someone can just crack it in real time.

Right now public encryption works because it would take so long to break the encryption, even with say... 300k computers (distrubted.net) that when the encryption was broken (5-10 years later) the info would be old and it would not matter.

If someone could figure out some way to factor primes (which is along the lines of riemans sums) then they could possibly break even our stronger prime based encryption, which would make a great many people have to go back to teh drawing board on encrypting their data.

## Crypto applications (Score:2)

## Re:Crypto applications (Score:5, Funny)

(1.5*10^9 examples aren't often wrong)read the sales figures for pop albums.

## Watertight Proof? (Score:3, Funny)

so there is certainly a possibility that this is a hoax, or a less than watertight proof.I read this as waterproof tights for some reason... had visions of Batman in a wetsuit.

## Explained With Pictures (Score:5, Funny)

## Mathworld comment about the prize (Score:4, Interesting)

In 2000, Clay Mathematics Institute offered a $1 million prize for proof of the Riemann hypothesis. Interestingly,disproofof the Riemann hypothesis (e.g., by using a computer to actually find a zero off the critical line), does not earn the $1 million award.An example that operates on the exact opposite principle of awarding prizes is the recent battle between Kasprov and Deep Jr: He gets 500k regardless, and 300k extra if he wins, 200k extra if he loses, or 250k if draw (i think the last case took place).

Talk about being stingy! I'd think that disproving the Riemann Hypothesis would be equally interesting as proving it - There are soooo many theorms out there that basically begins with "We assume that the Riemann Hypothesis to be true, and so forth so forth."

## Re:Okay, assuming this proof to be correct... (Score:3, Insightful)

Who knows what use someone may derive from the proof of the RH?

## Re:Okay, assuming this proof to be correct... (Score:3, Insightful)

Scanning Tunnelling microscopes are just one example. Based on the pure science of quantum mechanics, which was very easy to dismaiss as "of no practical use" for a good thirty years.

## Re:Okay, assuming this proof to be correct... (Score:5, Insightful)

16-year-old John Quincy Adams and 77-year-old Ben Franklin had watched as Alexandre Charles tested an unmanned hydrogen balloon in Paris. That was where someone asked Franklin what use this all could be, and he gave his much-quoted answer, "What good is a new-born baby?"Not everything need have immediate application.

## Of course (Score:5, Funny)

It also proves that all non-trivial zeros are in the line Re(s) = 1/2. This is important because it humbles people without a very wierd Mathematical background, by informing them thre is such a this as trivial and non-trivial zeros. It may also get the Math guys some more girls.

## Re:Of course (Score:2)

## Re:Okay, assuming this proof to be correct... (Score:2, Insightful)

So mr Pytagoras you say that if one multiply the radius of a circle with two and then by approxymatley 3.14 one gets the size of that circle. Of what practical use is it again?? Anyone?

## Re:Okay, assuming this proof to be correct... (Score:3, Interesting)

Is it getting more practical now? No?

Modern electronic encryption uses prime numbers to work. Large prime numbers. Prime numbers that are currently "unguessable" without lots of brute force.

And if the function is truly solved, now they're all in a straight line.

## Re:Okay, assuming this proof to be correct... (Score:2, Insightful)

provingthe Riemann Hypothesis and thus putting it beyond any doubt (which experimental verification never can). It's applications are immense, but already exist.## Re:Okay, assuming this proof to be correct... (Score:5, Interesting)

However, what is discovered today may find application 50 or 100 years or even centuries later. As an example, consider Hardy's quote in the "Mathematician's Apology":It is undeniable that a good deal of elementary mathematics-- and I use the word 'elementary' in the sense in which professional mathematicians use it, in which it includes, for example, a fair working knowledge of the differential and integral calculus) has considerable practical utility. These parts of mathematics are, on the whole, rather dull; they are the parts which have the least aesthetic value. The 'real' mathematics of the 'real' mathematicians, the mathematics of Fermat and Euler and Gauss and Abel and Riemann, is almost wholly 'useless'(and this is as true of 'applied' as of 'pure' mathematics. It is not possible to justify the life of any genuine professional mathematician on the ground of the 'utility' of his work.Hardy says that pure mathematics is completely useless. The sweet irony is this: Hardy was a number theorist. In his time, no one could ever conceive that there would ever be any application of that field of mathematics. However, public key cryptography, which was born in 1976, is built on number theory, and is the foundation of modern information privacy and computer security. Immensely practical.

See how it works?

So no, no practical applications for you, but this would still (if correct) be a result of enormous impact.

## Re:Okay, assuming this proof to be correct... (Score:2)

Of what practical use is it again?step 1: .Proove Reiemann Hypothesis
step 2:???
step 3: PROFIT!!!!!

## Re:Okay, assuming this proof to be correct... (Score:5, Informative)

## Re:Okay, assuming this proof to be correct... (Score:3, Interesting)

For instance one can use it to prove the odd Goldbach conjecture-every odd number greater than five is the sum of three primes.71 + 2 + 3 =

61 + 3 + 5 =

9(well, there's one)2 + 3 + 5 =

10But, if you can use a prime twice:

2 + 2 + 3 =

7Got any specific details on this conjecture? It sounds intriguing.

## Re:Okay, assuming this proof to be correct... (Score:2)

## Re:Okay, assuming this proof to be correct... (Score:5, Interesting)

The coolest thing that ever happened to me in University (not involving social life), was when we started to prove things that I just took for granted as true.

Suddenly an order and majesty came out of all of it, and it was the more invigorating feeling I've had. There's something to be said about being good at math and able to memorize all of those formulae and how they work, etc. But there is something completely different about proving those formulae and knowing for a fact (beyond any doubt) that they are absolutely true.

Everyone generally assumed RH was true, this is exciting because if it is valid (I don't have the time to validate the proof, albeit I will read it over), than RH is absolutely true beyond any shadow of a doubt.

Now if RH were proven to not be true, that would be even more exciting, but this is just as good. ^_^

## Re:Okay, assuming this proof to be correct... (Score:5, Interesting)

This is not a "most fundamental theor[y]" on which calculus is based. Calculus is not based on it at all. Ostensibly it has nothing to do with calculus at all although any proof will almost certainly use calculus.

You're also confused about the words "theory" and "theorem". We're talking about the latter here. A theorem is a proposition that has been rigorously proved by deriving it from axioms. A theory is something quite different: loosely is means something like a "systematic body of knowledge". Like the theory of evolution or group theory. Or it can be used to mean a tentative hypothesis as in "I have a theory that this doesn't work because you forgot to ...". (That's two distinct meanings by the way - I might as well clear up some Creationist FUD while I'm at it.)

And what are you talking about when you say "proofs are rarely meant to be practical". The truth or falsity of Rimemann's Hypothesis affects things like the theoretical expected time for things like factoring algorithms to run. Maybe /. readers can.

youcan't see the consequences of that but I'm sure most## Re:Okay, assuming this proof to be correct... (Score:3, Interesting)

## Re:Sooo... what is it exactly? (Score:2)

## Why not a computer program (Score:2)

First, and probably the main reason, is that pure mathematicians do not think computers are mathematics. This is probably doubly so in the number theory area; where the people sometimes act like algebra isn't real mathematics....

Second, most computer programming languages cannot be "proven" themselves. This means, from a purely theoretical standpoint, that even if they produce the results desired, there is no way to "prove" that they really did what they were supposed to do. Or put another way, how can these author's prove that the "proof" isn't really the result of a programming error. Obviously, in the normal world, no one cares about this; if the program displays the correct graph, who cares whether it is really proven or not. But in the world of mathematical proofs, that sort of "slip-shod" work is really frowned upon. On the other hand, there are computer languages which are formally provable, so this may not matter depending on what the proof program was written in.

Finally, it looks much cooler to have a bunch of greek characters up on a white board then a computer monitor saying "Yup, it works."

## Re:What are the security concerns? (Score:3, Insightful)

You could, for instance, adopt the following strategy: assume that the conjecture is true. Use it (however it supposedly makes encryption easier to crack) to crack encryption algorithms. If it works, great. If not, you can still crack it the old-fashioned way.

As I understand it, we're already pretty damned convinced that this conjecture is true, and we're just lacking a 100% rigorous proof of it. I don't see how the presence or absence of a 100% rigorous proof will have any effect on whether or not it's useful in cryptanalysis. Even if the conjecture turns out to be false in general, it is known to hold for an absolutely enormous set of numbers, right? Even if it only works on a small percentage of cases, that's still a small percentage of cases you don't have to solve via brute-force.

This fact tends to make me believe that the conjecture will not, in fact, help us crack encryption faster -- because we would already be using it if it helped. Could someone with a real mathematical background explain how a rigorous proof of the conjecture would make any difference whatsoever in cryptanalysis? How exactly does it apply, and how would a rigorous proof make it apply in ways that it doesn't today?

## Re:NSA found it already? (Score:3, Funny)