Navier-Stokes Existence and Smoothness: The Official Clay Problem Statement, Explained
September 2026: OpenAI announces smooth-forced 3D blowup (Clay C/D); Clay acknowledges apparent settlement. Review and prize award are separate.
Published: March 22, 2026 · Last reviewed: September 12, 2026
The official Clay Millennium Prize problem
The unforced 3D Navier–Stokes global-regularity question remains open: the announced forced construction does not settle it. In the technical discussion below, unresolved regularity and uniqueness questions concern the unforced system unless another setting is explicitly stated.
Source status reviewed 2026-09-12 (JST). On September 8, OpenAI announced finite-time blowup for smooth-forced 3D incompressible Navier–Stokes, claiming Clay alternatives C and D, with a manuscript and Lean formalization. On September 11, Clay said the problem has “apparently been settled”; evaluation and assignment of credit are deliberately unhurried. This is not a prize award or our verification of the proof.
Primary sources: Clay (2026-09-11) · OpenAI (2026-09-08) · Lean / GitHub · Official Clay statement.
Clay asks for a proof of one of four alternatives, not all four: (A) global smooth existence without forcing on R³; (B) global smooth existence without forcing on the periodic torus T³; (C) breakdown on R³ with admissible smooth forcing allowed; (D) periodic breakdown with admissible smooth forcing allowed. A/B quantify over all admissible initial data; C/D require an admissible counterexample. Forced breakdown does not disprove A/B.
See also: is Navier-Stokes solved? (2026-09-12 (JST) status)
The unforced 3D Navier–Stokes global-regularity question remains open: the announced forced construction does not settle it. In the technical discussion below, unresolved regularity and uniqueness questions concern the unforced system unless another setting is explicitly stated.
Source status reviewed 2026-09-12 (JST). On September 8, OpenAI announced finite-time blowup for smooth-forced 3D incompressible Navier–Stokes, claiming Clay alternatives C and D, with a manuscript and Lean formalization. On September 11, Clay said the problem has “apparently been settled”; evaluation and assignment of credit are deliberately unhurried. This is not a prize award or our verification of the proof.
Primary sources: Clay (2026-09-11) · OpenAI (2026-09-08) · Lean / GitHub · Official Clay statement.
Clay asks for a proof of one of four alternatives, not all four: (A) global smooth existence without forcing on R³; (B) global smooth existence without forcing on the periodic torus T³; (C) breakdown on R³ with admissible smooth forcing allowed; (D) periodic breakdown with admissible smooth forcing allowed. A/B quantify over all admissible initial data; C/D require an admissible counterexample. Forced breakdown does not disprove A/B.
Official source and proof targets
Primary source: Charles L. Fefferman, Existence and Smoothness of the Navier-Stokes Equation, Clay Mathematics Institute.
What this page does: explains that official problem statement in plainer language, with enough mathematical detail to show exactly what Clay would accept.
The Clay problem is not asking whether fluid simulations work, whether engineers can solve pipe-flow examples, or whether weak solutions exist. Those are separate questions. The prize question is about global smoothness or finite-time breakdown for the three-dimensional incompressible equations.
To win the prize, a proof has to land in one of two buckets:
- Global smoothness: show that every admissible smooth initial flow stays smooth for all future time.
- Breakdown: give an admissible smooth setup where a globally smooth solution cannot exist.
Clay asks for a proof of one of four alternatives, not all four: (A) global smooth existence without forcing on R³; (B) global smooth existence without forcing on the periodic torus T³; (C) breakdown on R³ with admissible smooth forcing allowed; (D) periodic breakdown with admissible smooth forcing allowed. A/B quantify over all admissible initial data; C/D require an admissible counterexample. Forced breakdown does not disprove A/B.
Primary source: C. L. Fefferman, Existence and Smoothness of the Navier-Stokes Equation, Clay Mathematics Institute.
Status: this site is an explanatory guide, not the Clay Mathematics Institute. The linked PDF is the source of authority for the prize formulation.
The core system is the 3D incompressible Navier-Stokes equation
Clay's formulation separates whole-space and periodic cases. In the whole-space existence direction, the initial velocity is smooth, divergence-free, and rapidly decaying; the target is a globally smooth solution with finite energy for all time. In the breakdown direction, the task is to construct admissible data, under one of the official alternatives, for which the required globally smooth solution fails to exist.
Clay asks for a proof of one of four alternatives, not all four: (A) global smooth existence without forcing on R³; (B) global smooth existence without forcing on the periodic torus T³; (C) breakdown on R³ with admissible smooth forcing allowed; (D) periodic breakdown with admissible smooth forcing allowed. A/B quantify over all admissible initial data; C/D require an admissible counterexample. Forced breakdown does not disprove A/B.
The exact problem statement
Clay asks for a proof of one of four alternatives, not all four: (A) global smooth existence without forcing on R³; (B) global smooth existence without forcing on the periodic torus T³; (C) breakdown on R³ with admissible smooth forcing allowed; (D) periodic breakdown with admissible smooth forcing allowed. A/B quantify over all admissible initial data; C/D require an admissible counterexample. Forced breakdown does not disprove A/B.
Following Fefferman's formulation on with :
Hypotheses: Let be divergence-free. Assume for every and there exist constants such that
Conclusion (to prove): There exist and satisfying the Navier-Stokes equations, , and the energy bound
What makes it a Millennium Problem?
Three things put Navier-Stokes on that shortlist:
- Practical importance. These equations run most of fluid dynamics: aircraft design, climate models, blood flow, ocean currents. Even without a complete proof, engineers use these equations successfully in many regimes; the open problem is about whether the 3D equations can always be justified mathematically.
- Mathematical depth. It draws on analysis, geometry, topology, and physics simultaneously.
- Lasting importance. Clay selected Navier–Stokes as one of its seven Millennium Prize Problems in 2000 because it combines fundamental mathematical difficulty with the equations’ central role in fluid dynamics. The September 2026 announcement changes the status, not those reasons for its importance. See also: explore why
The problem's difficulty is rooted in the supercritical nature of the 3D equations. The natural energy estimate
places in , which is below the critical scaling. The Navier-Stokes equations are invariant under
and the critical space is (or ). The energy class is supercritical. It lies below the critical scaling threshold and does not by itself control the small-scale nonlinear cascade, leaving a gap that all existing techniques struggle to bridge.
The energy estimate displayed here is for zero forcing. With forcing, the right-hand side also includes the work term .
History of progress
The essential milestones:
- 1822: Navier derives the equations from molecular considerations.
- 1845: Stokes gives the modern derivation from continuum mechanics.
- 1934: Leray proves that "weak" solutions always exist. A massive result, but these solutions might not be smooth.
- 1982: Caffarelli, Kohn, and Nirenberg prove that singularities (more on partial regularity), if they exist, are extremely small: in the parabolic geometry natural to these equations, the singular set has zero one-dimensional parabolic Hausdorff measure.
- 1984: Beale, Kato, and Majda prove (originally for Euler, with Navier-Stokes analogues) that blowup can only happen if the vorticity becomes infinite.
- 2000: Clay names it a Millennium Problem.
- September 2026: OpenAI announces smooth-forced 3D blowup (Clay C/D); Clay acknowledges apparent settlement. Review and prize award are separate.
See also: critical-space approaches
Foundational results, selectively:
- Leray (1934): Global weak solutions exist, proved via compactness. He introduced the Leray projector and the concept of turbulent solutions. The starting gun for everything that followed.
- Hopf (1951): Extended Leray's construction to bounded domains.
- Ladyzhenskaya, Prodi, Serrin (1960s): Regularity criteria. If with , , then the solution is smooth. Escauriaza, Seregin, and Šverák settled the endpoint case in 2003.
- Caffarelli, Kohn, Nirenberg (1982): . The singular set has zero one-dimensional parabolic Hausdorff measure.
- Beale, Kato, Majda (1984): Originally proved for incompressible Euler: blowup happens iff . Analogous criteria hold for Navier-Stokes.
- Koch, Tataru (2001): Local well-posedness for small data in . This is the largest critical space where well-posedness is known.
- Seregin (2012): At a blowup time , the norm must diverge: as . Strictly stronger than ESS (2003), which only showed failure of uniform boundedness.
September 2026: OpenAI announces smooth-forced 3D blowup (Clay C/D); Clay acknowledges apparent settlement. Review and prize award are separate.
Continue exploring
This article is part of The Problem.
If you came here wondering whether someone already solved it, start with Is the Navier-Stokes Problem Solved?.
Then explore why it's so hard, or see how mathematicians have broken it into subproblems. For the structural reasons the 2D problem is tractable while 3D remains open, see Why 2D Is Easier Than 3D.
This article is part of The Problem.
Want the short answer on whether it's been solved? See Is the Navier-Stokes Problem Solved? That page also clarifies the gap between weak existence and global smooth regularity.
The mathematical obstacles are laid out in Why It's Hard. For a decomposition into tractable pieces (weak solutions, partial regularity, blowup classification), see Subproblems. And for why the 2D case is settled while 3D isn't, see Why 2D Is Easier Than 3D.