Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pendingjudge pass (gpt-6-luna)
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 discrepancy stopping converges under a source condition

Statement

Assume Countable Choice and the hypotheses of Landweber converges for exact data and balances source bias with noise. Let x†=Tνw with 0<ν≤1 and R=∥w∥≥0. Fix τ>1 and δ>0 with ∥yδ−Ax†∥≤δ. Let kδ be the first index on the associated infinite mathematical path satisfying ∥Axkδδ−yδ∥≤τδ, where xkδ is the corresponding noisy-data path. If a finite budget is used, assume it is at least the upper bound Kδ constructed in the proof when R>0. If R=0, the initial iterate is the first crossing and any finite budget suffices. For all sufficiently small δ, ∥xkδδ−x†∥≤Cν,A,ω,τR1/(2ν+1)δ2ν/(2ν+1). The conclusion is conditional on an actual discrepancy crossing; a budget exhaustion status is inconclusive.

Facts & Assumptions

Given: The stated compact operator, Landweber parameter, source condition, noise bound, τ>1, and the first discrepancy index.

[A1]

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

[F1]

Landweber converges for exact data and balances source bias with noise: For every s>0, sup⁡t∈Σts∣rk(t)∣≤Cs,A,ωk−s; the noise amplification is at most 2ωkδ.

[F2]

Landweber iterates and residuals are spectral-filter iterates: yδ−Axkδ=rk(AA∗)yδ and x†−xk=rk(T)x†.

[F3]

Compact spectral filters, source conditions, and qualification: Tν and rk(T) act by their scalar multipliers on each nonzero eigenspace.

[F4]

Hilbert-adjoint identities: ∥Av∥2=⟨A∗Av,v⟩, ∥A∗∥=∥A∥, and ∥Q∥2=∥QQ∗∥ for bounded Hilbert-space operators.

[F5]

Bounded multipliers on compact self-adjoint eigenspaces define bounded operators: A compact spectral multiplier has operator norm at most the supremum of the absolute values of its scalar multipliers.

[F6]

Spectral theorem for compact self adjoint operators: The eigenspaces of compact self-adjoint T are mutually orthogonal and, together with ker⁡T, have dense span.

[F7]

A compact Hilbert-space Gram operator is positive and has the forward kernel: Both A∗A and AA∗ are compact, positive, and self-adjoint; ker⁡(A∗A)=ker⁡A.

Proof

Given: The hypotheses above, with R≥0.

If R=0, then w=0, so x†=0 and y=Ax†=0. The initial iterate x0δ=0 has residual ∥Ax0δ−yδ∥=∥yδ∥≤δ≤τδ. Therefore kδ=0 and the stopped error is zero, which is the stated estimate with R=0 since 0a=0 for every a>0. For the rest of the proof assume R>0. [given, algebra]

1.1A1F1F2F3F4F5F6F7givenconstructalgebra

Put p=ν+12. By [F2], xk−x†=−rk(T)Tνw. The compact spectral expansion [F6], the power convention [F3], and ∥Az∥2=⟨A∗Az,z⟩ from [F4] give ∥Axk−y∥=∥Tprk(T)w∥. The scalar filter bound [F1] therefore gives ∥Axk−y∥≤Cp,A,ωRk−p. Choose Kδ=max⁡ ⁣{1,⌈(Cp,A,ωR(τ−1)δ)1/p⌉}. Then ∥AxKδ−y∥≤(τ−1)δ. By [F2], the noisy residual differs from the exact-data residual by rKδ(AA∗)(yδ−y). [F7] makes AA∗ compact positive self-adjoint, and [F4] gives ∥AA∗∥=∥A∥2. Every eigenvalue t of AA∗ therefore satisfies 0≤t≤∥A∥2, so ∣1−ωt∣≤1 by the step-size hypothesis. [F5] bounds the noise residual by δ. Hence ∥AxKδδ−yδ∥≤τδ, so the first crossing exists and kδ≤Kδ (provided the finite budget reaches Kδ).

1.2A1F2F5givenalgebra

At the crossing, [F2] and the same multiplier estimate [F5] give ∥Axkδ−y∥≤∥Axkδδ−yδ∥+δ≤(τ+1)δ.

2.1A1F2F3F4F6step 1.2algebra

Let v=rkδ(T)w and θ=2ν/(2ν+1). For a finite set E⊆Σ, put at=t2ν+1∥Ptv∥2 and bt=∥Ptv∥2. Then t2ν∥Ptv∥2=atθbt1−θ. If either ∑Eat or ∑Ebt is zero, every summand on the left is zero. Otherwise normalize a~t=at/(∑Eat) and b~t=bt/(∑Ebt). The scalar inequality uθv1−θ≤θu+(1−θ)v follows by minimizing f(s)=θs+(1−θ)−sθ: f′(s)=θ(1−sθ−1) is negative for 0<s<1 and positive for s>1, so f(s)≥f(1)=0. Thus the sum of the normalized products is at most 1, and ∥Tνv∥≤∥Tν+1/2v∥2ν/(2ν+1)∥v∥1/(2ν+1). Since [F6] gives the norm-convergent spectral expansion, increasing finite sets E to Σ passes this inequality to the full sums. Also ∥v∥≤R because ∣rkδ(t)∣≤1. Finally [F2], [F3], [F4], [F6], and [step 1.2] give x†−xkδ=Tνv. For every z∈X, ∥Az∥2=⟨Tz,z⟩=∑t∈Σt∥Ptz∥2=∥T1/2z∥2, so ∥Tν+1/2v∥=∥ATνv∥=∥Axkδ−y∥≤(τ+1)δ. Hence ∥xkδ−x†∥=∥Tνv∥≤((τ+1)δ)2ν/(2ν+1)R1/(2ν+1).

3.1A1F1step 1.1step 2.1algebra∎

From [F1], ∥xkδδ−xkδ∥≤2ωKδδ. Put B=Cp,A,ωR/(τ−1), choosing Cp,A,ω>0. For sufficiently small δ, B/δ≥1, so Kδ=⌈(B/δ)1/p⌉≤2(B/δ)1/p. Therefore 2ωKδδ≤2ω B1/(2p)δ1−1/(2p)=C′R1/(2ν+1)δ2ν/(2ν+1), because 2p=2ν+1. Combining this with [step 2.1] by the triangle inequality proves the claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

61 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