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 converges for exact data and balances source bias with noise
Statement
Assume Countable Choice. Let be a nonzero compact operator between real or complex Hilbert spaces, set , choose , and let with . Let be the exact-data Landweber iterates in the infinite recurrence-defined path of Landweber iteration with discrepancy and budget statuses for datum ; this path depends on and not on a finite cap or stopping test. Put . Then is nonincreasing and in norm. For every , if with , then for , The scalar filter also satisfies where is the set of nonzero eigenvalues of . For noisy data with , let be the infinite recurrence-defined path for datum . It satisfies Consequently, under the source condition , , the total error obeys
Facts & Assumptions
Given: Countable Choice; the stated ; and .
The Axiom of Countable Choice (): Countable Choice is assumed by the Hilbert-adjoint and compact spectral theorem suppliers used in this proof.
Landweber iterates and residuals are spectral-filter iterates: For the infinite mathematical path, and, for exact data, .
Compact spectral filters, source conditions, and qualification: and the filters are defined by their scalar values on the nonzero eigenvalues of the compact positive operator .
A compact Hilbert-space Gram operator is positive and has the forward kernel: is compact positive self-adjoint and .
Hilbert-adjoint identities: and for bounded Hilbert-space operators.
Orthogonality and the orthogonal complement: means it has no component in the zero eigenspace of .
Spectral theorem for compact self adjoint operators: The nonzero eigenspaces of compact self-adjoint are mutually orthogonal, at most countably many, and together with have dense span in .
Bounded multipliers on compact self-adjoint eigenspaces define bounded operators: A bounded scalar multiplier on these eigenspaces defines an operator whose norm is at most the supremum of the multiplier's absolute value.
Proof
Given: The hypotheses and facts above. Write .
For every nonzero eigenvalue of , [F3]–[F4] give , so and . Therefore decreases with and tends to . Since by [F3] and [F5], [F6] expands it using only positive-eigenvalue components. By [F1], each component of is multiplied by ; its magnitude decreases to zero and is bounded by the corresponding component of . Given , choose a finite set of eigenvalues whose omitted squared components of sum to less than ; on the chosen finite set every component tends to zero. The squared error sum therefore tends to at most , and arbitrariness of proves norm convergence. The componentwise decrease also proves monotonicity of the norm.
Choose an integer . For and an integer , : induction proves this, since multiplying the bound at by gives . For , let , so and . If , put . At the filter is zero. If , then . If and , the identity gives . Consequently For the same product is at most . Thus on this range . If , a range that exists only when , then . Put . For and the same , so . For , . Hence and . Combining the two ranges proves .
For , the scalar geometric identity gives for . Since , both the bound by and the finite-sum bound by hold for its numerator. Hence The last inequality follows by splitting at . For , adjoint multiplication gives , the compact spectral multiplier with scalar values and value zero on . [F7] bounds its norm by the supremum of these values; [F4] and then give . Applying [F1] to gives .
Under , [F1] gives . On every eigenspace the product multiplier is , bounded by [step 1.2]; [F7] therefore yields . Substituting the bound in [step 1.2] proves the source-bias estimate.
The triangle inequality gives ; substituting the bounds from [step 2.1] and [step 1.3] proves the final estimate.
Depends on
- Landweber iterates and residuals are spectral-filter iterates
- Landweber iteration with discrepancy and budget statuses
- Compact spectral filters, source conditions, and qualification
- A compact Hilbert-space Gram operator is positive and has the forward kernel
- Spectral theorem for compact self adjoint operators
- Bounded multipliers on compact self-adjoint eigenspaces define bounded operators
- Hilbert-adjoint identities
- Orthogonality and the orthogonal complement
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
60 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
- Per Christian Hansen, Introduction to Inverse Problems, Chapter 6: Iterative Methods (standard reference, not scraped)
- Christian Clason, Regularization of Inverse Problems, full lecture notes (standard reference, not scraped)