Prove or give a counterexample: If is self-adjoint and there exists an orthonormal basis of such that for each , then is a positive operator.
Proof
This is false via the following explanation. The proof prior shows where the proof would fail in the process.
Notice that since is an orthonormal basis of then any has:
Thus, for the condition of being positive, we already have is self-adjoint, and for positivity:
which is where the proof would have to stop. Thus we want a for all .
Define and is the matrix over the standard orthonormal basis given by:
Notice so and thus is self-adjoint. However:
per our requirement while:
Thus:
since each while we have at least one .
☐
2
Question
Suppose is a positive operator on . Suppose are such that:
and:
Then .
Proof
Since is positive, then since each positive operator has only one positive square root, then it's unique. Notice that in this specific case for :
thus is an eigenvector of . Notice that if or are then the other vector must be the zero vector, proving . Now if then they are valid eigenvectors of with .
Notice further that is an eigenvector of with , but it can't be the negative because if it was then:
which would be a contradiction to being positive. Thus is an eigenvector with and thus so .
☐
4
Question
Suppose . Prove that is a positive operator on and is a positive operator on .
Proof
To show that we get positivity, first:
And then for the self-adjointness notice that:
☐
5
Question
Prove that the sum of two positive operators on is positive.
Proof
Consider both positive. As such are self-adjoint. Notice:
Thus has the positive-definiteness. We then can show is self adjoint because:
Thus is self-adjoint.
☐
6
Question
Suppose is positive. Then is positive for all .
Proof
Induction over . For the base case is trivial. For case (first positivity then self-adjointness):
Both using the fact that is positive and moving it to the other side.
Now suppose that the theorem holds for all values of or less. We'll show the case. Notice first is self-adjoint because using the fact that is self-adjoint:
Thus is self-adjoint.
For the positivity:
☐
7
Question
Suppose is a positive operator on . Then is invertible if and only if:
for every with .
Proof
We just have to show either injective or surjective to have it be equivalent for invertibility, since ( is specifically an operator on one vector space). We'll do injectivity.
(): is invertible. Let where . Since is positive then:
for every . Assume for contradiction . As a property, there is a (unique) operator where where is positive (and self-adjoint). Thus:
Thus but then but then that means and since is invertible then that implies which is a contradiction.
Notice that since then
(): Suppose for any . So so then . Thus since was arbitrary non-zero vector then only so is injective and thus invertible.
☐
8
Question
Suppose . For define by:
Prove that is an inner product on iff is an invertible positive operator (with respect to the original inner product )
Proof
(): First we know is an inner product. Notice that we only need to show injectivity for invertibility since is an operator. Let be arbitrary vector. Let thus . We'll show because:
so since is an inner product we must have . Thus is trivial and thus is injective and thus invertible.
For positivity, showing that the inner product is always positive-definite is easy because:
because has the property of positive-definiteness. For being self-adjoint:
Thus is self-adjoint.
(): Suppose is invertible and positive. We show is an inner product:
Suppose . Then prove that the following are equivalent:
is an isometry
for all
is an orthonormal list for every orthonormal list of vectors in
is an orthonormal basis for some orthonormal basis of .
Proof
Suppose (a), so is an isometry. Then by the characterization of isometries, then must be an isometry. As such, the following are equivalent:
By (b) of the lemma, then for all
By (c) of the lemma, then is northonormal for every orthonormal list of vectors in
By (d) of the lemma, then is an orthonormal basis for some orthonormal basis of .
Notice if you wanted to show the other directions, that one of the other points being true implies (a), that you can just use the characterization of isometries of any of these to imply that must be an isometry.
☐
11
Question
Suppose are normal operators on and both operators have as eigenvalues. Then prove there exists an isometry such that .
Proof
Since and we have 3 eigenvalues, then we have an orthonormal eigenbasis where and and for , while has the same eigenvalues with the eigenbasis (with the same eigenvalues).
Construct such that it takes in any vector from and gives a basis representation in terms of the 's from the 's. Namely:
Notice then that this is an isometry because since :
Thus is an isometry. We'll show . Notice that since is an isometry then . As a result: