HW 3 - Self-Adjoint and Normal Operators

Doenjang jigae

7.A

1

Theorem

Suppose n is a positive integer. Define TL(Fn) by:

T(z1,...,zn)=(0,z1,...,zn1)

Find T(z1,...,zn).

Proof
Fix a point y=(y1,...,yn)Fn, and let x=(x1,...,xn)Fn be arbitrary:

x,Ty=Tx,y=(0,x1,...,xn1),(y1,...,yn)=x1y2++xn1yn=x1y2++xn1yn+0xn=x,(y2,...,yn,0)

Thus:

Ty=(y2,...,yn,0)

2

Theorem

Suppose TL(V) and λF. Then λ is an eigenvalue of T iff λ is an eigenvalue of T.

Proof
Consider vV is an eigenvector of T (hence v0) where λ is the corresponding eigenvalue. Then if we fix some wV:

v,Tw=Tv,w=λv,w=λv,w=v,λwv,(TλI)w=0

Notice that (TλI)wv by contraction as then v=0, so then Tλ has to be non-surjective, so there's some w such that it makes the (TλI)w=0.

Thus (Tλ)w=0 so w was an eigenvector with eigenvalue λ. The other way is proved in the same method.

3

Theorem

Suppose TL(V) and U is a subspace of V. Then U is invariant under T iff U is invariant under T.

Proof
U is invariant under T iff for all uU we have TuU, which iff for any uU:

uU,TuU=TuU,uU=0

iff TuU iff T is invariant under U.

4

Theorem

Suppose TL(V,W):

  • T is injective iff T is surjective.
  • T is surjective iff T is injective.

Proof
Let n=dim(V) and m=dim(W).

For (a), T is injective iff null(T)={0} iff dim(null(T))=0 iff (by the FTOLM) dim(range(T))=m. This is iff dim((range(T)))=mn (by the supposition mn0 iff dim(null(T))=mn. Thus, again by the FTOLM iff dim(range(T))=m(mn)=n iff range(T)=W iff T is surjective.

For (b), T is surjective iff range(T)=W iff dim(range(T))=m iff by FTOLM dim(null(T))=nm iff dim((range(T)))=nm (again nm0) iff dim(range(T))=n(nm)=m iff dim(null(T)=0 iff null(T)={0} iff T is injective.

5

Theorem

  • dim(null(T))=dim(null(T))+dim(W)dim(V)
  • dim(range(T))=dim(range(T))
    for all TL(V,W).

Proof

dim(null(T))=dim(W)dim(range(T))FTOLM=dim(W)dim((null(T)))=dim(W)(dim(V)dim(null(T)))=dim(null(T))+dim(W)dim(V)dim(range(T))=dim(W)dim(null(T))See (a)=dim(W)dim(range(T))=dim(W)(dim(W)range(T))=range(T)

6

Theorem

Consider the inner product over P2(R) via:

p,q=01p(x)q(x)dx

Define TP2(R) by T(a0+a1x+a2x2)=a1x.

  • T is not self-adjoint
  • The matrix of T w.r.t. to the standard basis is:
[000010000]

This matrix equals its conjugate transpose, even though T is not self-adjoint. Explain why this not a contradiction.

Proof
For (a), notice that we can find T. Fix q=x+1 and let p=x+2 be arbitrary:

p,Tq=x+1,x=01(x+1)xdx=x33+x22|01=56

while:

Tp,q=x,x+2=01x(x+2)dx=x33+x2|01=43

so p,TqTp,q so TT by counterexample.

For (b), notice that:

T(1)=0+0x+0x2,T(x)=0+1x+0x2,T(x2)=0+0x+0x2

building the matrix:

M(T)=[000010000]

Notice that this matrix is M(T) then:

M(T)=[000010000]=[000010000]=[000010000]=M(T)

This isn't a contradiction because (7.10) assumes that our basis β is an orthonormal-basis, while here they are not orthogonal, nor normal.

7

Theorem

Suppose S,TL(V) are self-adjoint. Then ST is self-adjoint iff ST=TS.

Proof
We know T=T and S=S. ST is self-adjoint iff (ST)=(ST) which is:

ST=(ST)=TS=TS

8

Theorem

Suppose V is a real inner product space. That the set of self-adjoint operators on V is a subspace of L(V).

Proof
Consider S={TL(V):T=T}. We'll show S is a subspace of L(V), since clearly it's a subset. Clearly the zero map 0S since:

0v,w=v,0w=0

For additivity, let T,SS. Then:

T+S=T+S=(T+S)

thus T+SS.

For homogeneity, let λF:

λT=λT=(λT)=(λT)

since V is a real inner product space, so λ=λ. Thus λTS. Thus S is a subspace.

9

Theorem

Suppose V is a complex inner product space. Show that the set of self-adjoint operators on V is NOT a subspace.

Proof
Notice that this is the same case as HW 3 - Self-Adjoint and Normal Operators#8 EXCEPT for homogeneity, where now λ may not be λ. As such, as a counterexample, let λ=i, and have the self-adjoint operator be the identity operator on V. Then:

iI=iI=(iI)(iI)

Showing S is not a subspace.

13

Theorem

There is an example of an operator TL(C4) such that T is normal but not self-adjoint.

Proof
Choose T by:

T(e1)=e2,T(e2)=e1,T(e3)=0,T(e4)=0

notice:

M(T)=[0100100000000000]

We can derive:

M(T)=[0100100000000000]=[0100100000000000]=M(T)

Thus TT while TT=TT since:

M(T)M(T)=M(T)2=M(T)M(T)

since

14

Theorem

Suppose T is a normal operator on V. Suppose also that v,wV satisfy the equations:

v=w=2,Tv=3v,Tw=4w

Then:

T(v+w)=10

Proof
Notice:

T(v+w)=Tv+Tw=3v+4w

so since T and T have the same eigenvectors, so then Tv=3v and Tw=4w:

T(v+w)=Tv+Tw=3v+4w

and since T=T:

T(v+w)=T(v+w)3v+4w=3v2+4w2+23v,4w=0=3222+4222=252=10

Since T is normal then v,w as eigenvectors are orthogonal so v,w=0 above.

16

Theorem

Suppose TL(V) is normal. Then:

range(T)=range(T)

Proof
Let's actually prove that null(T)=null(T). Let unull(T). Then:

unull(T)Tu=0Tu=0Tu,Tu=0TTu,u=0TTu,u=0TT=TTTu,Tu=0Tu=0Tu=0unull(T)

We prove the range part using the properties of these ranges and nullspaces:

range(T)=(null(T))=(null(T))=range(T)

17

Theorem

Suppose TL(V) is normal. Then:

null(Tk)=null(T),range(Tk)=range(T)

for all kN+.

Proof
Let's prove this via induction. For k=1, the theorem is clearly true, so consider some k1N+ holds for the theorem. We'll prove the k case. Notice:

vnull(Tk1)Tk1v=0T(Tk1v)=T0Tkv=0vnull(Tk)

Thus vnull(Tk1)vnull(Tk) so null(Tk1)null(Tk). Since null(T)=null(Tk1) via the inductive hypothesis, then null(T)null(Tk). For the other way let vnull(Tk). Then:

Tkv=0T(Tk1v)=0T(Tk1v)=0null(T)=null(T)TTk1v,TTk1v=0Tk1v,Tk1v=0vnull(Tk1)vnull(Tk)

Showing the range is easy since:

range(Tk)=null((Tk))=null((T)k)=null(T)=range(T)

19

Theorem

Suppose TL(C3) is normal and T(1,1,1)=(2,2,2). Suppose (z1,z2,z3)null(T). Then z1+z2+z3=0.

Proof
Because T is normal, then all eigenvectors of T are orthogonal to one another. Notice that since T(1,1,1)=2(1,1,1) then v1=(1,1,1) is an eigenvector of T with λ1=2. Further notice that since (z1,z2,z3)null(T) then T(z1,z2,z3)=0(z1,z2,z3) so v2=(z1,z2,z3) is an eigenvector with λ2=0.

Therefore, v1,v2 are orthogonal, so v1,v2=0=z1+z2+z3 by doing the dot product.