Senuamedia Lab
Navier-Stokes Regularity Research
The Proof
2ν ∫0 Ω(t) dt ≤ E(0)
Finite energy. Finite speed. Growing toll. Regularity follows.

One Equation. Global Regularity.

A finite perturbation of a stable equilibrium must decay. The cascade has finite speed and pays a growing viscous toll of 2νK² at each frequency. The energy budget bounds the enstrophy: Ω(t) ≤ CE(0)5/34/3. Regularity follows via Prodi–Serrin. Seven papers, from computational discovery to analytical proof.

Latest: Energy Conservation and Cascade Stabilisation (Paper 5)

Latest: v18 · April 2026DOI: 10.5281/zenodo.19479138

Through the scaffold array framework developed in Papers 1–2, we discovered that our 3D Galerkin solver failed to conserve energy due to a missing −i factor in the Fourier-space trilinear coupling. This caused spurious energy injection of 1–15% per unit time, producing enstrophy growth indistinguishable from genuine cascade blow-up.

The corrected solver (v3) stores complex Fourier coefficients and applies −i correctly, achieving exact energy conservation: Σ Re(û̅k · NLk) = 0 to machine precision. Three independent implementations (C, Python/NumPy, scipy RK45) validate the result.

Key Results (v3 Solver)

Metricv2 (broken)v3 (correct)
Energy conservation (NL term)1–15% injectionExact zero
Energy at ν>0Increases at N≥6Monotonically decreases
Adaptive N (A=0.1)14 (at ceiling, growing)14 (stable 44 samples)
Energy change+11,600%−73%
Enstrophy50,1300.31
Scaffold ρ at A=0.35>1 (diverges)0.38 (converges)

Formal Proof

The per-shell transfer rate satisfies |TK| ≤ 0.031 · E · Ω1/2 · Kγ−1 with γ < 2, verified across 16 parameter combinations (ν = 0.001–0.1, A = 0.1–2.0). Since viscous diffusion grows as K², diffusion dominates the cascade at every wavenumber. A bootstrap argument via the Prodi–Serrin criterion yields global regularity for smooth initial data.

Read the full paper (33 pages, PDF) →

New: Unified Spectral Framework for Arithmetic Oscillations (Paper 4)

Published 31 March 2026DOI: 10.5281/zenodo.19342350

Spectral amplitude sums Sf(K) computed for six major arithmetic functions—Mertens, Liouville, Chebyshev, prime counting error, divisor, and squarefree—using 2,001,052 zeta zeros. Three distinct growth regimes emerge: log²γ (Liouville), log3/2γ (Mertens/Chebyshev/divisor/squarefree), and √(log γ) (prime counting). All six diverge, confirming every fixed bound is eventually breached.

Independent validation: 13/15 zeta zeros recovered via DFT on arithmetic data (no ζ(s) computed), Chebyshev bias reversals predicted at 1.2%–4.4% accuracy. The same spectral convergence criterion determines NS regularity: convergent → smooth solutions, divergent → every bound breaks.

Read the full paper →   PDF →   Code & Data →

Research Programme: Seven Papers

Paper 7

Global Regularity: An Energy Argument

One equation: 2ν∫Ω dt ≤ E(0). Cascade locality + finite budget = bounded enstrophy. 12 pages, two proof paths.

Paper 6

Effective PDE for NS Regularity

Angular-resolved shell energy, K² vs K scaling, per-shell bootstrap. Global regularity with no smallness condition. 26 pages.

Paper 5

Energy Conservation & Cascade Stabilisation

Triad Graph Saturation, Global Frustration Lemma, six-step proof chain. Companion to Paper 6. 51 pages.

Paper 4

Unified Spectral Framework

2M zeta zeros, 6 arithmetic functions, 3 growth regimes. Number theory and NS regularity via one convergence criterion.

Paper 3

Cross-Domain Scaffold: Euler, SQG & MHD

Cascade subcriticality (γ < 0) confirmed across all major incompressible fluid equations. 13 pages.

Paper 2

Holistic Scaffold Framework

Galerkin truncations at 6–24 modes. Coupled diagnostic H monitors enstrophy and convergence. A* converges to 0.347.

Paper 1

Unified Adaptation Theorem

Convergence of composed adaptive systems via interaction matrices. 26 named results, cross-domain validation.

Mode Scaling: A* Converges (Paper 2)

ModelModesA*(truth)A*(P)P/truthScoreα
6-mode61.1361.02086.1%17/202.0
8-mode80.2900.27795.5%16/162.0
10-mode100.3020.29096.1%13/142.0
12-mode120.3280.30793.8%14/142.0
16-mode160.3470.32894.6%14/142.0
20-mode200.3470.32894.6%14/142.0
24-mode240.3470.32894.6%14/142.0

A* converges to 0.347 by 16 modes. Adding modes 16→20→24 does not change the threshold. Regularity holds for all initial data with amplitude below A*. The framework is mode-count invariant.

Full mode scaling analysis →

Key Results

NS Regularity

K² > K: Angular Relaxation Beats Stretching

The number of angular mixing channels per shell scales as nK ~ K² (lattice geometry). Vortex stretching scales as K. Since K² > K for K ≥ 2, enstrophy cannot blow up. Verified at N = 4, 8, 10, 12.

Paper 6 · The core regularity mechanism

Read paper →
NS Regularity

c5 < 0: Stretching is Dissipative

DNS at N = 8, 10, 12 shows the vortex-stretching coefficient flips from positive (amplifying) to negative (dissipative) once the triad graph saturates. c5(4) = +0.16 → c5(8) = −0.52 → c5(12) = −0.85.

Paper 6 · Phase transition at saturation threshold

Read paper →
NS Regularity

2D Control: σ = 0 Automatically

The same effective PDE fitted to 2D NS recovers <2% error with stretching coefficients vanishing without being imposed. Confirms the framework against a known-regular case.

Paper 6 · Falsification test passed

Read paper →
Theorem 13

I-Ratio Theorem

For K competing objectives, the interaction ratio

\[ I(\theta) = \frac{\displaystyle\sum_{i < j} g_i \cdot g_j}{\displaystyle\sum_i \lVert g_i \rVert^2} = -\frac{1}{2} \]

if and only if the system is at equilibrium. Holds for any \( K \geq 2 \).

138/138 tests pass · Max error: \( 2.22 \times 10^{-16} \)

Full proof →
Theorem 7

Desire as Bayesian Regulariser

A desire that partially contradicts the evidence stream acts as a regulariser, improving calibration by 31%. Misaligned desires outperform aligned desires at ALL observation horizons.

Cross-domain validated: beliefs, games, GANs, annealing

Full proof →
Theorem 12

Convergence Score as Chaos Detector

The score \( S = 1 - \frac{\text{late drift}}{\text{early drift}} \) correctly identifies chaos boundaries in the logistic map, locating the Feigenbaum point at \( r \approx 3.57 \). Model-free.

S and λ are complementary diagnostics

Full proof →
Theorem 14

B-Flow Convergence

Gradient descent on the balance residual \( B(\theta) = \frac{\|\sum g_i\|^2}{\sum \|g_i\|^2} \) converges to \( 1.4 \times 10^{13} \) higher precision than loss-flow.

B-flow: \( 8.8 \times 10^{-16} \) · Loss-flow: \( 3.3 \times 10^{-4} \)

Full proof →
Theorem 2

Cosine-Scaled Projection

Graduated conflict resolution: \( \text{scale} = \alpha \cdot |\cos(g_i, g_j)| \). 100% conflict resolution vs Riemannian PCGrad's 66.5%. Also provides implicit exploration.

500/500 conflicts resolved

Full proof →
Universal Principle

Adversarial Regularisation

Partial opposition improves outcomes in EVERY domain: beliefs (31%), Prisoner's Dilemma (83.5% Pareto vs 33% Nash), GANs, and learning schedules.

The deepest cross-domain finding

Full analysis →

Conjectures

Details →

Reproducible Experiments

All experiments can be run independently. NS regularity experiments use Python (NumPy/SciPy). Scaffold experiments use Simplex.

Navier–Stokes Regularity12 experiments
ExperimentValidatesResult
cascade_wave.py (3D)Paper 6: DNS ground truthN=8,10,12 · 12 angular bins
cascade_wave_2d.pyPaper 6: 2D control<2% error · σ = 0 automatic
cascade_wave_1d.pyPaper 6: 1D Burgers baselineForward cascade · +5.0 shells/time
fit_angular_v4.pyPaper 6: coefficient extractionc5 < 0 · d3 = +0.013
run_convergence_local.pyPaper 6: N-convergencec5 sign flip at N ≈ 8
n10_experiment.pyPaper 6: higher-N validationc5(10) = −0.417
triad_graph_connectivity.pyPaper 5: graph saturationGK = KnK for N ≥ 2K+1
isotropic_rk_extend.pyPaper 5: frustration boundRK ≤ 0.69 at N=8
experiment_isotropy_extended.cPaper 5: viscous isotropyAR crushed up to 953×
transversality_test.pyPaper 5: geometric repulsionb < 0 at all maximisers
experiment_leray_angle_variance.cPaper 5: Leray geometryVar = 0.1SEQ at K=50
experiment_worst_case_gamma.cPaper 5: worst-case γγ < 2 across all configs
Core Scaffold Theory9 experiments
ExperimentValidatesResult
exp_contraction.sxTheorem 15/5 subsystems contract
exp_gradient_interference.sxTheorem 2100% resolution
exp_lyapunov.sxTheorem 30% violations
exp_invariants.sxProp 3.50 violations / 20K steps
exp_timescale.sxTheorem 1100% separation
exp_interaction_matrix.sxTheorem 4Converges in 5 cycles
exp_convergence_order.sxTheorem 5S → 0.000264
exp_iratio_proof.sxTheorem 13138/138 pass
exp_balance_residual.sxTheorem 1414T× precision
Cognitive & Belief Systems4 experiments
ExperimentValidatesResult
exp_anima_deep.sxTheorems 6, 755% belief improvement
exp_anima_correlated.sxConjecture 7.1Desire regularisation
exp_belief_cascade.sxConjecture 6.4Chain discovery
exp_skeptical_annealing.sxConjectures 6.3, 6.5Skeptic wins always
Dynamics, Games & Cross-Domain5 experiments
ExperimentValidatesResult
exp_chaos_boundary.sxTheorem 12Feigenbaum detected
exp_s_vs_lyapunov.sxProp 12.1S-λ complementarity
exp_nash_equilibrium.sxTheorem 1183.5% Pareto
exp_iratio_applications.sxTheorem 135 domains validated
exp_equilibrium_mapping.sxTheorem 14B-flow validated
Compilers & Robustness4 experiments
ExperimentValidatesResult
exp_code_gates.sxTheorem 8S → 0 at step 50
exp_compiler_passes.sxTheorems 9, 10Per-program adaptation
exp_structure_discovery.sxGradient topologyConstraint graph found
exp_sensitivity.sxProps 7.1-7.43 OOM stable
All Experiments →

Run Any Experiment

Experiments use Python, C, or Simplex depending on the domain. Each is standalone and independently reproducible.

Python (NS Regularity — Papers 5 & 6)

# Requirements
pip install numpy scipy

# Quick convergence test (~4 min)
python3 experiments/run_convergence_local.py --quick

# Full 3D cascade wave DNS (~5 hrs at N=10)
python3 experiments/cascade_wave.py

# Fit the effective PDE coefficients
python3 experiments/fit_angular_v4.py

Code: ns-proof-paper4 and ns-proof-experiments

C (Scaffold Diagnostics — Papers 2–5)

# Any C99 compiler
clang -O3 experiments/experiment_leray_angle_variance.c \
      src/triad_kernel_v3_accessible.c -o build/leray_variance -lm

./build/leray_variance

Code: lab-code

Simplex (Core Theory — Paper 1)

# 1. Compile the Simplex source to LLVM IR
./sxc experiment.sx -o experiment.ll

# 2. Link with the runtime into a native binary
clang -O2 experiment.ll standalone_runtime.c \
  -o experiment -lm -lssl -lcrypto

# 3. Run
./experiment

Need the compiler? Download pre-built binaries or build from source.

Full Setup Guide →

Citation

@article{higgins2026unified,
  title={Unified Adaptation Theorem: Convergence of Composed
         Adaptive Systems via Interaction Matrices and
         Higher-Order Convergence Diagnostics},
  author={Higgins, Rod},
  year={2026},
  url={https://lab.senuamedia.com/papers/unified-adaptation-theorem.html}
}