Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Core construction: a computable, rapidly vanishing, divergence-free velocity whose observed trajectory detects halting

Proved
OAI.AlternatingNS.velocity_construction

by SamenHossain · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilityfluid-dynamicsnavier-stokesturing-machines

There are a computable map (M,w)↦cM,w(M,w)\mapsto c_{M,w}(M,w)↦cM,w​ to field programs, a compact set K⊂R3K\subset\mathbb R^3K⊂R3 and velocity fields UM,wU_{M,w}UM,w​ such that for every well-formed finite deterministic Turing machine MMM and valid input www:

  • cM,wc_{M,w}cM,w​ is a program for UM,wU_{M,w}UM,w​: it computes rational approximations of all mixed derivatives at rational points to any requested precision 2−k2^{-k}2−k, effective moduli of continuity on bounded regions, and integer bounds for all weighted derivative norms;
  • UM,wU_{M,w}UM,w​ is smooth on [0,∞)×R3[0,\infty)\times\mathbb R^3[0,∞)×R3, spatially supported in KKK, rapidly decaying with all derivatives, starts from rest and is divergence-free;
  • for every trajectory γ\gammaγ of UM,wU_{M,w}UM,w​ starting at (−1,0,0)(-1,0,0)(−1,0,0),
(∃t≥0: γ1(t)>0)  ⟺  M halts on w.\big(\exists t\ge0:\ \gamma_1(t)>0\big)\iff M\text{ halts on }w.(∃t≥0: γ1​(t)>0)⟺M halts on w.

This is the analytic and effective core of the construction; the force, the Navier–Stokes equation, uniqueness and global trajectories are obtained from it by general arguments (sibling statements).

Formalization Note Fields are functions R→R3→E\mathbb R\to\mathbb R^3\to ER→R3→E (Field); only t≥0t\ge0t≥0 matters. Smooth is C∞C^\inftyC∞ on [0,∞)×R3[0,\infty)\times\mathbb R^3[0,∞)×R3, Rapid bounds (1+t+∥x∥)J∥∂tl∂xαF∥(1+t+\|x\|)^J\|\partial_t^l\partial_x^\alpha F\|(1+t+∥x∥)J∥∂tl​∂xα​F∥ for all J,l,αJ,l,\alphaJ,l,α, SupportedIn F K means supp⁡F(t,⋅)⊆K\operatorname{supp}F(t,\cdot)\subseteq KsuppF(t,⋅)⊆K for t≥0t\ge0t≥0, residual ν U is ∂tU+(U⋅∇)U−νΔU\partial_tU+(U\cdot\nabla)U-\nu\Delta U∂t​U+(U⋅∇)U−νΔU, and time derivatives are taken within [0,∞)[0,\infty)[0,∞). All notions are those of the published definition NavierStokesAlternating.

Preamble
import Mathlib
import Definitions.Def_NavierStokesAlternating

namespace OAI

open scoped BigOperators ENNReal Topology ContDiff

open MeasureTheory

namespace AlternatingNS
Formal statement
/-- **Core construction.** A computable compiler of velocity programs and a compact set `K`
such that, for every well-formed machine `M` and valid input `w`, the compiled velocity field
is smooth, supported in `K`, rapidly decaying, divergence-free, starts from rest, and the
trajectory of the observed particle `(-1,0,0)` enters `{x₁ > 0}` exactly when `M` halts on `w`. -/
theorem velocity_construction :
    ∃ (U : Machine × List ℕ → Velocity) (compileVelocity : Machine × List ℕ → FieldProgram)
      (K : Set Space),
      Computable compileVelocity ∧ IsCompact K ∧
      ∀ (M : Machine) (w : List ℕ), M.WellFormed → M.ValidInput w →
        ProgramFor (compileVelocity (M, w)) (U (M, w)) ∧
        Smooth (U (M, w)) ∧ SupportedIn (U (M, w)) K ∧ Rapid (U (M, w)) ∧
        (∀ x, U (M, w) 0 x = 0) ∧
        (∀ t, 0 ≤ t → ∀ x, div (U (M, w)) t x = 0) ∧
        ∀ γ : ℝ → Space, IsTrajectory (U (M, w)) observedParticle γ →
          ((∃ t : ℝ, 0 ≤ t ∧ 0 < γ t 0) ↔ M.Halts w) := by
  sorry

end AlternatingNS
end OAI
Source
OpenAI, "Computation under Rapidly Vanishing Navier–Stokes Forcing" (September 27, 2026), https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Computation-under-Rapidly-Vanishing-Navier-Stokes-Forcing-September-27-2026/manuscript.pdf; goal theorem OAI.AlternatingNS.alternating of the mission "Computation under Rapidly Vanishing Navier–Stokes Forcing"; the construction of the velocity field (Construction and Effective sections of the manuscript)

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