Documentary state: DRAFT_UNACCEPTED. This draft has NOT been editorially admitted. Mathematical claims require independent checking.
OAI-26 family 376: Transport constructions and quantitative estimates
The question in plain language
The family includes mathematical constructions that move prescribed boxes using carefully controlled flows, together with a forced-fluid computation construction. A later manuscript edition also makes quantitative claims about projecting forces on a torus and about how derivatives decay in time. A theorem about existence of a flow is not automatically a theorem with those stronger numerical bounds.
A small example
For a periodic vector field \(g\) on a flat torus, its divergence-free projection can be written as
with a mean-zero convention for \(\phi\). Take the pure gradient field \(g(x)=\nabla\sin(x_1)\). Choosing \(\phi(x)=\sin(x_1)\) gives \(Pg=0\). This illustrates what the pressure-correcting projection removes. It does not establish a general high-order Sobolev bound or uniform time-decay control.
What is known
The indexed October 6 manuscript differs from its September 27 edition. A pinned TeX comparison found changes in analysis.tex, clocks.tex, and the date-bearing main.tex. The newer text adds effective torus projection and pressure estimates and a shared derivative-decay envelope. These are concrete additional proof obligations, not merely cosmetic editorial changes.
GCL verification state
GCL's exact TeX revision record preserves the September/October source distinction. The protected nine-file Lean scope inspection found no explicit versions of the October quantitative estimates in the named target statements and supporting files it inspected. That search was bounded: it did not traverse the entire transitive import graph and does not establish that the estimates are absent from all formalized material.
Documentary status: DRAFT_UNACCEPTED. Version concordance: UNRESOLVED. NO_CERTIFICATION.
What remains
Inspect all transitive dependencies, relevant definitions and alternative theorem names. Compare each corrected quantitative October assertion with the precise formal statement and its proof dependencies. In particular, verify the source's stated mapping from a Sobolev space to a continuous-derivative norm and the uniform common-clock bound for mixed derivatives. Report missing theorem statements separately from proof failure.
Sources and claim boundaries
- Pinned September–October TeX delta and its protected admission.
- Bounded Lean-source inspection, protected PR #378.
- GCL WP02 remaining source-risk obligations.
Source lock: openai/math@1581d4cbdd69a0faf34b2089614fe2a814316a6a.
Boundary: the projection example checks one simple vector field, not the corrected manuscript's operator estimates. A bounded signature search cannot certify absence, equivalence or mathematical validity. NO_CERTIFICATION.
Indexed primary manuscript paths:
- Finite Instructions and Solenoidal Shear Flows —
preprints/Finite-Instructions-and-Solenoidal-Shear-Flows-September-27-2026/manuscript.pdf - A Fixed Particle Test for Computation in a Forced Viscous Flow —
preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/manuscript.pdf - Universal Computation with Eventually Stationary Navier–Stokes Forcing —
preprints/Universal-Computation-with-Eventually-Stationary-Navier-Stokes-Forcing-September-27-2026/manuscript.pdf - Geometric Programs for Solenoidal Forcing —
preprints/Geometric-Programs-for-Solenoidal-Forcing-September-27-2026/manuscript.pdf - Prefix Instructions and Incompressible Flows —
preprints/Prefix-Instructions-and-Incompressible-Flows-September-27-2026/manuscript.pdf - Computation under Rapidly Vanishing Navier–Stokes Forcing —
preprints/Computation-under-Rapidly-Vanishing-Navier-Stokes-Forcing-September-27-2026/manuscript.pdf - Velocity-Field Detection of Computation in Forced Navier–Stokes Flows —
preprints/Velocity-Field-Detection-of-Computation-in-Forced-Navier-Stokes-Flows-September-27-2026/manuscript.pdf - Scalar Potentials and Slow Clocks for Forced Fluid Computation —
preprints/Scalar-Potentials-and-Slow-Clocks-for-Forced-Fluid-Computation-September-27-2026/manuscript.pdf - Incompressible Box Transport and Finite Computation —
preprints/Incompressible-Box-Transport-and-Finite-Computation-October-6-2026/manuscript.pdf