Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-time Euler singularity from smooth compact data (Theorem 1.1, quantitative form)

Open
Euler.exists_compact_smooth_euler_singularity

by LG · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

eulerfinite-time-blowupfluid-dynamicspde

This is the quantitative form of Theorem 1.1 of the OpenAI paper Finite time blowup for the Euler equation: a smooth, compactly supported, divergence-free initial velocity on R3\mathbb{R}^3R3 whose unforced Euler solution develops a singularity in finite time.

There exist an initial velocity u0u_0u0​, a time T∗∈(0,1]T_*\in(0,1]T∗​∈(0,1], and fields v,pv,pv,p such that:

  1. u0u_0u0​ is smooth, divergence-free, rapidly decaying, compactly supported, and nonzero;
  2. (v,p)(v,p)(v,p) solves unforced Euler on the half-open interval [0,T∗)[0,T_*)[0,T∗​) in the all-order Sobolev class (the velocity and its strong time derivative have continuous L2L^2L2 spatial jets of every order), with uniformly bounded kinetic energy;
  3. for every T>0T>0T>0, a closed-interval solution in this class on [0,T][0,T][0,T] exists if and only if T<T∗T<T_*T<T∗​ (maximal lifespan);
  4. on every shorter closed interval [0,T]⊂[0,T∗)[0,T]\subset[0,T_*)[0,T]⊂[0,T∗​) the C1C^1C1 norm of vvv and the time integral of the vorticity norm are finite;
  5. at the endpoint,
lim sup⁡t↑T∗∥v(t)∥C1=∞,∫0T∗∥curl⁡v(t)∥L∞ dt=∞;\limsup_{t\uparrow T_*}\|v(t)\|_{C^1}=\infty,\qquad \int_0^{T_*}\|\operatorname{curl}v(t)\|_{L^\infty}\,dt=\infty;t↑T∗​limsup​∥v(t)∥C1​=∞,∫0T∗​​∥curlv(t)∥L∞​dt=∞;
  1. the same datum admits no global smooth finite-energy Euler solution on R3×[0,∞)\mathbb{R}^3\times[0,\infty)R3×[0,∞).

The C1C^1C1 norm is the sum of the spatial suprema of ∥v∥\|v\|∥v∥ and ∥∇v∥\|\nabla v\|∥∇v∥; the vorticity norm is the spatial supremum of ∥curl⁡v∥\|\operatorname{curl}v\|∥curlv∥. Both are taken in R≥0∪{∞}\mathbb{R}_{\ge0}\cup\{\infty\}R≥0​∪{∞}, so the blowup assertions are equalities with ∞\infty∞. The bound T∗≤1T_*\le1T∗​≤1 is a normalization. This theorem implies the global-breakdown form Euler.euler_breakdown_R3.

Formalization Note. The statement is the independent Comparator reference theorem exists_compact_smooth_euler_singularity, proved in the repository's Euler/Solution.lean; suprema and the vorticity integral are ℝ≥0∞-valued (⊤ denotes infinity). Axioms: propext, Classical.choice, Quot.sound.

Preamble
import Mathlib
import Definitions.Def_EulerComparatorChallenge

open ContDiff Set InnerProductSpace MeasureTheory
open scoped ENNReal Topology

local notation "ℝ³" => EuclideanSpace ℝ (Fin 3)
Formal statement
namespace Euler
theorem exists_compact_smooth_euler_singularity :
    ∃ (u₀ : ℝ³ → ℝ³) (Tstar : ℝ) (v : ℝ³ → ℝ → ℝ³) (p : ℝ³ → ℝ → ℝ),
      InitialVelocityConditionDecay u₀ ∧ HasCompactSupport u₀ ∧ u₀ ≠ 0 ∧
      0 < Tstar ∧ Tstar ≤ 1 ∧
      EulerSobolevExistenceAndSmoothnessR3On (Ico 0 Tstar) u₀ v p ∧
      (∃ E : ℝ, ∀ t ∈ Ico (0 : ℝ) Tstar, (∫ x : ℝ³, ‖v x t‖ ^ 2) < E) ∧
      (∀ T : ℝ, 0 < T →
        ((∃ w q, EulerSobolevExistenceAndSmoothnessR3On (Icc 0 T) u₀ w q) ↔ T < Tstar)) ∧
      (∀ T ∈ Ioo 0 Tstar,
        (⨆ t ∈ Icc (0 : ℝ) T, velocityC1Norm (v · t)) < ⊤ ∧
        (∫⁻ t in Ico (0 : ℝ) T, vorticityNorm (v · t)) < ⊤) ∧
      Filter.limsup (fun t : ℝ => velocityC1Norm (v · t)) (𝓝[<] Tstar) = ⊤ ∧
      (∫⁻ t in Ico (0 : ℝ) Tstar, vorticityNorm (v · t)) = ⊤ ∧
      ¬ (∃ w q, EulerExistenceAndSmoothnessR3 u₀ w q) := by
  sorry
end Euler
Source
OpenAI, Finite time blowup for the Euler equation (2026), https://cdn.openai.com/pdf/315b36cd-ec98-4023-8342-93345194ece1/euler.pdf, Theorem 1.1; Lean reference: https://github.com/openai/NavierStokesAndEuler/blob/f9e8bc5b38b6e212696e8a30e3e91517af887bbd/ComparatorChallenges/Euler.lean#L164-L184; proved in https://github.com/openai/NavierStokesAndEuler/blob/f9e8bc5b38b6e212696e8a30e3e91517af887bbd/Euler/Solution.lean#L40-L75.
Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me