Study: Lean Verification of OpenAI's Navier-Stokes Proof Doesn't Match the Written Argument
The paper argues that AI-driven autoformalisation—translating natural-language math proofs into formal languages like Lean for mechanical verification—cannot in general be trusted to faithfully capture the original argument. The authors claim the task of resolving ambiguity in mathematical natural language is arbitrarily hard within the arithmetical hierarchy (harder than the Halting problem), and illustrate this with concrete examples, including OpenAI's announced Lean-verified proof of blow-up for Navier-Stokes solutions, where they show the formalized Lean statement does not actually correspond to the natural-language proof. The broader claim is that a Lean verification passing is not sufficient evidence that the informal proof it's supposedly checking is correct. Commentary on Twitter focused heavily on the Navier-Stokes case as a concrete, high-profile embarrassment for AI-assisted formal verification claims, with some noting the irony that another AI model reportedly fixed the mismatch. Other users raised skeptical/cynical asides about how such subtle mistranslations could go undetected in large formalized codebases, questioning the practical trustworthiness of AI autoformalisation pipelines at scale.
Discussion: 6 tweets from 6 authors · @Quasilocal, @pmddomingos, @mike_mates, @semiDL, @LogicPractice +1