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.
Unanchored Levenberg–Marquardt step with explicit early stopping
Definition
Assume Countable Choice, as required for the Hilbert-space adjoints in the normal equation.
Let be Hilbert spaces over the same field , let be open, and let be continuously Fréchet differentiable over . In the complex case, each is a bounded complex-linear operator and the Fréchet remainder is measured over complex increments, so Inputs are , noisy data , a bound , a discrepancy factor , a finite budget , and parameters and . The output is a tuple . Starting with , repeat the following checks and update. If return . Otherwise put and . Before computing an update, if , return . If , return .
For , solve the unique Hilbert-space Tikhonov normal equation and set , then replace by and repeat the checks. The shifted normal operator is invertible by The shifted Hilbert-space normal operator is invertible with inverse norm at most . If the new iterate leaves , the next check returns domain-failure. The procedure asserts no convergence theorem; its prescribed step is the unanchored Levenberg–Marquardt form used in the assigned contract.
Depends on
- Hilbert space
- The Hilbert-space adjoint of a bounded operator
- A bounded linear operator between normed spaces
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The natural numbers $\mathbb{N}$ (von Neumann)
- Integer powers $a^m$
- The shifted Hilbert-space normal operator is invertible with inverse norm at most $1/\lambda$
Used by
Dependency tree · two levels
42 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, full lecture notes (standard reference, not scraped)
- Qinian Jin, A convergence analysis of the iteratively regularized Gauss-Newton method under Lipschitz condition (standard reference, not scraped)
- Barbara Kaltenbacher, Methods for Inverse Problems: IV. Newton type methods, author lecture notes (standard reference, not scraped)