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
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Conjugate families and Gaussian conditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Function-space priors and sample regularity
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Geodesics, the Exponential Map, Completeness, and Hopf–Rinow
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Inverse maps, identifiability, and stability
- Learned reconstruction targets and risk
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Likelihood potentials and posterior propriety
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Plug-and-play MMSE denoisers and stationarity
- Polynomial Rings, the Division Algorithm and Roots
- Posterior propriety and dominated Bayes formula
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Proximal gradient and accelerated composite optimization
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
Exact scalar MMSE denoiser for a two-point prior
Example
Let and let the scalar prior put mass at each of and . Under the Gaussian likelihood kernel , its exact posterior-mean map is The normalizing constant of the Gaussian likelihood cancels in the posterior. For every , uniquely minimizes the posterior squared-error risk and, with the potential constructed from this prior, is the unique global minimizer of .
Example references
Facts & Assumptions
Given: , the two-point prior and Gaussian likelihood in the Example, and the definitions of a Dirac probability measure and the exact posterior-mean map.
The Dirac set function at a point: when and otherwise.
A Dirac set function is a probability measure: each Dirac set function is a probability measure.
The exponential addition formula : for all real .
Tweedie identity, positive Jacobian, and the MMSE proximal potential: if a Borel probability measure on 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 makes that map the unique global minimizer of .
Verification
Given: The hypotheses and definitions in the Example.
By [F1]–[F2], is a probability measure: for pairwise-disjoint Borel sets each of the two atoms occurs in at most one set, and . Since , its two atoms are distinct and each has positive mass; every affine hyperplane in is a singleton, so is not concentrated on any affine hyperplane. The posterior weights at and are proportional to and , hence .
Factoring from numerator and denominator and using [F3] yields , which is the stated hyperbolic-tangent formula.
Fact [F4] applies to this nondegenerate two-point prior, so the posterior mean is the unique squared-error minimizer and the lemma's makes the unique global minimizer of the displayed proximal objective for every .
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 , and let . For any noise parameter , deterministic map , step , and initialization , define and . The false claim is that Gaussian measurement noise forces to have a Gaussian law at every iteration , for every such denoiser, step, and initialization.
Statement references
Facts & Assumptions
Given: AC, a standard normal random variable , , the scalar least-squares function , and the PnP-ISTA recurrence in the Statement.
The Axiom of Choice: the Axiom of Choice is assumed.
Standard normal and normal laws: under AC, is the probability law with density , which is strictly positive for every real .
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 ; a zero-variance normal law is a point mass.
Plug-and-play ISTA with a denoiser: the gradient step is and the next iterate is .
Counterexample
Given: The probability model and recurrence in the Statement. Choose , , , , and the deterministic plug-in map .
Since , [F3] gives , , and . Thus almost surely.
The event has positive probability by [A1, F1] and gives . The event also has positive probability and gives . These disjoint output intervals show that is not almost surely constant.
A nondegenerate Gaussian law has positive probability below by [A1, F2], whereas has none by step 1.1; a degenerate Gaussian is a point mass, whereas step 2.1 shows is not. Therefore is not Gaussian and the universal iterative-AWGN claim is false.
A biased one-pixel CNN approximates but is not the exact MMSE denoiser
Example
Let and use the scalar two-point prior assigning mass to each of and , whose exact Gaussian posterior-mean map is , where . For any tolerance , choose with and define the one-pixel convolutional neural network (CNN) map This map is implemented by a convolution, a activation, output scaling, and an output bias . It satisfies , while . 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.
Example references
Network diagram
For this one-channel, one-pixel input, a convolution with weight is scalar multiplication . The architecture applies weight , then , then output scaling by and bias addition by . The arrows depict function composition, and the sequence computes exactly .
\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 nonzero bias with , and the finite two-point prior and Gaussian likelihood in the Example.
The Dirac set function at a point: when and otherwise.
A Dirac set function is a probability measure: each Dirac set function is a probability measure.
The exponential addition formula : for all real .
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.
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 .
Verification
Given: The prior, noise parameter, tolerance, bias, and network map in the Example.
By [F1]–[F2], is a Borel probability. Because , the atoms are distinct, each has positive mass, and every affine hyperplane in is a singleton, so is not concentrated on any affine hyperplane. Its posterior mean is , where the second equality follows by factoring the common Gaussian term and using [F3].
For every , , so the uniform error is . At , while ; hence the network is not the exact MMSE map and [F5] does not apply. No conclusion about a different objective follows.
Sources
- Xiaojian Xu, Yu Sun, Jiaming Liu, Brendt Wohlberg, and Ulugbek S. Kamilov, Provable Convergence of Plug-and-Play Priors with MMSE Denoisers, IEEE Signal Processing Letters 27 (2020), arXiv:2005.07685
- Rémi Gribonval and Mila Nikolova, On Bayesian Estimation and Proximity Operators, Applied and Computational Harmonic Analysis 50 (2021), 49–72, arXiv:1807.04021
- Neal Parikh and Stephen Boyd, Proximal Algorithms, Foundations and Trends in Optimization 1(3) (2014)