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.
Regularized LM decreases the local solution error
Statement
Assume Countable Choice. Let be real Hilbert spaces, let be bounded linear with Hilbert adjoint , and let and . Suppose , , , and is the unique minimizer of Assume its residual forcing and the range-approximation condition are Then If also for some , then
Statement references
Facts & Assumptions
Given: Countable Choice; real Hilbert spaces ; bounded linear with adjoint ; ; ; , , ; a unique minimizer with ; and .
Countable Choice is the assumed principle used by the adjoint and shifted-normal-operator interfaces (The Axiom of Countable Choice ()).
In the substitution and , the regularized LM algorithm takes its exact increment to be a global minimizer of this same quadratic (Regularized nonlinear Levenberg–Marquardt with discrepancy stopping).
The residual after the selected increment has norm , and the range-approximation residual satisfies (The regularized LM step and residual-forcing parameter exist, Product condition gives the LM range-approximation bound).
The adjoint identity gives (The Hilbert-space adjoint of a bounded operator).
For a real scalar , ; Cauchy–Schwarz gives (Basic properties of the absolute value, Cauchy–Schwarz: , with equality exactly for dependent pairs).
The adjoint satisfies (Hilbert-adjoint identities).
The operator norm of a bounded map is the supremum of over the unit ball (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
The real Hilbert norm satisfies the triangle inequality (The induced length is a norm).
In a real Hilbert space, (Real and complex inner-product spaces and their induced length).
Proof
For any and , expansion using [F6] gives Since is a global minimizer, this is nonnegative for every . Its linear coefficient must therefore vanish: if it were nonzero, a sufficiently small of the opposite sign would make the displayed difference negative. By [F3], for every ; taking and using positive definiteness gives . Set , so . Therefore [F3] gives , and taking the inner product of with gives .
Put . By [F6] and step 1.1, Indeed, ; substitute this into and use .
By [F2], and . Thus [F4] gives . Substituting this and into step 2.1 yields which is the first claim.
Applying to and using gives . By [F8], . The unit-ball definition [F7] gives and : if an input vector is nonzero, divide it by its norm to place it in the unit ball; if it is zero, the bound is immediate. Then [F5] gives . Thus, using and the forcing equality, Since , divide by and rearrange using to obtain .
Remarks
Apply the lemma in the iteration with , , and . By [F1], the algorithm's exact increment is the required minimizer. Then is the negative of the linearized residual at , so their norms agree. The proof uses Countable Choice through the Hilbert-adjoint and normal-operator interfaces; it does not use full AC, DC, or HB. The first estimate is conditional on the exact residual-forcing step and the stated range-approximation inequality. It is not a claim about arbitrary inexact solutions of the normal equation.
Depends on
- Regularized nonlinear Levenberg–Marquardt with discrepancy stopping
- Product condition gives the LM range-approximation bound
- The regularized LM step and residual-forcing parameter exist
- Hilbert space
- The Hilbert-space adjoint of a bounded operator
- A bounded linear operator between normed spaces
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- Real and complex inner-product spaces and their induced length
- Basic properties of the absolute value
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Hilbert-adjoint identities
- The induced length is a norm
Used by
Dependency tree · two levels
44 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
- Christian Clason, Regularization of Inverse Problems, Lemma 11.9 and proof of Theorem 11.11 (standard reference, not scraped)