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 source-condition rates balance noise at qualification one
Statement
Assume Countable Choice. Let be compact between real or complex Hilbert spaces and let with , , and . For data with , the Tikhonov solution satisfies, for every , For , choosing gives The qualification cannot exceed one uniformly over compact operators: for every there is a compact injective diagonal operator and a unit source vector for which the bias is not .
Facts & Assumptions
Given: Countable Choice, compact , , a source representation with and , data with , and .
The Axiom of Countable Choice (): Countable Choice is the compact spectral theorem's choice assumption; the arguments use no full Choice.
Tikhonov has qualification one for source powers of the Gram operator: The exact-data bias is at most .
Hilbert-space Tikhonov amplifies data by at most : The data perturbation is amplified by at most .
Compact spectral filters, source conditions, and qualification: The source condition uses and the Tikhonov residual filter is .
Square-summable families on an arbitrary index set and the space : The sequence space has its canonical norm, inner product, and coordinate vectors.
The real square-summable sequence space is complete: This real sequence space is complete.
Bounded finite rank operators are compact: Every bounded finite-rank operator between normed spaces is compact.
Norm limit of compact operators is compact: A norm limit of compact operators into a Banach space is compact.
Proof
Let . By linearity, . The triangle inequality, [F1], and [F2] give
Fix and take and with standard unit vectors . Relabelling coordinates by the bijection from to is an isometry from the complete space in [F5], so is Hilbert. For , define and, for each , define when and otherwise. These are linear and bounded because and ; has range in . Also , with equality at , so . By [F4]–[F7], is Hilbert and is compact. Since every diagonal coefficient is positive, is injective; , so with the source target is and .
Substituting into the two terms in step 1.1 gives and . Their sum is the stated rate.
For exact data , the first coordinate of the Tikhonov solution is and all other coordinates are zero. Hence , and Thus no constant depending only on and the source radius can give an bias bound uniformly for this compact-operator class when . This proves saturation at qualification one.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Compact spectral filters, source conditions, and qualification
- Tikhonov has qualification one for source powers of the Gram operator
- Hilbert-space Tikhonov amplifies data by at most $1/(2\sqrt{\lambda})$
- Bounded finite rank operators are compact
- Norm limit of compact operators is compact
- Square-summable families on an arbitrary index set and the space $\ell^2(I)$
- The real square-summable sequence space is complete
Used by
Dependency tree · two levels
58 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 5: Regularization Parameter Choice (standard reference, not scraped)