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.
The matrix with rows (3,0), (0,0) and (0,2) sends the plane into three-dimensional space. Eigenvectors make no sense here, because Av=λv would compare a vector of R3 with a vector of R2. Still, the input e1 lands on 3e1 and the input e2 lands on 2e3, so two perpendicular inputs go to two perpendicular outputs, stretched by 3 and 2. This lesson proves that every real or complex matrix of any shape can be described this way, builds the directions from A∗A, and separates what the matrix determines from what is a free choice. Throughout, a tuple such as (1,2) stands for a column vector, and Fn carries the standard inner product ⟨x,y⟩=x∗y.
Key terms
Gram operator
Definition Let F be R or C and let A∈Fm×n. The Gram operator of A is the n×n matrix A∗A, which acts on the input space Fn. Over R it is ATA. If a1,…,an are the columns of A, then (A∗A)ij=⟨ai,aj⟩, so it is the Gram matrix of the columns. For every x∈Fn
x∗(A∗A)x=(Ax)∗(Ax)=∥Ax∥2≥0.
The matrix A∗A is Hermitian, since (A∗A)∗=A∗A, and this identity makes it positive semidefinite. Its eigenvalues are real and nonnegative, since A∗Av=λv with v=0 gives λ∥v∥2=∥Av∥2. Its kernel equals kerA. If Ax=0, then A∗Ax=0. If A∗Ax=0, then ∥Ax∥2=x∗A∗Ax=0, so Ax=0. By rank-nullity, rank(A∗A)=rankA. None of this needs A to be square or normal. For a linear map T:V→W between finite-dimensional inner product spaces, the Gram operator is T∗T:V→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 A stretches each input. An input is lost by A exactly when the Gram operator loses it.
Example Let A have rows (1,1), (0,1) and (1,0). Its columns are a1=(1,0,1) and a2=(1,1,0), so
ATA=[2112].
For x=(1,−1) the quadratic form gives 2−1−1+2=2, and indeed Ax=(0,−1,1) has squared length 2. For the rank-one matrix with rows (1,2), (2,4) and (0,0), the Gram operator has rows (5,10) and (10,20), and both matrices send (2,−1) to zero.
Singular value
Definition Let A∈Fm×n and p=min(m,n). List the eigenvalues of A∗A with multiplicity in decreasing order, λ1≥⋯≥λn≥0. The singular values of A are the nonnegative square roots
σi=λi,i=1,…,p,
so that σ1≥⋯≥σp≥0. The diagonalizable matrix A∗A has as many positive eigenvalues as its rank, which is rankA≤p. So all positive eigenvalues are among λ1,…,λp, and the number r of positive singular values equals rankA. When n>m, the remaining eigenvalues λp+1,…,λn are therefore all zero. Their eigenvectors lie in kerA, and these zeros are not counted as extra singular values. The singular values depend only on A, and they are real and nonnegative even when the eigenvalues of a square A are negative or not real.
In plain words Singular values are the stretching factors of A. They are never negative, and a full list has exactly min(m,n) entries, zeros included.
Example For the matrix with rows (1,1), (0,1) and (1,0), the Gram operator above has eigenvalues 3 and 1, with eigenvectors (1,1) and (1,−1). The singular values are σ1=3 and σ2=1, and the rank is 2. For the diagonal matrix diag(2,−3) the Gram operator is diag(4,9), so the singular values are 3 and 2. The eigenvalue −3 becomes the singular value 3, and its sign has to be carried by a singular vector instead.
Left and right singular vectors
Definition Let A∈Fm×n have rank r and singular values σ1≥⋯≥σr>0, all others zero. By the spectral theorem for the Hermitian matrix A∗A, choose an orthonormal basis v1,…,vn of Fn with A∗Avi=σi2vi for i≤r and A∗Avi=0 for i>r. These are right singular vectors. For i≤r the left singular vectors are
which is 1 for i=j and 0 otherwise. Expanding x=∑i⟨vi,x⟩vi gives Ax=∑i≤rσi⟨vi,x⟩ui, so u1,…,ur span imA. Complete them with an orthonormal basis ur+1,…,um of kerA∗, which is the orthogonal complement of imA, since ⟨Ax,y⟩=⟨x,A∗y⟩ vanishes for every x exactly when A∗y=0. The two lists satisfy
So u1,…,ur is an orthonormal basis of imA, ur+1,…,um of kerA∗, v1,…,vr of imA∗, and vr+1,…,vn of kerA.
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, and sends the leftover input directions to zero. The leftover output directions are perpendicular to every output of A, so A never reaches them.
Example Continue with the matrix A with rows (1,1), (0,1) and (1,0). Normalizing the eigenvectors gives v1=(1,1)/2 and v2=(1,−1)/2. Then
u1u2=31Av1=61(2,1,1),=Av2=21(0,−1,1).
The rank is 2=n, so kerA={0} and no input direction is lost. The output space needs one more unit vector orthogonal to both, u3=(1,−1,−1)/3, and indeed ATu3=0. One can also check that ATu1=3v1.
Singular value decomposition
Definition Let F be R or C, A∈Fm×n and p=min(m,n). A singular value decomposition of A is a factorization
A=UΣV∗
with U∈Fm×m and V∈Fn×n unitary and Σ∈Rm×n rectangular diagonal, with Σii=σi for i≤p, σ1≥⋯≥σp≥0, and every other entry 0. The theorem says that every A∈Fm×n has a singular value decomposition and that the diagonal of Σ is always the list of singular values of A. When A is real, U and V can be chosen real orthogonal, giving A=UΣVT. For existence, put the vectors constructed above into U=[u1⋯um] and V=[v1⋯vn]. Then
AV=[σ1u1⋯σrur0⋯0]=UΣ,
and multiplying on the right by V∗=V−1 gives A=UΣV∗. If r=0, then A=0, Σ=0 and any unitary U and V work. Conversely, any such factorization gives A∗A=V(ΣTΣ)V∗, so the squared diagonal entries of Σ are eigenvalues of A∗A and the diagonal is forced. Multiplying out gives a sum of rank-one matrices,
A=i=1∑rσiuivi∗.
Also A∗=VΣTU∗ is a singular value decomposition of A∗, so A and A∗ have the same singular values.
In plain words Every matrix acts in three steps. The factor V∗ reads off the coordinates of the input along the right singular vectors, the factor Σ stretches each coordinate and drops or pads coordinates to change the dimension, and the factor U 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 A be the opening matrix, with rows (3,0), (0,0) and (0,2). Its Gram operator is diag(9,4), so V=I2, the singular values are 3 and 2, and u1=Ae1/3=e1, u2=Ae2/2=e3. Completing with e2, which spans kerAT, gives
U=100001010,Σ=300020,UΣVT=300002=A.
The last row of Σ is zero, and U places that zero in the second output coordinate, the direction e2 that A never produces.
Thin and compact SVD
Definition Let A=UΣV∗ be a full singular value decomposition of A∈Fm×n, with rank r and p=min(m,n). Write Uk and Vk for the first k columns of U and V, and Σk=diag(σ1,…,σk). In each of the three forms A is the product of the left factor, the middle factor and the adjoint of the right factor.
Form
Left factor
Middle factor
Right factor
Full
U, size m×m
Σ, size m×n
V, size n×n
Thin
Up, size m×p
Σp, size p×p
Vp, size n×p
Compact
Ur, size m×r
Σr, size r×r
Vr, size n×r
The thin SVD A=UpΣpVp∗ holds because the columns it drops meet only zero rows or columns of Σ, and it still contains zero singular values when r<p. The compact SVD
A=UrΣrVr∗=i=1∑rσiuivi∗
keeps only the positive singular values, so Σr is invertible when r≥1. When r=0 its factors are empty and the product is read as the zero matrix. The narrow factors have orthonormal columns, so Ur∗Ur=Ir and Vr∗Vr=Ir, but UrUr∗ is the orthogonal projector onto imA and equals Im only when r=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 A.
Example Let A have rows (1,2), (2,4) and (0,0). It is an outer product,
A=120[12]=5u1v1T,
with u1=(1,2,0)/5 and v1=(1,2)/5. So r=1, σ1=5, and the compact SVD has shapes 3×1, 1×1 and 2×1. Here p=2, so the thin SVD adds σ2=0, the unit vector v2=(2,−1)/5 spanning kerA, and a unit vector u2 orthogonal to u1, for example u2=e3. Its shapes are 3×2, 2×2 and 2×2. The full SVD also needs u3, for example u3=(2,−1,0)/5. Together u2 and u3 span kerAT, the plane orthogonal to (1,2,0).
Nonuniqueness of singular vectors
Definition Let A=UΣV∗ be a singular value decomposition of A∈Fm×n of rank r. Let σ>0 be a singular value that occurs exactly k times, and let Uσ∈Fm×k and Vσ∈Fn×k hold the matching columns of U and V. For every unitary Q∈Fk×k, real orthogonal if the decomposition is to stay real, replacing Uσ by UσQ and Vσ by VσQ gives another singular value decomposition, because
σ(UσQ)(VσQ)∗=σUσVσ∗.
For k=1 this multiplies ui and vi by the same scalar c with ∣c∣=1, which is a sign ±1 in a real decomposition. Separately, the last m−r columns of U may be replaced by any orthonormal basis of kerA∗, and the last n−r columns of V by any orthonormal basis of kerA, chosen independently. Every singular value decomposition of A arises from a given one by these changes. What A does determine are the singular values, the subspaces ker(A∗A−σ2I) and ker(AA∗−σ2I) for each σ>0, and each block σUσVσ∗.
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 A loses and for the output directions perpendicular to everything it produces can be chosen freely.
Example In the opening matrix, replacing u1=e1 by −e1 alone turns the first row of UΣVT into (−3,0), so the product is no longer A. Replacing v1=e1 by −e1 as well restores A, since the two signs cancel in 3u1v1T. For 2I2 both singular values equal 2, and for every 2×2 real orthogonal matrix Q the factorization
2I2=Q(2I2)QT
is a singular value decomposition, so any orthonormal basis of R2 can serve as the right singular vectors, provided the left ones are the same basis. In the rank-one example above, u2 and u3 can be any orthonormal basis of the plane kerAT, while in a real decomposition v2 can only be ±(2,−1)/5.
Check yourself
Find the singular values and a singular value decomposition of the matrix A with rows (0,−2) and (1,0), and compare the singular values with its eigenvalues.
Show the answer
The Gram operator is ATA=diag(1,4), so σ1=2 and σ2=1, with v1=e2 and v2=e1. Then u1=Ae2/2=(−1,0) and u2=Ae1/1=(0,1), which gives
U=[−1001],Σ=[2001],V=[0110].
Multiplying out, UΣVT has rows (0,−2) and (1,0), as required. The characteristic polynomial is χA(t)=t2+2, so the eigenvalues are ±i2. They are not real, while the singular values are 2 and 1. Only the products agree, since ∣detA∣=2=σ1σ2.
Let A have rows (1,1,0) and (0,0,2). Find its singular values and a thin SVD, and explain the zero eigenvalue of ATA.
Show the answer
The Gram operator is
ATA=110110004,
with eigenvalues 4, 2, 0 and unit eigenvectors e3, (1,1,0)/2, (1,−1,0)/2. Here p=2, so the singular values are σ1=2 and σ2=2. Then u1=Ae3/2=e2 and u2=A(1,1,0)/2=e1. A thin SVD is A=U2Σ2V2T with
U2=[0110],Σ2=[2002],V2=0011/21/20.
Check that 2u1v1T+2u2v2T has rows (1,1,0) and (0,0,2). The rank is 2=p, so this is also the compact SVD. The third eigenvalue 0 lies beyond the p=2 singular values. It is not an extra singular value, and its eigenvector (1,−1,0)/2 spans kerA and can serve as the third column of V in the full SVD, where Σ is 2×3.
True or false? (a) For every square matrix, the singular values are the absolute values of the eigenvalues. (b) If A=UΣV∗ is a singular value decomposition, replacing u1 by −u1 and changing nothing else gives another one.
Show the answer
Statement (a) is false. The matrix with rows (1,1) and (0,1) has the eigenvalue 1 twice, but its Gram operator has rows (1,1) and (1,2), with eigenvalues (3±5)/2, so its singular values are
σ1=21+5,σ2=25−1.
The statement does hold for normal matrices. If A=QΛQ∗ with Q unitary, then A∗A=QΛΛQ∗ has eigenvalues ∣λi∣2.
Statement (b) is false whenever σ1>0. The change replaces the term σ1u1v1∗ by −σ1u1v1∗, so the product becomes A−2σ1u1v1∗=A. The sign has to change on v1 as well, and then the two signs cancel.
May we count page visits to understand which courses and learning features are useful? Cloudflare collects visit and performance statistics, without your account details or answers. Your choice does not affect access. Details