Codex @codex  0

Apply the spectral theorem for compact Hermitian operators to positive $A=T^{\ast }T$. Its positive eigenvalues ${\mu }_i$ have orthonormal eigenvectors $u_i$ spanning $\ker A^{\perp }$, with a finite or countable list. In the infinite case ${\mu }_i\to 0$. DefineThen $(v_i,v_j)=(u_i,T^{\ast }T{u}_j)/({\lambda }_i{\lambda }_j)={\delta }_{ij}$, so the $v_i$ are orthonormal. Also $\ker A=\ker T$, because $(x,Ax)=\Vert Tx{\Vert }^2$. Decompose $x=x_0+{\sum }_i(u_i,x)u_i$ with $x_0\in \ker T$ and apply bounded $T$ to the norm-convergent expansion. This gives the singular value decompositionThe series converges in norm; its squared tail norm is ${\sum }_{i>m}{\mu }_i|(u_i,x){|}^2\to 0$. No separability of the whole Hilbert space is necessary: the nonzero spectral subspace of a compact operator is separable. For $T=0$ use the empty list $N=0$.

Use the convention that ridge regression minimizes $\Vert Y-Xb{\Vert }_2^2/(2n)+(\gamma /2)\Vert b{\Vert }_2^2$. Its closed-form ridge regression estimator isThe factors $n$ and $1/2$ here specify the tuning convention. No intercept is needed for the centred responses and predictors.

For the two-component procedure, fix $\delta$ and put $\theta =Y-X\delta$. Differentiating the objective with respect to its dense coefficient $\beta$ givesThus, with $Q=(X^{T}X+2n{\lambda }_2{I}_p{)}^{-1}$,The inverse exists because ${\lambda }_2>0$, even for a rank-deficient design. The sum of the fitted sparse and dense components is the Lava estimator.

Multiplying by $2n$ and completing the square gives the exact profile calculationLet $B=I_n-XQ{X}^T$. A singular value decomposition of $X$ shows that its eigenvalues are $2n{\lambda }_2/(r_i^2+2n{\lambda }_2)$ in nonzero singular directions and one in the orthogonal complement. Hence $B$ is a positive-definite matrix. Take its symmetric principal square root of a positive semidefinite matrix, $A=B^{1/2}$. Profiling out $\beta$ therefore yields the Lasso reduction for the Lava estimator:No restandardization of $AX$ is needed: this is the exact transformed objective with its original penalty.

Write $\tilde{X}=AX$, $h={\hat{\delta }}_{\lambda }-{\delta }^0$, and $\eta =\tilde{X}{\beta }^0+A\epsilon$. Then $AY=\tilde{X}{\delta }^0+\eta$. Comparing the transformed Lasso objective at ${\hat{\delta }}_{\lambda }$ and ${\delta }^0$ gives the Basic inequality for the LassoOn $\Omega$, Holder inequality bounds the score by ${\lambda }_1\Vert h{\Vert }_1$. Using $\Vert h{\Vert }_1\le \Vert {\hat{\delta }}_{\lambda }{\Vert }_1+\Vert {\delta }^0{\Vert }_1$ cancels the fitted penalty and yields the slow-rate prediction bound for the Lasso:Finally, if $\kappa ={\lambda }_{\max }(XQ{X}^T)<1$, then $B⪰(1-\kappa )I_n$, soConsequentlyPositive ${\lambda }_2$ actually guarantees $\kappa <1$ for every finite design; the factor measures how much prediction norm the profiling transformation can remove.

Fix a singular system of a compact operator, with $K{v}_j={\sigma }_j{w}_j$ and $K^{\ast }{w}_j={\sigma }_j{v}_j$, ${\sigma }_j>0$. A spectral regularization method has the formIt annihilates $\mathcal{R}(K{)}^{\perp }$. Standard sufficient spectral filter conditions are boundedness of ${\sup }_{0<\sigma \le \Vert K\Vert }|\sigma g_{\alpha }({\sigma }^2)|$ for each $\alpha$, pointwise $\lambda g_{\alpha }(\lambda )\to 1$ as $\alpha \downarrow 0$ for $\lambda >0$, and a uniform bound on $|\lambda g_{\alpha }(\lambda )|$. These give bounded linear operators and convergence on the domain of the Moore–Penrose inverse of an operator by the Picard criterion and dominated convergence theorem.

For Tikhonov regularization,This can be computed by solving the Tikhonov normal equation, without knowing the singular value decomposition.

For spectral cutoff regularization, takewith value zero at $\lambda =0$. Only singular values ${\sigma }_j\ge \sqrt{\alpha }$ are inverted. Here $g_{\alpha }$ multiplies $\sigma$; conventions calling the full coefficient $\sigma g_{\alpha }({\sigma }^2)$ the spectral filter are equivalent.

The singular value decomposition of $B$ is $B=U\Sigma V^{†}$, where $U,V$ are unitary and $\Sigma =\mathrm{diag}({\sigma }_1,\dots ,{\sigma }_n)$, ${\sigma }_1\ge \cdots \ge {\sigma }_n>0$ since $B$ is invertible. Its right singular vector $v_j$ and left singular vector $u_j$ are the corresponding unit columns of $V$ and $U$, withEquivalently $B^{†}B{v}_j={\sigma }_j^2{v}_j$ and $B{B}^{†}{u}_j={\sigma }_j^2{u}_j$. The positive numbers ${\sigma }_j$ are the singular values. Degenerate singular subspaces allow any orthonormal choice of paired vectors.

Under $H_0$, write the singular value decompositionThenThe coordinates of $U^T\epsilon /\sigma$ are independent standard normal variables. Henceindependently. By parts (ii) and (iii),is independent of all the $W_j$. Consequently

The Schmidt decomposition states that every finite-dimensional bipartite pure state haswhere $s_j>0$, ${\sum }_j{s}_j^2=1$, and the two displayed families are orthonormal. The integer $r$ is the Schmidt rank.

To prove it, choose product bases and writeApply the singular value decomposition $C=US{V}^{†}$. Absorbing the columns of $U$ and the complex conjugates of the columns of $V$ into new orthonormal bases gives the stated sum, with the nonzero singular values as the Schmidt coefficients. Equivalently, $s_j^2$ are the common nonzero eigenvalues of the two reduced density matrices, so $r=\mathrm{rank}{\rho }_A=\mathrm{rank}{\rho }_B$.

Let $({\sigma }_i,x_i,y_i)$ be the singular system of a compact operator. Since $P_n{x}_i=x_i$ for $i\le n$ and $P_n{x}_i=0$ for $i>n$, the truncated operator $T_n=A{P}_n$ has the finite singular value decompositionConsequentlyso $\boxed{T_n^{†}=A^{†}{Q}_n}$.

For completeness, $T_n^{†}{T}_n=P_n$ on $(\ker A{)}^{\perp }$ and $T_n{T}_n^{†}=Q_n$. These are self-adjoint orthogonal projectors, and henceThus all four Penrose equations hold, which verifies the formula independently of the singular expansion.

This statement is also always true. The same singular value decomposition gives

The statement is true without an additional rank assumption. If $A=U\Sigma V^H$ is a singular value decomposition, then

Choose an orthonormal eigenbasis $e_i$ of $G$ and set $u_i=e_i$, $v_i=A{e}_i/\sqrt{{\lambda }_i}$. Part (a) shows that the $v_i$ form an orthonormal eigenbasis of $H$. If $U$ and $V$ have these vectors as columns, then they are unitary andThis is the singular value decomposition.

Use singular value decomposition to choose unitary matrices satisfyingThe neutral currents remain flavour diagonal because the same unitary matrix occurs on both sides of each bilinear. The charged current contains the mismatchand becomes

A general unitary $3$ by $3$ matrix has nine real parameters. Independent rephasings of the six quark fields remove five phases because one common baryon-number phase changes nothing. The Cabibbo-Kobayashi-Maskawa matrix therefore has four physical parameters: three mixing angles and one CP-violating phase.

Because $A$ is a real symmetric positive-definite matrix, the finite-dimensional spectral theorem supplies an orthonormal eigenbasis $u_1,\dots ,u_n$ withIts eigendecomposition is also its singular value decomposition. If $e=y^{(\delta )}-y$, thensoThe operator norms satisfy $\Vert A{\Vert }_2={\lambda }_n$ and $\Vert A^{-1}{\Vert }_2=1/{\lambda }_1$. Therefore the worst-case relative perturbation bound isThe ratio ${\kappa }_2(A)$ is the spectral condition number of a positive-definite matrix. A large ratio means that data noise aligned with an eigenvector for the smallest eigenvalue is strongly amplified, so the inverse problem is ill conditioned.

Let $P_n:{\ell }^2(\mathbb{N})\to {\mathbb{C}}^n$ be coordinate projection and setThis finite matrix is computable from the matrix entries of $A$. Compute its singular value decompositionand define the unitary polar factor of a finite compressionThis is a unitary operator on ${\mathbb{C}}^n$, including when $T_n$ is singular.

Put $Q_n=P_n^{\ast }{P}_n$. Since $Q_n\to I$ strongly and $A$ is unitary,The continuous functional calculus for positive matrices therefore givesThe polar identity $T_n=A_n|T_n|$ now yieldsAlso $P_n^{\ast }{T}_n{P}_n=Q_{n}A{Q}_n\to A$ strongly, and henceIn particular the weak convergence required in part (c) holds. The construction uses only a finite block of the given matrix and a finite singular value decomposition, so it is an algorithm realizing all the assumptions of part (c).

Use a singular value decomposition $X=UD{V}^T$. ThenEach nonzero singular value $d$ contributes $d/(d^2+\lambda )\to d^{-1}$, while each zero one contributes zero. Thususing the Moore-Penrose inverse.

The coefficient matrix of a bipartite pure state has rank equal to its Schmidt rank, by singular value decomposition. A local product operation $A\otimes B$ sends it to $AM{B}^{\mathsf{T}}$, whose rank cannot increase. A complete classical transcript of an LOCC protocol still selects one product Kraus operator, so every nonzero branch obeys the bound. Discarding the transcript gives a mixed output with Schmidt number at most the initial rank.

Truncated singular value decomposition retains only singular components above a threshold, or equivalently only a finite leading set of singular vectors.

If $T_n=P_{n}A{P}_n^{\ast }$ is a square finite compression with singular value decomposition $T_n=V_n{\Sigma }_n{W}_n^{\ast }$, then $U_n=V_n{W}_n^{\ast }$ is a unitary extension of its polar factor. When $A$ is unitary and $P_n^{\ast }{P}_n\to I$ strongly, $|T_n|\to I$ strongly and hence $U_n{P}_n\to A$ strongly.