Alphabeta Math
Pipeline-generated
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.

Plug-and-play MMSE denoisers and stationarity

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Tweedie identity, positive Jacobian, and the MMSE proximal potential

Statement

Let n≥1, let μ be a Borel probability measure on Rn that is not concentrated on any affine hyperplane, and let σ,γ>0. Put ρσ(w)=exp⁡ ⁣(−∥w∥222σ2),pσ(z)=∫Rnρσ(z−u) μ(du), and define the normalized posterior measure and its mean by νσ,z(E)=∫Eρσ(z−u) μ(du)pσ(z)(E∈B(Rn)),Dσ(z)=∫Rnu νσ,z(du). The omitted normalizing constant of the N(0,σ2I) likelihood is independent of u and cancels in νσ,z. Writing U(u)=u for the identity random vector under νσ,z, its covariance matrix is Cov⁡νσ,z(U)=∫Rn(u−Dσ(z))(u−Dσ(z))T νσ,z(du). Then pσ is positive and smooth, each νσ,z has finite second moment, and Dσ(z) uniquely minimizes the posterior squared-error risk a↦∫∥u−a∥22 νσ,z(du). Moreover, Dσ is smooth and JDσ(z)=σ−2Cov⁡νσ,z(U) is symmetric positive definite. Hence Dσ is injective with open image Xσ=Dσ(Rn) and smooth inverse on Xσ. Put qσ=−log⁡pσ and, for x∈Xσ, define hσ,γ(x)=−∥x−Dσ−1(x)∥222γ+σ2γqσ(Dσ−1(x)); set hσ,γ(x)=+∞ outside Xσ. The restriction of hσ,γ to Xσ is smooth. For any extended-real h:Rn→R∪{+∞}, define prox⁡γhglob(z)=arg min⁡x∈Rn{12∥x−z∥22+γh(x)}, where the argmin is the set of global minimizers and h need not be convex. Then Dσ(z)=z+σ2∇log⁡pσ(z)=z−σ2∇qσ(z),prox⁡γhσ,γglob(z)={Dσ(z)}(z∈Rn).

Facts & Assumptions

Given: The integer n≥1, a Borel probability μ not concentrated on an affine hyperplane, and σ,γ>0, with ρσ,pσ,νσ,z,Dσ,qσ and hσ,γ as in the Statement.

[F1]

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

[F2]

Probability measures and probability spaces: μ is a measure on its Borel sigma-algebra with total mass μ(Rn)=1.

[F3]

Differentiation under the integral sign: if an integrand is integrable for each parameter, its parameter derivative is measurable, and that derivative has one integrable majorant on an open interval, then the integral is differentiable and its derivative is the integral of the derivative.

[F4]

Dominated convergence: almost-everywhere convergence under one integrable majorant permits passage of the limit through the integral.

[F5]

The exponential function is smooth and (exp⁡)′=exp⁡: the real exponential is smooth and exp⁡′=exp⁡.

[F6]

The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: for r>0, log⁡ is differentiable with log⁡′(r)=1/r.

[F7]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): for totally differentiable Euclidean maps, the total derivative of a composite is the composite of the total derivatives.

[F9]

Ck Euclidean maps are closed under componentwise algebra and composition: finite componentwise sums, products, scalar multiples, and composites of Ck Euclidean maps are Ck.

[F10]

Ck Euclidean maps and diffeomorphisms: a Euclidean map is smooth when it is Ck for every finite k.

[F11]

Choice-free smooth inverse function theorem in Euclidean space: in positive-dimensional Euclidean space, a smooth map with invertible derivative at a point restricts to a smooth diffeomorphism between open neighborhoods; this theorem uses no choice axiom.

[F12]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): a continuous scalar function on a closed interval, differentiable in its interior, has an interior derivative equal to its endpoint difference divided by interval length.

[F13]

Ck maps and multi-index derivative notation in Euclidean space: a multi-index is an element α∈Nn, and ∂α is the corresponding iterated coordinate derivative.

[F14]

The measure with density f relative to μ: for nonnegative Borel w, E↦∫Ew dμ is a measure.

[F15]

The nonnegative integral agrees with the simple integral on simple functions: the nonnegative Lebesgue integral of a nonnegative simple function is its simple integral.

[F16]

Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous under positive finite scalars.

[F17]

The Lebesgue integral is linear on L1(μ): the Lebesgue integral is linear on integrable functions.

[F18]

Monotone convergence for the integral: increasing pointwise limits of nonnegative measurable functions commute with the integral.

[F19]

Finite and countable subadditivity of measures: for a measure and a countable family of measurable sets, the measure of their union is at most the sum of their measures.

Proof

1.1givenF1F2F14F16F19algebra

Since 0<ρσ(z−u)≤1, pσ(z)≤1. For fixed z, the measurable sets Ek={u:ρσ(z−u)≥1/k}, k≥1, cover Rn. Their union is Rn, so [F19] and [F2] give 1=μ(Rn)≤∑k≥1μ(Ek); some Ek therefore has positive μ-measure, and pσ(z)≥μ(Ek)/k>0. For j=1,2, the function u↦∥u∥2jρσ(z−u) is bounded because a polynomial factor is dominated at infinity by the Gaussian exponential, so its μ-integral is finite. Put wσ,z(u)=ρσ(z−u)/pσ(z). This is a nonnegative Borel function. By [F14], E↦∫Ewσ,z dμ is a measure; [F16] identifies it with νσ,z and gives total mass ∫wσ,z dμ=pσ(z)−1pσ(z)=1. Hence νσ,z is a probability measure.

2.1F2F15F16F17F18step 1.1algebra

For a nonnegative simple Borel function φ=∑j=1maj1Aj on disjoint Borel sets, φwσ,z∈L1(μ) because φ is bounded and wσ,z∈L1(μ) by step 1.1. By [F15] and [F17], ∫φ dνσ,z=∑j=1majνσ,z(Aj)=∫φwσ,z dμ. For arbitrary nonnegative Borel φ, set φk(u)=2−k⌊2kmin⁡{φ(u),k}⌋. These are finite-valued Borel simple functions, increase pointwise, and converge to φ. Applying [F18] under νσ,z and μ yields ∫φ dνσ,z=lim⁡k∫φk dνσ,z=lim⁡k∫φkwσ,z dμ=∫φwσ,z dμ=pσ(z)−1∫φρσ(z−u) dμ. For real Borel φ with ∫∣φ∣ρσ(z−u) dμ<∞, apply this identity to φ+ and φ− and use [F17] to obtain the same formula for φ. Taking φ(u)=∥u∥22 and using its weighted bound in step 1.1 proves the finite-second-moment claim; the finite first moment follows from ∥u∥2≤1+∥u∥22. Thus Dσ(z) is well-defined.

3.1F2F3F4F5F6F7F8F9F10F12F13step 2.1

Let α∈Nn be a multi-index as in [F13]. At order zero, ∂αρσ=ρσ. If ∂αρσ(w)=P(w)ρσ(w) for a polynomial P, then [F7] and [F8] give ∂j(P(w)ρσ(w))=(∂jP(w)−wjP(w)/σ2)ρσ(w), again a polynomial times ρσ. Induction on ∣α∣, in any coordinate order, proves the stated form for every finite derivative. On each compact set of z values, both ∣∂αρσ(z−u)∣ and ∣ui∂αρσ(z−u)∣ are bounded uniformly in u, since every polynomial times the Gaussian tends to zero at infinity. Apply [F3] coordinate by coordinate to pσ and to each numerator Ni(z)=∫uiρσ(z−u) μ(du); the uniform bounds supply an integrable majorant and [F4] justifies passage of each derivative limit through the integral. The same bounds for derivatives of order ∣α∣+1 give a uniform bound M for the coordinate derivatives of each resulting derivative on any compact box K. For z,w∈K, change one coordinate at a time from z to w. Each coordinate restriction is differentiable on an open interval containing its segment by [F3], hence continuous on the segment, so [F12] bounds its increment by M∣zj−wj∣. Summing gives a difference bound M∑j<n∣zj−wj∣≤nM∥z−w∥2; thus each resulting derivative is continuous. Iterating over α makes pσ and every Ni smooth. Since pσ>0, the reciprocal r(s)=1/s is smooth on (0,∞): its first derivative is −r(s)2 by the difference quotient, and repeated use of [F8] shows every higher derivative is a polynomial in r. Thus [F9] makes Dσ=(Ni/pσ)i<n smooth. Since r=1/s is smooth and [F6] gives (log⁡)′=r on (0,∞), log⁡ is smooth there; then [F9] and pσ>0 make qσ=−log⁡pσ smooth.

4.1F1F3F5F7F8F9step 2.1step 3.1algebra

For a∈Rn, expand u−a=(u−Dσ(z))+(Dσ(z)−a) and integrate. The cross term vanishes because ∫(u−Dσ(z)) νσ,z(du)=0, giving ∫∥u−a∥22 νσ,z(du)=∫∥u−Dσ(z)∥22 νσ,z(du)+∥a−Dσ(z)∥22. Thus Dσ(z) is the unique posterior squared-error minimizer. Differentiating Ni/pσ using [F3], [F5], [F7], [F8], and [F9] gives ∂jDσ,i(z)=1σ2(∫uiuj νσ,z(du)−Dσ,i(z)Dσ,j(z)), because the terms containing zj cancel. This is exactly the stated symmetric covariance formula.

4.2F3F5F6F7step 2.1step 3.1

For each coordinate j, ∂jρσ(z−u)=(uj−zj)ρσ(z−u)/σ2. Differentiating under the integral by [F3] and using step 2.1 gives ∇pσ(z)=pσ(z)(Dσ(z)−z)/σ2. Since pσ(z)>0, [F6] gives ∇log⁡pσ=∇pσ/pσ, proving both Tweedie identities in the Statement.

5.1givenF1F16step 1.1step 4.1

For nonzero v∈Rn, vTJDσ(z)v=σ−2∫⟨v,u−Dσ(z)⟩2 νσ,z(du). If this were zero, then for each k≥1 the set where ∣⟨v,u−Dσ(z)⟩∣≥1/k would have νσ,z-measure zero, since the integral is at least k−2 times that set's measure by [F16]; their union is the complement of the affine hyperplane {u:⟨v,u⟩=⟨v,Dσ(z)⟩}. Hence that hyperplane has full νσ,z-measure. The density ρσ(z−u)/pσ(z) is strictly positive, so νσ,z and μ have the same null sets: if νσ,z(E)=0, then for each k, [F16] and step 1.1 give μ(E∩{ρσ(z−u)/pσ(z)≥1/k})≤kνσ,z(E∩{ρσ(z−u)/pσ(z)≥1/k})=0, and these sets cover E. Thus the hyperplane has full μ-measure, contradicting the hypothesis. Therefore JDσ(z) is positive definite.

5.2F1F7step 4.1step 4.2

Fix z and write Ψz(u)=12∥Dσ(u)−z∥22−12∥Dσ(u)−u∥22+σ2qσ(u). By the definition of hσ,γ, this equals 12∥Dσ(u)−z∥22+γhσ,γ(Dσ(u)). Differentiate using [F7] and the symmetry of JDσ from step 4.1: ∇Ψz(u)=JDσ(u)(Dσ(u)−z)−(JDσ(u)−I)(Dσ(u)−u)+σ2∇qσ(u)=JDσ(u)(u−z), where the last equality uses Dσ(u)−u=−σ2∇qσ(u) from step 4.2.

6.1F1F7F12step 5.1

If z≠w, put v=w−z and ψ(t)=⟨Dσ(z+tv),v⟩ on [0,1]. By [F7] and step 5.1, ψ′(t)=vTJDσ(z+tv)v>0. The mean-value theorem [F12] yields ⟨Dσ(w)−Dσ(z),w−z⟩>0, so Dσ(w)≠Dσ(z) and Dσ is injective.

7.1F9F10F11step 3.1step 5.1step 6.1

At every z, the derivative JDσ(z) is invertible by step 5.1. Apply [F11] at each z: every point has an open neighborhood mapped diffeomorphically onto an open neighborhood. Their images cover Xσ, so Xσ is open. Injectivity from step 6.1 makes the local inverse maps agree on overlaps, giving the global inverse Dσ−1:Xσ→Rn, which is smooth. Since qσ is smooth by step 3.1, the formula in the Statement makes hσ,γ smooth on Xσ.

8.1F12step 5.1step 7.1step 5.2∎

For any v≠0, let χ(t)=Ψz(z+tv) on [0,1]. Step 5.2 gives χ′(t)=t vTJDσ(z+tv)v>0 for every t∈(0,1] by step 5.1. By [F12], Ψz(z+v)>Ψz(z). Thus u=z is the unique global minimizer of Ψz. Every x∈Xσ has a unique form Dσ(u) by step 7.1, while hσ,γ=+∞ outside Xσ; consequently Dσ(z) is the unique global minimizer of 12∥x−z∥22+γhσ,γ(x) over all x∈Rn.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Plug-and-play ISTA with a denoiser

Definition

Let n≥1, σ,γ>0, let g:Rn→R be continuously differentiable, let D~σ:Rn→Rn be a supplied deterministic map used in the denoising step, and choose x0∈Rn. Define zt=xt−1−γ∇g(xt−1),xt=D~σ(zt)(t=1,2,…). The output is the sequence (xt)t≥0. This definition imposes no convexity, proximal representation, exact-MMSE identity, or convergence property on D~σ.

Here “denoiser” names the role of the plug-in map; Borel measurability and training under a signal-corruption law, as in the learned-estimator interface, are not assumed.

The diagram depicts the data flow for one update; the displayed recurrence, not the diagram, defines the iteration.

\begin{tikzpicture}[x=1.3cm,y=0.9cm,>=stealth]
  \node at (0,0) (old) {$x_{t-1}$};
  \node at (3,0) (grad) {$z_t=x_{t-1}-\gamma\nabla g(x_{t-1})$};
  \node at (7,0) (den) {$x_t=\widetilde D_\sigma(z_t)$};
  \draw[->] (old) -- (grad);
  \draw[->] (grad) -- (den);
\end{tikzpicture}
TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

RemarkRemark: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

An arbitrary denoiser does not inherit the exact-MMSE objective

Remark

For γ>0, a global proximal selection of an extended-real penalty h:R→R∪{+∞} is a map P:R→R such that, for every z∈R, P(z) is a global minimizer of x↦12∣x−z∣2+γh(x). The potential hσ,γ in the exact-MMSE stationarity result is constructed from the conditional-mean map Dσ. Replacing Dσ in PnP-ISTA by an arbitrary map D~σ does not in general give a global proximal representation or inherit that stationarity conclusion: for every γ>0, the map z↦−z is not a global proximal selection of any such h that is finite somewhere and nowhere −∞. This does not assert that a particular other denoiser has no different objective.

Facts & Assumptions

Given: The exact-MMSE potential construction, the general PnP-ISTA input-map convention, and the global-proximal-selection counterexample claimed in the Remark.

[F1]

Tweedie identity, positive Jacobian, and the MMSE proximal potential: for the exact Gaussian posterior-mean map, the constructed extended-real potential has that map as its unique global proximal minimizer.

[F2]

Plug-and-play ISTA with a denoiser: PnP-ISTA permits a deterministic map D~σ in the denoising step.

[F3]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: on R, the norm is the absolute value and the squared Euclidean distance is the square of the scalar difference.

Verification

Given: A step parameter γ>0 and the global-proximal-selection definition in the Remark.

1.1givenF3algebra

Suppose an extended-real penalty h that is finite somewhere and nowhere −∞ had P(z)=−z as a global minimizer of 12∣x−z∣2+γh(x) for every z. Its objective has a finite competitor for every input, so each claimed global minimizer has finite value. For distinct s,t∈R, compare the minimizer at input s with competitor P(t) and the minimizer at input t with competitor P(s), then add the inequalities. The finite penalty values cancel and expansion gives (P(s)−P(t))(s−t)≥0.

2.1F1F2step 1.1algebra∎

Substituting P(s)−P(t)=−(s−t) into step 1.1 yields −(s−t)2≥0, which is false for s≠t. Thus no such h exists for this map, so the exact-MMSE construction and stationarity result cannot be transferred to an arbitrary denoiser without a separate proof.

4 · Examples, counterexamples and false statements

None yet.

Sources