Non-uniqueness of smooth solutions to the Navier-Stokes equations on torus $\TTT^2$
Changxing Miao, Yao Nie, Weikui Ye
TL;DR
The paper resolves the two-dimensional local well-posedness problem for incompressible Navier–Stokes on $\mathbb{T}^2$ in the largest known critical space ${\rm BMO}^{-1}$ by constructing two distinct global smooth solutions with the same initial data. It develops a heat-dominated Fourier mode flow based on steady 2D Euler flows and executes a careful inductive scheme that decomposes each iterates into a primary oscillatory part, a secondary inverse-cascade part, and a small nonlinear perturbation, with sharp Besov-type control. Through a detailed analysis of the interaction terms and error estimates, the authors prove convergence of alternating subsequences to two different limits, $u^{\mathrm{even}}$ and $u^{\mathrm{odd}}$, thereby demonstrating non-uniqueness in ${\rm BMO}^{-1}$. The results build on and extend the framework used in the 3D setting, adapting it to 2D with novel geometric and frequency-localized techniques, and show that non-uniqueness persists in the plane as a fundamental feature of the critical-scale Navier–Stokes dynamics.
Abstract
The local well-posedness theory for the incompressible Navier-Stokes equations in $\BMO^{-1}$ has attracted considerable attention over the past two decades. In a recent breakthrough, Coiculescu and Palasek (Invent. Math., 2025) settled the three-dimensional case by demonstrating the existence of two distinct global solutions, both smooth for $t>0$, evolving from a common initial datum in ${\rm BMO}^{-1}(\mathbb{T}^3)$. However, the two-dimensional case remains open. In this paper, we solve the two-dimensional problem. Unlike its three-dimensional counterpart, the two-dimensional setting presents additional difficulties stemming from the geometric intersections of two-dimensional Mikado flows. To overcome these difficulties, we develop a heat-dominated Fourier mode flow built upon steady two-dimensional Euler flows, and present the proof using a new iterative scheme.
