Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

CS layman folk here. How one is going to prove 250K page argument? Just single sign of hallucination can make it false, no?
 help



Its formalized in lean, which verifies each step. The steps themselves are relatively easy, and can be mechanically verified (think "A and A->B thus by modus ponens B").

Traditionally writing verified proofs is a hard undertaking, exactly because you need to write out a lot of steps "normal human" mathematics jump over, but with AI its easier.


> The steps themselves are relatively easy, and can be mechanically verified

They aren't


At what point do we start worrying that it's found a bug in Lean instead?

The Lean kernel should be easy to verify by hand. We can ask the same question with humans though. What if a result that was used to prove some other result turns out to be wrong just because whoever reviewed it neglected a small detail?

That already happened multiple times, it’s a known worry

Right now.

Still possible, but Lean ships with formally verified kernels as of a few weeks ago.

In principle you can run Lean with different kernels and so there would have to be a bug in all of them for the proof to be faulty I believe.

AI proof in lean, can verify by computer. Mistake can only be compiler bug or state problem wrong.

No, it can also be that the proof doesn’t actually prove the thing you think it does, and a lot of other variant of that issue. Lean doesn’t make it magically valid

Right, but to the extent that Lean is correct (both the semantics of the language and the implementation(s) used to check) and the proof checks with the expected axioms, then the length of the proof doesn't much matter since Lean has checked it.

You'd still have to check the theorem statement, which is not going to be nearly as easy as with FLT (Riemann uses analytic continuations etc) but it's much easier than checking a 250,000 page proof.


Mathematicians, famously known for being extremely precise in their specification of problems and absolute lack of errors writing down proofs.

It's always, always, always stating problem wrong.


Step 1 will be making a much shorter argument.

I think we're probably on the precipice of proofs that can't be made shorter and so can't be really understood by a single mathematician in their lifetime. Or maybe we'll have proofs not understandable by humans at all in the same way a cat can't understand the fundamental theorem of calculus.

It's going to be the age of the oracle.



Small errors in proofs can often be fixed easily. So it's not that the whole thing would be useless. Also, he has a Lean proof, which rules out these small errors.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: