Alphabeta Math
TheoremStatement: 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.

Exact-MMSE PnP-ISTA has monotone objective and vanishing gradient

Statement

Let n≥1, let σ>0, and let μ be a Borel probability measure on Rn that is not concentrated on any affine hyperplane. Use the analytic Gaussian posterior-mean map Dσ and potential hσ,γ constructed from μ in the local lemma. This map is used as the exact MMSE plug-in map; no fitted parameter or training guarantee is assumed. Let g:Rn→R be C1 and suppose ∥∇g(u)−∇g(v)∥2≤L∥u−v∥2(u,v∈Rn) for some L>0. Suppose the extended-real objective f=g+hσ,γ has finite infimum in R, fix 0<γ≤1/L, and run xt=Dσ ⁣(xt−1−γ∇g(xt−1))(t≥1) from any x0∈Rn. Then xt∈Xσ and f(xt) is finite for every t≥1; f(xt)≤f(xt−1) in extended-real order for t≥1; the finite sequence (f(xt))t≥1 converges; and ∥∇f(xt)∥2→0, where ∇f is the ordinary gradient of its restriction to the open set Xσ. This is a stationarity conclusion only: it asserts no global minimizer, objective rate, iterate convergence, posterior sampling, or trained-network guarantee.

Facts & Assumptions

Given: The integer n≥1, the Borel probability prior μ on Rn not concentrated on any affine hyperplane, σ>0, the exact MMSE denoiser and potential constructed from μ, a C1 function g with the displayed L-Lipschitz-gradient bound, a finite infimum for f=g+hσ,γ, L>0, 0<γ≤1/L, and an arbitrary initial point x0.

[F1]

Tweedie identity, positive Jacobian, and the MMSE proximal potential: Dσ maps Rn into the open set Xσ, hσ,γ is smooth on Xσ and +∞ off it, and Dσ(z) is the unique global minimizer of 12∥x−z∥22+γhσ,γ(x).

[F2]

Plug-and-play ISTA with a denoiser: a PnP-ISTA update takes zt=xt−1−γ∇g(xt−1) and sets xt=D~σ(zt).

[F3]

Descent inequality for a Lipschitz gradient: if g is C1 with L-Lipschitz gradient, then g(y)≤g(x)+⟨∇g(x),y−x⟩+L2∥y−x∥22 for all x,y.

[F4]

Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction: an L-Lipschitz map satisfies ∥T(x)−T(y)∥2≤L∥x−y∥2 for all points in its domain.

[F5]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: the Euclidean gradient and norm use ⟨x,y⟩=∑k<nxkyk and ∥x∥2=⟨x,x⟩.

Proof

1.1givenF3F5algebra

For a point s∈Rn, define the extended-real quadratic model μs(x)=g(s)+⟨∇g(s),x−s⟩+12γ∥x−s∥22+hσ,γ(x). By [F3] and γ≤1/L, its smooth part majorizes g(x) and is tight at x=s. Adding hσ,γ preserves the majorization; when hσ,γ(x)=+∞ both objective values are +∞. Thus μs(x)≥f(x) for every x, and μs(s)=f(s) in extended-real order.

1.2F3F4F5F6givenalgebra

For t≥2 put s=xt−1∈Xσ and define rt(x)=g(s)+⟨∇g(s),x−s⟩+12γ∥x−s∥22−g(x). By [F3], rt(x)≥0 for every x, rt(s)=0, and ∇rt(s)=0. Its gradient is ∇rt(x)=∇g(s)+(x−s)/γ−∇g(x), so the triangle inequality and positive homogeneity [F6], the Lipschitz bound [F4], and the hypothesis on ∇g give ∥∇rt(x)−∇rt(y)∥2≤(1/γ+L)∥x−y∥2≤(2/γ)∥x−y∥2. On Xσ, μs−f=rt.

2.1F1F2F5step 1.1givenalgebra

Completing the square gives μs(x)=12γ∥x−(s−γ∇g(s))∥22+hσ,γ(x)+g(s)−γ2∥∇g(s)∥22. By [F1] and the exact update in [F2] with D~σ=Dσ, xt is the unique global minimizer of μxt−1. Hence f(xt)≤μxt−1(xt)≤μxt−1(xt−1)=f(xt−1). Also xt∈Xσ for t≥1, where hσ,γ is finite, so f(xt) is finite.

3.1givenstep 2.1

The sequence (f(xt))t≥1 is finite, nonincreasing by step 2.1, and bounded below by inf⁡f∈R. It therefore converges: if ℓ=inf⁡t≥1f(xt), then for every ε>0 some N has f(xN)<ℓ+ε, and every t≥N has ℓ≤f(xt)≤f(xN).

3.2F1step 2.1step 1.2givenalgebra

Because xt minimizes μs, step 2.1 and the identity in step 1.2 yield 0≤rt(xt)=μs(xt)−f(xt)≤f(xt−1)−f(xt). Summing from t=2 to N gives ∑t=2Nrt(xt)≤f(x1)−f(xN)≤f(x1)−inf⁡f. The nonnegative summands therefore tend to zero.

4.1F3step 1.2step 3.2algebra

Apply [F3] to rt with gradient Lipschitz constant 2/γ and point xt, taking ut=xt−γ2∇rt(xt). Then 0≤rt(ut)≤rt(xt)−γ4∥∇rt(xt)∥22. Step 3.2 implies ∥∇rt(xt)∥22≤4rt(xt)/γ→0.

5.1F1F5step 1.2step 4.1choose∎

For t≥2, xt is a global minimizer of μs and belongs to the open set Xσ, where μs is differentiable. For every direction v, the global minimum gives nonnegative directional difference quotients along v and −v for small positive increments; taking limits gives ⟨∇μs(xt),v⟩=0. Thus ∇μs(xt)=0. Since rt=μs−f on Xσ, ∇rt(xt)=−∇f(xt); step 4.1 now proves ∥∇f(xt)∥2→0.

Depends on

Used by

Dependency tree · two levels

50 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