| ▲ | sonicrocketman 5 hours ago |
| Tao's Rule of Thumb (which applies very well to software): > My own suggested rule of thumb: if the authors cannot convincingly demonstrate that they are able to give a clear, expert-level talk on their results, one that is correct and properly attributed, then the result should not be published. A proof that no human can properly explain should be viewed as incomplete, even if it has been formally verified. |
|
| ▲ | kriro 2 hours ago | parent | next [-] |
| The counterpoint to this comes from chess. High level engines "prove" certain lines correct (not in the mathematical sense) but those "engine lines" are really hard to explain to humans, even by GMs. They can sort of explain that something is a good line but not why. Engines crush GMs and are considered ground truth even if noone really understands what is happening. Would it be a nightmare if math was the same, not sure. Especially for counterexamples LLM solutions seem fine. They stop humans from wasting time on pointless things. For proofs it gets more hairy but I think if it is formally verified a proof is a proof. Attribution is a problem (should the person who wrangled the answer out of an LLM get the credit, I guess so). I think these are non-trivial epistemology and science theory problems. |
| |
| ▲ | RandomLensman 4 minutes ago | parent | next [-] | | If the proof is formally verified but impossible to understand how would anyone be able to be sure the formal verification is correct? Complex software is bound to have bugs, no? | |
| ▲ | GPerson an hour ago | parent | prev | next [-] | | I don’t think it’s pointless to spend time trying to prove a conjecture which is ultimately false if along the way you figure out a bunch of different true variations on the conjecture, which is how mathematics actually works. This is something I’m a bit worried about with LLMs since it gets you to the end too fast. | |
| ▲ | jhrmnn an hour ago | parent | prev [-] | | I can almost see two branches of mathematics developing. One which is human-understandable, the other formally verified. I assume the latter is a strict superset of the former? | | |
| ▲ | metahuman_crumb an hour ago | parent | next [-] | | I suggest "Catching crumbs from the table" by Ted Chiang. Very short piece published in Nature (2000) and well worth a read. Depicts a scenario where modified humans produce science beyond ordinary scientists' comprehension. | |
| ▲ | Jblx2 41 minutes ago | parent | prev [-] | | Mochizuki enters the chat | | |
|
|
|
| ▲ | nilkn an hour ago | parent | prev | next [-] |
| I believe this rule of thumb will come to fail. The combination of superhuman mathematical reasoning and synthesis in upcoming AI models plus the rapid build-out of scalable formal verification infrastructure means this exponential in math is going to take off quite explosively, and we've barely seen anything yet. Mathematics is going to decisively move beyond human ability fairly soon (within our lifetimes, if not much more abruptly). It seems abundantly clear to me that much of the work will only be immediately accessible to AI, and rather than trying to explain all of it back to humans we will rather focus on explaining the portions that humans would benefit disproportionately from understanding. |
| |
| ▲ | skybrian an hour ago | parent | next [-] | | Maybe that will be true when it's math with practical applications, but most theoretical math isn't like that. If it's not practical and it's not for mathematians to understand, what good is it? | | |
| ▲ | esafak 9 minutes ago | parent [-] | | One day it might be for the AI's pleasure, the same way it has heretofore been for ours. Or if you prefer, as a byproduct of its programming to acquire knowledge. |
| |
| ▲ | fultonn 44 minutes ago | parent | prev [-] | | People say similar things about automation of software engineering. Different, but similar. I'm deeply suspicious. I do not yet have a concise statement for why, but a lot of literature on the sociology of knowledge work sort of points at my thoughts. Section 5 of the Thurston article cited by Tao touches the elephant. Raduchel's article on the economics of software [2] also touches it. I've tried to put words to this for a few years. I think I'm just going to start writing versions of it as see if that helps me shape the thought into something more concise. So, in the spirit of this article's style, here are some postulates: 1. There is a sociological process happening in the production function during knowledge work. 2. That production function and the associated sociological process spans years or even decades, and must outlast many of the artifacts that are produced during the early years of the function. 3. You cannot get the right lines of code or the right theorems proved without running that sociological process alongside the artifact production process. 4. It is impossible to completely separate the sociological process from the artifact construction process. If you just iterate on artifacts then too much of the required hidden state is lost to make progress in the right direction. This is true even if you include distilled artifacts capturing pieces of the sociological process (eg meeting notes, documentation, commit logs, prompts). 5. So you need that sociological process, or something like it, to still happen. 6. For a lot of knowledge work that process plays out in extremely high-fidelity social interactions [3] that we have not yet captured in the datasets that would be required to reproduce those dynamics. 7. And even if we do collect that data, our current architectures and training algorithms and hardware would be useless given the size of the datasets. So: the technology today gives us the ability to iterate on the production of artifacts. But it does not sufficiently simulate the social process which gives rise to the Right artifacts. This isn't exactly what I actually think, but it's a version of the thing that I intuit when I watch heavy use of AI in both software projects and formalization projects. And simulating that process feels way harder than people are currently assuming. [1] https://arxiv.org/pdf/math/9404236 Section 5. [2] https://www.nationalacademies.org/read/11587/chapter/11 pp 166-168. [3] there is a reason we still gather in-person around white boards, and why doing so is more crucial for some types of work than others. |
|
|
| ▲ | lacker an hour ago | parent | prev | next [-] |
| I don't think the mathematicians are going to be able to make that work, because journals are already struggling to keep up with their review load, and AI seems like it will make that harder. So a solution that involves "journals will do a lot more effort to review each paper" doesn't seem practical. It would work better as a bar for hiring, rather than as a bar for publishing. |
| |
| ▲ | Jblx2 28 minutes ago | parent [-] | | It will be interesting to see the evolution of journals in the next ten years for sure. Have they outlived their usefulness? Maybe everyone will just upload papers to arXiv, along with a copy of the formal proof. |
|
|
| ▲ | czgov 4 hours ago | parent | prev | next [-] |
| I wonder what his views on the 4 color problem are. One can explain it as the computer checked a bunch of cases and all maps reduce to one of these cases. It doesn’t take an expert to state this. Properly explain is an enormous grey area. Soon, I think, there will be proofs of results that are verified in Lean that are so long that no one will be able to “properly explain”. I don’t think they should be discarded. Resolution of singularities is a famous theorem of Hironaka. Abhyankar claimed that no one truly understood the proof of the theorem. He said that he and Zariski couldn’t get through the paper with a full understanding. But everyone accepts this theorem as being correct. |
| |
| ▲ | akk0 2 hours ago | parent | next [-] | | For an exhaustive search, if you can explain to me:
- how to exhaustively list the cases that need to be checked, and why that method is exhaustive
- how to check each case, and why that works
and then conclude with "we've had a computer do this exhaustive search, and the result came up as X", for me that satisfies completely understanding the proof. | |
| ▲ | aleph_minus_one 2 hours ago | parent | prev | next [-] | | > I wonder what his views on the 4 color problem are. One can explain it as the computer checked a bunch of cases and all maps reduce to one of these cases. Just burn lots of tokens on the frontier model of your choice to let the AI find a high-level argument why the four color theorem holds. :-) -- Seriously: since there exist quite a lot of readers on HN who are both hardcore into AI and mathematical problems: This is a challenge for you. I am looking forward to seeing an announcement of a novel high-level argument why the four color theorem holds on the first page of HN in at most a month. :-D | |
| ▲ | ChadNauseam 4 hours ago | parent | prev | next [-] | | > One can explain it as the computer checked a bunch of cases and all maps reduce to one of these cases. It doesn’t take an expert to state this. Hmm, doesn't it take an expert to explain why those cases are exhaustive, and why the code that checked them is correct? Tangentially, I'm not a mathematician but I wonder if one "opaque" proof that is too complicated for anyone to understand, but that we know is correct via formal verification, might end up being built on with "transparent" human-understandable proofs. For example, it's my understanding that there are many conjectures that have been proven true conditional on the riemann hypothesis being true. In that case, an opaque proof of the riemann hypothesis would enable those conjectures to be known and built upon | | |
| ▲ | czgov 3 hours ago | parent [-] | | That will certainly happen. Humans will extend AI generated results. But what will also happen is that AI can “think” much longer than a human can and can have a vastly greater base “knowledge” than humans can have and so there will be a bewildering amount of new results. Humans may not be able to keep up. To your first point. There a large number of cases that maps can be reduced to. Very few people have checked these reductions themselves. In 50 years there will be no human alive that will have checked the reductions by hand. Do we then discard the theorem? More importantly, do we trust the people that claim to have checked all the reductions? There are hundreds of cases. I trust a computer verification much more than I’d trust human verification. Humans will likely make mistakes due to the tedium. And some will claim understanding of all cases but be wrong in their understanding in some of the cases. |
| |
| ▲ | intuitionist 3 hours ago | parent | prev | next [-] | | Nowadays the proof of resolution of singularities in characteristic zero is considered something you can teach in an intro algebraic geometry course, though. The concepts have been absorbed and are now much better understood. 4CT is very different because so much of it is exhaustive case analysis; you can understand the high-level ideas of the proof as a bright undergraduate, but you still can’t check the cases by hand | |
| ▲ | 4 hours ago | parent | prev [-] | | [deleted] |
|
|
| ▲ | pfdietz 3 hours ago | parent | prev | next [-] |
| The problem with that rule of thumb is that unless there's some status/reward for completing the result, it won't happen. People will just put up the formally verified result and call it a day, and there's no incentive for them or anyone else to clean things up. We'll end up with incomprehensible math because comprehensibility isn't rewarded. No one is going to get a Fields Medal, or tenure, for digesting someone else's results. |
| |
| ▲ | BeetleB an hour ago | parent | next [-] | | > People will just put up the formally verified result and call it a day, and there's no incentive for them or anyone else to clean things up. The incentive will be to be able to publish in a top tier journal. I suspect what Tao is advocating for is having journals reject such manuscripts. > No one is going to get a Fields Medal, or tenure, for digesting someone else's results. I'm sure no one gets a Field's Medal if others can't digest their results. | |
| ▲ | cubefox an hour ago | parent | prev [-] | | > The problem with that rule of thumb is that unless there's some status/reward for completing the result, it won't happen. He says it shouldn't be able to published if they can't explain it. Publishing it is the reward. | | |
| ▲ | pfdietz 17 minutes ago | parent [-] | | The thing is, the cost of creating these results, and the expertise needed, is being greatly reduced. So it's possible for people who wouldn't actually care about the results to spoil them by just putting out a formalized proof (for example, to Tao's Palomar site). These people wouldn't care about the prestige; they aren't on a career track where that would matter. |
|
|
|
| ▲ | _doctor_love 24 minutes ago | parent | prev | next [-] |
| I saw an analogous argument posted on LinkedIn the other day from one of the opencode guys: the job of a programmer is still to be able to answer questions - from memory - about how the system works and why. |
|
| ▲ | tossandthrow 2 hours ago | parent | prev | next [-] |
| I think any idea that is contingent on a human being in the loop, solely to the property of being a human is most practically doomed to fail, but is inherently anti scientific. Science,at its core, does not care about the credentials or institutions. It cares about the results and to what extend they can be falsified. This feel a bit like "we know all about physics, we can only get more precise" - moment |
|
| ▲ | mohamedkoubaa 2 hours ago | parent | prev [-] |
| Ive wondered whether a possible outcome of LLM slop is a retvrn to oral wisdom traditions. Ironically that's the most anthropological form of understanding and pedagogy. |