upvote
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.

reply
> All of modern math - outside logicians whose entire job is to study set theory and its alternatives - is based on set theory.

That's only true in a technical sense:

You can base all of math on set theory, but you could also base all of math on Turing machines, or on integers, or a variety of other pretty much equivalent foundations.

reply
Peano Arithmetic has lesser proof-theoretic strength than ZF. Iirc, if you remove the axiom of infinity from ZF, and then maybe add in its negation or something like that (I don’t remember the details), you get something with the same proof theoretic strength as PA (or a mild strengthening of it?).

In particular, the hereditarily finite sets are in correspondence with the natural numbers.

There’s a fair bit of mathematics that relies on the axiom of infinity. Uh. And a lot also uses the axiom of choice (or something equivalent), though ZFC doesn’t have a greater consistency strength than ZF (both can prove that if either is consistent, then both are).

I think it is fair to say that one’s choice of foundations does matter at least a little bit, though typically not all that much.

That’s not to say that it is always necessary to state what foundations one is using. One can understand a work to be done in any foundations in which it works. Though sometimes it is important to specify.

reply
That's sort of the argument for why we have so much faith in set theory though, and things provable under it. It's not a system with some special powers that let us prove more things, it's a system that only lets us prove things that are intuitively true under "any" proof system (not actually any of course - but as you say a variety of equivalent foundations).

Reducing the correctness of the lean code here to set theory is then also reducing it to everything you can reduce the correctness of set theory to.

reply
[flagged]
reply
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.

reply
I guess what I am wondering is if the mathematical community would say 0 chance or greater than 0 chance that we're mistaken in accepting things like halting problem, cantors diagonal argument, and godels incompleteness theorem as true. Sometimes it feels like they all point to same fundamental inconsistency with how we model infinity and self reference.
reply
They are conclusions that follow naturally from axioms that most of the community accept are true. The consequence of these results is that one cannot truly construct something that can completely verify everything, but we can get something that can verify almost everything, and if we know what pathologies look like, we can rule them out.

I do probability theory, so everything is just varying degrees of confidence in my view. Right now, this statement says that your confidence in RH should be extremely high.

reply
Gödel says that undecidable statements are out there. We now know that the Riemann hypothesis is not one of them.
reply
deleted
reply
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.
reply
> 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

reply
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".

reply
Well, you can also run lean on ARM and Risc-V etc. So you are not solely reliant on x86.
reply
I was talking about this. This assembly code implementation of a lean-compatible checker is formally verified to be correct. The x86/ARM/Risc-V version of lean is not.

> con-agua is con-leche reimplemented at the level of x86-64 assembly: a close clone of con-ron's checker, written in a small first-order language, compiled by a verified compiler, and shipped as one committed assembler file together with a C harness of about two hundred lines that reads the input and calls it.

> The code the CPU executes is the code the theorem is about, so neither a compiler nor a language runtime is trusted; what is trusted is Kraken's x86 semantics, the assembler and loader, and the C harness.

https://arena.lean-lang.org/checker/con-agua/

reply