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

Recall how we defined a positive operator:

positive operator

An operator T∈L(V) is called positive if T is self-adjoint and:
⟨Tv,v⟩≥0
for all v∈V.

Recall we needed ⟨Tv,v⟩∈R 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

T∈L(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=R∗R.

\begin{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,v⟩≥0

via the definition. Since ⟨v,v⟩=‖v‖2≥0 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,β)=[λ10…00λ2…0⋮⋮⋱⋮00…λn]=[λ10…00λ2…0⋮⋮⋱⋮00…λn]2=M(R,β)2

where R is given by M(R,β). This is allowed since each λi≥0 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λi≥0

(e) → (a): Suppose there is R∈L(V) such that T=R∗R:

⟨Tv,v⟩=⟨R∗Rv,v⟩=⟨Rv,Rv⟩=‖Rv‖2≥0

so T is positive.
\end{proof}

Uniqueness of a positive square root of an operator

The positive square root of a positive operator is unique.

\begin{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αjfj⇒R2(ei)=R2(∑j=1nαjfj)=∑j=1nαjR2(fj)=∑j=1nαjβjfj⏟subtract=T(ei)=λiei=∑j=1nαjλifj⏟subtract⇒∑j=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=λi∑i=1nαjfj=λiei

\end{proof}