Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 T:X→Y be an injective compact linear operator of infinite rank between separable real Hilbert spaces (each with a countable dense subset), and assume T is Hilbert–Schmidt, meaning that for its positive singular values sj the sum ∑j≥1sj2 is finite. Put S=T∗T, λj=sj2, and λ1=∥S∥, with the positive eigenvalues listed with multiplicity in nonincreasing order. Let φ:[0,∞)→[0,∞) be continuous and strictly increasing with φ(0)=0, and take its inverse on its range. Assume the paper's convexity condition on the spectral range: x↦xφ−1(x) is convex for 0≤x≤φ(λ1)2. Define the source class Wφ(ρ):={φ(S)w:w∈X, ∥w∥X≤ρ} for ρ>0; equivalently, it is the source ball with singular-value index ψ(t)=φ(t2).

An ordered spectral filter is a family of functions qα:[0,λ1]→[0,∞) indexed by a set A⊂(0,∞) with 0 as an accumulation point, such that for constants Cq′<∞ and Cq′′=1,

0≤αqα(x)≤Cq′,0≤xqα(x)≤1,

and qα(x)≤qα~(x) whenever α~<α, for every x∈[0,λ1]. The index function φ is a qualification of this filter if for some Cφ<∞,

sup⁡0≤x≤λ1φ(x)(1−xqα(x))≤Cφφ(α)(α∈A).

For α∈A, define the variance function

VT,q(α):=∑j≥1λjqα(λj)2.

For σ>0, a decreasing candidate sequence (αm)m∈N0 in A has geometric variance growth if VT,q(α0)>0 and there are constants 1<θ1≤θ2<∞ such that

θ1≤VT,q(αm)VT,q(αm−1)≤θ2(m≥1).

Set vm:=σ2VT,q(αm) and

um:=σ2sup⁡j≥1λjqαm(λj)2,

the operator norm of the estimator-noise covariance in the singular basis. The bound qαm(λj)≤Cq′/αm and ∑jλj<∞ make each um and vm finite. The finite candidate set ends at

mmax⁡:=min⁡{m∈N0:vm≥1}.

The geometric lower bound vm≥v0θ1m makes this index finite.

Remarks

The source class agrees with the earlier singular-value convention because its multiplier at a singular value sj is ψ(sj)=φ(sj2)=φ(λj). The variance function is finite for every fixed α∈A: the filter bound gives qα(λj)≤Cq′/α and ∑jλj<∞.

Depends on

Used by

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