But with a problem as difficult and fundamental as the Riemann Hypothesis the thought has always been that in the process of solving it we'd be likely to develop or discover something that did have real world utility. At least this is often what happened in the past, the obvious example here being Newton developing calculus, a field of mathematics which can be applied to other problems beyond the narrow set of problems he was trying to solve.
What I find interesting about this, if the claim holds up, is whether this will assumption will remain true, or if the value of these AI proofs is going to significantly lower than those of human discoveries in the past.
Maybe a good analogy here is to think about how all of tools we humans have created has been ultimately in the pursuit of solving some problem. For the developers here, consider this – if ChatGPT had existed before React, would React ever have been developed? I mean, if an LLM can brute force the same result with just vanilla JS the need to develop frameworks and libraries to solve what was once difficult for a human to solve drops.
I'll note that I'm playing devils advocate here as I think AIs would probably build something better than React had it not existed, but it's something to think about at least. I suspect there's a higher probability than some here are assigning that this proof ultimately ends up have relatively little utility.
In fact, there was a whole literature of papers proving that if the GRH was false in one particular way (the existence of Landau-Siegel zeroes) many theorems followed from it. For example, if there's a Landau-Siegal zero, the twin primes conjecture is true.
Are you claiming that there wasn't a significant majority of mathematicians who believed it true? That's all I'm saying. I can only assume we agree.
To expand on what I said though, if it is proven that P != NP then nothing really changes as that assumption is in line with everything we understand about computational complexity theory. The proof would really just suggest there's probably nothing that surprising to be found that we don't know.
If P = NP however that is far more likely to suggest we're missing something fundamental which could radical consequences for more practical fields like comp-sci. Similar can be said of GRH. Everything we know points in the direction of GRH being true, and while it may be interesting to prove these things, its much less likely to lead to some surprising and impactful downstream discoveries.
But that doesn't change the value of proving it. Most graph theorists probably thought the 4-color theorem was true, but it was still a big deal when a computer proof showed it. Most people thought the Kepler conjecture was true, but it was still a big deal when Hales reduced it to a big minimization problem that he solved.
On the flip side, everybody thought the Hauptvermutung was true, and probably subconsciously used it. But it's not.