Post

“…and the proof is checked in Lean”

A Lean proof is meaningful evidence, but compiling code alone does not establish that it proves the intended theorem. The Xena Project outlines checks especially relevant to AI-generated formalizations: inspect the statement and definitions, compile safely, check the proved statement and axioms with lake comparator, and use independent kernels for additional assurance.

The author notes that a verified formal proof also does not automatically validate a corresponding prose proof. HN commenters extend the same concern to software verification: the model and specification must actually correspond to the code and intended behavior. Others question overly broad claims that a verified kernel is entirely bug-free.