logoalt Hacker News

siddthesquid • today at 3:18 PM • 5 replies • view on HN

Not a mathematician. But I'm wondering if there is nuance with defining a valid lean proof as definitive if the underlying mathematical theory behind lean itself isn't necessarily sound.

EDIT: Here is my honest prediction - there's a more foundational mathematical framework, fully decidable and complete and consistent, that can interpret any well-formed mathematical question and deterministically transform it into the solution. The proofs of the most difficult unsolved problems right now would fit onto a page. There's an inconsistency (obviously unproven right now) specifically with our treatment of infinity and self-reference.


Replies

gpm • today at 3:33 PM

From the article

> The checkers con-leche and con-ron come with a formal proof, relative to set theory, that they cannot accept a false proof, thus addressing concerns that Lean’s logic itself might have flaws that the proof could exploit.

All of modern math - outside logicians whose entire job is to study set theory and its alternatives - is based on set theory. If you're prepared to accept normal mathematical proofs you shouldn't be rejecting this proof on the basis that you're not confident in leans underlying mathematical theory.

Of course incompleteness means we can never prove that set theory itself is correct (consistent). But that's not something mathematicians worry about on a day to day basis. Proving it inconsistent would be a order of magnitudes larger result than the riemann hypothesis. Generally everyone believes it is consistent despite not being able to prove it.

➕ show 1 reply
hodgehog11 • today at 3:21 PM

It is impossible for it to be fully "complete" (one of those halting problem proofs), but I've seen that the community has checked there is no meaningful metaprogramming here. Rather than checking whether it is right, the community tried to ensure that it could not have done something to cheat, and indeed, there were no examples of this.

At this point, I have more confidence in this proof than much of the published mathematical literature. RH has fallen.

➕ show 1 reply
bananaflag • today at 3:31 PM

Gödel showed that you can't prove consistency of ZFC, Lean etc except in another system which you also can't trust. See e.g. Gentzen's proof for PA.

nialv7 • today at 3:34 PM

> The checkers con-leche and con-ron come with a formal proof, relative to set theory, that they cannot accept a false proof

so it is correct as long as set theory is sound

dist-epoch • today at 3:52 PM

It's a web of different checkers proving each-other correct, and by implication this proof.

But there are still loopholes, each checker has a set of assumptions. For example one of them is proven correct, assuming x86 assembly works as specified - its assembly language implementation is proven correct.

So you can be 99.9999% certain it's correct, but one could always nitpick "technically not all loopholes are plugged at the same time".

➕ show 1 reply