you are viewing a single comment's thread
view the rest of the comments
[–] 3 points 2 hours ago

Because the proof as presented is a Lean program. Lean is a proof checking program, that means that this type of code runs only if the logic used is correct.

For example, you can write a proof of pythagora’s theorem and the code would run. But if you write a faulty proof (even if the final theorem is correct), the code doesn’t run.

About your second question, I agree with the sentiment, I will still answer the question unironically. Because if it’s in Lean it’s supposed to be reliable, and because we mathematicians are suckers for proofs, even obscure, poorly written stuff. We assume that a cool proof open the gate to new understanding of math.

  • source
  • parent