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.

Primal compactness and selection of a minimum-TV limit

Statement

Assume Countable Choice. Let X=L2(Ω;R) and let Y=L2(Σ,μ;R) be real Hilbert spaces. Let A:X→Y be bounded and real-linear, let f=Au†, and assume u† is an exact solution minimizing a proper, convex, lower semicontinuous, positively one-homogeneous TV functional R:X→[0,+∞] with a source certificate p†∈Y, so A∗p†∈∂R(u†). Use full-space R=TV2(⋅;R2) if Ω=R2; for a nonempty bounded connected Lipschitz Ω⊆R2, use either Neumann R(u)=TV(u;Ω) or Dirichlet R(u)=TV(u~;R2) for the zero extension u~, assigning +∞ outside the respective finite-variation domain. A bounded connected Lipschitz domain here is a nonempty bounded open set with a finite Lipschitz graph cover of its boundary, with the domain on one side of each graph, and with no separation into two disjoint nonempty relatively open sets.

Let αn>0 tend to zero, let wn∈Y, and suppose ∥A∗∥ ∥wn∥Y/αn≤η for some finite η. For each n, suppose a supplied global minimizer un∈X minimizes Jn(u)=12∥Au−(f+wn)∥Y2+αnR(u). In the Neumann case, if A1Ω=0, take un after subtracting its mean ∣Ω∣−1∫Ωun; this leaves Jn unchanged. Then a subsequence converges weakly in L2(Ω) and, in addition, strongly in L1(Ω) when Ω is bounded or strongly in L1 on every bounded ball when Ω=R2. Its limit u0 is an exact solution Au0=f minimizing R among exact solutions, and A∗p†∈∂R(u0).

Facts & Assumptions

Given: The objects and hypotheses in the Statement, including supplied global minimizers of Jn.

[A1]

Countable Choice supplies the countable diagonal selections in the compactness and weak-subsequence arguments. (The Axiom of Countable Choice (ACω))

[F1]

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

[F2]

Dual attainment and convergence of TV source certificates: every supplied global minimizer has pα,w=(f+w−Auα,w)/α, the exact-data fields pα,0 remain bounded as α→0, and ∥pα,w−pα,0∥Y≤∥w∥Y/α.

[F3]

Compactness and lower semicontinuity for bounded-domain BV: bounded-domain BV sequences with bounded L1 norm and variation have an L1-convergent subsequence, and TV is lower semicontinuous under L1 convergence.

[F4]

BV Sobolev inequality in full space: in two dimensions, ∥v∥L2(R2)≤TV(v;R2) for v∈BV(R2).

[F5]

Full-space BV Sobolev inequality for L² distributional TV: the same estimate holds for u∈L2(R2) with finite extended variation: ∥u∥2≤TV2(u;R2).

[F6]

A zero distributional gradient is constant on a connected domain: a locally integrable function with zero distributional gradient on a connected open domain is a.e. constant.

[F7]

Full-space, Dirichlet, and Neumann TV conventions: Neumann TV is unchanged by adding constants; Dirichlet TV is the full-space TV of the zero extension and dominates the interior variation.

[F8]

Test-field formula and L1 lower semicontinuity of spatial TV: spatial TV is lower semicontinuous in L1 and finite whenever the extended test-field variation is finite under Countable Choice.

[F9]

Finite L² distributional variation has a finite Radon derivative: finite TV2 gives a finite vector Radon derivative measure, whose restriction to bounded balls has variation at most TV2(u;R2).

[F10]

Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence: bounded scalar real sequences have convergent subsequences.

[F12]

Riesz representation for Hilbert spaces: bounded linear functionals on a real Hilbert space are inner products with vectors in that space.

[F13]

Locally integrable functions embed in distributions: two locally integrable functions that define the same distribution are equal almost everywhere.

[F14]

BV Sobolev–Poincaré inequality for Neumann TV: on a bounded connected Lipschitz domain, ∥u−uΩ∥2≤CΩTV(u;Ω) for a fixed finite CΩ.

Proof

1.1F1F6F7givencasesalgebra

If ∥A∗∥=0, the adjoint identity implies A=0 and f=0. Since 0 is exact, minimality gives R(u†)=0. The data term of Jn is then constant, so every global minimizer has R(un)=0. In the full-space case [F6] makes un constant and L2(R2) forces it to be zero; in the Dirichlet case apply [F6] to its zero extension, which vanishes outside bounded Ω, and again obtain zero; in the Neumann case [F6] makes it constant and the prescribed zero-mean choice makes it zero. Thus u0=0 is an exact minimum-TV solution. Since R≥0 and R(0)=0, 0∈∂R(0)=∂R(u0), so A∗p†=0∈∂R(u0) and the assertion holds. For the remainder assume ∥A∗∥>0.

1.2F1F2givenalgebra

Put pn=(f+wn−Aun)/αn. By [F2], pn=pαn,wn and pαn,0 is bounded. The noise hypothesis gives ∥wn∥Y/αn≤η/∥A∗∥, hence [F2] makes (pn) bounded and ∥wn∥Y→0. The identity Aun=f+wn−αnpn therefore gives Aun→f strongly in Y. Comparing the objective at un and u† gives 12∥Aun−(f+wn)∥Y2+αnR(un)≤12∥wn∥Y2+αnR(u†), so R(un)≤R(u†)+∥wn∥Y2/(2αn)≤R(u†)+η2αn/(2∥A∗∥2). In particular the variations are bounded and lim sup⁡nR(un)≤R(u†).

2.1F7F14step 1.2algebra

In the Neumann branch on bounded connected Ω, write mn=∣Ω∣−1∫Ωun and vn=un−mn. The Poincaré inequality [F14] gives ∥vn∥2≤CΩTV(vn;Ω)=CΩR(un), which is uniformly bounded by step 1.2.

3.1F1F4F5F7step 1.2step 2.1algebra

If A1Ω=0, subtracting mn leaves both Aun and Neumann TV unchanged, so we use the zero-mean minimizer specified in the Statement, which is uniformly bounded in L2 by step 2.1. If A1Ω≠0, then [F1] and step 1.2 give bounded ∥Aun∥Y and ∣mn∣ ∥A1Ω∥Y=∥Aun−Avn∥Y≤∥Aun∥Y+∥A∥∥vn∥2, so the means, and therefore ∥un∥2, are bounded. In the full-space case [F5] gives ∥un∥2≤R(un). In the Dirichlet case [F4] applied to u~n gives ∥un∥2≤R(un). Thus in every branch the selected sequence is bounded in L2.

4.1A1F3F7F9F11step 3.1construct

If Ω is bounded, the L2 bound gives an L1 bound by [F11]; the interior variation is bounded by R(un) in both boundary conventions [F7]. [F3] therefore supplies a subsequence converging strongly in L1(Ω). If Ω=R2, restrict to each ball B(0,m): the L1 norms are bounded by ∣B(0,m)∣1/2sup⁡n∥un∥2, and [F9] bounds the variation there. Applying [F3] on each ball and taking a countable diagonal subsequence using [A1] gives convergence in L1 on every bounded ball.

5.1A1F10F11F12F13step 4.1construct

The resulting sequence is still bounded in the Hilbert space L2(Ω). Its closed linear span is separable, since rational finite linear combinations of its terms are dense. Gram–Schmidt gives a finite or countable orthonormal family with dense span. Each coordinate sequence is bounded by [F11]; repeated use of [F10] and [A1] yields a subsubsequence on which every coordinate converges. Pythagoras applied to each finite orthogonal projection bounds the sums of squared limiting coordinates by the common squared norm bound, so these coordinates define a vector u0 in the closed span. Approximation by finite linear combinations proves convergence of inner products against every vector in the span. For any z∈L2(Ω), [F12] represents x↦⟨x,z⟩ restricted to that span by a vector in the span, so the convergence is weak in all of L2. Testing against compactly supported smooth functions shows that this weak limit and the strong L1 or local-L1 limit from step 4.1 define the same distribution; injectivity [F13] makes them equal almost everywhere.

6.1F1F8step 1.2step 4.1step 5.1algebra

Weak convergence and boundedness of A imply Aun⇀Au0, while step 1.2 gives Aun→f strongly; hence Au0=f. In the full-space case, for every admissible test field φ, local L1 convergence gives ∫u0div⁡φ=lim⁡n∫undiv⁡φ≤lim inf⁡nR(un); taking the supremum gives R(u0)≤lim inf⁡nR(un). In the Neumann case the same lower semicontinuity follows from [F8] and strong L1(Ω) convergence. In the Dirichlet case the zero extensions converge strongly in L1(R2), so [F8] gives the same inequality for their full-space TV. Thus R(u0)≤lim inf⁡nR(un)≤lim sup⁡nR(un)≤R(u†). Exactness and the minimum property of u† force equality, so u0 is a minimum-TV exact solution.

7.1F1step 6.1algebra∎

Let ξ=A∗p†. Since Au0=Au†=f, the adjoint identity in [F1] gives ⟨ξ,u0−u†⟩X=⟨p†,A(u0−u†)⟩Y=0. For every v∈X, the subgradient inequality at u† therefore gives R(v)≥R(u†)+⟨ξ,v−u†⟩X=R(u0)+⟨ξ,v−u0⟩X. This is exactly A∗p†∈∂R(u0), as required.

Depends on

Used by

Dependency tree · two levels

79 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