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 joint relaxed objective controls Bregman and range errors
Statement
Let . Let be real Banach spaces, a closed linear subspace, a domain containing and , and . Let , , and satisfy on , with bijective and Lipschitz with constant on . Let be a bounded linear projection such that , , and for an exact solution ; put . Assume the projected points belong to for all admitted .
Let be proper and convex, choose , and suppose that for some , , and continuous nondecreasing concave with , the variational source inequality
holds whenever and , where . Set in the joint objective. Let satisfy and exactly when , and assume there is a constant such that
For , let satisfy . Let , , and let be an -minimizer of the joint objective, meaning
Assume lies in the stated VSC sublevel. Define
and
Then
Statement references
Facts & Assumptions
Given: The Banach spaces, range factorization, projection, regularizer, VSC, compatibility inequality, exact datum, noise bound, and approximate minimizer in the Statement.
The candidate projected point belongs to and satisfies , so the VSC applies to it.
The noisy datum and approximate-minimizer tolerance satisfy the bounds in the Statement.
The projection-coupling bound holds for all range variables in the Statement.
Differential range invariance for Banach-space maps: for every in the range-factorization domain.
Joint and frozen-Newton objectives for range-invariant relaxations: with , the joint objective is .
Banach-space convex subgradients and dual pairings: means for every .
Variational source conditions on a regularizer sublevel: on the named regularizer sublevel, .
Proof
Compare the approximate-minimum inequality with . By [F1], , while and . Since and , the comparison regularizer is , so its objective is at most . Writing the estimated data residual as , the triangle inequality gives . For the power inequality is equality; for , has for and is continuous at zero, so it is convex on ; midpoint convexity gives for . Rearranging yields . Combining this with the comparison and gives .
By [F3], is a subgradient at , and [F4] gives . The VSC [F5] therefore implies . Substituting this lower bound in step 1.1 yields .
Put , so . Since , assumption [A3] and the triangle inequality give . Lipschitz continuity of gives . Applying [F1] at and , then applying twice, yields . Monotonicity of gives .
Substitute the last bound from step 2.2 into the inequality from step 2.1. This gives , as claimed.
Depends on
Used by
Dependency tree · two levels
11 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.