Core construction: a computable, rapidly vanishing, divergence-free velocity whose observed trajectory detects halting
ProvedOAI.AlternatingNS.velocity_constructioncomputabilityfluid-dynamicsnavier-stokesturing-machines
There are a computable map to field programs, a compact set and velocity fields such that for every well-formed finite deterministic Turing machine and valid input :
- is a program for : it computes rational approximations of all mixed derivatives at rational points to any requested precision , effective moduli of continuity on bounded regions, and integer bounds for all weighted derivative norms;
- is smooth on , spatially supported in , rapidly decaying with all derivatives, starts from rest and is divergence-free;
- for every trajectory of starting at ,
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 (Field); only matters. Smooth is on , Rapid bounds for all , SupportedIn F K means for , residual ν U is , and time derivatives are taken within . 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 OAISource
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)