Isometries, Unitary Operators, and Matrix Factorization
[20/0%]Suppose and . Prove that is an isometry if and only if is an orthonormal list in for every orthonormal list of length two in .
Suppose . Prove that is a scalar multiple of an isometry if and only if preserves orthogonality.
The phrase " preserves orthogonality" means that for all such that .
Show that the product of two unitary operators on is a unitary operator.
Show that the inverse of a unitary operator on is a unitary operator.
This exercise shows that the set of unitary operators on is a group, where the group operation is the usual product of two operators.
Suppose and are self-adjoint. Show that is unitary if and only if and .
Suppose . Prove that the following are equivalent.
-
is a self-adjoint unitary operator.
-
for some orthogonal projection on .
-
There exists a subspace of such that for every and for every .
Suppose are both normal operators on with as eigenvalues. Prove that there exists a unitary operator such that .
Give an example of two self-adjoint operators such that the eigenvalues of both operators are but there does not exist a unitary operator such that . Be sure to explain why there is no unitary operator with the required property.
Prove or give a counterexample: If and there exists an orthonormal basis of such that for each , then is a unitary operator.
Suppose and . Suppose every eigenvalue of has absolute value 1 and for every . Prove that is a unitary operator.
Suppose and is a self-adjoint operator such that for all .
Show that is a positive operator.
Show that is a unitary operator.
Suppose . Prove that is a unitary operator if and only if
Prove or give a counterexample: If is invertible and for every , then is unitary.
Explain why the columns of a square matrix of complex numbers form an orthonormal list in if and only if the rows of the matrix form an orthonormal list in .
Suppose with and . Also suppose . Prove that there exists a unitary operator such that if and only if .
Suppose is a unitary operator on such that is invertible.
Prove that is a skew operator (meaning that it equals the negative of its adjoint).
Prove that if , then is a self-adjoint operator.
The function maps the unit circle in (except for the point 1) to . Thus (b) illustrates the analogy between the unitary operators and the unit circle in , along with the analogy between the self-adjoint operators and .
Suppose and is self-adjoint. Prove that is a unitary operator and 1 is not an eigenvalue of this operator.
Explain why the characterizations of unitary matrices given by 7.57 hold.
7.57 (characterizations of unitary matrices): suppose is an -by- matrix. Then the following are equivalent: (a) is a unitary matrix; (b) the rows of form an orthonormal list in ; (c) for every ; (d) , the -by- matrix with 1's on the diagonal and 0's elsewhere.
A square matrix is called symmetric if it equals its transpose. Prove that if is a symmetric matrix with real entries, then there exists a unitary matrix with real entries such that is a diagonal matrix.
Suppose is a positive integer. For this exercise, we adopt the notation that a typical element of is denoted by . Define linear functionals on by
The discrete Fourier transform is the operator defined by
Show that is a unitary operator on .
Show that if and is defined to equal , then
Show that .
The discrete Fourier transform has many important applications in data analysis. The usual Fourier transform involves expressions of the form for complex-valued integrable functions defined on .
Suppose is a square matrix with linearly independent columns. Prove that there exist unique matrices and such that is lower triangular with only positive numbers on its diagonal, is unitary, and .