Unit 7, lesson 31

The Singular Value Decomposition

Why every real or complex matrix has a singular value decomposition, built from the Gram operator, with singular values, left and right singular vectors, thin and compact forms, and the choices that remain.

  • Video 31
  • The Decomposition and the Pseudoinverse

The matrix with rows (3,0)(3, 0), (0,0)(0, 0) and (0,2)(0, 2) sends the plane into three-dimensional space. Eigenvectors make no sense here, because Av=λvAv = \lambda v would compare a vector of R3\mathbb{R}^3 with a vector of R2\mathbb{R}^2. Still, the input e1e_1 lands on 3e13e_1 and the input e2e_2 lands on 2e32e_3, so two perpendicular inputs go to two perpendicular outputs, stretched by 33 and 22. This lesson proves that every real or complex matrix of any shape can be described this way, builds the directions from A∗AA^{*}A, and separates what the matrix determines from what is a free choice. Throughout, a tuple such as (1,2)(1, 2) stands for a column vector, and Fn\mathbb{F}^n carries the standard inner product ⟨x,y⟩=x∗y\langle x, y \rangle = x^{*}y.

Key terms

Gram operator

Definition Let F\mathbb{F} be R\mathbb{R} or C\mathbb{C} and let A∈Fm×nA \in \mathbb{F}^{m \times n}. The Gram operator of AA is the n×nn \times n matrix A∗AA^{*}A, which acts on the input space Fn\mathbb{F}^n. Over R\mathbb{R} it is ATAA^{\mathsf{T}}A. If a1,…,ana_1, \dots, a_n are the columns of AA, then (A∗A)ij=⟨ai,aj⟩(A^{*}A)_{ij} = \langle a_i, a_j \rangle, so it is the Gram matrix of the columns. For every x∈Fnx \in \mathbb{F}^n

x∗(A∗A) x=(Ax)∗(Ax)=∥Ax∥2≥0.\begin{aligned} x^{*}(A^{*}A)\,x &= (Ax)^{*}(Ax) \\[0.4em] &= \lVert Ax \rVert^2 \ge 0. \end{aligned}

The matrix A∗AA^{*}A is Hermitian, since (A∗A)∗=A∗A(A^{*}A)^{*} = A^{*}A, and this identity makes it positive semidefinite. Its eigenvalues are real and nonnegative, since A∗Av=λvA^{*}Av = \lambda v with v≠0v \ne 0 gives λ∥v∥2=∥Av∥2\lambda \lVert v \rVert^2 = \lVert Av \rVert^2. Its kernel equals ker⁡A\ker A. If Ax=0Ax = 0, then A∗Ax=0A^{*}Ax = 0. If A∗Ax=0A^{*}Ax = 0, then ∥Ax∥2=x∗A∗Ax=0\lVert Ax \rVert^2 = x^{*}A^{*}Ax = 0, so Ax=0Ax = 0. By rank-nullity, rank⁡(A∗A)=rank⁡A\operatorname{rank}(A^{*}A) = \operatorname{rank} A. None of this needs AA to be square or normal. For a linear map T ⁣:V→WT \colon V \to W between finite-dimensional inner product spaces, the Gram operator is T∗T ⁣:V→VT^{*}T \colon V \to V, and the same proofs apply.

In plain words The Gram operator lives on the input side and records, as a squared length, how much AA stretches each input. An input is lost by AA exactly when the Gram operator loses it.

Example Let AA have rows (1,1)(1, 1), (0,1)(0, 1) and (1,0)(1, 0). Its columns are a1=(1,0,1)a_1 = (1, 0, 1) and a2=(1,1,0)a_2 = (1, 1, 0), so

ATA=[2112].A^{\mathsf{T}}A = \begin{bmatrix} 2 & 1 \\ 1 & 2 \end{bmatrix}.

For x=(1,−1)x = (1, -1) the quadratic form gives 2−1−1+2=22 - 1 - 1 + 2 = 2, and indeed Ax=(0,−1,1)Ax = (0, -1, 1) has squared length 22. For the rank-one matrix with rows (1,2)(1, 2), (2,4)(2, 4) and (0,0)(0, 0), the Gram operator has rows (5,10)(5, 10) and (10,20)(10, 20), and both matrices send (2,−1)(2, -1) to zero.

Singular value

Definition Let A∈Fm×nA \in \mathbb{F}^{m \times n} and p=min⁡(m,n)p = \min(m, n). List the eigenvalues of A∗AA^{*}A with multiplicity in decreasing order, λ1≥⋯≥λn≥0\lambda_1 \ge \cdots \ge \lambda_n \ge 0. The singular values of AA are the nonnegative square roots

σi=λi,i=1,…,p,\sigma_i = \sqrt{\lambda_i}, \qquad i = 1, \dots, p,

so that σ1≥⋯≥σp≥0\sigma_1 \ge \cdots \ge \sigma_p \ge 0. The diagonalizable matrix A∗AA^{*}A has as many positive eigenvalues as its rank, which is rank⁡A≤p\operatorname{rank} A \le p. So all positive eigenvalues are among λ1,…,λp\lambda_1, \dots, \lambda_p, and the number rr of positive singular values equals rank⁡A\operatorname{rank} A. When n>mn > m, the remaining eigenvalues λp+1,…,λn\lambda_{p+1}, \dots, \lambda_n are therefore all zero. Their eigenvectors lie in ker⁡A\ker A, and these zeros are not counted as extra singular values. The singular values depend only on AA, and they are real and nonnegative even when the eigenvalues of a square AA are negative or not real.

In plain words Singular values are the stretching factors of AA. They are never negative, and a full list has exactly min⁡(m,n)\min(m, n) entries, zeros included.

Example For the matrix with rows (1,1)(1, 1), (0,1)(0, 1) and (1,0)(1, 0), the Gram operator above has eigenvalues 33 and 11, with eigenvectors (1,1)(1, 1) and (1,−1)(1, -1). The singular values are σ1=3\sigma_1 = \sqrt{3} and σ2=1\sigma_2 = 1, and the rank is 22. For the diagonal matrix diag⁡(2,−3)\operatorname{diag}(2, -3) the Gram operator is diag⁡(4,9)\operatorname{diag}(4, 9), so the singular values are 33 and 22. The eigenvalue −3-3 becomes the singular value 33, and its sign has to be carried by a singular vector instead.

Left and right singular vectors

Definition Let A∈Fm×nA \in \mathbb{F}^{m \times n} have rank rr and singular values σ1≥⋯≥σr>0\sigma_1 \ge \cdots \ge \sigma_r > 0, all others zero. By the spectral theorem for the Hermitian matrix A∗AA^{*}A, choose an orthonormal basis v1,…,vnv_1, \dots, v_n of Fn\mathbb{F}^n with A∗Avi=σi2viA^{*}Av_i = \sigma_i^2 v_i for i≤ri \le r and A∗Avi=0A^{*}Av_i = 0 for i>ri > r. These are right singular vectors. For i≤ri \le r the left singular vectors are

ui=1σi Avi,i=1,…,r,u_i = \frac{1}{\sigma_i}\,Av_i, \qquad i = 1, \dots, r,

which needs σi>0\sigma_i > 0. They are orthonormal, because

⟨ui,uj⟩=vi∗A∗Avjσiσj=σj2⟨vi,vj⟩σiσj,\begin{aligned} \langle u_i, u_j \rangle &= \frac{v_i^{*}A^{*}Av_j}{\sigma_i \sigma_j} \\[0.4em] &= \frac{\sigma_j^2 \langle v_i, v_j \rangle}{\sigma_i \sigma_j}, \end{aligned}

which is 11 for i=ji = j and 00 otherwise. Expanding x=∑i⟨vi,x⟩vix = \sum_i \langle v_i, x \rangle v_i gives Ax=∑i≤rσi⟨vi,x⟩uiAx = \sum_{i \le r} \sigma_i \langle v_i, x \rangle u_i, so u1,…,uru_1, \dots, u_r span im⁡A\operatorname{im} A. Complete them with an orthonormal basis ur+1,…,umu_{r+1}, \dots, u_m of ker⁡A∗\ker A^{*}, which is the orthogonal complement of im⁡A\operatorname{im} A, since ⟨Ax,y⟩=⟨x,A∗y⟩\langle Ax, y \rangle = \langle x, A^{*}y \rangle vanishes for every xx exactly when A∗y=0A^{*}y = 0. The two lists satisfy

Avi=σiui,A∗ui=σivi(i≤r),Avi=0(r<i≤n),A∗ui=0(r<i≤m).\begin{gathered} Av_i = \sigma_i u_i, \quad A^{*}u_i = \sigma_i v_i \quad (i \le r), \\[0.4em] Av_i = 0 \quad (r < i \le n), \\[0.4em] A^{*}u_i = 0 \quad (r < i \le m). \end{gathered}

So u1,…,uru_1, \dots, u_r is an orthonormal basis of im⁡A\operatorname{im} A, ur+1,…,umu_{r+1}, \dots, u_m of ker⁡A∗\ker A^{*}, v1,…,vrv_1, \dots, v_r of im⁡A∗\operatorname{im} A^{*}, and vr+1,…,vnv_{r+1}, \dots, v_n of ker⁡A\ker A.

In plain words Right singular vectors are perpendicular input directions and left singular vectors are perpendicular output directions. The matrix sends each input direction to its output partner, stretched by σi\sigma_i, and sends the leftover input directions to zero. The leftover output directions are perpendicular to every output of AA, so AA never reaches them.

Example Continue with the matrix AA with rows (1,1)(1, 1), (0,1)(0, 1) and (1,0)(1, 0). Normalizing the eigenvectors gives v1=(1,1)/2v_1 = (1, 1)/\sqrt{2} and v2=(1,−1)/2v_2 = (1, -1)/\sqrt{2}. Then

u1=13 Av1=16 (2,1,1),u2=Av2=12 (0,−1,1).\begin{aligned} u_1 &= \tfrac{1}{\sqrt{3}}\,Av_1 = \tfrac{1}{\sqrt{6}}\,(2, 1, 1), \\[0.4em] u_2 &= Av_2 = \tfrac{1}{\sqrt{2}}\,(0, -1, 1). \end{aligned}

The rank is 2=n2 = n, so ker⁡A={0}\ker A = \{0\} and no input direction is lost. The output space needs one more unit vector orthogonal to both, u3=(1,−1,−1)/3u_3 = (1, -1, -1)/\sqrt{3}, and indeed ATu3=0A^{\mathsf{T}}u_3 = 0. One can also check that ATu1=3 v1A^{\mathsf{T}}u_1 = \sqrt{3}\,v_1.

Singular value decomposition

Definition Let F\mathbb{F} be R\mathbb{R} or C\mathbb{C}, A∈Fm×nA \in \mathbb{F}^{m \times n} and p=min⁡(m,n)p = \min(m, n). A singular value decomposition of AA is a factorization

A=UΣV∗A = U \Sigma V^{*}

with U∈Fm×mU \in \mathbb{F}^{m \times m} and V∈Fn×nV \in \mathbb{F}^{n \times n} unitary and Σ∈Rm×n\Sigma \in \mathbb{R}^{m \times n} rectangular diagonal, with Σii=σi\Sigma_{ii} = \sigma_i for i≤pi \le p, σ1≥⋯≥σp≥0\sigma_1 \ge \cdots \ge \sigma_p \ge 0, and every other entry 00. The theorem says that every A∈Fm×nA \in \mathbb{F}^{m \times n} has a singular value decomposition and that the diagonal of Σ\Sigma is always the list of singular values of AA. When AA is real, UU and VV can be chosen real orthogonal, giving A=UΣVTA = U\Sigma V^{\mathsf{T}}. For existence, put the vectors constructed above into U=[u1 ⋯ um]U = [u_1 \ \cdots \ u_m] and V=[v1 ⋯ vn]V = [v_1 \ \cdots \ v_n]. Then

AV=[σ1u1⋯σrur0⋯0]=UΣ,\begin{aligned} &AV \\[0.4em] &= \begin{bmatrix} \sigma_1 u_1 & \cdots & \sigma_r u_r & 0 & \cdots & 0 \end{bmatrix} \\[0.4em] &= U\Sigma, \end{aligned}

and multiplying on the right by V∗=V−1V^{*} = V^{-1} gives A=UΣV∗A = U\Sigma V^{*}. If r=0r = 0, then A=0A = 0, Σ=0\Sigma = 0 and any unitary UU and VV work. Conversely, any such factorization gives A∗A=V(ΣTΣ)V∗A^{*}A = V(\Sigma^{\mathsf{T}}\Sigma)V^{*}, so the squared diagonal entries of Σ\Sigma are eigenvalues of A∗AA^{*}A and the diagonal is forced. Multiplying out gives a sum of rank-one matrices,

A=∑i=1rσi uivi∗.A = \sum_{i=1}^{r} \sigma_i\, u_i v_i^{*}.

Also A∗=VΣTU∗A^{*} = V\Sigma^{\mathsf{T}}U^{*} is a singular value decomposition of A∗A^{*}, so AA and A∗A^{*} have the same singular values.

In plain words Every matrix acts in three steps. The factor V∗V^{*} reads off the coordinates of the input along the right singular vectors, the factor Σ\Sigma stretches each coordinate and drops or pads coordinates to change the dimension, and the factor UU lays the results along the left singular vectors. Unlike diagonalization, the input basis and the output basis are chosen separately, and both are orthonormal.

Example Let AA be the opening matrix, with rows (3,0)(3, 0), (0,0)(0, 0) and (0,2)(0, 2). Its Gram operator is diag⁡(9,4)\operatorname{diag}(9, 4), so V=I2V = I_2, the singular values are 33 and 22, and u1=Ae1/3=e1u_1 = Ae_1/3 = e_1, u2=Ae2/2=e3u_2 = Ae_2/2 = e_3. Completing with e2e_2, which spans ker⁡AT\ker A^{\mathsf{T}}, gives

U=[100001010],Σ=[300200],UΣVT=[300002]=A.\begin{gathered} U = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 1 & 0 \end{bmatrix}, \\[0.4em] \Sigma = \begin{bmatrix} 3 & 0 \\ 0 & 2 \\ 0 & 0 \end{bmatrix}, \\[0.4em] U\Sigma V^{\mathsf{T}} = \begin{bmatrix} 3 & 0 \\ 0 & 0 \\ 0 & 2 \end{bmatrix} = A. \end{gathered}

The last row of Σ\Sigma is zero, and UU places that zero in the second output coordinate, the direction e2e_2 that AA never produces.

Thin and compact SVD

Definition Let A=UΣV∗A = U\Sigma V^{*} be a full singular value decomposition of A∈Fm×nA \in \mathbb{F}^{m \times n}, with rank rr and p=min⁡(m,n)p = \min(m, n). Write UkU_k and VkV_k for the first kk columns of UU and VV, and Σk=diag⁡(σ1,…,σk)\Sigma_k = \operatorname{diag}(\sigma_1, \dots, \sigma_k). In each of the three forms AA is the product of the left factor, the middle factor and the adjoint of the right factor.

FormLeft factorMiddle factorRight factor
FullUU, size m×mm \times mΣ\Sigma, size m×nm \times nVV, size n×nn \times n
ThinUpU_p, size m×pm \times pΣp\Sigma_p, size p×pp \times pVpV_p, size n×pn \times p
CompactUrU_r, size m×rm \times rΣr\Sigma_r, size r×rr \times rVrV_r, size n×rn \times r

The thin SVD A=UpΣpVp∗A = U_p\Sigma_pV_p^{*} holds because the columns it drops meet only zero rows or columns of Σ\Sigma, and it still contains zero singular values when r<pr < p. The compact SVD

A=UrΣrVr∗=∑i=1rσi uivi∗A = U_r \Sigma_r V_r^{*} = \sum_{i=1}^{r} \sigma_i\, u_i v_i^{*}

keeps only the positive singular values, so Σr\Sigma_r is invertible when r≥1r \ge 1. When r=0r = 0 its factors are empty and the product is read as the zero matrix. The narrow factors have orthonormal columns, so Ur∗Ur=IrU_r^{*}U_r = I_r and Vr∗Vr=IrV_r^{*}V_r = I_r, but UrUr∗U_rU_r^{*} is the orthogonal projector onto im⁡A\operatorname{im} A and equals ImI_m only when r=mr = m. Books use the words reduced, thin and economy in different ways, so it is safest to state the shapes.

In plain words The full form completes both orthonormal bases. The thin form keeps as many directions as the smaller dimension allows, and the compact form keeps only the directions with a positive stretch, which is all the information needed to rebuild AA.

Example Let AA have rows (1,2)(1, 2), (2,4)(2, 4) and (0,0)(0, 0). It is an outer product,

A=[120][12]=5 u1v1T,A = \begin{bmatrix} 1 \\ 2 \\ 0 \end{bmatrix} \begin{bmatrix} 1 & 2 \end{bmatrix} = 5\,u_1 v_1^{\mathsf{T}},

with u1=(1,2,0)/5u_1 = (1, 2, 0)/\sqrt{5} and v1=(1,2)/5v_1 = (1, 2)/\sqrt{5}. So r=1r = 1, σ1=5\sigma_1 = 5, and the compact SVD has shapes 3×13 \times 1, 1×11 \times 1 and 2×12 \times 1. Here p=2p = 2, so the thin SVD adds σ2=0\sigma_2 = 0, the unit vector v2=(2,−1)/5v_2 = (2, -1)/\sqrt{5} spanning ker⁡A\ker A, and a unit vector u2u_2 orthogonal to u1u_1, for example u2=e3u_2 = e_3. Its shapes are 3×23 \times 2, 2×22 \times 2 and 2×22 \times 2. The full SVD also needs u3u_3, for example u3=(2,−1,0)/5u_3 = (2, -1, 0)/\sqrt{5}. Together u2u_2 and u3u_3 span ker⁡AT\ker A^{\mathsf{T}}, the plane orthogonal to (1,2,0)(1, 2, 0).

Nonuniqueness of singular vectors

Definition Let A=UΣV∗A = U\Sigma V^{*} be a singular value decomposition of A∈Fm×nA \in \mathbb{F}^{m \times n} of rank rr. Let σ>0\sigma > 0 be a singular value that occurs exactly kk times, and let Uσ∈Fm×kU_\sigma \in \mathbb{F}^{m \times k} and Vσ∈Fn×kV_\sigma \in \mathbb{F}^{n \times k} hold the matching columns of UU and VV. For every unitary Q∈Fk×kQ \in \mathbb{F}^{k \times k}, real orthogonal if the decomposition is to stay real, replacing UσU_\sigma by UσQU_\sigma Q and VσV_\sigma by VσQV_\sigma Q gives another singular value decomposition, because

σ (UσQ)(VσQ)∗=σ UσVσ∗.\sigma\,(U_\sigma Q)(V_\sigma Q)^{*} = \sigma\,U_\sigma V_\sigma^{*}.

For k=1k = 1 this multiplies uiu_i and viv_i by the same scalar cc with ∣c∣=1\lvert c \rvert = 1, which is a sign ±1\pm 1 in a real decomposition. Separately, the last m−rm - r columns of UU may be replaced by any orthonormal basis of ker⁡A∗\ker A^{*}, and the last n−rn - r columns of VV by any orthonormal basis of ker⁡A\ker A, chosen independently. Every singular value decomposition of AA arises from a given one by these changes. What AA does determine are the singular values, the subspaces ker⁡(A∗A−σ2I)\ker(A^{*}A - \sigma^2 I) and ker⁡(AA∗−σ2I)\ker(AA^{*} - \sigma^2 I) for each σ>0\sigma > 0, and each block σUσVσ∗\sigma U_\sigma V_\sigma^{*}.

In plain words The stretches are fixed, but the directions carry choices. A sign or phase may be moved onto a pair of partner directions, a group of equal positive stretches may use any orthonormal basis of its subspace as long as the input and output partners change together, and orthonormal bases for the input directions that AA loses and for the output directions perpendicular to everything it produces can be chosen freely.

Example In the opening matrix, replacing u1=e1u_1 = e_1 by −e1-e_1 alone turns the first row of UΣVTU\Sigma V^{\mathsf{T}} into (−3,0)(-3, 0), so the product is no longer AA. Replacing v1=e1v_1 = e_1 by −e1-e_1 as well restores AA, since the two signs cancel in 3u1v1T3u_1v_1^{\mathsf{T}}. For 2I22I_2 both singular values equal 22, and for every 2×22 \times 2 real orthogonal matrix QQ the factorization

2I2=Q (2I2) QT2I_2 = Q\,(2I_2)\,Q^{\mathsf{T}}

is a singular value decomposition, so any orthonormal basis of R2\mathbb{R}^2 can serve as the right singular vectors, provided the left ones are the same basis. In the rank-one example above, u2u_2 and u3u_3 can be any orthonormal basis of the plane ker⁡AT\ker A^{\mathsf{T}}, while in a real decomposition v2v_2 can only be ±(2,−1)/5\pm(2, -1)/\sqrt{5}.

Check yourself

  1. Find the singular values and a singular value decomposition of the matrix AA with rows (0,−2)(0, -2) and (1,0)(1, 0), and compare the singular values with its eigenvalues.
Show the answer

The Gram operator is ATA=diag⁡(1,4)A^{\mathsf{T}}A = \operatorname{diag}(1, 4), so σ1=2\sigma_1 = 2 and σ2=1\sigma_2 = 1, with v1=e2v_1 = e_2 and v2=e1v_2 = e_1. Then u1=Ae2/2=(−1,0)u_1 = Ae_2/2 = (-1, 0) and u2=Ae1/1=(0,1)u_2 = Ae_1/1 = (0, 1), which gives

U=[−1001],Σ=[2001],V=[0110].\begin{gathered} U = \begin{bmatrix} -1 & 0 \\ 0 & 1 \end{bmatrix}, \quad \Sigma = \begin{bmatrix} 2 & 0 \\ 0 & 1 \end{bmatrix}, \\[0.4em] V = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}. \end{gathered}

Multiplying out, UΣVTU\Sigma V^{\mathsf{T}} has rows (0,−2)(0, -2) and (1,0)(1, 0), as required. The characteristic polynomial is χA(t)=t2+2\chi_A(t) = t^2 + 2, so the eigenvalues are ±i2\pm i\sqrt{2}. They are not real, while the singular values are 22 and 11. Only the products agree, since ∣det⁡A∣=2=σ1σ2\lvert \det A \rvert = 2 = \sigma_1\sigma_2.

  1. Let AA have rows (1,1,0)(1, 1, 0) and (0,0,2)(0, 0, 2). Find its singular values and a thin SVD, and explain the zero eigenvalue of ATAA^{\mathsf{T}}A.
Show the answer

The Gram operator is

ATA=[110110004],A^{\mathsf{T}}A = \begin{bmatrix} 1 & 1 & 0 \\ 1 & 1 & 0 \\ 0 & 0 & 4 \end{bmatrix},

with eigenvalues 44, 22, 00 and unit eigenvectors e3e_3, (1,1,0)/2(1, 1, 0)/\sqrt{2}, (1,−1,0)/2(1, -1, 0)/\sqrt{2}. Here p=2p = 2, so the singular values are σ1=2\sigma_1 = 2 and σ2=2\sigma_2 = \sqrt{2}. Then u1=Ae3/2=e2u_1 = Ae_3/2 = e_2 and u2=A(1,1,0)/2=e1u_2 = A(1, 1, 0)/2 = e_1. A thin SVD is A=U2Σ2V2TA = U_2\Sigma_2V_2^{\mathsf{T}} with

U2=[0110],Σ2=[2002],V2=[01/201/210].\begin{gathered} U_2 = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}, \quad \Sigma_2 = \begin{bmatrix} 2 & 0 \\ 0 & \sqrt{2} \end{bmatrix}, \\[0.4em] V_2 = \begin{bmatrix} 0 & 1/\sqrt{2} \\ 0 & 1/\sqrt{2} \\ 1 & 0 \end{bmatrix}. \end{gathered}

Check that 2u1v1T+2 u2v2T2u_1v_1^{\mathsf{T}} + \sqrt{2}\,u_2v_2^{\mathsf{T}} has rows (1,1,0)(1, 1, 0) and (0,0,2)(0, 0, 2). The rank is 2=p2 = p, so this is also the compact SVD. The third eigenvalue 00 lies beyond the p=2p = 2 singular values. It is not an extra singular value, and its eigenvector (1,−1,0)/2(1, -1, 0)/\sqrt{2} spans ker⁡A\ker A and can serve as the third column of VV in the full SVD, where Σ\Sigma is 2×32 \times 3.

  1. True or false? (a) For every square matrix, the singular values are the absolute values of the eigenvalues. (b) If A=UΣV∗A = U\Sigma V^{*} is a singular value decomposition, replacing u1u_1 by −u1-u_1 and changing nothing else gives another one.
Show the answer

Statement (a) is false. The matrix with rows (1,1)(1, 1) and (0,1)(0, 1) has the eigenvalue 11 twice, but its Gram operator has rows (1,1)(1, 1) and (1,2)(1, 2), with eigenvalues (3±5)/2(3 \pm \sqrt{5})/2, so its singular values are

σ1=1+52,σ2=5−12.\sigma_1 = \frac{1 + \sqrt{5}}{2}, \qquad \sigma_2 = \frac{\sqrt{5} - 1}{2}.

The statement does hold for normal matrices. If A=QΛQ∗A = Q\Lambda Q^{*} with QQ unitary, then A∗A=QΛ‾ΛQ∗A^{*}A = Q\overline{\Lambda}\Lambda Q^{*} has eigenvalues ∣λi∣2\lvert \lambda_i \rvert^2.

Statement (b) is false whenever σ1>0\sigma_1 > 0. The change replaces the term σ1u1v1∗\sigma_1u_1v_1^{*} by −σ1u1v1∗-\sigma_1u_1v_1^{*}, so the product becomes A−2σ1u1v1∗≠AA - 2\sigma_1u_1v_1^{*} \ne A. The sign has to change on v1v_1 as well, and then the two signs cancel.

How this lesson connects

It also uses singular value decomposition calculations from a first linear algebra course.