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.
Dual attainment and convergence of TV source certificates
Statement
Assume Countable Choice. Let and be real Hilbert spaces, let be bounded and real-linear, and let be one of the full-space, Dirichlet, or Neumann TV functionals. Assume that is proper, convex, lower semicontinuous, and positively one-homogeneous, and that is a minimum- exact solution of with a dual source certificate , so . Define and for and .
For each and , has a unique maximizer on , namely . If is any supplied global minimizer of , then , , and . For every such supplied minimizer, the correctly normalized primal-dual value identity is
Let and let be its unique minimum-norm element. For every sequence with , strongly in and strongly in . For every and ,
Moreover, for any the certificate yields a variational source condition on with exponent , coefficient , and index function . Consequently, if , , , and exact global minimizers are supplied, then the variational-source rate theorem gives
Statement references
Facts & Assumptions
Given: Countable Choice, the real Hilbert spaces and map in the Statement, a minimum-TV exact solution, a dual source certificate, and (where specified) supplied global minimizers.
Countable Choice supplies the nearest-point minimizing sequences and weakly convergent subsequences used below. (The Axiom of Countable Choice ())
Dual source certificates for TV regularization: is an exact minimum-TV solution and ; the Hilbert adjoint satisfies .
Banach-space convex subgradients and dual pairings: exactly when for every .
Fenchel–Young equality for a Banach regularizer: if and only if .
Variational source conditions on a regularizer sublevel: on a named sublevel, .
Variational source conditions yield nonlinear regularization rates: when the exact global minimizer, noise bound, sublevel VSC, and conjugate parameter coupling hold, the Bregman distance and noisy residual have the displayed rates.
Cauchy–Schwarz: , with equality exactly for dependent pairs: in a real Hilbert space.
Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence: every bounded real sequence has a convergent subsequence.
Riesz representation for Hilbert spaces: every bounded linear functional on a real Hilbert space is inner product with a vector in that space.
Real and complex inner-product spaces and their induced length: the real Hilbert norm satisfies .
Proof
Put . Applying [F2] at with and , and using and , gives . For arbitrary , [F2] then yields , so and . Every satisfies ; equality holds for . Thus is nonempty, closed, and convex.
The set is nonempty because , convex by the subgradient inequality, and closed because is an intersection of closed half-spaces and is continuous. For any nonempty closed convex subset of a Hilbert space, let and use Countable Choice to select with . The midpoint belongs to , so the parallelogram identity gives ; thus is Cauchy. Completeness and closedness yield a nearest point, and strict convexity of squared norm makes it unique. Applying this to and defines their projections.
Completing the square gives . Hence its unique maximizer on is .
Let be a supplied global minimizer and put . For any and , objective minimality and expansion of the square give . As , the lower limit of these secants is at least ; convexity makes the unit secant at least every smaller positive secant, so . This for every proves . Applying [F2] with and gives , and then [F2] for arbitrary gives , so . By [F4] at , for every ; Fenchel–Young in [F4] therefore gives . Thus . Hence . Finally , so , establishing the normalized value identity in the Statement.
If and , minimizing squared distance along the segment from to any gives . Apply this with , and the corresponding inequality for with . Adding yields by [F7], so . Taking and proves the first noise-stability bound; applying proves the second.
Write . Maximality against and the support bound give and . The closed span of any subsequence is separable; Gram–Schmidt on rational finite linear combinations of its terms gives a finite or countable orthonormal family with dense span. Repeated use of [F8] and [A1] selects a further subsequence whose coordinates all converge. For each finite initial segment, expanding the nonnegative squared norm after orthogonal projection shows that the sum of squared limiting coordinates is at most ; hence the coordinates define a vector in that closed span. Approximation by finite linear combinations proves weak convergence there, and [F9] represents each functional restricted to the span, so convergence is weak in . The limit lies in : by [F2], , an intersection of weakly closed half-spaces. It also attains , so . Weak lower semicontinuity of the norm and the bound force , hence uniqueness gives . Every subsequence therefore has a further subsequence weakly converging to ; testing against any fixed shows that every scalar subsequence has a further subsequence converging to , so . Thus . Weak lower semicontinuity and the uniform upper bound then give . The norm identity [F10] yields strong convergence, and boundedness of yields strong convergence of .
For , [F1] and [F7] give . Therefore the VSC [F5] holds with , , and , , on every regularizer sublevel; [F3] identifies its Bregman term with the distance in the Statement. Its conjugate is for . For an exact minimizer with , comparison to gives ; if , this is below any fixed for small . With , and , so all parameter-coupling hypotheses in [F6] hold and the stated rates follow.
Depends on
- Dual source certificates for TV regularization
- Bregman distances for convex regularizers
- Spatial BV and distributional total variation
- Full-space, Dirichlet, and Neumann TV conventions
- Banach-space convex subgradients and dual pairings
- Variational source conditions on a regularizer sublevel
- Fenchel–Young equality for a Banach regularizer
- Variational source conditions yield nonlinear regularization rates
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- 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
- Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence
- Riesz representation for Hilbert spaces
Used by
Dependency tree · two levels
55 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
- José A. Iglesias, Gwenael Mercier, and Otmar Scherzer, A note on convergence of solutions of total variation regularized linear inverse problems, Theorem 1, Proposition 3, and their complete proofs (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)
- Jonathan M. Borwein and Jon D. Vanderwerff, Convex Functions: Constructions, Characterizations and Counterexamples, Exercise 4.4.1 (standard reference, not scraped)