Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.08144

Navier-Stokes lost in translation: Why Lean verification of AI autoformalisation does not guarantee correct natural language proofs

Alexander Bastounis·Fabian Circelli·Anders C. Hansen
View original source ↗Read source document ↗Export metadata ↓

Abstract

Autoformalisation is increasingly used to verify mathematical texts, including those generated by AI, as in OpenAI's announced proof of blow-up of solutions to the Navier-Stokes equations. In this process, an AI system translates the text from a natural language (NL) into a formal language such as Lean. Once this translation is done, the argument expressed in the formal language can easily be mechanically verified. The purpose of this article is to demonstrate why this process may offer no confidence in the original NL argument, owing to the various difficulties in performing the translation semantically faithfully. In particular, we highlight that the problem of resolving ambiguities in mathematical NL text, which is necessary in order to provide semantically faithful translation, is arbitrarily high up in the Solvability Complexity Index (SCI) hierarchy/arithmetical hierarchy (the SCI $= \infty$). Hence, informally, providing semantically faithful AI autoformalisation is harder than any computational problem including the Halting problem (which has SCI $= 1$). To demonstrate the effect of this result we provide several examples of AI mistranslations of NL statements and proofs into Lean in practice, resulting in mismatches between NL proofs and their Lean `verifications'. These include OpenAI's announced Navier-Stokes proof. In particular, we show that the formalised Lean proof does not correspond to the NL proof of blow-up of solutions to the Navier-Stokes equations.

Explore related subjects

math.APcs.AImath.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Bastounis, Fabian Circelli, Anders C. Hansen. 2026-10-06. Navier-Stokes lost in translation: Why Lean verification of AI autoformalisation does not guarantee correct natural language proofs. https://arxiv.org/abs/2610.08144

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

When Self-Generated Gradients meet Cell Division: Waves and Speed Selection in a Minimal Model

We study a minimal Go-or-Grow model for cell propagation driven by self-generated nutrient gradients, coupling diffusion, division, and directed migration through a discontinuous switching mechanism. We establish local well-posedness, characterize all positive bounded traveling waves, and derive an explicit minimal wave speed. Using neutral fractions, we show that minimal waves undergo a pulled-to-pushed transition as the migratory bias increases, while nonminimal waves remain pulled. Finally, we obtain a weak speed-selection result that singles out the minimal wave speed as the only possible limiting propagation speed.

math.AP↗
arXiv2026

Entropic Chaos of Mixed Mean-Field Jump Processes

This paper studies a class of mixed mean-field jump processes on an abstract state space $Π$, together with their associated $N$-particle systems. The dynamics consist of the superposition of an independent Markovian component and a bounded mean-field jump interaction; in particular, piecewise deterministic Markov processes (PDMPs) with mean-field interactions are covered by this framework. A key feature of our setting is that the jump kernel may depend nonlinearly on the mean-field law, and correspondingly on the empirical measure at the particle level. Under a second-order bounded difference condition on the mean-field jump kernel, we establish entropic propagation of chaos as $N \to \infty$. In particular, we obtain an explicit qualitative bound on the relative entropy between the law of the $N$-particle system and the product measure induced by the mean-field limit. The proof relies on the second-order concentration inequality introduced in Götze and Sambale, 2020.

math.AP↗
arXiv2026

Local profiles of self-similar solutions of the planar stationary Navier--Stokes equations

In this paper, we revisit self-similar solutions of the two-dimensional stationary incompressible Navier-Stokes equations under scaling symmetries, also known as Jeffery-Hamel solutions. We investigate the local patterns of smooth Jeffery-Hamel solutions in a conical subdomain $Ω$ with vertex at the origin, without imposing any boundary conditions on $Ω$. For radial Jeffery-Hamel solutions, we obtain all the explicit local profiles in $Ω$ with arbitrary opening angles. In the non-radial case, we show that some Jeffery-Hamel solutions can be obtained via solving a Liénard equation, and we derive new explicit local profiles expressible in terms of Weierstrass elliptic functions.

math.AP↗