upvote
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.
reply
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?

reply
It’s the nature of mathematical ideas and methods that they are reducible to their component parts, so if you really want to, you can nearly always claim that something is just recombining existing knowledge. Motivated reasoning, from people dead-set on embellishing or downplaying a result, is hard to avoid here, so all you can really do is make an earnest and sincere judgment call based on the fine details of the mathematics.

For example, it is my opinion that the Jacobian conjecture counterexample was, in retrospect, easy and classical and hiding in plain sight, and that it’s a bit embarrassing we didn't find it decades ago. (I wrote about the construction on my blog btw!) In contrast, the Unit Distance Conjecture counterexample seemed to me to use a stroke of genius by applying techniques from class field theory to approach what seemed like a problem in discrete geometry and combinatorics. It’s a neat, if annoying, feature of math that once we find a long-sought solution to an open problem, we reserve the right to retrospectively change our mind about the value of the problem if the solution turns out too easy or uninteresting. We just have to try to be fair and honest about it (the word “just” is doing some heavy lifting in this sentence).

Anyway, I don’t think “brute force recombination” is likely to be meaningfully the case here with GRH, though we won’t know for sure until the proof has been simplified and distilled. Alpöge’s sketch in his announcement yesterday included (IIRC) connections to the function field setting and new ideas about Fourier analysis.

reply
Reading Alpöge’s post from yesterday, the proof seems to be full of fascinating new insights.
reply
alpoge's post is also unhinged in other ways
reply
It's a press release more than anything else, so consider it through that lens.
reply
What are some of those ways, for those of us who aren't equipped to spot them on our own?
reply
It's way too early to answer those questions
reply
As soon as you define the axioms, every mathematical consequence is a matter of recombining them.
reply
That is too reductionist in my view. Like saying all software is just opcode instructions. Technically true but still we find it interesting when new sort, search or crypto algoritms are invented. If someone says "here is a blob of code AI invented and it is a fast search but we have no insight into how it works" that would be a bit dissappointing.
reply
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.
reply
This sounds like something ancient Greeks believed. Unfortunately, they were very wrong.

Math expands fractally, so there always will be some new branch/idea one can pursue. There may be a limit of things with any semblance of practical application, but mathematicians in general are not very concerned about this.

reply
Are you a mathematician yourself? I’ve heard a lot of them talk about this and none have suggested we are anywhere near that point, or even certainty that such a proposition is even coherent.
reply
Math has Goedel incompleteness theorem which seems to state that formal Lean proofs cannot be the ultimate solution to all Math.
reply
One of Alpöge's key innovations is finding a way to reproduce some of the geometric methods of function fields over the ordinary integers. This creates a "wormhole" to import powerful techniques from algebraic geometry into number theory, so there are likely many exciting advances in the cards.
reply
I would hesitate to call it "Alopge's innovations". Nothing against him of course.
reply
Professional mathematician here. I consider RH proved. (The admirable work of the Lean community over the last 24 hours leaves little room for reasonable doubt.) But I’m salivating at the prospect of learning why RH is true!
reply
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.
reply
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.

reply
It's lke asking God also a few hints. You probably can not understall all of them, but can create a group to recite and study them and after a few months/years/decades reach enlighment.
reply
Experts say it's true and you believe them. Is that so different from asking God?
reply
The point is that Lean evaluation of a proof we don't understand gives an oracular answer. The statement is true, yes or no? It looks like yes, but it's going to be an enormous amount of work to understand _why_ the Riemann Hypothesis is true.
reply
GRH was assumed to be true already anyway, the value is in the why for what other doors those methods might open.
reply
It's different because we are both humans
reply
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.

reply
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.

reply
> All of modern math - outside logicians whose entire job is to study set theory and its alternatives - is based on set theory.

That's only true in a technical sense:

You can base all of math on set theory, but you could also base all of math on Turing machines, or on integers, or a variety of other pretty much equivalent foundations.

reply
Peano Arithmetic has lesser proof-theoretic strength than ZF. Iirc, if you remove the axiom of infinity from ZF, and then maybe add in its negation or something like that (I don’t remember the details), you get something with the same proof theoretic strength as PA (or a mild strengthening of it?).

In particular, the hereditarily finite sets are in correspondence with the natural numbers.

There’s a fair bit of mathematics that relies on the axiom of infinity. Uh. And a lot also uses the axiom of choice (or something equivalent), though ZFC doesn’t have a greater consistency strength than ZF (both can prove that if either is consistent, then both are).

I think it is fair to say that one’s choice of foundations does matter at least a little bit, though typically not all that much.

That’s not to say that it is always necessary to state what foundations one is using. One can understand a work to be done in any foundations in which it works. Though sometimes it is important to specify.

reply
That's sort of the argument for why we have so much faith in set theory though, and things provable under it. It's not a system with some special powers that let us prove more things, it's a system that only lets us prove things that are intuitively true under "any" proof system (not actually any of course - but as you say a variety of equivalent foundations).

Reducing the correctness of the lean code here to set theory is then also reducing it to everything you can reduce the correctness of set theory to.

reply
[flagged]
reply
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.

reply
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.
reply
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.

reply
Gödel says that undecidable statements are out there. We now know that the Riemann hypothesis is not one of them.
reply
deleted
reply
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.
reply
> 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

reply
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".

reply
Well, you can also run lean on ARM and Risc-V etc. So you are not solely reliant on x86.
reply
I was talking about this. This assembly code implementation of a lean-compatible checker is formally verified to be correct. The x86/ARM/Risc-V version of lean is not.

> con-agua is con-leche reimplemented at the level of x86-64 assembly: a close clone of con-ron's checker, written in a small first-order language, compiled by a verified compiler, and shipped as one committed assembler file together with a C harness of about two hundred lines that reads the input and calls it.

> The code the CPU executes is the code the theorem is about, so neither a compiler nor a language runtime is trusted; what is trusted is Kraken's x86 semantics, the assembler and loader, and the C harness.

https://arena.lean-lang.org/checker/con-agua/

reply
A layman (or university graduate level) explanation/understanding (as opposed to 250k pages of proof) would ve nice
reply
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.
reply
> 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.

reply
The complexity of a problem has nothing to do with the uncertainty of it being true or false. “GRH is not that complex” is just an absurd take.
reply
My claim is one of relative complexity. Your claim was it was “possibly the most complicated problem in all of math”.

P=NP should fall next week to Grok and Elon then I suppose? What an exciting time for you.

reply
> The GRH problem is not that complex

That's an interesting take, but as a complete noob I'd like to know how qualified you are to make these statements. Are you a mathematician?

I mean, on one hand we have people like Terrence Tao (among others) saying it is extremely difficult, as well as stubborn resistance to decades of effort backed by a million dollar prize and eternal fame. And there's you saying it's not that complex, and "the high likelihood that it would be proven in the future".

reply
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....
reply
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.
reply
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 ?

reply
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.

reply
How is that different? Isn't each application of an inference rule also trivial?
reply
It's different because there's humans who could look at any one of those 2000 cases and understand it or do the proof themselves, I guess. The proof is understood up and down the abstraction hierarchy.
reply
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.
reply
> 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).

reply
> 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"?

reply
For some mathematicians it's only "proven" once it's peer reviewed and published in a respectable journal.
reply
Peer reviewed abd published is much lower bar than having formalized and lean-verified proof. During my PhD study several times i found invalid proofs in published papers.
reply
And even then there will probably still be people that complain there's something wrong with it
reply
Probably just time. The longer it stands with our challenge the more “proven” you can consider it.
reply
many of the people working with and maintaining lean are professional mathematicians
reply
Not a mathematician, but P!=NP (?)
reply
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.

reply
deleted
reply