Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 A:X→Y be a nonzero compact operator between real or complex Hilbert spaces, set T=A∗A, choose 0<ω<2/∥A∥2, and let y=Ax† with x†∈(ker⁡A)⊥. Let xk be the exact-data Landweber iterates in the infinite recurrence-defined path of Landweber iteration with discrepancy and budget statuses for datum y; this path depends on A,ω,y and not on a finite cap or stopping test. Put rk(t)=(1−ωt)k. Then ∥xk−x†∥ is nonincreasing and xk→x† in norm. For every s>0, if x†=Tsw with w∈X, then for k≥1, ∥xk−x†∥≤Cs,A,ω∥w∥k−s. The scalar filter also satisfies sup⁡t∈Σts∣rk(t)∣≤Cs,A,ωk−s, where Σ is the set of nonzero eigenvalues of T. For noisy data yδ with ∥yδ−y∥≤δ, let xkδ be the infinite recurrence-defined path for datum yδ. It satisfies ∥xkδ−xk∥≤2ωk δ. Consequently, under the source condition x†=Tνw, 0<ν≤1, the total error obeys ∥xkδ−x†∥≤Cν,A,ω∥w∥k−ν+2ωk δ.

Facts & Assumptions

Given: Countable Choice; the stated A,ω,y,x†; and T=A∗A.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed by the Hilbert-adjoint and compact spectral theorem suppliers used in this proof.

[F1]

Landweber iterates and residuals are spectral-filter iterates: For the infinite mathematical path, xk=gk(T)A∗yδ and, for exact data, x†−xk=rk(T)x†.

[F2]

Compact spectral filters, source conditions, and qualification: Tν and the filters are defined by their scalar values on the nonzero eigenvalues of the compact positive operator T.

[F3]

A compact Hilbert-space Gram operator is positive and has the forward kernel: T is compact positive self-adjoint and ker⁡T=ker⁡A.

[F4]

Hilbert-adjoint identities: ∥A∗A∥=∥A∥2 and ∥Q∥2=∥QQ∗∥ for bounded Hilbert-space operators.

[F5]

Orthogonality and the orthogonal complement: x†∈(ker⁡A)⊥ means it has no component in the zero eigenspace of T.

[F6]

Spectral theorem for compact self adjoint operators: The nonzero eigenspaces of compact self-adjoint T are mutually orthogonal, at most countably many, and together with ker⁡T have dense span in X.

[F7]

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 M=∥A∥2.

1.1A1F1F3F4F5F6givenchoose

For every nonzero eigenvalue t of T, [F3]–[F4] give 0<t≤M, so 0<ωt<2 and ∣1−ωt∣<1. Therefore ∣rk(t)∣ decreases with k and tends to 0. Since x†⊥ker⁡T by [F3] and [F5], [F6] expands it using only positive-eigenvalue components. By [F1], each component of xk−x† is multiplied by −rk(t); its magnitude decreases to zero and is bounded by the corresponding component of x†. Given ϵ>0, choose a finite set of eigenvalues whose omitted squared components of x† 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.

1.2A1F2F3F4givenalgebra

Choose an integer m>s. For v≥0 and an integer n≥0, (1+v)n≥1+nv: induction proves this, since multiplying the bound at n by 1+v gives 1+(n+1)v+nv2≥1+(n+1)v. For k≥2m, let n=⌊k/m⌋, so mn≤k and n≥k/(2m). If 0<t≤min⁡{M,ω−1}, put u=ωt∈(0,1]. At u=1 the filter is zero. If 0<u≤1/k, then us(1−u)k≤k−s. If k≥2m and 1/k<u<1, the identity (1−u)(1+u)=1−u2≤1 gives (1−u)−k≥(1+u)k≥(1+u)mn=((1+u)n)m≥(nu)m. Consequently us(1−u)k≤n−mus−m≤n−mkm−s≤(2m)mk−s. For k<2m the same product is at most 1≤(2m)sk−s. Thus on this range ts∣rk(t)∣=ω−sus(1−u)k≤Cs,ωk−s. If ω−1<t≤M, a range that exists only when ωM>1, then ∣1−ωt∣=ωt−1≤ωM−1=:q∈(0,1). Put a=q−1−1>0. For k≥2m and the same n, q−k=(1+a)k≥(1+a)mn=((1+a)n)m≥(na)m, so ksqk≤(2m)ma−mks−m≤(2m)ma−m. For k<2m, ksqk≤(2m)s. Hence sup⁡k≥1ksqk<∞ and ts∣rk(t)∣≤Msqk≤Cs,M,ωk−s. Combining the two ranges proves sup⁡t∈σ(T)∖{0}ts∣rk(t)∣≤Cs,A,ωk−s.

1.3A1F1F4F7givenalgebra

For k≥1, the scalar geometric identity gives gk(t)=[1−(1−ωt)k]/t for t>0. Since ∣1−ωt∣≤1, both the bound by 2 and the finite-sum bound by kωt hold for its numerator. Hence t ∣gk(t)∣≤min⁡{2/t,ωkt}≤2ωk. The last inequality follows by splitting at t=2/(ωk). For Qk=gk(T)A∗, adjoint multiplication gives QkQk∗=gk(T)Tgk(T)∗, the compact spectral multiplier with scalar values t∣gk(t)∣2 and value zero on ker⁡T. [F7] bounds its norm by the supremum of these values; [F4] and ∥Qk∥2=∥QkQk∗∥ then give ∥Qk∥≤2ωk. Applying [F1] to yδ−y gives ∥xkδ−xk∥=∥Qk(yδ−y)∥≤2ωk δ.

2.1A1F1F2F7step 1.2algebra

Under x†=Tsw, [F1] gives xk−x†=−rk(T)Tsw. On every eigenspace the product multiplier is tsrk(t), bounded by [step 1.2]; [F7] therefore yields ∥xk−x†∥≤sup⁡t>0ts∣rk(t)∣ ∥w∥. Substituting the bound in [step 1.2] proves the source-bias estimate.

3.1step 2.1step 1.3algebra∎

The triangle inequality gives ∥xkδ−x†∥≤∥xkδ−xk∥+∥xk−x†∥; substituting the bounds from [step 2.1] and [step 1.3] proves the final estimate.

Depends on

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