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?
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.
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.
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.
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.
> 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.
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.
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.
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.
At this point, I have more confidence in this proof than much of the published mathematical literature. RH has fallen.
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.
so it is correct as long as set theory is sound
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".
> 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.
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.
P=NP should fall next week to Grok and Elon then I suppose? What an exciting time for you.
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".
Did anyone ever manage to grok it, in its entirety, in their heads ?
The (an) issue with some of these AI proofs is that no one understands them at all.
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).
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"?
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.