Remix.run Logo
▲ jorisw 6 hours ago

For the laymen, what's the significance?

▲cgearhart 5 hours ago | parent | next [-]

In truly layman's terms, this is among the most famous problems in mathematics; it is arguably the holy grail of pure mathematics and number theory. It is also another one of the Clay Millennium Prize problems.

In the ~150 years since it was posed, it has become a lynchpin for hundreds of downstream results that assume it is true. This proof would immediately confirm all of those results.

More practically, there are also some algorithms that will now have guaranteed theoretical bounds and it will likely eventually lead to some more interesting algorithms in the future.

It's kinda the math equivalent of "we found life on another planet".

▲ryandrake 5 hours ago | parent | next [-]

I went to the Wikipedia page for it, hoping to find one of those “practical applications” section and left greatly disappointed! No doubt that this is very exciting for Math departments and would be a historic achievement within the field, but I still struggle to see what real world advances this could bring about. Is this about cryptography or something?

▲cgearhart 4 hours ago | parent | next [-]

The most "practical" thing I can point to is that the Miller primality test has a concrete bound under the generalized Riemann hypothesis (which is also claimed in the OP paper). Still not very practical because we already had the algorithm and we already knew experimentally that it worked well in practice.

This is why I compared it to "life on another planet". In both cases it might be more surprising if it was false; but even knowing the answer for certain, we wouldn't have any immediate application for it. It's likely that with further study we can learn more and might find new applications.

It is a remarkable achievement, but I suspect that in 100 years the most notable thing about the Riemann Hypothesis will be that it was among the first tremendous achievements of AI. It'll be picked apart and dissected, extended, and applied, but just as we rarely think about how silicon wafers are made into the computers we're using, future generations will not stare up at Riemann as a mountain daring them to climb. They'll see it as we look at other foundational results from the past: a stepping stone on the path to the next mountain.

▲inkysigma 4 hours ago | parent | prev | next [-]

A lot of the Millenium Prize problems are pure mathematics problems in the sense there's no direct immediate application. There's some neat implications for primality checking and the like but the degree to which this is relevant is probably questionable given we typically use ECC or maybe post-quantum crypto nowadays.

▲jackling 4 hours ago | parent | prev | next [-]

For most of these unsolved math problems, should we expect there to be many practical consequences? If there truly was something that could be made from knowing Riemann was true, could we not just have assumed it was true and developed such a thing on that assumption and see if it worked?

▲hbcdbff 5 hours ago | parent | prev [-]

There’s a reason it’s a pure mathematics problem and not applied.

▲tavavex 4 hours ago | parent | prev | next [-]

I thought that the downstream results were already assumed to be true because people by consensus thought that the hypothesis is likely to be true. Are we already using any things or results in practice that were created through this assumption? The important question is how much value a real proof would add. Would a counterexample be much more disruptive by overturning all this research that was built on the assumption it was true?

▲adastra22 4 hours ago | parent | prev | next [-]

Which ones? I’m sorry but your post really doesn’t answer the question.

▲cgearhart 4 hours ago | parent [-]

I was trying to keep it very generic because I think you can understand the significance of the result without having to probe into the details. Saying "Riemann implies Fhqwhgads" is also impenetrable to a layman.

That said, the most practical result I can point to is probably that the Miller primality test has a concrete bound under the generalized Riemann hypothesis, which is also claimed in the paper. This doesn't change much because we already had the algorithm and we already knew it worked well in practice, so it's more of a confirmation than conclusion. That's a trend around Riemann because we've been able to just assume it was true and proceed beyond it already.

▲saberience 4 hours ago | parent | prev [-]

So what practical applications does it have?

Will it cure cancer?

Will it result in fusion power?

Will it change the lives of people who live on planet earth?

Are there any positive effects at all which will be felt by human beings? Other than perhaps Anthropic’s stock price increasing.

▲ducttapecrown 2 hours ago | parent | next [-]

It will help us solve problems where there are patterns like the prime numbers. Since the prime numbers produce very complicated patterns, this can be helpful. But a math result is always just another way to see the world, not change it.

▲cgearhart 4 hours ago | parent | prev [-]

There have already been a bunch of results that relied on assuming the RH was true. It will not cure cancer, deliver fusion power, or directly influence or change the lives of anyone on earth--at least not as far as we know right now.

Are there any positive effects? I'm not sure. This is certainly among the problems--like the others you listed--that have attracted the most human energy and brainpower ever, and over an even longer time than the problems you listed. Is that not remarkable? It was like 2 years ago that LLMs couldn't even solve peak high-school level math problems. Now they've taken down two of the most famous maths problems in history in about as many months. And unlike Navier-Stokes which was approximately the prompt equivalent of "sounds good. keep going." this one seemed to require a good deal of expert human involvement. That's _interesting_, right?

I feel like I'm standing in the rain witnessing the invention of the wheel or the discovery of fire and hearing folks complain that it's pointless because it doesn't keep them dry. What people are achieving with this technology is _astounding_.

▲shigawire 2 hours ago | parent | next [-]

It's cool, but to a dummy like me who knows not knows "ryemann (sic) very hard" and then hears "no practical application" it seems to follow the general AI trend I see in my day to day.

And that is, very good at generating text. Not in of itself helpful in the real world unless that text it generates can be pointed somewhere useful. And the maximum utility I have seen is writing software. Which again, is quite good - but not earth shattering (except to my career prospects).

The other uncertainty to me (as a dummy) is where any of this can even go. Do we just scale forever? Does AI ever succeed at RL or is that just crap to sell the stock? Who knows...

▲arrowleaf 2 hours ago | parent | prev [-]

From a layman, all I’m hearing is that proving this theorem will stop us from misallocating the focus of genius minds on the practical equivalent of a very hard sudoku puzzle.

▲nickcw 5 hours ago | parent | prev | next [-]

Lots of existing maths proofs start by assuming the Riemann Hypothesis true. Proving it will automatically complete those proofs.

More discussion: https://mathoverflow.net/questions/17209/consequences-of-the...

▲__lm__ 5 hours ago | parent | prev | next [-]

It is one of the greatest open problems in Mathematics which has stayed open for more than 100 years (actually since 1859), which has eluded generations of mathematicians, including some of the most brilliant minds of the XX Century (it was already important enough that it is part of one of problems in the list of the 23 Hilbert's problems (stated in 1900). Many results holds under the assumption that RH is true.

▲cman1444 5 hours ago | parent [-]

Isn't it arguably the greatest? Maybe tied with P=NP?

▲trio8453 5 hours ago | parent | prev | next [-]

It's the hardest problem in mathematics and solving it would be the most impressive thing done by AI so far. It also automatically proves many other statements in mathematics which are currently formulated is [if the Riemann hypothesis is true, then <this> happens].

Take everything that happened a couple of months ago with Navier-Stokes and increase the magnitude several times.

▲meowface 5 hours ago | parent | next [-]

Is it the hardest problem, or just the biggest problem? Is solving P=NP not more difficult?

▲dooglius 4 hours ago | parent [-]

We know to Godel that some problems are independent, i.e. it can't be resolved. It's likely that some famous problems are independent, and thus infinitely difficult.

It is perhaps the hardest problem that has been resolved

▲agos 4 hours ago | parent | prev | next [-]

with "everything that happened a couple of months ago with Navier-Stokes" you mean the claims of plagiarism? I don't remember much else connected to it

▲sashank_1509 4 hours ago | parent | prev [-]

By definition unsolved problems are harder

▲rustyhancock 5 hours ago | parent | prev | next [-]

3blue1brown has an excellent video for a visually intuitive understanding of what RH is.

It's quite old but I find a reason to watch it every few years.

https://youtu.be/sD0NjbwqlYw

▲TehCorwiz 5 hours ago | parent | prev | next [-]

As a fellow layman my understanding is that if it holds true then it has implications about the distribution of prime numbers. Cryptography is an example of a field that relies on prime numbers. They underpin a lot of security. Also, right now finding new large prime numbers is relatively difficult to do, but relatively easy to check. I'm not sure if it's NP-something or not, but finding a solution to shorten the effort to find new primes might have broader applications in algorithm design.

▲darkwi11ow 5 hours ago | parent | prev | next [-]

The direct impact is mostly theoretical, as many things in number theory are based on assumption of Riemann hypothesis, and they were not advancing much historically because there was no proof of Riemann. These things will start getting more spotlight if proof holds true, and they could lead to advancements in cryptography, coding theory, computational theory, and other fields that are heavily invested in number theory.

NB: I am a student of mathematics, not a researcher, and some practicing researcher could correct me here

▲jrflo 5 hours ago | parent | prev | next [-]

It's one of, if not the biggest unsolved problems in math. It's also a millennium prize problem. There are a ton of conditional proofs in math that are true if RH is true, so this would fully prove tons of work. There's also a link between the spacing of nontrivial zeros in RH and the spacing of prime numbers, so it will be interesting to see if this proof illuminates anything about the primes.

▲est 5 hours ago | parent | prev | next [-]

Goldbach's conjecture would turn out to be true.

https://mrc.sdu.edu.cn/english/info/1018/1514.htm

▲perching_aix 2 hours ago | parent [-]

Requires a bit more, but Alpöge's work may have machinery to provide that.

▲criddell 6 hours ago | parent | prev | next [-]

This is the only information I've found that was at all comprehendible by me:

https://en.wikipedia.org/wiki/Riemann_hypothesis#Consequence...

▲charlieyu1 5 hours ago | parent | prev | next [-]

The Riemann zeta function can be written as a product of the same function in prime powers.

Finding zeros of a complex function tells us a lot about Riemann zeta function, and in turn, the distribution of primes.

I’d compare this to Fundamental Theorem of Algebra in terms of importance.

▲BigTTYGothGF 5 hours ago | parent | prev | next [-]

For certain parts of pure math, it would be tremendous, it's been a big deal and is connected to lots of other things in those domains. For everything else in the universe, there's no real consequences.

▲jtumbot 5 hours ago | parent | prev | next [-]

Complicated topic that I don't fully understand, but I believe our understanding of Complex numbers would be much better. In that we understand regular/irregular distributions. The knock on affect is there's thousands of theorems that have been prove 'if' the Riemann Hypothesis is true. And there'll be much more to look into now that it's proven.

I don't know how immediate it would be but you'd expect to see improvements in any algorithm that uses prime numbers. Which is quite a few (RSA, Hash tables, RNGs)

▲rhdunn 6 hours ago | parent | prev | next [-]

The Riemann Hypothesis is used as a foundation for several important theorems. See https://en.wikipedia.org/wiki/Riemann_hypothesis#Consequence... for details.

▲vuldin 6 hours ago | parent | prev | next [-]

I have the same question. So far I'm not seeing details on why this is worth continuing to read about.

▲ 5 hours ago | parent | prev | next [-]
[deleted]
▲shawabawa3 5 hours ago | parent | prev | next [-]

Thousands of mathematical papers build on top of it, basically proving X holds _if_ the Generalized Riemann hypothesis holds

So all of those X are now proven (if this is indeed proven)

▲fallingbananna 5 hours ago | parent | prev | next [-]

Looking at the wikipedia page explaining it... I get the feeling there is no *quick* way to explain it to laymen.

(Just a feeling, I don't know the significance either.)

▲keybored 5 hours ago | parent [-]

I haven’t seen a Wikipedia page on mathematics that was written for laymen yet.

▲Betelbuddy 6 hours ago | parent | prev | next [-]

Mathematicians are nothing more than a Matrix product.

▲pg_bot 5 hours ago | parent | prev | next [-]

Arguably the most famous unsolved math problem.

▲ 5 hours ago | parent | prev | next [-]
[deleted]
▲ReptileMan 6 hours ago | parent | prev [-]

Humongous