Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Anchored IRGNM error identity and fixed-reference residual inequality

Statement

Assume AC. Let X,Y be real or complex Hilbert spaces over the same scalar field, let U⊆X be open, and let B=B‾(x†,ρ)⊆U be convex. Let F:U→Y continuously Fréchet differentiable over that field (bounded complex-linear derivatives in the complex case). Set A=F′(x†), S=A∗A and y=F(x†). Suppose for each x∈B that F′(x)=(I+Rx)A for a bounded linear Rx:Y→Y with ∥Rx∥≤κ<1, taking Rx†=0. Let x∈B, e=x−x†, e0=x0−x†=Sνw, 0<ν≤1/2, ∥w∥≤W, and ∥yδ−y∥≤δ. For a single exact anchored update with shift α>0, define e+=x+−x†, v=∥Ae∥, v+=∥Ae+∥, R=Rx, H=R+R∗+R∗R, θ=2κ+κ2, d0=2κ(1+κ), and c0=1+κ. Then t=F′(x)e−(F(x)−y),z=(I+R)∗(yδ−y+t)−HAe+, (S+αI)e+=αe0+A∗z,∥z∥≤c0δ+d0v+θv+. Consequently (1−θ)v+≤Wαν+1/2+d0v+c0δ,∥e+∥≤Wαν+c0δ+d0v+θv+2α. Also for x,u∈B, (1−κ)∥A(x−u)∥≤∥F(x)−F(u)∥≤(1+κ)∥A(x−u)∥, and the tangential-cone condition holds with constant 2κ/(1−κ). The conclusions require only the current state and segment in B, not the next state in B.

Facts & Assumptions

Given: The objects, source condition, current admissible state and exact anchored step in the Statement.

[A1]

The Axiom of Choice: AC supplies the field-complete functional calculus and the inherited Countable Choice for adjoints and the segment integral.

[F1]

Anchored iteratively regularized Gauss-Newton with finite discrepancy stopping specifies the anchored correction equation. Here a single exact anchored update means x+=x+s, where (F′(x)∗F′(x)+αI)s=F′(x)∗(yδ−F(x))+α(x0−x). This is a standalone step at the specified x∈B with anchor x0∈X, not a run initialized at x0.

[F2]

Real and complex Hilbert source powers and fixed-reference Tikhonov filter bounds: source bias, source residual, normal-noise and pushed residual bounds hold in both fields.

[F3]

Taylor expansion with integral remainder for Banach-valued curves, Linearity of the Bochner integral and Bochner integral norm inequality: a continuously differentiable segment curve has increment the integral of its derivative, and the integral norm is bounded by the integral of the norm.

[F4]

Hilbert-adjoint identities: adjoints reverse products, preserve the norm and satisfy the conjugate-linear sum identities.

Proof

1.1A1F3givenalgebra

For h=x−u, let γ(s)=F(u+sh). The segment lies in B. If h≠0 and 0<s<1, then for real r→0 with s+r∈[0,1], same-field Fréchet differentiability gives ∥F(u+(s+r)h)−F(u+sh)r−F′(u+sh)h∥=∥F(u+(s+r)h)−F(u+sh)−F′(u+sh)(rh)∥∣r∣⟶0. Thus γ′(s)=F′(u+sh)h. For h=0 the curve is constant. In either case differentiability makes γ continuous by the Fréchet remainder definition, and this derivative is continuous on the segment with endpoint extensions because the assumed continuous Fréchet differentiability makes s↦F′(u+sh) continuous in operator norm, including at s=0,1, and evaluation at the fixed vector h is continuous. Applying the Banach-valued fundamental theorem [F3] and subtracting the constant integral of Ah gives F(x)−F(u)−Ah=∫01(F′(u+sh)−A)h ds. Linearity of Ru+sh and its norm bound make the integrand norm at most κ∥Ah∥, so the integral has that bound. The triangle and reverse triangle inequalities give the two-sided estimate. Subtracting (F′(u)−A)h bounds the linearization remainder by 2κ∥Ah∥, proving the cone constant. This integrates the continuous vector F′(u+sh)h, not a possibly unmeasurable choice of the operators Ru+sh. Taking u=x† also gives ∥t∥≤2κv.

1.2A1F1F2F4givenalgebra

Let Ax=F′(x). Since Ax is bounded and α>0, [F2] applied to Ax supplies the inverse defining the unique correction in [F1] for every anchor x0∈X; no evaluation at x0 is required. Adding (Ax∗Ax+αI)e to that correction equation gives (Ax∗Ax+αI)e+=αe0+Ax∗(yδ−y+t). By factorization and [F4], Ax∗Ax=S+A∗HA and Ax∗=A∗(I+R)∗. Moving A∗HAe+ to the right gives the fixed-reference identity with z in the Statement. The inverse used here exists independently of where x+ lies.

2.1F4step 1.1step 1.2algebra

By [F4], ∥H∥≤2κ+κ2=θ and ∥(I+R)∗∥≤1+κ. Combining these bounds with ∥t∥≤2κv proves ∥z∥≤c0δ+d0v+θv+.

3.1A1F2step 1.2step 2.1algebra∎

Apply A(S+αI)−1 to step 1.2 and use [F2] with e0=Sνw. Then v+≤Wαν+1/2+∥z∥; moving θv+ to the left gives the residual inequality. Applying (S+αI)−1 without A instead gives ∥e+∥≤Wαν+∥z∥/(2α), proving the error bound. This controls the fixed source term through its spectral filter, not through a crude α−1∥e0∥ estimate.

Depends on

Used by

Dependency tree · two levels

35 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