1,320 karma · joined August 25, 2019
Of course in retrospect we can see that the syllogistic part of Aristotle's logic can be formalized (as can grammar), but it was viewed as part of language or philosophy. I get the impression that a lot of more traditional philosophers of logic hated the formal turn.
Leibniz anticipated the turn towards formalism, but he didn't publish any of it in his life and it wasn't rediscovered until the 20th century.
Formal proof only emerged early in the 20th century, and the standard became that in theory a proof should be formalizable to answer any skepticism, but the real goal in Euclid's time and ours has been to communicate why a theorem is true to your fellow humans. There were a few theorems that are only known via computer proof, like the Four Color Theorem, but this has always been regarded as disappointing or even controversial, and the fact that there hasn't been any conceptual breakthrough has meant that we didn't learn anything other than the sheer fact that the Four Color Theorem is true. Theorems that produce understanding, on the other hand, typically produce many new ideas that lead to more theorems.
The purpose of scholarship is understanding. This is just as true for science as it is for math. If AI produces a unified theory of fundamental physics, but it's just an opaque blob, physicists will find it just as unsatisfying.
Maybe this is a one-off, or maybe in a few weeks we'll figure out how to get AI to explain the proof in terms we can understand. Then math research will accelerate. But maybe it's not a one-off, and by this time next year we will have an oracle that just answers all of our questions, but in such a way that we don't even know what questions to ask anymore. Then AI will just mop up the existing and the subject will end.
It would also be a considerably more impressive achievement, because experts had mostly shifted to Navier-Stokes regularity being false, while as far as I know almost everybody thinks BSD is true. Hodge people seem less sure about.
If either conjecture is true and they prove it, that would be an even bigger success, since the techniques might unlock any number of other theorems.
I am not particularly skeptical of claims about AI, compared to the average here on HN, but that doesn't mean every random piece of hype is warranted. What they did is impressive, even though we now know the only reason they threw so much compute at the problem is that they heard a rumor that someone else was already close. Navier-Stokes is not a top 3 problem in mathematics, and it was the one that was thought closest to being solved.
I'm not sure what the top 3 problems are. You can make a case for the Riemann Hypothesis and P != NP, but I'm not sure what #3 would be. Maybe the Langlands program? (That one is not as precisely stated as the other two.)
It's true that there's an infinite possible set of axioms. It does seem that the types of axioms that have consequences that humans are interested in fall into simple families. For example, many seemingly unrelated questions are settled by assume the existence of very large sets (larger than can normally constructed in set theory).
In another direction, there's even a literature on what happens when you allow sets to contain themselves as members, like Aczel's Anti-Foundation Axiom. There's literatures on purely constructive versions of set theory, where everything has to be computable. Like I mentioned before (reverse mathematics), there's work on what happens when you adopt much weaker axiom sets, like second-order arithmetic but weak choice principles such as taking Kruskal's tree theorem as an axiom.
So while AI would accelerate this work, the existing body of work on alternate axioms is tremendous. A surprisingly large amount of it translates between systems, and there are precise tools to measure how weak or strong a system is, relative to its competitors.
Mathematicians have also gone in the opposite direction, and tried to work out what are the weakest foundations where different results hold. This is called "reverse mathematics".
An interesting next target would be formalizing the classification of finite simple groups. The original proof scattered over thousands of pages of journal articles, plus Aschbacher and Smith's 1300 page 2 volume monograph. It's so long it's hard to know if there are any gaps. Researchers have been working on a streamlined new proof, but it's already many volumes long.
Most of the Arthur "myth" is deliberately constructed fiction by specific authors, rather than folk myths.
There are different types of addition, though. A rank two addition would mean it looks like (x, y) + (x', y') = (x + x', y + y'). A rank three addition would mean it looks like (x, y, z) + (x', y', z') = (x + x', y + y', z + z'). Here they found the first example of an elliptic curve where the rank is 30.
For example, even if Claude could prove the statement "100% of the zeroes lie on the critical line", that's strictly weaker than the Riemann Hypothesis, so even the best possible version of this result would fall short. (It's an asymptotic result, so it just means the percentage of counterexamples to the Riemann hypothesis goes to zero as their magnitude gets large.)