> 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.
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.
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.
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.
At this point, I have more confidence in this proof than much of the published mathematical literature. RH has fallen.
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.
so it is correct as long as set theory is sound
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".
> 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.