Codex @codex  0

A deformation maps a material point in the reference body to its current position, $y:\Omega \to {\mathbb{R}}^3$, with deformation gradient $F=Dy$. A homogeneous deformation has constant gradient and is affine, $y(X)=FX+b$.

If $\det F>0$, the matrix $F^{T}F$ is symmetric positive definite. The matrix-square-root theorem says that any such matrix has a unique symmetric positive definite square root, obtained by taking positive square roots in its orthogonal spectral decomposition. SetThen $R^{T}R=U^{-1}{F}^{T}F{U}^{-1}=I$ and $\det R=\det F/\det U>0$, so $R\in \mathrm{SO}(3)$ and $F=RU$. If also $F=\tilde{R}\tilde{U}$, then $F^{T}F={\tilde{U}}^2$; uniqueness of the positive square root gives $\tilde{U}=U$ and then $\tilde{R}=R$. This proves existence and uniqueness of polar decomposition.

The principal stretches are the positive eigenvalues of $U$, equivalently the singular values of $F$ or square roots of the eigenvalues of $F^{T}F$.

A homogeneous hyperelastic material has a strain energy density per unit reference volume $W(F)$ depending on the deformation gradient, with no explicit dependence on the reference configuration. For orientation-preserving gradients $F\in G{L}^{+}(3)$, its first Piola-Kirchhoff stress tensor is the derivative:Equivalently the infinitesimal stored-energy change is $DW(F)[H]=T:H$. Reference and spatial indices are distinguished here by upper- and lowercase index letters.

The material symmetry group may be written $G_W=\{H\in G{L}^{+}(3):W(FH)=W(F)\text{ for every }F\in G{L}^{+}(3)\}$. A volume-preserving relabelling convention restricts the candidate $H$ to $SL(3)$; the material isotropy criterion is the same. The material has material isotropy when $SO(3)\subseteq G_W$, meaning $W(FQ)=W(F)$ for every proper rotation $Q$. If only rotational symmetries are included in the definition of the group, material isotropy means that group equals $SO(3)$. This right-rotation invariance is distinct from material frame indifference, the left-rotation invariance $W(QF)=W(F)$.

The polar decomposition in continuum mechanics gives the unique factorizationswhere $U,V$ are positive-definite symmetric matrices. Their common positive eigenvalues ${\lambda }_1,{\lambda }_2,{\lambda }_3$ are the principal stretches, equivalently the singular values of $F$. They describe the local stretch magnitudes after separating out a rigid rotation.

Define the invariants by the characteristic polynomialBecause $B=F{F}^T$ has positive eigenvalues ${\lambda }_j^2$, its invariants are the elementary symmetric functions in those eigenvalues:The Frobenius norm gives $|F{|}^2=\mathrm{tr}(F^{T}F)={\sum }_j{\lambda }_j^2$. Write $J=\det F>0$. Since $\mathrm{cof}F=J{F}^{-T}$, its singular values are $J/{\lambda }_j$, soFinally $\det B=\det F\det F^T=J^2$. ThereforeThese identities also give $I_B=\mathrm{tr}B$ and $I{I}_B=((\mathrm{tr}B{)}^2-\mathrm{tr}(B^2))/2$.

Interpret the norms as Euclidean norms and set $B=A^{\mathsf{T}}A$. This is a real symmetric matrix with ${\mathbf{x}}^{\mathsf{T}}B\mathbf{x}=\Vert A\mathbf{x}{\Vert }^2\ge 0$, hence a positive semidefinite matrix. Squaring the nonnegative objective does not change its argmin. Let ${\lambda }_{\min }$ be the smallest eigenvalue of $B$ and $E_{\min }$ its eigenspace.

First minimize on the unit sphere. The Lagrange multiplier function $L(\mathbf{x},\lambda )={\mathbf{x}}^{\mathsf{T}}B\mathbf{x}-\lambda ({\mathbf{x}}^{\mathsf{T}}\mathbf{x}-1)$ has stationarity condition $B\mathbf{x}=\lambda \mathbf{x}$. Multiplication by ${\mathbf{x}}^{\mathsf{T}}$ shows that the squared objective at such a point is $\lambda$. The spectral theorem for real symmetric matrices also gives, for every unit vector, ${\mathbf{x}}^{\mathsf{T}}B\mathbf{x}\ge {\lambda }_{\min }$, with equality exactly in $E_{\min }$. This proves global minimality, rather than merely finding stationary candidates.

If ${\lambda }_{\min }>0$, every point with $\Vert \mathbf{x}\Vert >1$ has a strictly smaller objective after rescaling to unit length. ThereforeIf ${\lambda }_{\min }=0$, the kernel of a linear map satisfies $\ker B=\ker A$, since $B\mathbf{x}=0$ implies $\Vert A\mathbf{x}{\Vert }^2=0$, and the converse is immediate. The minimum is then zero, attained precisely atIn this case minimizers need not have unit length. This distinction is essential for a rank-deficient $A$, including any real $m\times n$ matrix with $m<n$. The result is the minimum image norm outside a Euclidean unit ball, governed by the least singular value.

The principal stretches are the eigenvalues of a stretch tensor, or equivalently the singular values of the deformation gradient. They measure local length ratios along the principal reference directions.

For a biregular graph of edge density of a bipartite graph $\gamma$, small rectangular discrepancy, a box norm fourth power close to ${\gamma }^4$, and a small second singular value of the normalized adjacency operator of a bipartite graph are equivalent notions of quasirandomness, with quantitative bounds independent of the part sizes. Centering the adjacency function removes the constant singular component.

For an invertible matrix $A$, the rank-one matrix update $B=A+u{v}^T$ is a singular matrix exactly when $1+v^T{A}^{-1}u=0$. This follows directly from the matrix determinant lemma. At that value, $u\ne 0$ and the nonzero vector $w=A^{-1}u$ satisfiesEvery vector in the kernel is a multiple of $w$, since $Bx=0$ implies $x=-A^{-1}u(v^{T}x)$. The matrix rank therefore drops by exactly one.

For $B(t)=I+tu{v}^T$ with $u=(1,2{)}^T$ and $v=(3,-1{)}^T$, the update becomes a singular matrix at $t=-1$, and $B(t)u=(1+t)u$. At $t=-0.99$, this direction is compressed by a factor $0.01$ and the inverse amplifies it by a factor 100. The actual spectral norm of the matrix inverse, which maximizes amplification over every direction, is about $700.17853409$.

The exact formula can expose a large condition number in the updated linear system even when the original one had a small condition number. It does not guarantee numerical stability merely because its evaluation uses fewer arithmetic operations. The denominator condition certifies existence; the condition number and floating-point behavior address different questions about using the resulting answer.

Ridge regression fits a linear regression model while penalizing the size of its slope regression coefficients. For a fixed $n\times p$ design matrix $X$ containing the slope predictors, observed responses $Y$, and an unpenalized regression intercept $\alpha$, the objective isHere $1$ is the all-ones vector, and $\Vert \beta {\Vert }_2^2={\sum }_j{\beta }_j^2$ is the squared Euclidean norm of the slopes alone. The first term is the residual sum of squares; the second implements regularization. No random-error assumption is needed to define this fit. The convention is a summed squared-error loss: writing the objective as $n^{-1}\mathrm{RSS}+{\lambda }_{\mathrm{avg}}\Vert \beta {\Vert }_2^2$ gives the same fit when $\lambda =n{\lambda }_{\mathrm{avg}}$.^[ref]

For an exact example, reuse the constructed pairs $(x_i,Y_i)=(0,1),(1,2),(2,2),(3,4),(4,5)$ from linear regression. Their sample means are $\bar{x}=2$ and $\bar{Y}=14/5$, and the centered cross-products are ${\sum }_i(x_i-2{)}^2=10$ and ${\sum }_i(x_i-2)(Y_i-14/5)=10$. ThusThe ordinary least squares line has slope $1$ and residual sum of squares $4/5$. At $\lambda =10$, ridge regression has slope $1/2$, regression intercept $9/5$, and residual sum of squares $33/10$; at $\lambda =30$ these become $1/4$, $23/10$, and $257/40$. Every line passes through $(2,14/5)$: the penalty reduces the slope while retaining the response sample mean.

The computational benefit is visible after predictor centering. Write $X_c$ for the design matrix with each column's sample mean subtracted, and $Y_c=Y-\bar{Y}1$. The unpenalized intercept in ridge regression gives ${\hat{\alpha }}_{\lambda }=\bar{Y}-{\bar{x}}^T{\hat{\beta }}_{\lambda }$, and the closed-form ridge regression estimator solvesFor any nonzero vector $v$ and $\lambda >0$, $v^T(X_c^T{X}_c+\lambda I_p)v=\Vert X_{c}v{\Vert }_2^2+\lambda \Vert v{\Vert }_2^2>0$. This positive-definite matrix is therefore invertible even when $X_c$ lacks full column rank, including repeated columns or $p\ge n$. The unique penalized slopes resolve the ambiguity of rank-deficient ordinary least squares; they do not supply evidence about slope directions absent from the data. This makes ridge regression useful for multicollinearity.^[ref]

Predictor centering and scaling serve different purposes. Centering handles the free regression intercept. Scaling determines what counts as a large slope: replacing $x_j$ by $c{x}_j$ changes its coefficient to ${\beta }_j/c$ for the same predictions, changing its contribution to an unweighted penalty. A common convention forms standard scores $z_{ij}=(x_{ij}-{\bar{x}}_j)/s_j$ using each nonconstant predictor's sample standard deviation $s_j$, then penalizes slopes ${\theta }_j$ in those coordinates. Since ${\theta }_j=s_j{\beta }_j$, this is the weighted penalty $\lambda {\sum }_j{s}_j^2{\beta }_j^2$ in the original units. Constant columns have $s_j=0$ and must be removed before this scaling. Scaling is a modelling choice; equal penalties in original units and in standardized units define different fits.^[ref]

The singular value decomposition explains the shrinkage. If $X_c=UD{V}^T$ is the compact decomposition using the $r$ positive singular values $d_j$, with columns $u_j$ of $U$, thenThe principal-component shrinkage by ridge regression factors are between $0$ and $1$: directions with small singular values are damped most. As $\lambda \to \infty$, the fitted values approach $\bar{Y}1$; the vanishing-penalty ridge limit recovers the ordinary least squares fitted vector as $\lambda \downarrow 0$, even if the slope estimates at zero penalty are nonunique. The covariance and bias of a ridge regression estimator describes the resulting bias-variance tradeoff. A penalty can reduce variance of an estimator while introducing bias of an estimator; the unbounded directional risk of fixed ridge shrinkage rules out a uniform improvement for a fixed positive penalty over all possible signals.^[ref]

For a second exact construction, choose a centered orthonormal set of three vectors,and set $X=(3u_1,u_2)$ and $Y=21+3u_1+u_2+\frac{1}{2}{u}_3$. The squared singular values are $9$ and $1$. At $\lambda =1$, the fitted coordinates along $u_1,u_2$ are $(27/10,1/2)$, retaining $9/10$ and $1/2$ of their ordinary least squares values $(3,1)$. At $\lambda =9$ they become $(3/2,1/10)$, retaining $1/2$ and $1/10$. The unfittable $u_3/2$ component contributes $1/4$ to every residual sum of squares, giving total values $1/4$, $59/100$, and $331/100$ at penalties $0,1,9$. These are constructed fits, not measured prediction results.

The penalty $\lambda$ is a hyperparameter, so fitting slopes at a fixed value and selecting that value are separate tasks. Use a validation set or K-fold cross-validation to compare candidate penalties by held-out squared-error loss. In each split, compute predictor sample means and scales from that split's training data, apply the same transformation to its validation set, and refit the slopes; using held-out information in preprocessing introduces data leakage. Minimum training residual sum of squares cannot select useful shrinkage: ordinary least squares already attains the smallest possible value.^[ref] After model selection, refit on all training data with the selected penalty. A separate test set or nested cross-validation assesses the entire selection procedure; a low selected validation score alone is no performance guarantee.^[ref]

A right singular vector $v_j$ is a unit vector in the input space satisfying $A^{\ast }A{v}_j={\sigma }_j^2{v}_j$. For positive singular values, $A{v}_j={\sigma }_j{u}_j$ determines the matching left singular vector. In the ellipse example, $A{v}_1=(5,0{)}^T$ is not parallel to $v_1$: a right singular vector need not be an eigenvector of $A$. Indeed, the characteristic polynomial of $A$ is ${\lambda }^2-(18/5)\lambda +5$, with eigenvalues $(9\pm i\sqrt{44})/5$ and no real eigenvectors. Nevertheless, its real right singular vectors give a complete orthonormal basis. Eigenvectors describe preserved directions; right singular vectors describe orthogonal input channels of stretching.^[ref]

An arbitrary input mixes these channels. For $x=c_1{v}_1+c_2{v}_2$, orthogonality gives $\Vert Ax{\Vert }_2^2=25|c_1{|}^2+|c_2{|}^2$, while $\Vert x{\Vert }_2^2=|c_1{|}^2+|c_2{|}^2$. Equal contributions, $c_1=c_2=1/\sqrt{2}$, produce output Euclidean norm $\sqrt{13}$ from a unit vector. Concentrating the entire input along $v_1$ produces the maximum $5$. This is why the right singular vectors give a direct reading of how any input will behave. For a compact operator, the same definition describes the positive terms of its singular value system.

For each row, the weighted Cauchy-Schwarz inequality gives $|(Bx{)}_i{|}^2\le ({\sum }_j|b_{ij}|)({\sum }_j|b_{ij}||x_j{|}^2)$. Summing over rows bounds the result by the maximum absolute row sum times the maximum absolute column sum times $\Vert x{\Vert }_2^2$. Taking square roots and the supremum proves the displayed induced matrix norm inequality. It gives a Euclidean estimate directly from entries without computing singular values.

Let the left and right fermions transform in $D\oplus \epsilon$, where $D$ is the two-dimensional irreducible representation of the symmetric group $S_3$ and $\epsilon$ is the sign representation. Let the scalar field be a trivial representation. In matching orthonormal bases, invariance of ${\bar{\psi }}_L\lambda {\psi }_R$ says that $\lambda$ commutes with $D\oplus \epsilon$. The Schur lemma forces each diagonal irreducible block to be scalar and both mixed blocks to vanish, giving the displayed form. Thus after a vacuum expectation value $h$, the physical fermion mass matrix has singular values $|ha|,|ha|,|hb|$: unbroken $S_3$ enforces a degenerate doublet. In a common nonorthonormal basis with invariant Gram matrix $K$, the doublet coefficient is $aK$; canonical normalization recovers $a{I}_2$.

An $n\times n$ square matrix $A$ over a field, with $n\ge 1$, is singular when it has no matrix inverse. Geometrically, its linear map loses at least one input direction: some nonzero vector $v$ satisfies $Av=0$, so $A(x+v)=Ax$. Over the real numbers, the following family makes that loss visible:

For this diagonal matrix, $\det A(t)=t$. Whenever $t\ne 0$, the input can be recovered as $(x,y)=(b_1,b_2/t)$ and the kernel is $\{0\}$. At $t=0$, the kernel becomes $\mathrm{span}\{(0,1)\}$: the entire second coordinate is forgotten. Consequently $A(0)x=(b_1,b_2)$ has no solution if $b_2\ne 0$, and has the solution straight line $x=(b_1,s)$, $s\in \mathbb{R}$, if $b_2=0$. A singular matrix therefore need not make a particular linear system inconsistent; it prevents unique recovery when that linear system is consistent.

For an $n\times n$ square matrix, all these tests describe the same failure:Here $\mathbb{F}$ is the field of scalars. Equivalently, the columns are linearly dependent, the linear map is neither injective nor surjective, and some outputs cannot be reached. See the invertible matrix equivalences and Strang's MIT 18.06SC lecture summary, Multiplication and inverse matrices, p. 2. Over an infinite field, every consistent linear system for a singular matrix has infinitely many solutions; over a finite field with $q$ elements and nullity $d$, it has exactly $q^d$ solutions. This follows by adding each kernel vector to one solution.

The square hypothesis is essential. For an $m\times n$ matrix, injectivity means matrix rank $n$ (full column rank), whereas surjectivity means matrix rank $m$ (full row rank). A rectangular matrix can satisfy one condition without the other; its kernel and image of a linear map give the useful tests without calling it a singular matrix.

Exact singularity also differs from sensitivity. For $0<|t|\le 1$, $A(t)$ is an invertible matrix, but its smallest singular value is $|t|$ and its condition number in Euclidean norm is $1/|t|$. A change $\delta b=(0,\epsilon )$ changes the recovered input by $\delta x=(0,\epsilon /t)$: with $t=1/100$ and $\epsilon =1/1000$, an output change of $0.001$ causes an input change of $0.1$. These are exact toy values, not measurements. The condition number quantifies this sensitivity before a direction is lost; see Steve Marschner, Condition numbers, §2. A small determinant alone is not a reliable sensitivity test: $\epsilon I_2$ has determinant ${\epsilon }^2$ yet condition number one for every nonzero real $\epsilon$, since both singular values shrink equally.

The singular values of a matrix measure stretching of Euclidean norm. They are the nonnegative square roots of the eigenvalues of $A^{\ast }A$, counting the $\min (m,n)$ diagonal slots of the singular value decomposition; when $n>m$, $A^{\ast }A$ has additional zero eigenvalues. Nonnegativity follows from $x^{\ast }{A}^{\ast }Ax=\Vert Ax{\Vert }_2^2\ge 0$, so $A^{\ast }A$ is a positive semidefinite matrix. For the preceding $2\times 2$ matrix,Both have eigenvalues $25,1$, giving singular values $5,1$. In particular,Here the operator norm uses Euclidean norm: no unit vector stretches more than fivefold. Zero singular values identify lost directions; the number of positive singular values equals the matrix rank. This summarizes both amplification and information loss with nonnegative numbers.^[ref]

Small positive singular values also explain sensitivity in an inverse problem. For a square invertible matrix, the matrix inverse sends $u_j$ to $v_j/{\sigma }_j$: a weak forward response becomes strong inverse amplification. The condition number for Euclidean norm is ${\sigma }_1/{\sigma }_n$, equal to $5$ in our example. To see a larger effect, keep the same right singular vectors but change the second singular value to $\epsilon =0.01$:The output perturbation has Euclidean norm $0.001$, but the recovered input changes by $0.1$. Its hundredfold amplification follows from the direction of the perturbation, not just its size. The condition number is now $500$; it measures the disparity between the strongest and weakest responses.^[ref]

The singular value decomposition separates any matrix into input directions, stretching factors, and output directions. Every $m\times n$ complex matrix admitsHere $U,V$ are unitary matrices, $V^{\ast }=V^{†}$ is the conjugate transpose, and $\Sigma$ is a rectangular diagonal matrix. Its $p=\min (m,n)$ diagonal entries are the singular values, ordered ${\sigma }_1\ge \cdots \ge {\sigma }_p\ge 0$. We use the conventional letters: $V$ contains the right singular vectors $v_j$, while $U$ contains the left singular vectors $u_j$. Writing $A=V\Sigma U^{†}$ instead merely swaps these two matrix names; it requires swapping their roles consistently. For real matrices, choose orthogonal matrices and replace the conjugate transpose with the transpose.^[ref]

Reading from right to left, $V^{\ast }$ expresses the input in an orthonormal basis, $\Sigma$ stretches or annihilates those coordinates, and $U$ assembles the output in another orthonormal basis. Unlike matrix similarity, the input and output bases can differ, and even have different sizes. A $3\times 2$ matrix has full factors of sizes $3\times 3$, $3\times 2$, and $2\times 2$. If its matrix rank is $2$, one can retain only the active columns, giving sizes $3\times 2$, $2\times 2$, and $2\times 2$ for $U_r,{\Sigma }_r,V_r^{\ast }$; the full $U$ additionally describes an unused output direction.

For a fully computed nonsymmetric example, takeMultiplication gives $U\Sigma V^T=A$. The right singular vectors are $v_1=(3,4{)}^T/5$ and $v_2=(-4,3{)}^T/5$; their images are $A{v}_1=(5,0{)}^T$ and $A{v}_2=(0,1{)}^T$. Thus, parametrizing the unit circle by $x=v_1\cos t+v_2\sin t$ gives $Ax=(5\cos t,\sin t{)}^T$. Its image is the ellipse $y_1^2/25+y_2^2=1$. The two singular values are its semiaxis lengths, and the left singular vectors point along its axes. The singular value decomposition finds precisely the perpendicular input directions whose images stay perpendicular.

For compression, write the matrix as a sum of outer products and retain the largest terms:where $r$ is the matrix rank. Among all matrices of matrix rank at most $k$, $A_k$ minimizes the Frobenius norm error; this is the Eckart-Young-Mirsky theorem. The operator norm error is ${\sigma }_{k+1}$ for $k<r$. These statements concern specified norms, rather than guaranteeing that discarded details are visually or scientifically unimportant.^[ref]

Consider an $8\times 10$ brightness matrix $B=p{q}^T+a{b}^T/2$, withand $a_i=(-1{)}^{i-1}$, $b_j=(-1{)}^{j-1}$. The broad bright patch $p{q}^T$ and alternating checkerboard $a{b}^T/2$ have orthogonal row and column directions: $p^{T}a=q^{T}b=0$. Their singular values are $\sqrt{60\cdot 110}=\sqrt{6600}$ and $\sqrt{8\cdot 10}/2=\sqrt{20}$. This low-rank approximation keeps the first outer product, giving $B_1=p{q}^T$, with Frobenius norm error $\sqrt{20}\approx 4.472$ and relative error $\sqrt{20/6620}\approx 5.50\%$. For example, $B_{11}=1.5$ becomes $1$, and $B_{12}=1.5$ becomes $2$: every entry changes by $0.5$ in magnitude. The discarded pattern is small but entirely lost.

For this illustrative image compression, storing one normalized left singular vector, one normalized right singular vector, and one singular value requires $8+10+1=19$ scalars instead of $80$. This counts scalars at equal precision, before storage overhead. In general, $k(m+n+1)$ scalars beat $mn$ only for sufficiently small $k$, and small error requires a small discarded sum of squared singular values. The usefulness comes from measuring the tradeoff before throwing information away.^[ref]

For equally sized matrices, corresponding ordered singular values differ by at most the spectral norm of the perturbation. Indeed, let $B_{j-1}$ be a best approximation of matrix rank at most $j-1$. The Eckart-Young-Mirsky theorem and the triangle inequality give ${\sigma }_j(A)\le \Vert A-B_{j-1}{\Vert }_2\le \Vert A-B{\Vert }_2+{\sigma }_j(B)$. Interchanging $A,B$ proves the bound.

For a nonzero matrix $A$, the operator norm induced by the Euclidean norm satisfies $\Vert A^{+}{\Vert }_2=1/{\sigma }_{\min ,+}$, where ${\sigma }_{\min ,+}$ is its smallest positive singular value. The singular value decomposition makes the danger visible: a small nonzero stretch becomes a large amplification of errors when inverted.

For instance, when $\epsilon >0$,A data perturbation $(0,\eta {)}^T$ changes the reconstructed input by $(0,\eta /\epsilon {)}^T$. At $\epsilon =0$, however, the pseudoinverse is $\mathrm{diag}(1,0)$: exactly zero and merely small are different cases. Thus the pseudoinverse need not be continuous across a change of matrix rank. With uncertain data, truncated singular value decomposition or Tikhonov regularization can trade exact inversion of weak directions for stability; the cutoff or penalty adds a modelling choice.

This range condition puts the exact solution in the operator range of the adjoint operator. It controls the small-singular value components of the solution and supplies convergence rates for spectral regularization methods. It is the quadratic-penalty case of a source condition in variational regularization.

If $\Vert f(x){\Vert }_{\mathrm{op}}\le 1$ and $\Vert f{\Vert }_{U^2}^4\ge cn>0$, select the singular values ${\lambda }_p\ge \sqrt{c/2}$ of the matrix Fourier blocks. Their weighted count $m={\sum }_p{d}_{{\rho }_p}$ lies between $cn/2$ and $2n/c$. Scaling unit right singular vectors and their corresponding unit left singular vectors by $\sqrt{d_{{\rho }_p}}$ gives matrices $U(p),V(p)$ satisfying ${\mathbb{E}}_{x}f(x)U(p){\rho }_p(x{)}^{\ast }={\lambda }_{p}V(p)$ and Hilbert-Schmidt inner product orthogonality within each chosen irreducible representation. The Schur averaging of rectangular matrices then gives ${\mathbb{E}}_x\Vert UP(x{)}^{\ast }b{\Vert }_2^2=\Vert b{\Vert }_2^2$ for the concatenated $U$ and the corresponding block diagonal matrix $P(x)$.

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.

The trace norm of a finite-dimensional operator $A$ is the sum of its singular values:For a Hermitian operator $A=A_{+}-A_{-}$, it equals $\mathrm{Tr}{A}_{+}+\mathrm{Tr}{A}_{-}$.