upvote
Since I'm not terribly familiar with Lean, math folks are generally satisfied the provided proof encodes the RH correctly I presume?

edit: I need to learn to read, that's the first part of their statement.

The statement of the Riemann Hypothesis is correct. This statement is part of Mathlib: RiemannHypothesis and has been carefully vetted by experts in Lean and number theory.

reply
The statement of RH that it proves is taken directly from Mathlib, so it's extremely well-vetted and longstanding (from my understanding).
reply
how unreasonable is it to think that during the ai assited claude bruteforce process, it bruteforced also the kernel and built on a randomly found logical inconsistency
reply
This is covered in point 4 of the linked post. The exported raw proof has been checked by several different kernels, not just one.
reply
unreasonable
reply
very, due to the precautions explained in the link. For example, they used multiple kernels with different implementations etc.
reply
As unreasonable as assuming all human's peer reviewed proofs to be incorrect due to an error collectively missed by all humans.
reply
"This year" hints at them all being created this year. Does that mean they have all been created via LLM from the same corpus?
reply
Even exploiting bugs would be interesting and constructive, as it would reveal some things to fix.
reply
Well yeah, if we can find the bug(s). The big worry is that we might overlook the bug and go on our merry way assuming the claimed results are true when they're not. (I don't see that happening in the case of the Riemann hypothesis, but the same worry exists for all proofs that exist only in the form of Lean code, such as the massive dump from OpenAI.)
reply
It's math. Presumably if it's wrong after all, sooner or later it'll be found out because stuff built on top of this result will not add up.
reply
is it still possible absent a flaw in the hardware model for con-leche?
reply
The underlying type theory could theoretically turn out to be unsound.
reply
Which is perhaps not such a far-fetched possibility?

While I have not studied this topic enough to really understand _how_, but I've been told that type systems laid out in frequently cited papers by the likes of Girard and Martin-Löf were found to be unsound more than a decade after publication. These issues were then "patched", so to speak.

Can anyone better versed in type theory explain how likely that is for the type system of Lean?

reply
Con leche has been proved to be consistent if zfc is, so if it turns out to be inconsistent the entire foundation of modern day math turns out to be broken
reply