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 — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Exact scalar MMSE denoiser for a two-point prior

Example

Let a,σ,γ>0 and let the scalar prior put mass 1/2 at each of −a and a. Under the Gaussian likelihood kernel ρσ(z−u)=exp⁡(−(z−u)2/(2σ2)), its exact posterior-mean map is Dσ(z)=atanh⁡ ⁣(azσ2),tanh⁡(s)=exp⁡(s)−exp⁡(−s)exp⁡(s)+exp⁡(−s). The normalizing constant of the Gaussian likelihood cancels in the posterior. For every z, Dσ(z) uniquely minimizes the posterior squared-error risk and, with the potential hσ,γ constructed from this prior, is the unique global minimizer of x↦(x−z)2/2+γhσ,γ(x).

Facts & Assumptions

Given: a,σ,γ>0, the two-point prior and Gaussian likelihood in the Example, and the definitions of a Dirac probability measure and the exact posterior-mean map.

[F1]

The Dirac set function at a point: δx0(E)=1 when x0∈E and 0 otherwise.

[F2]

A Dirac set function is a probability measure: each Dirac set function is a probability measure.

[F3]

The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y): exp⁡(x+y)=exp⁡(x)exp⁡(y) for all real x,y.

[F4]

Tweedie identity, positive Jacobian, and the MMSE proximal potential: if a Borel probability measure on R is not concentrated on an affine hyperplane, then for the Gaussian likelihood kernel its posterior-mean map uniquely minimizes posterior squared-error risk and the constructed hσ,γ makes that map the unique global minimizer of 12∣x−z∣2+γhσ,γ(x).

Verification

Given: The hypotheses and definitions in the Example.

1.1F1F2givenalgebra

By [F1]–[F2], μ=12δ−a+12δa is a probability measure: for pairwise-disjoint Borel sets each of the two atoms occurs in at most one set, and μ(R)=1. Since a>0, its two atoms are distinct and each has positive mass; every affine hyperplane in R is a singleton, so μ is not concentrated on any affine hyperplane. The posterior weights at a and −a are proportional to ρσ(z−a) and ρσ(z+a), hence Dσ(z)=aρσ(z−a)−ρσ(z+a)ρσ(z−a)+ρσ(z+a).

2.1F3step 1.1algebra

Factoring exp⁡(−(z2+a2)/(2σ2)) from numerator and denominator and using [F3] yields Dσ(z)=a(exp⁡(az/σ2)−exp⁡(−az/σ2))/(exp⁡(az/σ2)+exp⁡(−az/σ2)), which is the stated hyperbolic-tangent formula.

3.1F4givenstep 2.1∎

Fact [F4] applies to this nondegenerate two-point prior, so the posterior mean is the unique squared-error minimizer and the lemma's hσ,γ makes Dσ(z) the unique global minimizer of the displayed proximal objective for every z.

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

Gaussian measurement noise need not remain Gaussian at later PnP-ISTA inputs

Statement refuted

Assume the Axiom of Choice. Let ε have the standard normal law, let Y=θ+ε, and let g(x)=(x−Y)2/2. For any noise parameter σ>0, deterministic map D~σ:R→R, step γ>0, and initialization x0∈R, define zt=xt−1−γ(xt−1−Y) and xt=D~σ(zt). The false claim is that Gaussian measurement noise forces zt−θ to have a Gaussian law at every iteration t≥1, for every such denoiser, step, and initialization.

Facts & Assumptions

Given: AC, a standard normal random variable ε, Y=θ+ε, the scalar least-squares function g(x)=(x−Y)2/2, and the PnP-ISTA recurrence in the Statement.

[A1]

The Axiom of Choice: the Axiom of Choice is assumed.

[F1]

Standard normal and normal laws: under AC, N(0,1) is the probability law with density ϕ(u)=exp⁡(−u2/2)/2π, which is strictly positive for every real u.

[F2]

A positive-variance normal law has its location-scale density: under AC, every positive-variance normal law has a strictly positive Lebesgue density on all of R; a zero-variance normal law is a point mass.

[F3]

Plug-and-play ISTA with a denoiser: the gradient step is zt=xt−1−γ∇g(xt−1) and the next iterate is xt=D~σ(zt).

Counterexample

Given: The probability model and recurrence in the Statement. Choose θ=0, x0=0, σ=1, γ=1/2, and the deterministic plug-in map D~1(z)=z2.

1.1F3givenalgebra

Since ∇g(x)=x−ε, [F3] gives z1=ε/2, x1=ε2/4, and z2=x1−12(x1−ε)=ε2/8+ε/2=(ε+2)2/8−1/2. Thus z2≥−1/2 almost surely.

2.1A1F1step 1.1givenalgebra

The event −1/2<ε<1/2 has positive probability by [A1, F1] and gives −7/32<z2<9/32. The event −5/2<ε<−3/2 also has positive probability and gives −1/2≤z2<−15/32. These disjoint output intervals show that z2 is not almost surely constant.

3.1A1F2step 1.1step 2.1∎

A nondegenerate Gaussian law has positive probability below −1/2 by [A1, F2], whereas z2 has none by step 1.1; a degenerate Gaussian is a point mass, whereas step 2.1 shows z2 is not. Therefore z2 is not Gaussian and the universal iterative-AWGN claim is false.

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

A biased one-pixel CNN approximates but is not the exact MMSE denoiser

Example

Let a,σ>0 and use the scalar two-point prior assigning mass 1/2 to each of −a and a, whose exact Gaussian posterior-mean map is Dσ(z)=atanh⁡(az/σ2), where tanh⁡(s)=(exp⁡(s)−exp⁡(−s))/(exp⁡(s)+exp⁡(−s)). For any tolerance η>0, choose b with 0<∣b∣<η and define the one-pixel convolutional neural network (CNN) map D~σ(z)=atanh⁡(az/σ2)+b. This map is implemented by a 1×1 convolution, a tanh⁡ activation, output scaling, and an output bias b. It satisfies sup⁡z∈R∣D~σ(z)−Dσ(z)∣=∣b∣<η, while D~σ(0)≠Dσ(0). It is approximate and does not meet the exact-denoiser hypothesis of the stationarity theorem; this example makes no claim that it lacks some other objective.

Network diagram

For this one-channel, one-pixel input, a 1×1 convolution with weight w is scalar multiplication z↦wz. The architecture applies weight a/σ2, then tanh⁡, then output scaling by a and bias addition by b. The arrows depict function composition, and the sequence computes exactly D~σ(z)=atanh⁡(az/σ2)+b.

\begin{tikzpicture}[x=1.45cm,y=0.8cm,>=stealth]
  \node (input) at (0,0) {$z$};
  \node[draw,rounded corners,minimum width=2.3cm,minimum height=0.9cm] (conv) at (2,0) {$1\times1$ conv: $a/\sigma^2$};
  \node[draw,rounded corners,minimum width=1.4cm,minimum height=0.9cm] (act) at (4.5,0) {$\tanh$};
  \node[draw,rounded corners,minimum width=2cm,minimum height=0.9cm] (out) at (7,0) {scale $a$, bias $b$};
  \node (result) at (9.2,0) {$\widetilde D_\sigma(z)$};
  \draw[->] (input) -- (conv);
  \draw[->] (conv) -- node[above] {$az/\sigma^2$} (act);
  \draw[->] (act) -- node[above] {$\tanh(az/\sigma^2)$} (out);
  \draw[->] (out) -- (result);
\end{tikzpicture}

Facts & Assumptions

Given: a,σ,η>0, a nonzero bias b with ∣b∣<η, and the finite two-point prior and Gaussian likelihood in the Example.

[F1]

The Dirac set function at a point: δx0(E)=1 when x0∈E and 0 otherwise.

[F2]

A Dirac set function is a probability measure: each Dirac set function is a probability measure.

[F3]

The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y): exp⁡(x+y)=exp⁡(x)exp⁡(y) for all real x,y.

[F4]

Tweedie identity, positive Jacobian, and the MMSE proximal potential: for a Borel probability measure not concentrated on an affine hyperplane, the Gaussian posterior-mean map is defined by the normalized likelihood integral and uniquely minimizes posterior squared-error risk.

[F5]

Exact-MMSE PnP-ISTA has monotone objective and vanishing gradient: the stationarity conclusion assumes the plug-in map is exactly the analytic posterior-mean map Dσ.

Verification

Given: The prior, noise parameter, tolerance, bias, and network map in the Example.

1.1F1F2F3F4givenalgebra

By [F1]–[F2], μ=12δ−a+12δa is a Borel probability. Because a>0, the atoms are distinct, each has positive mass, and every affine hyperplane in R is a singleton, so μ is not concentrated on any affine hyperplane. Its posterior mean is Dσ(z)=aρσ(z−a)−ρσ(z+a)ρσ(z−a)+ρσ(z+a)=atanh⁡(az/σ2), where the second equality follows by factoring the common Gaussian term and using [F3].

2.1F4F5givenalgebra∎

For every z, ∣D~σ(z)−Dσ(z)∣=∣b∣<η, so the uniform error is ∣b∣. At z=0, Dσ(0)=0 while D~σ(0)=b≠0; hence the network is not the exact MMSE map and [F5] does not apply. No conclusion about a different objective follows.

Sources