Plectis Atlas
Effective finite computation detected by a fixed particle
Family 376: Universal computation in forced Navier–Stokes flows
Candidate pairing
Theorem (Periodic lattice memory)
Fix a computable viscosity \nu>0. A finite deterministic machine and a finite input effectively determine a smooth force g on the unit flat torus \T^3=(\R/\mathbb Z)^3 with zero spatial mean. The Navier–Stokes equations with force g and zero initial velocity have a smooth solution (U,0) with zero spatial mean. Its particle from
enters the fixed open set
at some finite time if and only if the machine halts on that input. For every pair of nonnegative integers r,J and every spatial multi-index \alpha, there is an effective constant C_{r,\alpha,J} such that
There is also an effective smooth mean-zero solenoidal force f with the same bounds and exactly the same velocity and material event. It is f=g-\nabla\phi, with pressure -\phi, where \phi is the mean-zero periodic solution of \Delta\phi=\operatorname{div}g.
For either force, uniqueness holds among periodic classical solutions for which the velocity, its time derivative and its spatial derivatives through order two, and the pressure and its spatial gradient, are continuous on every [0,T]\times\T^3. Pressure is normalized to have zero spatial mean.
Computation under Rapidly Vanishing Navier–Stokes Forcing
TeX label thm:lattice, build/lattice.tex, line 18
The Lean statement says
theorem balanced_three_stack_realization : ∃ U f₀ f₁ : Family Velocity, ∃ X : Family MaterialFlow, ∃ repeated : FiniteMachine → Velocity, EffectiveFamily U ∧ EffectiveFamily f₀ ∧ EffectiveFamily f₁ ∧ (∀ M, Function.Periodic (repeated M) 1) ∧ ∀ (M : FiniteMachine) (w : Input M), Smooth (U M w) ∧ Smooth (f₀ M w) ∧ Smooth (f₁ M w) ∧ f₀ M w = inertialCoefficient (U M w) ∧ f₁ M w = viscousCoefficient (U M w) ∧ CommonCompactSupport (U M w) (f₀ M w) (f₁ M w) ∧ BoundedMixed (U M w) ∧ PeriodicAfterOne (U M w) ∧ (∀ t, 1 ≤ t → ∀ x, U M w t x = repeated M t x) ∧ ComparisonClass (U M w) (fun _ _ => 0) ∧ IsMaterialFlow (U M w) (X M w) ∧ ((∃ t : ℝ, 0 ≤ t ∧ X M w t fixedLabel ∈ observer) ↔ Halts M w) ∧ ∀ ν : ℝ, 0 < ν →A Lean statement states the theorem and leaves its proof as sorry on purpose. OpenAI’s proof is in a separate solution module, and a program called Comparator checks that proof against this statement.