How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Ordered spectral filters, source indices, and variance grids
Definition
Assume Countable Choice. Let be an injective compact linear operator of infinite rank between separable real Hilbert spaces (each with a countable dense subset), and assume is Hilbert–Schmidt, meaning that for its positive singular values the sum is finite. Put , , and , with the positive eigenvalues listed with multiplicity in nonincreasing order. Let be continuous and strictly increasing with , and take its inverse on its range. Assume the paper's convexity condition on the spectral range: is convex for . Define the source class for ; equivalently, it is the source ball with singular-value index .
An ordered spectral filter is a family of functions indexed by a set with as an accumulation point, such that for constants and ,
and whenever , for every . The index function is a qualification of this filter if for some ,
For , define the variance function
For , a decreasing candidate sequence in has geometric variance growth if and there are constants such that
Set and
the operator norm of the estimator-noise covariance in the singular basis. The bound and make each and finite. The finite candidate set ends at
The geometric lower bound makes this index finite.
Definition references
The singular-value source ball convention and spectral multiplier for an index function
Compact spectral multipliers, source powers, and regularizing filters
Positive singular systems and the compact SVD
Countable Choice for the upstream countable singular-system construction
Li and Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, §§3.1.1–3.2.1
Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §§5.1–5.2
Remarks
The source class agrees with the earlier singular-value convention because its multiplier at a singular value is . The variance function is finite for every fixed : the filter bound gives and .
Depends on
Used by
- SOLIT parameter choice on a geometric-variance grid Algorithm
- SOLIT for a Dirichlet second-antiderivative model Example
- SOLIT for the periodic heat equation (reported simulation) Example
- SOLIT in the mean-zero 2D satellite-gradiometry model Example
- Risk decomposition and monotone bias for ordered spectral filters Lemma
- SOLIT oracle risk bound and spectral rates Theorem
Dependency tree · two levels
38 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Housen Li and Frank Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, §§3.1.1–3.2.1 (standard reference, not scraped)
- Christian Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §§5.1–5.2 (standard reference, not scraped)