In other words, an operator is an isometry if it preserves norms.
We talked about:
Characterization of isometries
is an isometry
for all
is orthonormal for every orthonormal list of vectors in
an orthonormal basis of such that is orthonormal.
is an isometry
is invertible and .
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 being an isometry implies is an isometry, then all the properties apply to consequently. But we'll prove something pretty interesting.
Lemma
is an isometry iff is normal (ONEB with every eigenvalue having ).
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 is called a square root of an operator if .
Here we say that is the positive square root of , and . It denotes the unique positive operator. In other words, is positive and .
polar decomposition
Given , then there exists an isometry such that:
Note that we better have be positive, as we are square rooting it. Consider the map :
Thus is positive. We are now required to find the that will make the above work.
Proof
The general idea is that:
Here, we are curious about when acting on we get vectors in it's , so what vectors from this set needs to be mapped to the correct spots. We'll build up an isometry . Suppose maps to .
We actually have a problem of being well defined here, because may not be injective. It's possible to have:
while . But we are building specifically an isometry. So we have to ask:
Are norms preserved under the transformation ? Namely:
So yes is norm-preserving.
Is well-defined?
To show it is. Suppose . We need to show that . Look at:
So then .
The last thing to do is check is actually linear. But that's easy to check.
So at the moment, we have is a linear operator that preserves norms. Since it does this, then the only way to get the as an output is to input a norm of 0, and thus must be the input zero-vector. Thus is injective. As a result, it's also surjective.
But what about vectors not starting from the range of ? Note that . Thus, starting with a basis for can be mapped to a relabeled basis for . But we can extend this basis, say up to for each of the spaces to be a basis for .
The basis is a basis for and for (these are a basis for the orthogonal complement of these spaces, by the way). Define for these 's. We claim that this works still.
Is an isometry still? Notice:
Thus is an isometry.
☐
Singular Value Decomposition
Recall that . As such, then because is so simple, let's look at the other operator instead.
singular values of
The singular values of some are the eigenvalues of with each eigenvalue repeated times.
Typically, since these singular values are all positive, then they are usually written in descending order:
The top way is Axler's way, while the way is the most typically adopted format.