Universal computation in forced Navier–Stokes flows
The following describes the scope of the Lean formalization related to the following accompanying paper(s):
Scope
The formalization realizes finite families of prescribed positive diagonal maps on coding sheets by smooth incompressible flows on a flat three-torus. At every positive computable viscosity, it supplies a solution starting from rest with zero pressure and a force that is divergence free, has spatial mean zero, and is one-periodic from time zero. Each map acts on every point of its source sheet, and the construction provides effective bounds for all mixed derivatives.
This selected statement covers the sheet programs. The paper's fixed-particle halting detector and its reciprocal maps on solid boxes are outside its scope.
The formalization proves that a fluid particle can detect arbitrary finite-machine halting using alternating-coordinate memory in smooth incompressible Navier–Stokes flows whose velocity and force decay faster than every inverse power of time, including every mixed derivative. For each fixed positive computable viscosity, the construction starts from rest and provides effective forces, unique material trajectories, and an exact equivalence between entering a fixed open detector and halting.
The velocity and force share one compact support for every machine and input. The solution-uniqueness assertion uses the stated energy comparison class.
The formalization constructs smooth forced three-dimensional Navier–Stokes flows from rest whose velocity fields detect whether a prescribed machine halts, at any positive computable viscosity. On the unit flat torus, halting is equivalent to the vertical velocity exceeding 1/2 somewhere in a fixed observation strip. On R2×T, it is equivalent to the integral of the nonnegative vertical velocity over the observation half-plane times the circle exceeding 1/2.
The torus force is confined to a fixed horizontal region. The cylindrical force has globally bounded mixed derivatives and compact horizontal support on every finite time interval. Both constructions have effective descriptions and uniqueness within their respective smooth solution-comparison classes.
The formalization realizes finitely many positive diagonal affine maps of determinant one between rational solid boxes by a smooth compactly supported divergence-free flow. Source boxes are pairwise disjoint and target boxes are pairwise disjoint, while overlap between the two families is allowed. Each map holds on a neighborhood of the entire source box, and the velocity is supported in the middle half of the time interval.
It also encodes every finite machine and input in a smooth, compactly supported incompressible Navier–Stokes flow on R3 starting from rest: the particle initially at (4,0,0) enters the fixed open box (−1,2)3 exactly when the machine halts. One velocity works for every viscosity ν>0, with zero pressure and force f0+νf1. Velocity and force have bounded mixed derivatives and are one-periodic after time one; the repeated velocity depends only on the machine. The force is computable for computable ν. Velocity is unique among smooth zero-data solutions with u∈CtHx2∩Ct1Lx2, bounded u and ∇u on finite time intervals, and pressure modulo a function of time in CtHx1.
Comparator links