Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Compact spectral filters, source conditions, and qualification

Definition

Assume Countable Choice. Let X,Y be real or complex Hilbert spaces and let A:X→Y be compact and bounded. Put S=A∗A. By A compact Hilbert-space Gram operator is positive and has the forward kernel, S is compact, positive, and self-adjoint, with ker⁡S=ker⁡A. Let Σ be the set of nonzero eigenvalues of S and Pt the orthogonal projection onto the eigenspace of t∈Σ; let P0 be the orthogonal projection onto ker⁡S. The compact spectral multiplier of a bounded scalar function q:{0}∪Σ→F is q(S)x:=q(0)P0x+∑t∈Σq(t)Ptx, where the finite-subset net converges in norm by Bounded multipliers on compact self-adjoint eigenspaces define bounded operators. For ν>0, define Sν by the multiplier qν(0)=0 and qν(t)=tν for t>0. This multiplier is bounded: if t∈Σ and u∈Et is a unit vector, then 0<t=∥Su∥≤∥S∥, so ∣qν(t)∣≤∥S∥ν.

For λ>0, the Tikhonov filter and residual filter are gλ(t)=1t+λ,rλ(t)=1−tgλ(t)=λt+λ. The Tikhonov solution for data yδ∈Y is xλδ=gλ(S)A∗yδ=(A∗A+λIX)−1A∗yδ. Indeed, the spectral decomposition gives S+λIX the multiplier t+λ on each Et and λ on ker⁡S, so gλ(S) is its inverse, whose existence is also supplied by The shifted Hilbert-space normal operator is invertible with inverse norm at most 1/λ. The source condition of order ν>0 and radius R≥0 means that x†=Sνw for some w∈X with ∥w∥≤R. A family of filters gα with residual filters rα(t)=1−tgα(t) has qualification at least p>0 when, for each 0<ν≤p, some finite constant Cν≥0 satisfies tν∣rα(t)∣≤Cνανfor every α>0 and t∈Σ. When Σ=∅, this condition is vacuous.

Remarks

The parameter λ here is the coefficient of ∥x∥2 in ∥Ax−yδ∥2+λ∥x∥2. Hansen's discrete slides write this coefficient as λH2, so λ=λH2. Clason writes the source condition as x†=∣A∣μw with ∣A∣=(A∗A)1/2; here μ=2ν. Thus Tikhonov's qualification-one range in the present convention is 0<ν≤1.

Depends on

Used by

Dependency tree · two levels

61 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