| ▲ | gxd an hour ago |
| This sounded pretty definitive to me. I'd like to hear from professional mathematicians about what's left for humanity to consider this proven. |
|
| ▲ | jlev1 an hour ago | parent | next [-] |
| I don’t think there’s anything left to consider the result proven (I am a professional mathematician albeit in algebraic geometry, not number theory). I think the verification tells us it’ll be worth the substantial effort to seek to understand this proof and the new ideas in it, so what’s next for humanity (or mathematicians at least) now is to actually try to do so. |
| |
| ▲ | matsemann 43 minutes ago | parent [-] | | Are there new ideas, or just brute force combinations of existing knowledge? I'm asking because I wonder. I always thought the most interesting things about these problems where we're fairly certain about the results, is the new concepts invented to get to the solution. Will this actually bring the field forwards? Can anyone understand this? | | |
| ▲ | thatsthebestcas 7 minutes ago | parent [-] | | It seems unfathomable to mathematicians but their world might be finite and once all major idea spaces have been explored all that’s left is “brute forcing” it. |
|
|
|
| ▲ | bemtevi 4 minutes ago | parent | prev | next [-] |
| The AI proof is very long, so hard to verify manually. It's more or less asking God and him just telling you it's true. Is that a proof? The human proof is shorter, somewhat, but still needs verification. Keep in mind that the Millenium criteria asks for two years for the community to come to a consensus. That's because people must be convinced it's true, and many are not completely at least to the level of rigour typically demanded in math. |
|
| ▲ | zug_zug an hour ago | parent | prev | next [-] |
| My understanding is that these ARE the professional mathematicians and SMEs in the field of automated proof. This statement IS the experts saying "we, after intense collaborative review, deem it true." Granted mathematicians are not a monolith, but my understanding is that this group is the group other mathematicians would normally refer you to. Hence why they felt the need to publish a statement. |
|
| ▲ | siddthesquid an hour ago | parent | prev | next [-] |
| Not a mathematician. But I'm wondering if there is nuance with defining a valid lean proof as definitive if the underlying mathematical theory behind lean itself isn't necessarily sound. EDIT: Here is my honest prediction - there's a more foundational mathematical framework, fully decidable and complete and consistent, that can interpret any well-formed mathematical question and deterministically transform it into the solution. The proofs of the most difficult unsolved problems right now would fit onto a page. There's an inconsistency (obviously unproven right now) specifically with our treatment of infinity and self-reference. |
| |
| ▲ | gpm an hour ago | parent | next [-] | | From the article > The checkers con-leche and con-ron come with a formal proof, relative to set theory, that they cannot accept a false proof, thus addressing concerns that Lean’s logic itself might have flaws that the proof could exploit. All of modern math - outside logicians whose entire job is to study set theory and its alternatives - is based on set theory. If you're prepared to accept normal mathematical proofs you shouldn't be rejecting this proof on the basis that you're not confident in leans underlying mathematical theory. Of course incompleteness means we can never prove that set theory itself is correct (consistent). But that's not something mathematicians worry about on a day to day basis. Proving it inconsistent would be a order of magnitudes larger result than the riemann hypothesis. Generally everyone believes it is consistent despite not being able to prove it. | |
| ▲ | hodgehog11 an hour ago | parent | prev | next [-] | | It is impossible for it to be fully "complete" (one of those halting problem proofs), but I've seen that the community has checked there is no meaningful metaprogramming here. Rather than checking whether it is right, the community tried to ensure that it could not have done something to cheat, and indeed, there were no examples of this. At this point, I have more confidence in this proof than much of the published mathematical literature. RH has fallen. | | |
| ▲ | siddthesquid an hour ago | parent [-] | | I guess what I am wondering is if the mathematical community would say 0 chance or greater than 0 chance that we're mistaken in accepting things like halting problem, cantors diagonal argument, and godels incompleteness theorem as true. Sometimes it feels like they all point to same fundamental inconsistency with how we model infinity and self reference. | | |
| ▲ | hodgehog11 43 minutes ago | parent [-] | | They are conclusions that follow naturally from axioms that most of the community accept are true. The consequence of these results is that one cannot truly construct something that can completely verify everything, but we can get something that can verify almost everything, and if we know what pathologies look like, we can rule them out. I do probability theory, so everything is just varying degrees of confidence in my view. Right now, this statement says that your confidence in RH should be extremely high. |
|
| |
| ▲ | bananaflag an hour ago | parent | prev | next [-] | | Gödel showed that you can't prove consistency of ZFC, Lean etc except in another system which you also can't trust. See e.g. Gentzen's proof for PA. | |
| ▲ | nialv7 an hour ago | parent | prev | next [-] | | > The checkers con-leche and con-ron come with a formal proof, relative to set theory, that they cannot accept a false proof so it is correct as long as set theory is sound | |
| ▲ | dist-epoch 27 minutes ago | parent | prev [-] | | It's a web of different checkers proving each-other correct, and by implication this proof. But there are still loopholes, each checker has a set of assumptions. For example one of them is proven correct, assuming x86 assembly works as specified - its assembly language implementation is proven correct. So you can be 99.9999% certain it's correct, but one could always nitpick "technically not all loopholes are plugged at the same time". |
|
|
| ▲ | Aardwolf an hour ago | parent | prev | next [-] |
| A layman (or university graduate level) explanation/understanding (as opposed to 250k pages of proof) would ve nice |
| |
| ▲ | ion_trapper 25 minutes ago | parent | next [-] | | You were never getting anything like this even if it were a human proof. Where is the layman understanding of the Poincare theorem? The average modern math proof is way too advanced even for the average university graduate to understand. And here we’re talking about possibly the most complicated problem in all of math. It’d probably take you a month to wrap your head around a single lemma. | | |
| ▲ | Zenbit_UX 6 minutes ago | parent [-] | | > And here we’re talking about possibly the most complicated problem in all of math. This is like watching Free Solo over the weekend and telling all your friends at work that Alex Honnold is the world’s best climber. It’s only true to your surface level understanding on the topic. The GRH problem is not that complex, and certainly not the most complex. In fact we’ve been assuming it’s true for years because of the high likelihood that it would be proven in the future. It is however, much like Alex, the most famous within the domain. Thus anyone watching Numberphile or Veritassium on YouTube will have heard of it and wax poetic on message boards about its epic status. |
| |
| ▲ | zug_zug 43 minutes ago | parent | prev [-] | | The lean crew feel the same way and are working on it out of their own curiosity, there's a lot of work done already. They aren't necessarily going out of there way to demonstrate it to general public, but here's one out of at least a dozen attempts to start in that direction https://deeptheory-labs.github.io/GRH/blueprints/verso-origi.... |
|
|
| ▲ | hodgehog11 an hour ago | parent | prev | next [-] |
| It is almost certainly proven, but is not "proven". For the latter, it needs to be understood, with a reasonably in-depth human language explanation of how and why the proof works, and ideally some general picture to give an idea of how it will extend to all the other fields that RH is connected to. |
| |
| ▲ | euroderf an hour ago | parent | next [-] | | Years ago there was that computer-assisted proof of the Four Color Theorem. Did anyone ever manage to grok it, in its entirety, in their heads ? | | |
| ▲ | wk_end 37 minutes ago | parent | next [-] | | That's different though, isn't it? IIUC the issue wth the Four Colour Theorem is that they could only reduce it to a huge number of different cases (~2000 originally). But I think that reduction is grokable, and each case is relatively trivial. The (an) issue with some of these AI proofs is that no one understands them at all. | |
| ▲ | jerf 42 minutes ago | parent | prev [-] | | I checked that a couple of weeks ago. It has been improved since the original proof but there is still no proof that one would consider an insightful, human-comprehensible proof. There's still just a lot of case-grinding at its core. Fewer cases than the original but still way too many to be anything intuitive. |
| |
| ▲ | trio8453 14 minutes ago | parent | prev | next [-] | | > It is almost certainly proven, but is not "proven". For the latter, it needs to be understood No, this is just mental gymnastics. It's proven, just not understood yet (naturally, with the complexity and size of the solution and the fact that it's been a day). | |
| ▲ | lostmsu 31 minutes ago | parent | prev [-] | | > human language explanation I've been long joking that I speak many languages, most of them programming languages. Why do you believe you need specifically "human" language explanation? Perhaps you want a simplified explanation. But does it have to be "human"? |
|
|
| ▲ | thomasahle an hour ago | parent | prev | next [-] |
| For some mathematicians it's only "proven" once it's peer reviewed and published in a respectable journal. |
| |
| ▲ | ranger_danger an hour ago | parent [-] | | And even then there will probably still be people that complain there's something wrong with it |
|
|
| ▲ | doctoboggan an hour ago | parent | prev | next [-] |
| Probably just time. The longer it stands with our challenge the more “proven” you can consider it. |
|
| ▲ | 25 minutes ago | parent | prev | next [-] |
| [deleted] |
|
| ▲ | maze-le an hour ago | parent | prev [-] |
| Not a mathematician, but P!=NP (?) |
| |
| ▲ | jvanderbot an hour ago | parent [-] | | No, not related I think. I think proving GRH subsequently proves decades of work that assumed it was true. Like proving p!=np. Disproving it would be more analogous to p=np. Lots of work would just collapse and whole new threads would open. |
|