Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pendingjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

The regularized LM step and residual-forcing parameter exist

Statement

Assume Countable Choice. Let X,Y be real Hilbert spaces, let T:X→Y be a bounded linear operator, let r∈Y be nonzero, and let σ∈(0,1) and γ>1. Suppose that a fixed v∈X satisfies ∥Tv−r∥Y≤σγ∥r∥Y. For each α>0, the functional Φα(h):=12∥Th−r∥Y2+α2∥h∥X2(h∈X) has the unique global minimizer hα=(T∗T+αIX)−1T∗r, where T∗ is the Hilbert adjoint and IX is the identity on X. Moreover, there exists at least one α>0 for which ∥Thα−r∥Y=σ∥r∥Y.

Facts & Assumptions

Given: Countable Choice; real Hilbert spaces X,Y; a bounded linear map T:X→Y with Hilbert adjoint T∗; r≠0; 0<σ<1; γ>1; and v∈X with ∥Tv−r∥≤(σ/γ)∥r∥.

[A1]

Countable Choice, written ACω, permits a choice from each countable family of nonempty sets (The Axiom of Countable Choice (ACω)). It is the only choice axiom assumed here.

[F1]

The Hilbert adjoint satisfies ⟨Tx,z⟩Y=⟨x,T∗z⟩X for every x∈X,z∈Y (The Hilbert-space adjoint of a bounded operator).

[F2]

For every α>0, T∗T+αIX is bijective with inverse norm at most 1/α (The shifted Hilbert-space normal operator is invertible with inverse norm at most 1/λ).

[F3]

Since T is bounded linear, there is an operator norm with ∥Tw∥Y≤∥T∥ ∥w∥X for every w∈X (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F4]

In a real Hilbert space, ∥w∥2=⟨w,w⟩ and the inner product is symmetric and bilinear (Real and complex inner-product spaces and their induced length).

[F6]

The norm satisfies the triangle inequality, hence ∣∥u∥−∥v∥∣≤∥u−v∥ (The induced length is a norm).

Proof

1.1A1F1F2givenconstruct

Fix α>0 and write Bα:=T∗T+αIX. By [F2], Bα is bijective, so hα:=Bα−1T∗r is defined and satisfies T∗(Thα−r)+αhα=0.

2.1F1F2F4step 1.1algebra

For any h∈X, set d:=h−hα. Expanding with [F4] gives Φα(h)−Φα(hα)=⟨Thα−r,Td⟩Y+α⟨hα,d⟩X+12∥Td∥Y2+α2∥d∥X2. The first two terms sum to ⟨T∗(Thα−r)+αhα,d⟩X=0 by [F1] and step 1.1. The remaining terms are nonnegative, and because α>0 their sum vanishes only when d=0. Thus hα is the unique global minimizer and Φα(hα)≤Φα(0), so ∥hα∥X≤∥r∥Y/α.

3.1F2F3F6step 1.1step 2.1algebra

Define f(α):=∥Thα−r∥Y. For α,β>0, the inverse identity Bα−1−Bβ−1=(β−α)Bα−1Bβ−1 and [F2] give hα−hβ=(β−α)Bα−1hβ. Therefore, when α,β lie near a fixed α0>0, ∥hα−hβ∥X≤∣β−α∣∥r∥Yαβ, which tends to zero with ∣β−α∣. Thus hα and f(α) are continuous on (0,∞), using [F6] for continuity of the norm.

3.2F3F6step 2.1givenalgebra

By step 2.1 and [F3], ∥Thα∥Y≤∥T∥∥r∥Y/α→0 as α→∞. The reverse triangle inequality from [F6] gives ∣f(α)−∥r∥Y∣≤∥Thα∥Y, so f(α)→∥r∥Y>σ∥r∥Y.

3.3givenstep 2.1constructchoosealgebra

Comparing the minimizer with the fixed vector v gives f(α)2+α∥hα∥X2≤∥Tv−r∥Y2+α∥v∥X2. Because ∥Tv−r∥Y≤(σ/γ)∥r∥Y<σ∥r∥Y, there is a strict squared-norm gap below σ2∥r∥Y2. Also v≠0, since v=0 would contradict the range bound and r≠0. Choose a>0 small enough that ∥Tv−r∥Y2+a∥v∥X2<σ2∥r∥Y2. The minimizer comparison in this step gives f(a)2≤∥Tv−r∥Y2+a∥v∥X2<σ2∥r∥Y2, so f(a)<σ∥r∥Y.

4.1F5step 3.1step 3.2step 3.3construct∎

By step 3.2, choose b>a with f(b)>σ∥r∥Y. Continuity from step 3.1 and [F5] give α∈[a,b] such that f(α)=σ∥r∥Y. Since a>0, this is an admissible positive parameter and proves the forcing claim.

Remarks

The proof uses Countable Choice through the stated Hilbert-adjoint and normal-operator interfaces; it does not use full AC, DC, or HB. The scalar bisection or root-finding cost of a numerical parameter selector is not covered by this existence lemma.

Depends on

Used by

Cited to discharge well-definedness by Regularized nonlinear Levenberg–Marquardt with discrepancy stopping.

Dependency tree · two levels

53 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