Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 X=L2(Ω;R) and Y=L2(Σ,μ;R) be real Hilbert spaces, let A:X→Y be bounded and real-linear, and let R:X→[0,+∞] be one of the full-space, Dirichlet, or Neumann TV functionals. Assume that R is proper, convex, lower semicontinuous, and positively one-homogeneous, and that u† is a minimum-R exact solution of Au=f with a dual source certificate p†∈Y, so A∗p†∈∂R(u†). Define K:={p∈Y:A∗p∈∂R(0)} and Dα,w(p):=⟨f+w,p⟩Y−α2∥p∥Y2 for α>0 and w∈Y.

For each α>0 and w∈Y, Dα,w has a unique maximizer on K, namely pα,w=Proj⁡K((f+w)/α). If uα,w is any supplied global minimizer of u↦12∥Au−(f+w)∥Y2+αR(u), then pα,w=(f+w−Auα,w)/α, A∗pα,w∈∂R(uα,w), and A∗pα,w∈∂R(0). For every such supplied minimizer, the correctly normalized primal-dual value identity is

min⁡u{12∥Au−(f+w)∥Y2+αR(u)}=αDα,w(pα,w).

Let P0:={p∈K:⟨f,p⟩Y=R(u†)} and let p0 be its unique minimum-norm element. For every sequence αn>0 with αn→0, pαn,0→p0 strongly in Y and A∗pαn,0→A∗p0 strongly in X. For every α>0 and w∈Y,

∥pα,w−pα,0∥Y≤∥w∥Yα,∥A∗pα,w−A∗pα,0∥X≤∥A∗∥ ∥w∥Yα.

Moreover, for any R0>R(u†) the certificate yields a variational source condition on {u:R(u)≤R0} with exponent 2, coefficient β=0, and index function ψ(s)=(1+∥p†∥Y)s. Consequently, if δn↓0, ∥wn∥Y≤δn, αn≍δn, and exact global minimizers un are supplied, then the variational-source rate theorem gives

DRA∗p†(un,u†)=O(δn),∥Aun−(f+wn)∥Y=O(δn).

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.

[A1]

Countable Choice supplies the nearest-point minimizing sequences and weakly convergent subsequences used below. (The Axiom of Countable Choice (ACω))

[F1]

Dual source certificates for TV regularization: u† is an exact minimum-TV solution and A∗p†∈∂R(u†); the Hilbert adjoint satisfies ⟨Au,p⟩Y=⟨u,A∗p⟩X.

[F2]

Banach-space convex subgradients and dual pairings: ξ∈∂R(u) exactly when R(z)≥R(u)+⟨ξ,z−u⟩ for every z∈X.

[F3]

Bregman distances for convex regularizers: DRξ†(u,u†)=R(u)−R(u†)−⟨ξ†,u−u†⟩X.

[F4]

Fenchel–Young equality for a Banach regularizer: R(u)+R∗(ξ)=⟨ξ,u⟩ if and only if ξ∈∂R(u).

[F5]

Variational source conditions on a regularizer sublevel: on a named sublevel, −⟨ξ†,u−u†⟩≤βDRξ†(u,u†)+ψ(∥Au−Au†∥Y2).

[F6]

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.

[F7]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: ∣⟨u,v⟩∣≤∥u∥ ∥v∥ in a real Hilbert space.

[F8]

Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence: every bounded real sequence has a convergent subsequence.

[F9]

Riesz representation for Hilbert spaces: every bounded linear functional on a real Hilbert space is inner product with a vector in that space.

[F10]

Real and complex inner-product spaces and their induced length: the real Hilbert norm satisfies ∥y∥Y2=⟨y,y⟩Y.

Proof

1.1F1F2givenalgebra

Put q†=A∗p†. Applying [F2] at u† with z=0 and z=2u†, and using R(0)=0 and R(2u†)=2R(u†), gives ⟨q†,u†⟩X=R(u†). For arbitrary z∈X, [F2] then yields R(z)≥⟨q†,z⟩X, so q†∈∂R(0) and p†∈K. Every p∈K satisfies ⟨f,p⟩Y=⟨u†,A∗p⟩X≤R(u†); equality holds for p†. Thus P0 is nonempty, closed, and convex.

1.2A1F2givenconstruct

The set K is nonempty because 0∈∂R(0), convex by the subgradient inequality, and closed because ∂R(0)={q:R(z)≥⟨q,z⟩X for all z} is an intersection of closed half-spaces and A∗ is continuous. For any nonempty closed convex subset C of a Hilbert space, let d=inf⁡c∈C∥x−c∥ and use Countable Choice to select cn∈C with ∥x−cn∥2≤d2+1/n. The midpoint belongs to C, so the parallelogram identity gives ∥cn−cm∥2≤2/n+2/m; thus (cn) is Cauchy. Completeness and closedness yield a nearest point, and strict convexity of squared norm makes it unique. Applying this to K and P0 defines their projections.

2.1step 1.2givenalgebra

Completing the square gives Dα,w(p)=∥f+w∥Y22α−α2∥p−(f+w)/α∥Y2. Hence its unique maximizer on K is pα,w=Proj⁡K((f+w)/α).

3.1F2F4step 2.1givenalgebra

Let uα,w be a supplied global minimizer and put p=(f+w−Auα,w)/α. For any h∈X and t>0, objective minimality and expansion of the square give [R(uα,w+th)−R(uα,w)]/t≥⟨A∗p,h⟩X−t∥Ah∥Y2/(2α). As t↓0, the lower limit of these secants is at least ⟨A∗p,h⟩X; convexity makes the unit secant at least every smaller positive secant, so R(uα,w+h)−R(uα,w)≥⟨A∗p,h⟩X. This for every h proves A∗p∈∂R(uα,w). Applying [F2] with z=0 and z=2uα,w gives ⟨A∗p,uα,w⟩X=R(uα,w), and then [F2] for arbitrary z gives A∗p∈∂R(0), so p∈K. By [F4] at 0, R∗(A∗q)=0 for every q∈K; Fenchel–Young in [F4] therefore gives ⟨A∗q,uα,w⟩X≤R(uα,w). Thus Dα,w(q)≤R(uα,w)+α⟨p,q⟩Y−α∥q∥Y2/2=Dα,w(p)−α∥q−p∥Y2/2. Hence p=pα,w. Finally Auα,w=f+w−αp, so 12∥Auα,w−(f+w)∥Y2+αR(uα,w)=αDα,w(p), establishing the normalized value identity in the Statement.

3.2F7step 2.1givenalgebra

If PKx=p and PKy=q, minimizing squared distance along the segment from p to any z∈K gives ⟨x−p,z−p⟩≤0. Apply this with z=q, and the corresponding inequality for PKy with z=p. Adding yields ∥p−q∥Y2≤⟨x−y,p−q⟩Y≤∥x−y∥Y∥p−q∥Y by [F7], so ∥p−q∥Y≤∥x−y∥Y. Taking x=(f+w)/α and y=f/α proves the first noise-stability bound; applying A∗ proves the second.

3.3A1F1F2F8F9F10step 1.1step 1.2step 2.1constructalgebra

Write pn=pαn,0. Maximality against p0∈P0 and the support bound ⟨f,pn⟩Y≤R(u†) give ∥pn∥Y≤∥p0∥Y and ⟨f,pn⟩Y→R(u†). 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 ∥p0∥Y2; hence the coordinates define a vector p in that closed span. Approximation by finite linear combinations proves weak convergence there, and [F9] represents each functional x↦⟨x,y⟩Y restricted to the span, so convergence is weak in Y. The limit lies in K: by [F2], K=⋂z∈X{q:⟨q,Az⟩Y≤R(z)}, an intersection of weakly closed half-spaces. It also attains ⟨f,p⟩Y=R(u†), so p∈P0. Weak lower semicontinuity of the norm and the bound force ∥p∥Y=∥p0∥Y, hence uniqueness gives p=p0. Every subsequence therefore has a further subsequence weakly converging to p0; testing against any fixed y∈Y shows that every scalar subsequence has a further subsequence converging to ⟨p0,y⟩Y, so ⟨pn,y⟩Y→⟨p0,y⟩Y. Thus pn⇀p0. Weak lower semicontinuity and the uniform upper bound then give ∥pn∥Y→∥p0∥Y. The norm identity [F10] yields strong convergence, and boundedness of A∗ yields strong convergence of A∗pn.

4.1F1F3F5F6F7givenalgebra∎

For u∈dom⁡R, [F1] and [F7] give −⟨A∗p†,u−u†⟩X=⟨p†,f−Au⟩Y≤∥p†∥Y∥Au−f∥Y. Therefore the VSC [F5] holds with β=0, p=2, and ψ(s)=Cs, C=1+∥p†∥Y, on every regularizer sublevel; [F3] identifies its Bregman term with the distance in the Statement. Its conjugate is H(q)=C2/(4q) for q>0. For an exact minimizer with ∥w∥Y≤δ, comparison to u† gives R(uα,w)≤R(u†)+δ2/(2α); if α≍δ, this is below any fixed R0>R(u†) for small δ. With cp=1/4, ρδ=H(cp/α)=C2α≍δ and H(cp/(2α))=2ρδ, so all parameter-coupling hypotheses in [F6] hold and the stated rates follow.

Depends on

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