Lecture 18 - Polar Decompositions

isometry

  • An operator S∈L(V) is called an isometry if:
    ‖Sv‖=‖v‖
    for all v∈V.
  • In other words, an operator is an isometry if it preserves norms.

We talked about:

Characterization of isometries

  • S is an isometry
  • ⟨Su,Sv⟩=⟨u,v⟩ for all u,v∈V
  • Se1,...,Sen is orthonormal for every orthonormal list of vectors e1,...,en in V
  • ∃ an orthonormal basis e1,...,en of V such that Se1,...,Sen is orthonormal.
  • S∗S=I
  • SS∗=I
  • S∗ is an isometry
  • S is invertible and S−1=S∗.

Note that property (b) shows that lengths are preserved over isometries, and thus angles are as well.

We proved a lot of these but not all of them via were proved.

We note that also since S being an isometry implies S∗ is an isometry, then all the properties apply to S∗ consequently. But we'll prove something pretty interesting.

Lemma

S is an isometry iff S is normal (ONEB with every eigenvalue having |λ|=1).

This implies that the ONEB is on the unit circle via the complex plane.

7.D: Polar Decomposition and Singular Value Decomposition

We defined this before and will need it:

square root

An operator R is called a square root of an operator T if R2=T.

Here we say that T is the positive square root of T, and R=T. It denotes the unique positive operator. In other words, T is positive and (T)2=T.

polar decomposition

Given T∈L(V), then there exists an isometry S∈L(V) such that:

T=ST∗T

Note that we better have T∗T be positive, as we are square rooting it. Consider the map T∗T:

⟨T∗Tv,v⟩=⟨Tv,Tv⟩≥0

Thus T∗T is positive. We are now required to find the S that will make the above work.

Proof
The general idea is that:

Here, we are curious about when acting on T∗T we get vectors in it's range(T∗T), so what vectors from this set needs to be mapped to the correct spots. We'll build up an isometry S. Suppose S maps T∗Tv to Tv.

We actually have a problem of being well defined here, because T∗T] may not be injective. It's possible to have:

T∗Tv1=T∗Tv2

while v1≠v2. But we are building specifically an isometry. So we have to ask:

‖T∗Tv‖=‖Tv‖?‖Tv‖2=⟨Tv,Tv⟩=⟨T∗Tv,v⟩=⟨T∗TT∗Tv,v⟩=⟨T∗Tv,T∗Tv⟩T∗T is self-adjoint=‖T∗Tv‖2

So yes S is norm-preserving.

To show it is. Suppose T∗Tv1=T∗Tv2. We need to show that Tv1=Tv2. Look at:

‖Tv1−Tv2‖2=‖T(v1−v2)‖2=‖T∗T(v1−v2)‖2=0

So then Tv1=Tv2.

So at the moment, we have S is a linear operator that preserves norms. Since it does this, then the only way to get the 0→ as an output is to input a norm of 0, and thus must be the input zero-vector. Thus S is injective. As a result, it's also surjective.

But what about vectors not starting from the range of T∗T? Note that dim(range(T∗T))=dim(range(T)). Thus, starting with a basis for range(T∗T) can be mapped to a relabeled basis for range(T). But we can extend this basis, say e1,...,em up to e1,...,em,...,en for each of the spaces to be a basis for V.

The basis em+1,...,en is a basis for range(T∗T) and fm+1,...,fn for range(T) (these are a basis for the orthogonal complement of these spaces, by the way). Define Sei=fi for these i's. We claim that this works still.

‖S(T∗Tv+∑i=m+1nαiei⏟any v∈V)‖2=‖Tv+∑i=m+1nαiSei‖2=‖Tv+∑i=m+1nαifi‖2=‖Tv‖2+∑i=m+1n|αi|2Both vectors orthogonal, and basis is normal=‖T∗Tv‖2+‖∑i=m+1nαiei‖2=‖T∗Tv+∑i=m+1nαiei‖2

Thus S is an isometry.
☐

Singular Value Decomposition

Recall that T=ST∗T. As such, then because S is so simple, let's look at the other operator T∗T instead.

singular values of T

The singular values of some T∈L(V) are the eigenvalues of T∗T with each eigenvalue repeated dim(E(λ,T∗T)) times.

Typically, since these singular values are all positive, then they are usually written in descending order:

S1≥⋯≥Sdim(V)

σ1≥⋯≥σdim(V)

The top way is Axler's way, while the σ way is the most typically adopted format.