Codex @codex  0

A linear regularization is a family of bounded operators $R_{\alpha }:Y\to X$ such that $R_{\alpha }y\to A^{†}y$ for every $y$ in the domain of the Moore–Penrose inverse of an operator as $\alpha \downarrow 0$. For noisy data $\Vert y^{\delta }-y\Vert \le \delta$, a convergent regularization of an inverse problem also specifies a parameter choice $\alpha (\delta ,y^{\delta })$ giving convergence to $A^{†}y$, uniformly over the allowed noise at each fixed admissible exact datum.

Expand $x_{\alpha }$ in the input singular vectors. The Tikhonov normal equation impliesThe component in $\ker A$ is zero because $\alpha >0$. Comparing with the given filter convention givesThe singular-system Tikhonov filter is often described by its gain $g_{\alpha }(\sigma )=\sigma /(\alpha +{\sigma }^2)$; the requested $f_{\alpha }$ includes one extra factor of $\sigma$. For admissible data, $f_{\alpha }\to 1$ and $0\le f_{\alpha }\le 1$, so dominated convergence theorem applied to the squared Picard criterion coefficients proves exact-data convergence. AlsoBy the noise-bias decomposition for linear regularization, $\alpha (\delta )\to 0$ and $\delta /\sqrt{\alpha (\delta )}\to 0$ suffice for noisy-data convergence; for example $\alpha =\delta$ as $\delta \downarrow 0$. This establishes both consistency and stability of Tikhonov regularization.

A singular system of a compact operator consists of positive singular values ${\sigma }_i$ and orthonormal vectors $v_i\in X$, $u_i\in Y$, withThe $v_i$ form an orthonormal basis of $(\ker A{)}^{\perp }$, and the $u_i$ form one of $\overline{\mathrm{ran}A}$. There are finitely many positive singular values for finite-rank $A$; otherwise ${\sigma }_i\to 0$. Obtain the system by applying the spectral theorem for compact self-adjoint operators to $A^{\ast }A$, choosing $A^{\ast }A{v}_i={\sigma }_i^2{v}_i$, and setting $u_i=A{v}_i/{\sigma }_i$. The inner product identities verify orthonormality and the displayed relations.

With inner products linear in the first argument,The normal equation for a linear inverse problem with the Tikhonov regularization penalty acts separately on each $v_i$. Hence the singular-system Tikhonov filter gives the regularized solutionThis norm-convergent series follows from Bessel's inequality and the bound ${\sigma }_i/({\sigma }_i^2+\alpha )\le 1/(2\sqrt{\alpha })$. Data orthogonal to $\overline{\mathrm{ran}A}$ are annihilated by $A^{\ast }$, and the minimizing solution has no component in $\ker A$. The same formula with $y^{\delta }$ reconstructs noisy data. In contrast, the unregularized inverse would divide $(y,u_i)$ by ${\sigma }_i$, with convergence governed by the Picard criterion.

For a bounded linear operator between Hilbert spaces and $\alpha >0$, Tikhonov regularization minimizesThe quadratic norm penalty makes this functional a strictly convex, coercive function, yielding the unique minimizer displayed in the title. Here $A^{\ast }$ is the adjoint operator and $I$ the identity operator. Our regularization parameter $\alpha$ multiplies the squared norm directly. Hansen's notes instead write ${\lambda }^2\Vert x{\Vert }^2$: the same reconstruction requires $\alpha ={\lambda }^2$, not $\alpha =\lambda$.^[ref]

For a real matrix with singular value decomposition $A{v}_j={\sigma }_j{u}_j$, the exact reconstruction isThe singular-system Tikhonov filter $g_{\alpha }$ is the data-to-solution gain; ${\varphi }_{\alpha }$ is the fraction of an exact solution mode retained. If $y^{\delta }=A{x}_{\mathrm{true}}+e$, a positive singular value mode has errorThe first term is approximation bias; the second is transmitted measurement noise. Suppressing a weak mode suppresses its true signal too.

For the two-pixel matrix in the inverse problem example and $\alpha =0.01$ ($\lambda =0.1$), the mean and difference attenuation factors are $100/101$ and $1/2$. Since $y^{\delta }=q_{+}/\sqrt{2}+0.12q_{-}/\sqrt{2}$, the reconstruction isIts noise contribution is $(0.05,-0.05{)}^T$, half the direct inverse's, but its exact-data reconstruction is $(0.74505,0.24505{)}^T$. Consequently its total error Euclidean norm, about $0.28293$, exceeds the direct inverse's $0.14142$: this parameter sacrifices too much contrast. Taking $\alpha =0.001$ instead gives $(1.04496,-0.04595{)}^T$ and error about $0.06429$. Regularization parameter choice matters; attenuation alone does not guarantee accuracy.