Lecture 15 - Finishing 7C, More Applications of Linear!

Recall how we defined a positive operator:

positive operator

An operator TL(V) is called positive if T is self-adjoint and:
Tv,v0
for all vV.

Recall we needed Tv,vR and thus required that T to be self-adjoint.

Like with complex numbers, we want to show how 's of operators stay within this positive realm.

Properties of positive operators

TL(V) is self-adjoint, the following are equivalent:

  • T is positive
  • T is self-adjoint and all eigenvalues of T are non-negative.
  • T has a positive square root (we will show that this is unique later).
  • T has a self-adjoint square root.
  • There exists an operator R such that T=RR.

Proof
We prove (a) (b) ... (e) (a). Notice that:

(a) (b): Suppose T is positive. Let Tv=λv for some non-zero vector v. Then:

Tv,v=λv,v=λv,v0

via the definition. Since v,v=v20 so then λ0 and we are done.

(b) (c): There is an orthonormal eigenbasis β={e1,...,en} for V (via the Spectral Theorem) w/ e-vals λ1,...,λn. Then:

M(T,β)=[λ1000λ2000λn]=[λ1000λ2000λn]2=M(R,β)2

where R is given by M(R,β). This is allowed since each λi0 so taking the square root is fine here. R is T's positive square root, where the positivity comes from v=i=1nαiei so then:

Rv,v=i=1nαiλiei,i=1nαiei=i=1n|αi|2λi0

(e) (a): Suppose there is RL(V) such that T=RR:

Tv,v=RRv,v=Rv,Rv=Rv20

so T is positive.

Uniqueness of a positive square root of an operator

The positive square root of a positive operator is unique.

Proof
Use R from the previous proof. We'll show that R is unique. Suppose R2=T for some positive operators R,T. Start with T (a positive operator, thus self-adjoint and ...), given an orthonormal eigenbasis for T, say e1,...,en.

We'll show that any Rei=λiei (this is the operator defined in (b) (c) in the previous proof). Since R is positive, then it has its own orthonormal eigenbasis f1,...,fn with eigenvalues β1,...,βn (notice that these are still arbitrary and positive, per our requirement). Write:

ei=j=1nαjfjR2(ei)=R2(j=1nαjfj)=j=1nαjR2(fj)=j=1nαjβjfjsubtract=T(ei)=λiei=j=1nαjλifjsubtractj=1n(αjβjαjλi)fj=0αj(βjλi)=0

Thus αj=0 or βj=λi for each j. Note that ei=j=1nαjfj, so throw out the terms without the αj=0:

ei=j=1nαjfj where βj=λi as a conditionR(ei)=j=1nαjR(fj)=j=1nαjβjfjβj=λi=i=1nαjλifj=λii=1nαjfj=λiei