Develops a recursive finite-window audit chain framework with anti-phantom certificates and propagation theorems for Navier-Stokes generated packages.
Strict 2.5D Shadows for One-Component Navier-Stokes Regularity
3 Pith papers cite this work. Polarity classification is still indexing.
abstract
We formulate and prove a conditional finite-scale reduction theorem for the local one-component regularity problem for suitable weak solutions of the three-dimensional Navier--Stokes equations. Starting from a scale-invariant bound Phi(1) <= M and smallness of the critical vertical component C_3(1) = delta, the argument compares the solution with a strict two-and-a-half-dimensional shadow class. The comparison is made in the harmonic-pressure quotient, which is the natural local topology for pressure compactness. The Reynolds commutator produced by coarse graining is treated as a positive covariance stress and is absorbed by an unresolved-variance buffer; consequently this stress contributes additively, while the genuinely vertical residuals carry a positive power of delta and may pass through finite-stage exponential constants. The theorem is deliberately stated as a reduction theorem. Under the explicitly listed structural inputs--prepared pressure-covariance closure, weak horizontal-defect admissibility, sharp admissible-time trace tightness, singular-stratum tangent-cone inputs, strict limiting smoothing and decay, finite-window trace-cost/Newton solvability, and the vertical-duality active-residual estimate--we derive r_reg(0,0) >= c_{M,theta} |log C_3(1)|^{-sigma/3}. The paper does not constitute an unconditional resolution of the logarithmic one-component regularity problem. Its contribution is a theorem-driven reduction: strict-shadow selection failure is reduced to a finite-mode flat trace obstruction, and that obstruction is eliminated, conditionally, by vertical duality forced by the full three-dimensional vertical momentum equation.
fields
math.AP 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Proves a finite-chain CKN-bad scale counting theorem for 3D Navier-Stokes via standard PDE closure with one-component compactness and an amended canonical detector realization.
Proves a local-to-clean detection theorem and anti-phantom principle ensuring baseline-visible defects in sharp Navier-Stokes packages are either detector-caught or charged to a quotient-residual ledger under listed conditions.
citing papers explorer
-
Finite-Window Recursive Audit Chains for Navier-Stokes Generated Packages
Develops a recursive finite-window audit chain framework with anti-phantom certificates and propagation theorems for Navier-Stokes generated packages.
-
Finite-Chain CKN-Bad Scale Counting for Navier-Stokes: Standard PDE Closure and Canonical Detector Realization
Proves a finite-chain CKN-bad scale counting theorem for 3D Navier-Stokes via standard PDE closure with one-component compactness and an amended canonical detector realization.
-
Finite-Window Local-to-Clean Transfer and Anti-Phantom Detection for Sharp Navier-Stokes Packages
Proves a local-to-clean detection theorem and anti-phantom principle ensuring baseline-visible defects in sharp Navier-Stokes packages are either detector-caught or charged to a quotient-residual ledger under listed conditions.