Multilinear Algebra and Determinants
[51/0%]Prove that if is a bilinear form on , then there exists such that
for all .
Let . Suppose is a bilinear form on . Prove that there exist such that
for all . This exercise shows that if , then every bilinear form on is of the form given by the last bullet point of Example 9.2.
Suppose is a bilinear form on and also is a linear functional on . Prove that .
Suppose is a real inner product space and is a bilinear form on . Show that there exists a unique operator such that
for all . This exercise states that if is a real inner product space, then every bilinear form on is of the form given by the third bullet point in 9.2.
Suppose is a bilinear form on a real inner product space and is the unique operator on such that for all (see Exercise 4). Show that is an inner product on if and only if is an invertible positive operator on .
Prove or give a counterexample: If is a symmetric bilinear form on , then
is a subspace of .
Explain why the proof of 9.13 (diagonalization of a symmetric bilinear form by an orthonormal basis on a real inner product space) fails if the hypothesis that is dropped.
Theorem 9.13: suppose is a real inner product space and is a symmetric bilinear form on . Then has a diagonal matrix with respect to some orthonormal basis of .
Proof of 9.13: let be an orthonormal basis of . Let . Then is a symmetric matrix (by 9.12). Let be the operator such that . Thus is self-adjoint. The real spectral theorem (7.29) states that has a diagonal matrix with respect to some orthonormal basis of . Let . Thus is the matrix of with respect to the basis (by 3.84). Hence is a diagonal matrix. Now , where the first equality holds by 9.7 and the second equality holds because is a unitary matrix with real entries (which implies that ; see 7.57).
Find formulas for and in terms of .
Suppose that is a positive integer and . Define by
Show that is an alternating bilinear form on .
Suppose that is a positive integer and
Define by
Show that is a symmetric bilinear form on .
Suppose is a positive integer. Show that .
Suppose and is defined by
Show that is an alternating 3-linear form on .
Suppose is a positive integer and is an -linear form on such that whenever is a list of vectors in with for some . Prove that is an alternating -linear form on .
Prove or give a counterexample: If , then
is a subspace of .
Suppose is a positive integer and is an -linear form on . Define an -linear form on by
for . Explain why .
Suppose is a positive integer and is an -linear form on . Define an -linear form on by
for . Explain why
for all and all .
Give an example of a nonzero alternating 2-linear form on and a linearly independent list in such that .
This exercise shows that 9.39 can fail if the hypothesis that is deleted. Theorem 9.39 (alternating -linear forms and linear independence): let . Suppose is a nonzero alternating -linear form on and is a list of vectors in . Then if and only if is linearly independent.
Prove or give a counterexample: .
Suppose the first column of a square matrix consists of all zeros except possibly the first entry . Let be the matrix obtained from by deleting the first row and the first column of . Show that .
Suppose is nilpotent. Prove that .
Suppose . Prove that is unitary if and only if .
Suppose is a block upper-triangular matrix
where each along the diagonal is a square matrix. Prove that
Suppose is an -by- matrix, with denoting the column of . Show that if perm , then
Suppose is invertible. Let denote the characteristic polynomial of and let denote the characteristic polynomial of . Prove that
for all nonzero .
Suppose is an operator with no eigenvalues (which implies that ). Prove that .
Suppose that is a real vector space of even dimension, , and . Prove that has at least two distinct eigenvalues.
Suppose is a real vector space of odd dimension and . Without using the minimal polynomial, prove that has an eigenvalue.
This result was previously proved without using determinants or the characteristic polynomial-see 5.34. Theorem 5.34: every operator on an odd-dimensional vector space has an eigenvalue.
Prove or give a counterexample: If , and , then has a square root.
If , and , then has a square root (see 8.41). Theorem 8.41: suppose is a complex vector space and is invertible. Then has a square root.
Suppose and is invertible. Define by
Prove that is a polynomial of degree and that the coefficient of in this polynomial is .
Suppose , and . Let denote the eigenvalues of , with each eigenvalue included as many times as its multiplicity.
Find a formula for the coefficient of in the characteristic polynomial of in terms of .
Find a formula for the coefficient of in the characteristic polynomial of in terms of .
Suppose is an inner product space and is a positive operator on . Prove that
Suppose is an inner product space and . Use the polar decomposition to give a proof that
that is different from the proof given earlier (see 9.60).
Suppose . Define by . Show that .
Look for a clean solution to this exercise, without using the explicit but complicated formula for the determinant of a matrix.
Suppose are positive numbers. Find the volume of the ellipsoid
by finding a set whose volume you know and an operator on such that equals the ellipsoid above.
Suppose that is an invertible square matrix. Prove that Hadamard's inequality (9.66) is an equality if and only if each column of is orthogonal to the other columns.
Theorem 9.66 (Hadamard's inequality): suppose is an -by- matrix. Let denote the columns of . Then .
Suppose is an inner product space, is an orthonormal basis of , and is a positive operator.
Prove that .
Prove that if is invertible, then the inequality in (a) is an equality if and only if is an eigenvector of for each .
Suppose is an -by- matrix, and suppose is such that for all . Prove that
The formula for the determinant of a matrix (9.46) shows that !. However, the estimate given by this exercise is much better. For example, if and , then , but the estimate given by this exercise is the much smaller number . If is an integer power of 2, then the inequality above is sharp and cannot be improved.
Suppose is a positive integer and is a function such that
for all and equals the product of the diagonal entries of for each diagonal matrix . Prove that
for all . Recall that denotes set of -by-n matrices with entries in . This exercise shows that the determinant is the unique function defined on square matrices that is multiplicative and has the desired behavior on diagonal matrices. This result is analogous to Exercise 10 in Section 8D, which shows that the trace is uniquely determined by its algebraic properties.
Suppose and . Prove that if and only if or .
Give an example of six distinct vectors in such that
but none of is a scalar multiple of another element of this list.
Suppose that is a linearly independent list in . Suppose also that is a list in such that
Prove that .
Suppose and . Prove that
is not a subspace of . This exercise implies that if and , then
Suppose and are positive integers. For and , identify with an -by- matrix as in Example 9.76. With that identification, show that the set
is the set of -by- matrices (with entries in ) that have rank at most one.
Example 9.76: let denote the standard basis of and let denote the standard basis of . Suppose and . Then . Writing the coefficients in an -by- matrix with in row , column , identifies with the -by- matrix whose entry is .
Suppose and are positive integers. Give a description, analogous to Exercise 5, of the set of -by- matrices (with entries in ) that have rank at most two.
Suppose and . Prove that
Suppose and are such that
Suppose that is a vector space and is a bilinear map. Show that
Suppose and . Prove that there exists a unique operator on that takes to for all and .
In an abuse of notation, the operator on given by this exercise is often called .
Suppose and . Prove that is an invertible operator on if and only if both and are invertible operators. Also, prove that if both and are invertible operators, then , where we are using the notation from the comment after Exercise 9.
The comment after Exercise 9: in an abuse of notation, the operator on that takes to for all and (given by Exercise 9) is often called .
Suppose and are inner product spaces. Prove that if and , then , where we are using the notation from the comment after Exercise 9.
The comment after Exercise 9: in an abuse of notation, the operator on that takes to for all and (given by Exercise 9) is often called .
Suppose that are finite-dimensional inner product spaces. Prove that there is a unique inner product on such that
for all and in . Note that the equation above implies that
for all .
Suppose that are finite-dimensional inner product spaces and is made into an inner product space using the inner product from Exercise 12. Suppose is an orthonormal basis of for each . Show that the list
is an orthonormal basis of .
Exercise 12: the inner product on is the unique one such that for all and in .