Study: Lean Verification of AI-Formalized Proofs Doesn't Guarantee the Original Proof Is Correct
The paper argues that autoformalisation—translating natural-language math proofs into formal languages like Lean for mechanical verification—cannot reliably confirm the original argument is correct, because resolving ambiguities in mathematical natural language is provably harder than any computable problem (the authors place it arbitrarily high in the Solvability Complexity Index/arithmetical hierarchy, i.e., SCI = ∞, exceeding even the Halting problem's SCI = 1). They back this with concrete examples of AI mistranslation, including OpenAI's publicized Navier-Stokes blow-up proof, where they claim the Lean-verified formalization does not actually match the natural-language proof it was supposed to encode. The authors frame this as a general warning against trusting Lean verification as a proxy for the validity of AI-generated mathematical reasoning in prose.
Discussion: 3 tweets from 3 authors · @ValerioCapraro, @gammaofzeta, @gro_tsen