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.
Variational source conditions yield nonlinear regularization rates
Statement
Let be real Banach spaces, , and . Let be proper and convex, let , set , and choose . Fix , , and a level . Let be continuous, nondecreasing and concave, with and for , and assume the variational source inequality
where . Extend by on negative arguments and write ; assume is finite for sufficiently large and as . For sufficiently small noise levels and data with , define . Suppose tends to zero, , and is an -minimizer, meaning . Set and . Assume that for constants independent of ,
for all sufficiently small . Then for all sufficiently small , and
If, in addition, for a fixed such that for all sufficiently small , then . If also on for constants , then .
In the Hilbert special case, set and suppose are real Hilbert spaces, has the real open-domain interface of a nonlinear forward map, is an -minimum-norm exact solution, , and the source inequality on a regularizer sublevel contained in is
with and . For exact global minimizers of the nonlinear Tikhonov functional with , the theorem gives and . The assertion is conditional on such a global minimizer being supplied; it does not assert existence or cover local numerical minima.
Statement references
Facts & Assumptions
Given: All hypotheses in the Statement hold. Write , , and .
, is an -minimizer of , and , with .
The VSC holds on with the chosen , , and .
, , , and .
For the optional penalty conclusion, for a fixed that bounds for small .
For the optional norm conclusion, on for constants .
For the Hilbert conclusion, , , the displayed -minimum-norm VSC holds with and , and .
Bregman distances for convex regularizers: and is nonnegative.
A conjugate bound for residual and Bregman errors: from , the stated conjugate bounds hold for and .
Nonlinear forward maps between Hilbert spaces: in the Hilbert specialization is a real-Hilbert forward map on an open domain.
x₀-minimum-norm solutions of nonlinear equations: the Hilbert specialization assumes the exact solution globally minimizes distance to over its exact solution set.
The nonlinear Tikhonov functional: for a datum , .
A norm on a real vector space, the induced metric, and the dictionary with the metric axioms: each Banach norm satisfies the triangle inequality.
Real and complex inner-product spaces and their induced length: a real Hilbert norm satisfies .
Proof
Comparing the approximate-minimum inequality with the exact solution gives . Since the data term is nonnegative, by [A1] and [A3]. As and , for sufficiently small .
By [F5]–[F7] the special case uses the open-domain Hilbert map, the stipulated global -minimum-norm exact solution, and the existing quadratic nonlinear Tikhonov functional. Under [A6], define . By [F10] this is a bounded real-linear functional; expansion using [F9] gives , so [F1] gives and [F2] gives . Taking , the stated Hilbert source inequality implies the VSC with .
By [F8], . For , ; for , is continuous at zero and has nonnegative second derivative on , hence is convex on , and its defining convexity inequality at the midpoint gives . Taking , yields and thus . Substituting into the comparison inequality from 1.1 gives .
For , the conjugate is , by completing the square. With , , so and when . The scale comparability in [A3] also holds because .
By [F2] and [F3], . Combining this with the objective comparison in step 2.1 gives , where .
Apply [F4] with , , , , , and . It follows that and .
From [A1] and [A3], , , and . Thus and . The triangle inequality gives , so the noisy-data residual is .
For the penalty rate, [F2]–[F3] give , while step 1.1 supplies its upper bound. If [A4] holds for a fixed bounding , then . If [A5] also holds, the Bregman bound in step 5.1 gives .
Applying the Bregman bound from step 5.1 and the exact Bregman identity from step 1.2 gives and , hence the asserted solution error and residual.
Depends on
- Banach-space convex subgradients and dual pairings
- A conjugate bound for residual and Bregman errors
- Bregman distances for convex regularizers
- Variational source conditions on a regularizer sublevel
- Nonlinear forward maps between Hilbert spaces
- x₀-minimum-norm solutions of nonlinear equations
- The nonlinear Tikhonov functional
- A norm on a real vector space, the induced metric, and the dictionary with the metric axioms
- Real and complex inner-product spaces and their induced length
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
Used by
Dependency tree · two levels
38 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, Theorem 10.7 (standard reference, not scraped)
- Frederic Weidling, Variational Source Conditions and Conditional Stability Estimates for Inverse Problems in PDEs, Theorem 2.20 (standard reference, not scraped)
- Barbara Kaltenbacher, Convergence rates under a range invariance condition with application to electrical impedance tomography, Lemma 2 and Theorem 3 (standard reference, not scraped)