Remix.run Logo
▲ NoDodgeQuestion 5 hours ago

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

▲dgellow 4 hours ago | parent | next [-]

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

▲less_less 3 hours ago | parent [-]

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.

▲well_ackshually 5 hours ago | parent | prev [-]

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.