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.
Tikhonov has qualification one for source powers of the Gram operator
Statement
Assume Countable Choice. Let be compact between real or complex Hilbert spaces, put , and suppose with and . Then for every the exact-data Tikhonov bias satisfies Equivalently, the Tikhonov residual filter has qualification at least one in the convention of Compact spectral filters, source conditions, and qualification.
Facts & Assumptions
Given: Countable Choice, compact , , a source representation with and , and .
The Axiom of Countable Choice (): Countable Choice is required by the compact self-adjoint spectral theorem used for .
A compact Hilbert-space Gram operator is positive and has the forward kernel: is compact, positive and self-adjoint.
Spectral theorem for compact self adjoint operators: The nonzero eigenspaces of are orthogonal and the finite-subset spectral sums converge in norm.
Compact spectral filters, source conditions, and qualification: The Tikhonov residual multiplier is , and is the multiplier on positive eigenvalues and zero on the kernel.
Proof
On the eigenspace with , the exact-data regularization error multiplies the source coefficient by ; on the source multiplier is zero. Orthogonality in [F2] and the definition in [F3] therefore give
Put . If , then . If , then because . Thus for every .
Applying the orthogonal norm formula to step 1.1 and using step 1.2 gives Taking nonnegative square roots proves the bound. The scalar inequality in step 1.2 is the qualification condition from [F3] with .
Depends on
Used by
Dependency tree · two levels
54 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
- Guido Clason, Regularization of Inverse Problems, full lecture notes (standard reference, not scraped)
- Per Christian Hansen, Introduction to Inverse Problems, Chapter 4: Regularization Methods (standard reference, not scraped)