Helpers: convolution and deconvolution.

Helper 1 (convolution as a matrix, finite case). Let with probability vector , and noise with , independent of . Then has

i.e. for the banded matrix with on the diagonal and subdiagonal. Deconvolution is solving for : , , …, a back-substitution that exists and is unique. Note (i) depends only on the noise law; (ii) the recipe does not care what is; (iii) errors in double at every step (instability).

Helper 2 (Gaussians convolve by adding variances). If , , independent, then . (Prove once: either by completing the square, or via characteristic functions .) Hence within the Gaussian family deconvolution is “subtract the noise variance”: given and known , the input was . It exists iff : a narrower than the noise cannot have been produced by any . Again the map is fixed by alone.

Helper 3 (Fourier makes it linear algebra). For densities, with ; this is the independence identity [T6 in cond_exp.pdf]. So convolution is a diagonal operator in the Fourier basis, with “eigenvalue” at frequency , and deconvolution divides by it: . Helper 2 is this with : dividing subtracts from the variance. Ill-posedness as , so high-frequency error in is amplified without bound.

Common thread. Deconvolution is a map on distributions, , determined by the noise law only, and it is linear. Keep this in mind for Problem 5.1 b).

Exercise (stays inside Helper 2). For , , compute the conditional law (Gaussian; same computation as Problem 3.6 in p36.tex). Then ask what map on distributions induces via , and compare its ingredients with the deconvolution map’s ingredients.

Solution Let us fix and write

Now note that can be subsumed into some new . Now focus on the exponent terms containing

Results side by side (, , , ):

Both recover from : the second directly, the first via . They are different maps on distributions: the first has (i.e. ) baked into its coefficients, the second does not.

The two maps. Fix the model , , , , and write , , , so that . Both maps take a probability measure on the -axis to one on the -axis:

Here (hence ) are frozen into the maps; parameterize the varying input.

With the help of Claim 1 (anm_claims.pdf) and defining with , , , we can show that , with the distribution

Since while , the two maps differ whenever ; moreover for the map is undefined while is not, and for the variances agree only at . The maps agree exactly at , where both return .