LOCCDSFAApr 14

From Witness-Space Sharpness To Family-Pointwise Exactness For The Solvability Complexity Index

arXiv:2604.127506.9h-index: 1
Predicted impact top 75% in LO · last 90 daysOriginality Incremental advance
AI Analysis

For researchers in computational complexity and numerical analysis, this work clarifies foundational distinctions in SCI theory and provides tools to upgrade sharpness results, though the contributions are incremental and technical.

The paper formalizes a trichotomy of exactness notions for the Solvability Complexity Index (SCI) in the family setting, showing that witness-space sharpness is strictly weaker than family-pointwise exactness. It provides upgrade theorems and introduces a decoder-regular transport preorder, with applications to Koopman-operator classification and exact integration.

We study how exact Solvability Complexity Index (SCI) statements should be formulated for families of computational problems rather than for single problems. While the equality \(\operatorname{SCI}_G (\mathcal P)=k\) is unambiguous for an individual computational problem \(\mathcal P\), the family setting requires one to distinguish family-pointwise exactness, witness-space sharpness, and worst-case exactness. We formalize this trichotomy, prove that witness-space sharpness coincides with worst-case exactness but is, in general, strictly weaker than family-pointwise exactness, and show that certain Koopman-operator classification results are sharp only in this worst-case sense. We then establish two positive upgrade theorems: an abstract pullback principle and a concrete finite-query criterion guaranteeing that witness-space sharpness upgrades to family-pointwise exactness. Next, we introduce a decoder-regular finite-query transport preorder on SCI computational problems, prove that it is a preorder, derive a transport-saturation sufficient criterion extending the principal-source package, and show that the associated transport degrees need not form a lattice in full generality. We analyze the natural decoder classes \(\mathscr R_{\mathrm{cont}}\) and \(\mathscr R_{\mathrm{Bor}}\): on the full class the corresponding quotients are not upper semilattices, while on the nondegenerate subclass the preorder is upward and downward directed. Finally, we exhibit two natural positive families realizing the principal transport mechanism: exact integration on compact intervals and a fixed-window spectral decision family obtained by block-diagonal stabilization.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes