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
- Absolute and Conditional Convergence; Rearrangement; Products
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- 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
- 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
- Foundations of the Real Numbers for Analysis
- Function-space priors and sample regularity
- 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
- 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-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
- 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
- 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
- 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 Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Radon Nikodym Theorem and Lebesgue Decomposition
- 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
Tweedie identity, positive Jacobian, and the MMSE proximal potential
Statement
Let , let be a Borel probability measure on that is not concentrated on any affine hyperplane, and let . Put and define the normalized posterior measure and its mean by The omitted normalizing constant of the likelihood is independent of and cancels in . Writing for the identity random vector under , its covariance matrix is Then is positive and smooth, each has finite second moment, and uniquely minimizes the posterior squared-error risk . Moreover, is smooth and is symmetric positive definite. Hence is injective with open image and smooth inverse on . Put and, for , define set outside . The restriction of to is smooth. For any extended-real , define where the argmin is the set of global minimizers and need not be convex. Then
Statement references
Facts & Assumptions
Given: The integer , a Borel probability not concentrated on an affine hyperplane, and , with and as in the Statement.
The Euclidean inner product on : on , and .
Probability measures and probability spaces: is a measure on its Borel sigma-algebra with total mass .
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.
Dominated convergence: almost-everywhere convergence under one integrable majorant permits passage of the limit through the integral.
The exponential function is smooth and : the real exponential is smooth and .
The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: for , is differentiable with .
The chain rule for total derivatives: : for totally differentiable Euclidean maps, the total derivative of a composite is the composite of the total derivatives.
Sums, scalar multiples, products and quotients: , , , and when : sums, products, scalar multiples, and quotients obey their derivative formulas wherever their denominators are nonzero.
Euclidean maps are closed under componentwise algebra and composition: finite componentwise sums, products, scalar multiples, and composites of Euclidean maps are .
Euclidean maps and diffeomorphisms: a Euclidean map is smooth when it is for every finite .
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.
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : 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.
maps and multi-index derivative notation in Euclidean space: a multi-index is an element , and is the corresponding iterated coordinate derivative.
The measure with density relative to : for nonnegative Borel , is a measure.
The nonnegative integral agrees with the simple integral on simple functions: the nonnegative Lebesgue integral of a nonnegative simple function is its simple integral.
Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous under positive finite scalars.
The Lebesgue integral is linear on : the Lebesgue integral is linear on integrable functions.
Monotone convergence for the integral: increasing pointwise limits of nonnegative measurable functions commute with the integral.
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
Since , . For fixed , the measurable sets , , cover . Their union is , so [F19] and [F2] give ; some therefore has positive -measure, and . For , the function is bounded because a polynomial factor is dominated at infinity by the Gaussian exponential, so its -integral is finite. Put . This is a nonnegative Borel function. By [F14], is a measure; [F16] identifies it with and gives total mass . Hence is a probability measure.
For a nonnegative simple Borel function on disjoint Borel sets, because is bounded and by step 1.1. By [F15] and [F17], For arbitrary nonnegative Borel , set . These are finite-valued Borel simple functions, increase pointwise, and converge to . Applying [F18] under and yields For real Borel with , apply this identity to and and use [F17] to obtain the same formula for . Taking and using its weighted bound in step 1.1 proves the finite-second-moment claim; the finite first moment follows from . Thus is well-defined.
Let be a multi-index as in [F13]. At order zero, . If for a polynomial , then [F7] and [F8] give , again a polynomial times . Induction on , in any coordinate order, proves the stated form for every finite derivative. On each compact set of values, both and are bounded uniformly in , since every polynomial times the Gaussian tends to zero at infinity. Apply [F3] coordinate by coordinate to and to each numerator ; 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 give a uniform bound for the coordinate derivatives of each resulting derivative on any compact box . For , change one coordinate at a time from to . 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 . Summing gives a difference bound ; thus each resulting derivative is continuous. Iterating over makes and every smooth. Since , the reciprocal is smooth on : its first derivative is by the difference quotient, and repeated use of [F8] shows every higher derivative is a polynomial in . Thus [F9] makes smooth. Since is smooth and [F6] gives on , is smooth there; then [F9] and make smooth.
For , expand and integrate. The cross term vanishes because , giving Thus is the unique posterior squared-error minimizer. Differentiating using [F3], [F5], [F7], [F8], and [F9] gives because the terms containing cancel. This is exactly the stated symmetric covariance formula.
For each coordinate , . Differentiating under the integral by [F3] and using step 2.1 gives . Since , [F6] gives , proving both Tweedie identities in the Statement.
For nonzero , If this were zero, then for each the set where would have -measure zero, since the integral is at least times that set's measure by [F16]; their union is the complement of the affine hyperplane . Hence that hyperplane has full -measure. The density is strictly positive, so and have the same null sets: if , then for each , [F16] and step 1.1 give , and these sets cover . Thus the hyperplane has full -measure, contradicting the hypothesis. Therefore is positive definite.
Fix and write By the definition of , this equals . Differentiate using [F7] and the symmetry of from step 4.1: where the last equality uses from step 4.2.
If , put and on . By [F7] and step 5.1, . The mean-value theorem [F12] yields , so and is injective.
At every , the derivative is invertible by step 5.1. Apply [F11] at each : every point has an open neighborhood mapped diffeomorphically onto an open neighborhood. Their images cover , so is open. Injectivity from step 6.1 makes the local inverse maps agree on overlaps, giving the global inverse , which is smooth. Since is smooth by step 3.1, the formula in the Statement makes smooth on .
For any , let on . Step 5.2 gives for every by step 5.1. By [F12], . Thus is the unique global minimizer of . Every has a unique form by step 7.1, while outside ; consequently is the unique global minimizer of over all .
Plug-and-play ISTA with a denoiser
Definition
Let , , let be continuously differentiable, let be a supplied deterministic map used in the denoising step, and choose . Define The output is the sequence . This definition imposes no convexity, proximal representation, exact-MMSE identity, or convergence property on .
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}
Exact-MMSE PnP-ISTA has monotone objective and vanishing gradient
Statement
Let , let , and let be a Borel probability measure on that is not concentrated on any affine hyperplane. Use the analytic Gaussian posterior-mean map and potential 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 be and suppose for some . Suppose the extended-real objective has finite infimum in , fix , and run from any . Then and is finite for every ; in extended-real order for ; the finite sequence converges; and , where is the ordinary gradient of its restriction to the open set . This is a stationarity conclusion only: it asserts no global minimizer, objective rate, iterate convergence, posterior sampling, or trained-network guarantee.
Statement references
Facts & Assumptions
Given: The integer , the Borel probability prior on not concentrated on any affine hyperplane, , the exact MMSE denoiser and potential constructed from , a function with the displayed -Lipschitz-gradient bound, a finite infimum for , , , and an arbitrary initial point .
Tweedie identity, positive Jacobian, and the MMSE proximal potential: maps into the open set , is smooth on and off it, and is the unique global minimizer of .
Plug-and-play ISTA with a denoiser: a PnP-ISTA update takes and sets .
Descent inequality for a Lipschitz gradient: if is with -Lipschitz gradient, then for all .
Lipschitz map, -Hölder map for rational , and contraction: an -Lipschitz map satisfies for all points in its domain.
The Euclidean inner product on : the Euclidean gradient and norm use and .
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: the Euclidean norm satisfies the triangle inequality and positive homogeneity.
Proof
For a point , define the extended-real quadratic model . By [F3] and , its smooth part majorizes and is tight at . Adding preserves the majorization; when both objective values are . Thus for every , and in extended-real order.
For put and define . By [F3], for every , , and . Its gradient is , so the triangle inequality and positive homogeneity [F6], the Lipschitz bound [F4], and the hypothesis on give . On , .
Completing the square gives . By [F1] and the exact update in [F2] with , is the unique global minimizer of . Hence . Also for , where is finite, so is finite.
The sequence is finite, nonincreasing by step 2.1, and bounded below by . It therefore converges: if , then for every some has , and every has .
Because minimizes , step 2.1 and the identity in step 1.2 yield . Summing from to gives . The nonnegative summands therefore tend to zero.
Apply [F3] to with gradient Lipschitz constant and point , taking . Then . Step 3.2 implies .
For , is a global minimizer of and belongs to the open set , where is differentiable. For every direction , the global minimum gives nonnegative directional difference quotients along and for small positive increments; taking limits gives . Thus . Since on , ; step 4.1 now proves .
An arbitrary denoiser does not inherit the exact-MMSE objective
Remark
For , a global proximal selection of an extended-real penalty is a map such that, for every , is a global minimizer of . The potential in the exact-MMSE stationarity result is constructed from the conditional-mean map . Replacing in PnP-ISTA by an arbitrary map does not in general give a global proximal representation or inherit that stationarity conclusion: for every , the map is not a global proximal selection of any such that is finite somewhere and nowhere . This does not assert that a particular other denoiser has no different objective.
Remark references
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.
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.
Plug-and-play ISTA with a denoiser: PnP-ISTA permits a deterministic map in the denoising step.
The Euclidean inner product on : on , the norm is the absolute value and the squared Euclidean distance is the square of the scalar difference.
Verification
Given: A step parameter and the global-proximal-selection definition in the Remark.
Suppose an extended-real penalty that is finite somewhere and nowhere had as a global minimizer of for every . Its objective has a finite competitor for every input, so each claimed global minimizer has finite value. For distinct , compare the minimizer at input with competitor and the minimizer at input with competitor , then add the inequalities. The finite penalty values cancel and expansion gives .
Substituting into step 1.1 yields , which is false for . Thus no such 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
- 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)