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.
Landweber semiconvergence for diagonal noisy data
Example
Let and , let for the standard unit vectors , and take , exact solution , and exact data . For let , so . The un-stopped Landweber residual tends to zero, but the reconstruction norms are unbounded along the subsequence .
Facts & Assumptions
Given: The diagonal operator, exact solution and noisy data in the Example. Here is the sequence with coordinate at and elsewhere. Let be the associated infinite mathematical path of Landweber iteration with discrepancy and budget statuses, with discrepancy and finite-budget tests suppressed.
The Axiom of Countable Choice (): Countable Choice is assumed by the Hilbert-adjoint and compact spectral-filter suppliers used here.
Landweber iteration with discrepancy and budget statuses: Its infinite mathematical path satisfies when .
Bounded finite rank operators are compact: Every bounded linear operator between normed spaces whose range has an ordered basis of finite length is compact.
Norm limit of compact operators is compact: An operator-norm limit of compact operators is compact.
The operator norm as the least bound and as the unit-sphere or unit-ball supremum: The operator norm is the supremum of over vectors with .
The real square-summable sequence space is complete: The real square-summable sequence space with its canonical inner product is a Hilbert space.
Square-summable families on an arbitrary index set and the space : , and uses the canonical coordinate inner product.
Verification
Given: The hypotheses above and .
Reindexing by is a linear isometry from onto , so [F7] makes Hilbert spaces. All coordinates below are indexed by , and . By [F8], , with equality at ; hence is bounded linear and [F5] gives . The truncation for and otherwise satisfies . It is bounded linear with range having ordered basis (the empty basis if ), so [F3] makes it compact. Also , so [F4] makes compact. Thus . The data norm is .
By [F6] and [F8], : for every , , and the adjoint is unique. Thus , and the un-stopped path from [F1] has residual coordinates given by [F2]: . Their squared sum is dominated termwise by , whose tail tends to zero by the geometric-series formula. Given , choose a finite initial segment with omitted bound below ; on that finite segment every residual coordinate tends to zero. Hence the full squared residual sum tends to zero. Each coordinate factor also decreases with , so the residual norm is nonincreasing.
Here . Substituting into [F2] gives . For an integer , Bernoulli's inequality gives , hence . Taking shows , which tends to infinity. Thus although the residual tends to zero; this is semiconvergence and shows why the method needs an explicit stopping rule.
Depends on
- Landweber iteration with discrepancy and budget statuses
- Landweber iterates and residuals are spectral-filter iterates
- Compact linear operator
- Bounded finite rank operators are compact
- Norm limit of compact operators is compact
- The real square-summable sequence space is complete
- Square-summable families on an arbitrary index set and the space $\ell^2(I)$
- The Hilbert-space adjoint of a bounded operator
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- The natural numbers $\mathbb{N}$ (von Neumann)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
70 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
- Christian Clason, Regularization of Inverse Problems, full lecture notes (standard reference, not scraped)
- Per Christian Hansen, Introduction to Inverse Problems, Chapter 6: Iterative Methods (standard reference, not scraped)