upvote
The Lean kernel should be easy to verify by hand. We can ask the same question with humans though. What if a result that was used to prove some other result turns out to be wrong just because whoever reviewed it neglected a small detail?
reply
What do you mean by it "should be easy"? It isn't easy at all; nested inductive types is the example that come to mind. Something like HOL is easy to check by hand as a prover kernel but Lean's type theory is definitely not.
reply
i guess what people are realizing is that, as great as these discoveries are, these errors have probably already happened numerous times in the past, and though they might get corrected, either way, it didn't really matter. academic math is as much about the aesthetic experience of doing math, maybe more so than anything else, as it is about the objectiveness of the discovery, which is what every mathematician has been saying, so it's not like small errors, provided they are unknown, matter.
reply
Still possible, but Lean ships with formally verified kernels as of a few weeks ago.
reply
formally verified by what?
reply
Lean. It isn't airtight, but it would have to be something very extreme or adversarial like Reflections on Trusting Trust.
reply
In principle you can run Lean with different kernels and so there would have to be a bug in all of them for the proof to be faulty I believe.
reply
That already happened multiple times, it’s a known worry
reply
Has there been a single case of a proof that was thought to be correct and later turned out to be incorrect due to a lean bug.
reply
No, not any serious proof
reply
Identically in all 4 independent checkers it ships with? Basically never.
reply
Right now.
reply