Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pass
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 I={j∈N:j≥1} and X=Y=ℓ2(I,R), let Aej=2−jej for the standard unit vectors ej, and take ω=1, exact solution x†=0, and exact data y=0. For δ>0 let yjδ=δ 2−j/2, so ∥yδ−y∥=δ. The un-stopped Landweber residual tends to zero, but the reconstruction norms are unbounded along the subsequence kj=4j.

Facts & Assumptions

Given: The diagonal operator, exact solution and noisy data in the Example. Here ej is the sequence with coordinate 1 at j and 0 elsewhere. Let xkδ be the associated infinite mathematical path of Landweber iteration with discrepancy and budget statuses, with discrepancy and finite-budget tests suppressed.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed by the Hilbert-adjoint and compact spectral-filter suppliers used here.

[F1]

Landweber iteration with discrepancy and budget statuses: Its infinite mathematical path satisfies xk+1=xk+A∗(yδ−Axk) when ω=1.

[F2]

Landweber iterates and residuals are spectral-filter iterates: xk=gk(A∗A)A∗yδ and yδ−Axk=(I−AA∗)kyδ.

[F3]

Bounded finite rank operators are compact: Every bounded linear operator between normed spaces whose range has an ordered basis of finite length is compact.

[F4]

Norm limit of compact operators is compact: An operator-norm limit of compact operators is compact.

[F5]

The operator norm as the least bound and as the unit-sphere or unit-ball supremum: The operator norm is the supremum of ∥Tx∥ over vectors with ∥x∥≤1.

[F6]

The Hilbert-space adjoint of a bounded operator: ⟨Ax,y⟩=⟨x,A∗y⟩ for all x,y∈ℓ2.

[F7]

The real square-summable sequence space is complete: The real square-summable sequence space with its canonical inner product is a Hilbert space.

[F8]

Square-summable families on an arbitrary index set and the space ℓ2(I): ∥x∥22=∑j∣xj∣2, and ℓ2 uses the canonical coordinate inner product.

Verification

Given: The hypotheses above and kj=4j.

1.1F3F4F5F7F8givenalgebra

Reindexing by n↦n+1 is a linear isometry from ℓ2(I,R) onto ℓ2(N,R), so [F7] makes X=Y Hilbert spaces. All coordinates below are indexed by j≥1, and (Ax)j=2−jxj. By [F8], ∥Ax∥2=∑j≥14−j∣xj∣2≤14∥x∥2, with equality at e1; hence A is bounded linear and [F5] gives ∥A∥=1/2. The truncation (ANx)j=2−jxj for j≤N and 0 otherwise satisfies ∥ANx∥2=∑j=1N4−j∣xj∣2≤14∥x∥2. It is bounded linear with range having ordered basis e1,…,eN (the empty basis if N=0), so [F3] makes it compact. Also ∥A−AN∥=sup⁡j>N2−j=2−(N+1)→0, so [F4] makes A compact. Thus 0<ω=1<2/∥A∥2=8. The data norm is ∥yδ∥2=δ2∑j=1∞2−j=δ2.

1.2A1F1F2F6F8givenchoosealgebra

By [F6] and [F8], A∗ej=2−jej: for every x, ⟨Ax,ej⟩=2−jxj=⟨x,2−jej⟩, and the adjoint is unique. Thus AA∗ej=4−jej, and the un-stopped path from [F1] has residual coordinates given by [F2]: δ2−j/2(1−4−j)k. Their squared sum is dominated termwise by δ22−j, whose tail tends to zero by the geometric-series formula. Given ϵ>0, 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 k, so the residual norm is nonincreasing.

2.1A1F2givenalgebra∎

Here A∗Aej=4−jej. Substituting into [F2] gives xk,jδ=δ2j/2(1−(1−4−j)k). For an integer n≥2, Bernoulli's inequality gives (1+1/(n−1))n≥1+n/(n−1)>2, hence (1−1/n)n<1/2. Taking n=4j shows ∣xkj,jδ∣≥δ2j/2/2, which tends to infinity. Thus ∥xkjδ−x†∥→∞ although the residual tends to zero; this is semiconvergence and shows why the method needs an explicit stopping rule.

Depends on

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