HW 3 - Self-Adjoint and Normal Operators

Doenjang jigae

7.A

1

Theorem

Suppose n is a positive integer. Define T∈L(Fn) by:

T(z1,...,zn)=(0,z1,...,zn−1)

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

\begin{proof}
Fix a point y=(y1,...,yn)∈Fn, and let x=(x1,...,xn)∈Fn be arbitrary:

⟨x,T∗y⟩=⟨Tx,y⟩=⟨(0,x1,...,xn−1),(y1,...,yn)⟩=x1y2∗+⋯+xn−1yn∗=x1y2∗+⋯+xn−1yn∗+0xn=⟨x,(y2,...,yn,0)⟩

Thus:

T∗y=(y2,...,yn,0)

\end{proof}

2

Theorem

Suppose T∈L(V) and λ∈F. Then λ is an eigenvalue of T iff λ― is an eigenvalue of T∗.

\begin{proof}
Consider v∈V is an eigenvector of T (hence v≠0) where λ is the corresponding eigenvalue. Then if we fix some w∈V:

⟨v,T∗w⟩=⟨Tv,w⟩=⟨λv,w⟩=λ⟨v,w⟩=⟨v,λ―w⟩⇔⟨v,(T−λ―I)w⟩=0

Notice that (T−λ―I)w≠v 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.
\end{proof}

3

Theorem

Suppose T∈L(V) and U is a subspace of V. Then U is invariant under T iff U⊥ is invariant under T∗.

\begin{proof}
U is invariant under T iff for all u∈U we have Tu∈U, which iff for any u′∈U⊥:

⟨u⏟∈U,T∗u′⏟∈U⊥⟩=⟨Tu⏟∈U,u′⏟∈U⊥⟩=0

iff T∗u′∈U⊥ iff T∗ is invariant under U⊥.
\end{proof}

4

Theorem

Suppose T∈L(V,W):

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

\begin{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))⊥)=m−n (by the supposition m−n≥0 iff dim(null(T∗))=m−n. Thus, again by the FTOLM iff dim(range(T∗))=m−(m−n)=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))=n−m iff dim((range(T∗))⊥)=n−m (again n−m≥0) iff dim(range(T∗))=n−(n−m)=m iff dim(null(T∗)=0 iff null(T∗)={0→} iff T∗ is injective.
\end{proof}

5

Theorem

  • dim(null(T∗))=dim(null(T))+dim(W)−dim(V)
  • dim(range(T∗))=dim(range(T))
    for all T∈L(V,W).

\begin{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)

\end{proof}

6

Theorem

Consider the inner product over P2(R) via:

⟨p,q⟩=∫01p(x)q(x)dx

Define T∈P2(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.

\begin{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,Tq⟩≠⟨Tp,q⟩ so T≠T∗ 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]∗=[00001∗0000]=[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.
\end{proof}

7

Theorem

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

\begin{proof}
We know T=T∗ and S=S∗. ST is self-adjoint iff (ST)=(ST)∗ which is:

ST=(ST)∗=T∗S∗=TS

\end{proof}

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).

\begin{proof}
Consider S={T∈L(V):T=T∗}. We'll show S is a subspace of L(V), since clearly it's a subset. Clearly the zero map 0→∈S since:

⟨0→v,w⟩=⟨v,0→w⟩=0

For additivity, let T,S∈S. Then:

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

thus T+S∈S.

For homogeneity, let λ∈F:

λT=λT∗=(λ―T)∗=(λT)∗

since V is a real inner product space, so λ=λ―. Thus λT∈S. Thus S is a subspace.
\end{proof}

9

Theorem

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

\begin{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.
\end{proof}

13

Theorem

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

\begin{proof}
Choose T by:

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

notice:

M(T)=[0−100100000000000]

We can derive:

M(T∗)=[0−100100000000000]∗=[0100−100000000000]=−M(T)

Thus T∗≠T while T∘T∗=T∗∘T since:

M(T)M(T∗)=−M(T)2=M(T∗)M(T)

since
\end{proof}

14

Theorem

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

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

Then:

‖T(v+w)‖=10

\begin{proof}
Notice:

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

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

T∗(v+w)=T∗v+T∗w=3v+4w

and since T=T∗:

‖T(v+w)‖=‖T∗(v+w)‖⟨3v+4w⟩=‖3v‖2+‖4w‖2+2⟨3v,4w⟩⏟=0=32⋅22+42⋅22=252=10

Since T is normal then v,w as eigenvectors are orthogonal so ⟨v,w⟩=0 above.
\end{proof}

16

Theorem

Suppose T∈L(V) is normal. Then:

range(T)=range(T∗)

\begin{proof}
Let's actually prove that null(T)=null(T∗). Let u∈null(T). Then:

u∈null(T)⇔Tu=0⇔‖Tu‖=0⇔⟨Tu,Tu⟩=0⇔⟨T∗Tu,u⟩=0⇔⟨TT∗u,u⟩=0TT∗=T∗T⇔⟨T∗u,T∗u⟩=0⇔‖T∗u‖=0⇔T∗u=0⇔u∈null(T∗)

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

range(T)=(null(T∗))⊥=(null(T))⊥=range(T∗)

\end{proof}

17

Theorem

Suppose T∈L(V) is normal. Then:

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

for all k∈N+.

\begin{proof}
Let's prove this via induction. For k=1, the theorem is clearly true, so consider some k−1∈N+ holds for the theorem. We'll prove the k case. Notice:

v∈null(Tk−1)⇒Tk−1v=0⇒T(Tk−1v)=T0⇒Tkv=0⇒v∈null(Tk)

Thus v∈null(Tk−1)⇒v∈null(Tk) so null(Tk−1)⊆null(Tk). Since null(T)=null(Tk−1) via the inductive hypothesis, then null(T)⊆null(Tk). For the other way let v∈null(Tk). Then:

Tkv=0T(Tk−1v)=0T∗(Tk−1v)=0null(T)=null(T∗)⟨T∗Tk−1v,T∗Tk−1v⟩=0⟨Tk−1v,Tk−1v⟩=0⇔v∈null(Tk−1)⇔v∈null(Tk)

Showing the range is easy since:

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

\end{proof}

19

Theorem

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

\begin{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.
\end{proof}