HW 6 - Polar & Singular Value Decomposition

2

Question

Give an example of T∈L(C2) such that 0 is the only eigenvalue of T and the singular values of T are 5,0.

Proof
Consider:

T(z1,z2)=(5z2,0)

Then:

T(e1)=(0,0),T(e2)=5e1⇒M(T)=[0500]

Notice that here λ2=0⇔λ=0 is the only eigenvalue, with eigenvector e1 in this case. However, calculating T∗:

⟨x,T∗y⟩=⟨Tx,y⟩=⟨(5x2,0),(y1,y2)⟩=5x2y1∗=⟨(x1,x2),(0,5y1)⟩

Thus T∗(x)=(0,5x2). Namely:

T∗T(x)=T∗(5x2,0)=(5x2,0)

This is confirmed by calculating M(T∗)=M(T)∗ manually:

M(T∗)=[0050]

Thus:

M(T∗T)=[0050][0500]=[00025]

Thus the eigenvalues of T∗T are 0 and 25, so then it's singular values are the square roots, namely 0 and 5 are the singular values for T.
☐

4

Question

Suppose T∈L(V) and s is a singular value of T. Prove that there exists a vector v∈V such that ‖v‖=1 and ‖Tv‖=s.

Proof
Since s is a singular value of T, then s is the eigenvalue of T∗T by definition, and thus there exists a corresponding eigenvector to s, we'll name v. Thus T∗Tv=sv. But notice:

T∗Tv=...T∗T2v=T∗T(sv)=s(T∗Tv)=s2v

Thus:

⟨T∗Tv,v⟩=⟨Tv,Tv⟩⟨s2v,v⟩=‖Tv‖2s2⟨v,v⟩=‖Tv‖2s2‖v‖2=‖Tv‖2s‖v‖=‖Tv‖

So notice this. Choose v′∈V where v′=v‖v‖. Notice that v′ is still an eigenvector of T∗T with eigenvalue s, so the finding above works if we replace all the v's with v′'s. But notice that now:

5

Question

Suppose T∈L(C2) is defined by T(x,y)=(−4y,x). Find the singular values of T.

Proof
We should first find T∗. Notice for a fixed y∈C2 and arbitrary x∈C2:

⟨Tx,y⟩=⟨(−4x2,x1),(y1,y2)⟩=−4x2y1∗+x1y2∗=x1y2∗−4x2y1∗=⟨(x1,x2),(y2,−4y1)⟩⟨x,T∗y⟩=⟨x,(y2,−4y1)⟩

Thus T∗(x,y)=(y,−4x). We should now determine M(T∗T) and then find the square roots of these eigenvalues. First notice that T∗T(x,y)=T∗(−4y,x)=(x,16y), so:

M(T∗T)=[10016]

As such, then we have a diagonal matrix, so the eigenvalues are on the diagonal. Thus, λ1=1,λ2=16 with the corresponding eigenvectors as the standard basis vectors for C2.

Therefore, our singular values are the square roots of these:

4,1

☐

6

Question

Find the singular values of the differentiation operator D∈P(R2) defined by Dp=p′, with the inner product given by:

⟨p,q⟩=∫−11p(x)q(x)dx

Proof
The example 6.33 gives the standard basis for P2(R):

β={12,32x,458(x2−13)}

Notice what the differentiation operator D does to our standard basis vectors:

De1=0De2=32=3e1De3=458⋅2x=452x=15e2

Thus:

M(D,β)=[0300015000]

So:

M(D∗D,β)=[0003000150][0300015000]=[0000300015]

Thus our singular values, from largest to smallest, are:

15,3,0

☐

7

Question

Define T∈L(F3) by:

T(z1,z2,z3)=(z3,2z1,3z2)

Find (explicitly) an isometry S∈L(F3) such that T=ST∗T.

Proof
For this case we can just deal with everything in terms of matrices since we're finite dimensional! Notice:

M(T)=[001200030]

Finding T∗:

⟨Tx,y⟩=⟨(x3,2x1,3x2),(y1,y2,y3)⟩=x3y1∗+2x1y2∗+3x2y3∗=2x1y2∗+3x2y3∗+x3y1∗=⟨(x1,x2,x3),(2y2,3y3,y1)⟩=⟨x,T∗y⟩

Thus T∗(z1,z2,z3)=(2z2,3z3,z1):

M(T∗)=[020003100]=M(T)T

which makes sense! As such:

M(T∗T)=M(T∗)M(T)=[400090001]

Since this is a diagonal matrix, clearly then:

M(T∗T)=[200030001]

Notice that M(T∗T) can be inverted:

M(T∗T−1)=[12000130001]

Multiplication of M(T∗T)M(T∗T−1) (both ways) gives the identity to verify this. As such, we can assume, and later verify, that:

M(S)=M(T)M(T∗T−1)=[001100010]

This I claim that I choose the transformation:

S(z1,z2,z3)=(z3,z1,z2)

is a valid isometry where T=ST∗T. To validate this, first let v∈V be arbitrary. Then:

‖Sv‖2=‖S(v1,v2,v3)‖2=‖(v3,v1,v2)‖2=|v3|2‖e1‖2+|v1|2‖e2‖2+|v2|2‖e3‖2=|v3|2‖e3‖2+|v1|2‖e1‖2+|v2|2‖e2‖2∀i(‖ei‖2=1)=‖(v1,v2,v3)‖2=‖v‖2

using the Pythagorean Theorem (our ei's are orthonormal). Thus, square rooting both sides gives ‖Sv‖=‖v‖ so S is a valid isometry.

To show that T=ST∗T, let v∈V be arbitrary. We know that v=∑i=13αiei:

ST∗Tv=ST∗T(∑i=13αiei)=∑i=13αiST∗Tei=2α1Se1+3α2Se2+α3Se3Use M(T∗T)=2α1e2+3α2e3+α3e1=(α3,2α1,3α2)=Tv

So since v was arbitrary, it follows ST∗T=T.
☐

8

Question

Suppose T∈L(V), while S∈L(V) is an isometry, and R∈L(V) is a positive operator such that T=SR. Prove that R=T∗T.

Proof
Using polar decomposition, we already know that since T∈L(V) that there is some isometry S′∈L(V) such that:

T=S′T∗T

Furthermore, we know from the question that we are given S and R where:

T=SR

Thus:

SR=S′T∗T

Thus, notice that since both S,S′ are isometries, by their properties then they are invertible and S−1=S∗ and likewise S′−1=S′∗. So then R=S∗T and S′∗T=T∗T. Consider:

0=‖Tv‖2−‖Tv‖2=‖S∗Tv‖2−‖S′∗Tv‖2=‖Rv‖2−‖T∗Tv‖2=⟨Rv,Rv⟩−⟨T∗Tv,T∗Tv⟩=⟨R∗Rv,v⟩−⟨T∗Tv,v⟩=⟨(R∗R−T∗T)v,v⟩

Thus we have R∗R−T∗T=0→. Since R is a positive operator then R is self-adjoint. Thus R=R∗ so then R2=T∗T. Then R has a unique positive square root which is R=T∗T.
☐

10

Question

Suppose T∈L(V) is self-adjoint. Prove that the singular values of T equal the absolute values of the eigenvalues of T, repeated appropriately.

Proof
Since T is self-adjoint then T=T∗ so then T only has real-valued eigenvalues λi∈R. For our cases, say that dim⁡(V)=n and λ1,...,λn∈R are eigenvalues of T, with some repeats possible.

Since T is self-adjoint, then no matter what by either Spectral Theorem we have an orthonormal basis consisting of eigenvectors of T. We'll label them β={e1,...,en} in this case, and each ei gets paired with it's corresponding eigenvalues λi. In essence:

M(T,β)=diag(λ1,...,λn)

Since T is self-adjoint, then T∗T=T∗T=TT=T2. As result, then T=T∗T because it's a possible square root (we don't know if it's unique or not).

Consider an eigenvector of T∗T, we'll denote fi. We'll show that fi∈β. Notice that it has an eigenvalue s. Notice that:

T∗T2fi=s2fi=T∗Tfi=T2fi⇒(T2−s2)fi=0→

As such notice that:

⇒(T−sI)(T+sI)fi=0→

So fi is an eigenvector of T. We know that we have an eigenbasis for T namely β thus fi∈β.

To end, let si be a singular value of T. Thus it's an eigenvalue of T∗T. We know any ei is an eigenvector of both transformations. Thus:

Tei=λiei⇔T∗Tei=siei

But:

T∗T2ei=si2ei=T2ei=λi2ei⇒(si2−λi2)ei=0→

Since all ei≠0→ then si2−λi2=0. Thus si2=λi2⇒si=|λi|. Notice that si cannot be negative since singular values are nonnegative square roots of the eigenvalues of T∗T.
☐

14

Question

Suppose T∈L(V) Then dim⁡(range(T)) is equal to the number of nonzero singular values of T.

Proof
Say dim⁡(V)=n for clarity. Let's first prove that range(T)=range(T∗T). We know from a previous exercise in HW 3 - Self-Adjoint and Normal Operators#5 that range(T)=range(T∗).

⊆: Suppose w∈range(T). Since range(T)=range(T∗) then w∈range(T∗) so ∃ v such that T∗v=w. We can write v=v′+v″ where v′∈null(T∗) and v″∈null(T∗)⊥. But since null(T∗)⊥=range(T) then notice that ∃ u where Tu=v″. Thus:

T∗Tu=T∗v″=w

Because notice that since v′∈null(T∗) then T∗w=T∗(v′+v″)=T∗v′+T∗v″=0→+T∗v″=T∗v″. As such, we can always choose vector u here such that T∗Tu=w, so then w∈range(T∗T).

⊇: We know that range(T∗T)⊆range(T∗)=range(T).

Thus we know that range(T∗T)=range(T). Since T∗T is diagonalizable as it is self-adjoint, then the number of nonzero singular values of T is the dimension of range(T∗T)=range(T∗T)=range(T).

☐

17

Question

Suppose T∈L(V) has singular value decomposition given by:

Tv=s1⟨v,e1⟩f1+⋯+sn⟨v,en⟩fn

for every v∈V where s1,...,sn are the singular values of T and e1,...,en and f1,...,fn are orthonormal bases of V.

  1. Prove that if v∈V, then:
T∗v=s1⟨v,f1⟩e1+⋯+sn⟨v,fn⟩en
  1. Prove that if v∈V, then:
T∗Tv=s12⟨v,e1⟩e1+⋯+sn2⟨v,en⟩en
  1. Prove that if v∈V, then:
T∗Tv=s1⟨v,e1⟩e1+⋯+sn⟨v,en⟩en
  1. Suppose T is invertible. Prove that if v∈V, then:
T−1v=∑i=1n⟨v,fi⟩eisi

for every v∈V.

Proof
(1) Notice that:

Tej=sjfj

for all 1≤j≤n. Notice then that if βe={e1,...,en} and βf={f1,...,fn} then we have:

M(T,βe,βf)=[s10…00s2…0⋮⋮⋱000…sn]

Thus:

M(T∗,βf,βe)=M(T,βe,βf)∗=[s10…00s2…0⋮⋮⋱000…sn]

Because all si∈R so the conjugate operation does nothing. As a result, then reading the matrix this implies:

T∗fj=sjej

As a result, because we can use the bases βe,βf then we can say that, using Graham Schmidt:

T∗v=s1⟨v,f1⟩e1+⋯+sn⟨v,fn⟩en

(2) Apply T∗ to the left of T via the matrices:

M(T∗T,βe,βe)=M(T∗,βf,βe)M(T,βe,βf)=[s120…00s22…0⋮⋮⋱000…sn2]

As such then:

T∗Tej=sj2ej

Using Graham Schmidt:

T∗Tv=∑i=1nsi2⟨v,ei⟩ei

(3) Since T∗T is positive, then T∗T is unique. From (2), we know that the eigenvalues are given by sj2 for each eigenvector ej. As such T∗T's eigenvalues are just the square roots of T∗T's eigenvalues, which is sj2=|sj|=sj because singular values are non-negative. As such, then:

T∗Tej=sjej

by this finding, so then applying Graham Schmidt:

T∗Tv=∑i=1nsj⟨v,ej⟩ej

(4) Apply TT−1 and T−1T and see they are the identity:

T−1Tv=T−1(∑i=1nsi⟨v,ei⟩fi)=∑j=1n⟨∑i=1nsi⟨v,ei⟩fi,fj⟩ejsj=∑j=1nsj⟨v,ej⟩ejsj=∑j=1n⟨v,ej⟩ej=vTT−1v=T(∑i=1n⟨v,fi⟩eisi)=∑j=1nsj⟨∑i=1n⟨v,fi⟩eisi,ej⟩fj=∑j=1nsjsj⟨v,fj⟩fj=v

thus T−1 is the correct definition for the inverse of T.
☐