pith. sign in

arxiv: 2606.13250 · v1 · pith:NZGHJCNLnew · submitted 2026-06-11 · 🧮 math.LO · cs.NA· math.NA· math.SP

Finite-Query Collapse and Modal Exact Bases in the SCI Hierarchy

Christopher Sorg This is my paper

Pith reviewed 2026-06-27 05:02 UTC · model grok-4.3

classification 🧮 math.LO cs.NAmath.NAmath.SP
keywords Solvability Complexity Indexfinite-query transportexact basisColbrook-Hansen blockmodal preordersWeihrauch reducibilityTTE computability
0
0 comments X

The pith

A CH23 geometric modality on finite-query preorders splits the Colbrook-Hansen SCI ambient into exactly two minimal exact sources.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that raw finite-query reductions equate the diagonal exact spectral source with the fixed-ε pseudospectral source in the Colbrook-Hansen block, making the six-problem ambient principal. Modal finite-query preorders add admissibility restrictions on encodings, decoders, reconstructions, uniformity, and geometric naturality. Under the CH23 modality built from representation inclusions, unitary and graph relabelings, and neutral stabilizations, the ambient regains exactly two minimal exact sources. This reformulates the exact-basis problem as one of finding modality-indexed bases and refinement maps rather than relying on a single raw preorder. A reader would care because the distinction affects how solvability complexity is measured for spectral and pseudospectral computations.

Core claim

Under a CH23 geometric modality generated by representation inclusions, unitary and graph relabelings, and neutral stabilizations, the same ambient has exactly two minimal exact sources. This contrasts with the raw finite-query preorder, under which the diagonal exact spectral and fixed-ε pseudospectral sources become equivalent, rendering the six-problem ambient raw-principal.

What carries the argument

The CH23 geometric modality, which restricts modal finite-query preorders via representation inclusions, unitary and graph relabelings, and neutral stabilizations to preserve a two-source exact-basis structure.

If this is right

  • SCI families should be classified by modality-indexed exact bases and refinement maps rather than by one raw preorder.
  • TTE finite-query transport is computable point transport with a uniform finite interface trace and strictly implies strong Weihrauch reducibility.
  • The six-problem CH23 ambient remains non-principal once the modality is imposed.
  • Natural SCI families admit calibrated reformulations that track which distinctions survive under each modality.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same modal technique could separate sources in other SCI blocks that currently appear collapsed under raw reductions.
  • If the admissibility conditions are varied, different modalities might produce different numbers of minimal sources for the same ambient.
  • This modal approach offers a way to compare exact bases across computable analysis problems that involve continuous output decoders.

Load-bearing premise

The specific admissibility conditions on the modal finite-query preorders together with the precise definition of the CH23 geometric modality are enough to block collapse while keeping the two-source structure intact.

What would settle it

An explicit sequence of representation inclusions or neutral stabilizations under the CH23 modality that makes the diagonal spectral source and the fixed-ε pseudospectral source equivalent would falsify the two-source claim.

read the original abstract

We study the exact-basis problem for Solvability Complexity Index (SCI) computational problem families through finite-query transports. A raw finite-query reduction permits arbitrary encodings and finite transcript reconstructions, with only a continuous output decoder. For the Colbrook-Hansen (CH23) singleton-window spectral/pseudospectral block, this raw preorder collapses the expected two-source structure: the diagonal exact spectral and fixed-$\varepsilon$ pseudospectral sources are raw- and continuous-finite-query equivalent, and, for computable $\varepsilon$ under the evaluation-name representations, TTE-finite-query equivalent, so the six-problem ambient is raw-principal. We then introduce modal finite-query preorders, whose admissibility conditions may restrict encodings, decoders, reconstructions, uniformity, and geometric naturality. We also characterize TTE finite-query transport as computable point transport with a uniform finite interface trace; after forgetting the trace this gives strong Weihrauch reducibility, and the implication is strict. Under a CH23 geometric modality generated by representation inclusions, unitary and graph relabelings, and neutral stabilizations, the same ambient has exactly two minimal exact sources. This gives a calibrated reformulation of the exact-basis problem: natural SCI families should be classified by modality-indexed exact bases and refinement maps, not by one raw preorder alone.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper claims that raw finite-query reductions on the CH23 singleton-window spectral/pseudospectral block collapse the six-problem ambient to a single principal source, as the diagonal exact spectral and fixed-ε pseudospectral problems become raw- and continuous-finite-query equivalent (with TTE equivalence for computable ε under evaluation-name representations). Modal finite-query preorders are introduced whose admissibility conditions restrict encodings, decoders, reconstructions, uniformity, and geometric naturality; under the CH23 geometric modality generated by representation inclusions, unitary/graph relabelings, and neutral stabilizations, the ambient retains exactly two minimal exact sources. TTE finite-query transport is characterized as computable point transport with uniform finite interface trace (yielding strong Weihrauch reducibility after forgetting the trace, strictly). This yields a reformulation of the exact-basis problem via modality-indexed exact bases and refinement maps rather than a single raw preorder.

Significance. If the modal preorders and geometric modality are rigorously defined and the claimed separations hold, the work supplies a calibrated refinement of exact-basis analysis in the SCI hierarchy by demonstrating how admissibility restrictions can block raw collapses while preserving a two-source structure. The explicit characterization of TTE transport and its relation to strong Weihrauch reducibility adds a concrete technical bridge between finite-query models and existing reducibility notions. The modality-indexed classification offers a systematic way to study natural SCI families that could influence subsequent work on computable analysis hierarchies.

major comments (2)
  1. [Abstract] Abstract: the central claim that raw finite-query reductions yield a single principal source rests on the asserted equivalences between diagonal spectral and fixed-ε pseudospectral problems (including TTE equivalence for computable ε). Without the explicit definitions of the representations, the continuous output decoder, and the precise form of the finite transcript reconstructions in the main text, it is impossible to confirm that these equivalences follow from the stated reductions rather than from hidden parameters in the encodings.
  2. [Abstract] Abstract: the claim that the modal finite-query preorders with the listed admissibility conditions (restricting encodings, decoders, reconstructions, uniformity, and geometric naturality) preserve exactly two minimal exact sources under the CH23 geometric modality is load-bearing for the reformulation result. A concrete theorem or proposition showing how these restrictions block the raw equivalences while the modality (generated by representation inclusions, unitary/graph relabelings, and neutral stabilizations) remains non-collapsing would be required to substantiate the two-source structure.
minor comments (2)
  1. [Abstract] Abstract: the phrase 'singleton-window spectral/pseudospectral block' is introduced without a brief parenthetical reference to the six problems in CH23; adding one sentence of clarification would improve accessibility.
  2. [Abstract] Abstract: the statement that 'after forgetting the trace this gives strong Weihrauch reducibility, and the implication is strict' would benefit from either a short inline definition or a citation to the relevant Weihrauch literature.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thorough review and valuable suggestions. The major comments point to areas where additional explicitness in the main text would strengthen the presentation of our results on raw and modal finite-query preorders. We address each comment below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that raw finite-query reductions yield a single principal source rests on the asserted equivalences between diagonal spectral and fixed-ε pseudospectral problems (including TTE equivalence for computable ε). Without the explicit definitions of the representations, the continuous output decoder, and the precise form of the finite transcript reconstructions in the main text, it is impossible to confirm that these equivalences follow from the stated reductions rather than from hidden parameters in the encodings.

    Authors: We agree that the main text should provide the explicit definitions to allow independent verification of the equivalences. In the revised manuscript, we will expand Section 2 (Preliminaries) and Section 3 (Raw Finite-Query Reductions) to include the full definitions of the evaluation-name representations, the continuous output decoder, and the finite transcript reconstructions. This will make clear that the equivalences derive directly from the reduction definitions without hidden parameters. revision: yes

  2. Referee: [Abstract] Abstract: the claim that the modal finite-query preorders with the listed admissibility conditions (restricting encodings, decoders, reconstructions, uniformity, and geometric naturality) preserve exactly two minimal exact sources under the CH23 geometric modality is load-bearing for the reformulation result. A concrete theorem or proposition showing how these restrictions block the raw equivalences while the modality (generated by representation inclusions, unitary/graph relabelings, and neutral stabilizations) remains non-collapsing would be required to substantiate the two-source structure.

    Authors: We concur that a dedicated theorem is necessary to substantiate this key claim. In the revision, we will introduce Theorem 5.3 in Section 5, which explicitly shows that the admissibility conditions prevent the collapse seen in the raw case by restricting the allowed encodings and reconstructions, while proving that the CH23 geometric modality does not collapse the two sources. The theorem will include the verification that the modality generated by the listed operations is non-collapsing. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The derivation introduces raw finite-query reductions that collapse the CH23 ambient to a single principal source via explicit equivalences (diagonal spectral and fixed-ε pseudospectral problems, including TTE equivalence for computable ε), then defines modal finite-query preorders with explicit admissibility restrictions on encodings/decoders/reconstructions/uniformity/geometric naturality. It characterizes TTE transport as computable point transport with uniform finite interface trace (implying strong Weihrauch reducibility strictly), and generates the CH23 geometric modality via representation inclusions, unitary/graph relabelings, and neutral stabilizations. The claim of exactly two minimal exact sources follows directly from applying these new preorders and the modality to the six-problem block; no step reduces by construction to a fitted parameter, self-definition, or load-bearing self-citation, and the result is framed as a calibrated reformulation independent of the raw preorder alone.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

Abstract-only review provides insufficient detail to enumerate specific free parameters, axioms, or invented entities; the work appears to build on standard definitions from computability theory and prior SCI papers without introducing new fitted constants.

invented entities (1)
  • modal finite-query preorders no independent evidence
    purpose: To impose admissibility conditions restricting encodings, decoders, reconstructions, uniformity, and geometric naturality in order to avoid raw collapse
    Introduced to calibrate the exact-basis problem; independent evidence not provided in abstract

pith-pipeline@v0.9.1-grok · 5769 in / 1216 out tokens · 20804 ms · 2026-06-27T05:02:14.830090+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

16 extracted references · 4 linked inside Pith

  1. [1]

    Computing spectra--on the solvability complexity index hierarchy and towers of algorithms

    Jonathan Ben-Artzi, Matthew J Colbrook, Anders C Hansen, Olavi Nevanlinna, and Markus Seidel. Computing spectra--on the solvability complexity index hierarchy and towers of algorithms. arXiv preprint arXiv:1508.03280 , 2015

    arXiv 2015

  2. [2]

    Convergent methods for koopman operators on reproducing kernel hilbert spaces

    Nicolas Boull \'e , Matthew J Colbrook, and Gustav Conradie. Convergent methods for koopman operators on reproducing kernel hilbert spaces. arXiv preprint arXiv:2506.15782 , 2025

    arXiv 2025

  3. [3]

    Weihrauch complexity in computable analysis

    Vasco Brattka, Guido Gherardi, and Arno Pauly. Weihrauch complexity in computable analysis. In Handbook of computability and complexity in analysis , pages 367--417. Springer, 2021

    2021

  4. [4]

    On the algebraic structure of W eihrauch degrees

    Vasco Brattka and Arno Pauly. On the algebraic structure of W eihrauch degrees. Log. Methods Comput. Sci. , 14(4):Paper No. 4, 36, 2018

    2018

  5. [5]

    Empiricism, semantics, and ontology

    Rudolf Carnap. Empiricism, semantics, and ontology. Revue internationale de philosophie , pages 20--40, 1950

    1950

  6. [6]

    Colbrook and Anders C

    Matthew J. Colbrook and Anders C. Hansen. The foundations of spectral computations via the solvability complexity index hierarchy. J. Eur. Math. Soc. (JEMS) , 25(12):4639--4718, 2023

    2023

  7. [7]

    Limits and powers of koopman learning

    Matthew J Colbrook, Igor Mezi \'c , and Alexei Stepanenko. Limits and powers of koopman learning. arXiv preprint arXiv:2407.06312 , 2024

    Pith/arXiv arXiv 2024

  8. [8]

    On the solvability complexity index, the -pseudospectrum and approximations of spectra of operators

    Anders Hansen. On the solvability complexity index, the -pseudospectrum and approximations of spectra of operators. Journal of the American Mathematical Society , 24(1):81--124, 2011

    2011

  9. [9]

    Alexander S. Kechris. Classical descriptive set theory , volume 156 of Graduate Texts in Mathematics . Springer-Verlag, New York, 1995

    1995

  10. [10]

    Two dogmas of empiricism

    Willard Van Orman Quine. Two dogmas of empiricism. Perspectives in the Philosophy of Language , pages 189--210, 2000

    2000

  11. [11]

    Residual sci upper bounds and lower witnesses for koopman approximate point spectra in L ^p for 1<p< : Extended version

    Christopher Sorg. Residual sci upper bounds and lower witnesses for koopman approximate point spectra in L ^p for 1<p< : Extended version. arXiv preprint arXiv:2509.16016v3 , 2025

    Pith/arXiv arXiv 2025

  12. [12]

    Foundational analysis of the solvability complexity index: The weihrauch-sci intermediate hierarchy

    Christopher Sorg. Foundational analysis of the solvability complexity index: The weihrauch-sci intermediate hierarchy. arXiv preprint arXiv:2603.18955v2 , 2026

    Pith/arXiv arXiv 2026

  13. [13]

    From witness-space sharpness to family-pointwise exactness for the solvability complexity index

    Christopher Sorg. From witness-space sharpness to family-pointwise exactness for the solvability complexity index. arXiv preprint arXiv:2604.12750v2 , 2026

    Pith/arXiv arXiv 2026

  14. [14]

    The semantic conception of truth and the foundations of semantics

    Alfred Tarski. The semantic conception of truth and the foundations of semantics. Philos. and Phenomenol. Res. , 4:341--376, 1944

    1944

  15. [15]

    Trefethen and Mark Embree

    Lloyd N. Trefethen and Mark Embree. Spectra and pseudospectra . Princeton University Press, Princeton, NJ, 2005. The behavior of nonnormal matrices and operators

    2005

  16. [16]

    Computable analysis: an introduction

    Klaus Weihrauch. Computable analysis: an introduction . Springer Science & Business Media, 2000

    2000