Inner Product Spaces
[81/0%]Prove or give a counterexample: If , then
Suppose . Define by
for all . Show that is an inner product on if and only if is injective.
Show that the function taking an ordered pair of elements of to is not an inner product on .
Show that the function taking an ordered pair of elements of to is not an inner product on .
Suppose is such that for every . Prove that is injective.
Suppose is a real inner product space.
Show that for every .
Show that if have the same norm, then is orthogonal to .
Use (b) to show that the diagonals of a rhombus are perpendicular to each other.
Suppose . Prove that for all .
Suppose . Prove that for all if and only if .
Suppose and . Prove that .
Suppose and and . Prove that .
Suppose and and . Prove that
Find vectors such that is a scalar multiple of , is orthogonal to , and .
Suppose are positive numbers.
Prove that .
For which positive numbers is the inequality above an equality?
Show that the square of an average is less than or equal to the average of the squares. More precisely, show that if , then the square of the average of is less than or equal to the average of .
Suppose and . Prove that is the unique closest element on the unit sphere of to . More precisely, prove that if and , then
with equality only if .
Suppose are nonzero vectors in . Prove that
where is the angle between and (thinking of and as arrows with initial point at the origin).
The angle between two vectors (thought of as arrows with initial point at the origin) in or can be defined geometrically. However, geometry is not as clear in for . Thus the angle between two nonzero vectors is defined to be
where the motivation for this definition comes from Exercise 15. Explain why the Cauchy-Schwarz inequality is needed to show that this definition makes sense.
Exercise 15 (Exercise 6A.15): if are nonzero vectors in , then , where is the angle between and (thinking of and as arrows with initial point at the origin).
Prove that
for all real numbers and .
Suppose is continuous. Show that
For which continuous functions is the inequality in (a) an equality with both sides finite?
Suppose is a basis of and . Prove that if is an eigenvalue of , then
where denotes the entry in row , column of the matrix of with respect to the basis .
Prove that if , then . The inequality above is called the reverse triangle inequality. For the reverse triangle inequality when , see Exercise 2 in Chapter 4.
Exercise 2 in Chapter 4 (Exercise 4.2): if , then .
Suppose are such that
What number does equal?
Show that if , then
Suppose are such that for each . Show that there exist such that
Prove or give a counterexample: If is the norm associated with an inner product on , then there exists such that .
Suppose . Prove that there is an inner product on such that the associated norm is given by
for all if and only if .
Suppose is a real inner product space. Prove that
for all .
Suppose is a complex inner product space. Prove that
for all .
A norm on a vector space is a function
such that if and only if for all and all , and for all . Prove that a norm satisfying the parallelogram equality comes from an inner product (in other words, show that if is a norm on satisfying the parallelogram equality, then there is an inner product on such that for all ).
Suppose are inner product spaces. Show that the equation
defines an inner product on . In the expression above on the right, for each , the inner product denotes the inner product on . Each of the spaces may have a different inner product, even though the same notation is used here.
Suppose is a real inner product space. For , define
Show that makes into a complex inner product space.
Show that if , then
The complexification was defined in Exercise 8 in Section 1B: suppose is a real vector space; the complexification of , denoted by , equals , with an element , , written as ; addition on is defined by ; complex scalar multiplication on is defined by for all and all .
Suppose . Prove that
Suppose that is a subset of with the property that implies . Let . Show that there is at most one point in that is closest to . In other words, show that there is at most one such that
for all .
Suppose are differentiable functions from to .
Show that
Suppose is a positive number and for every . Show that for every .
Interpret the result in (b) geometrically in terms of the tangent vector to a curve lying on a sphere in centered at the origin.
A function is called differentiable if there exist differentiable functions from to such that for each . Furthermore, for each , the derivative is defined by .
Use inner products to prove Apollonius's identity: In a triangle with sides of length , and , let be the length of the line segment from the midpoint of the side of length to the opposite vertex. Then
Fix a positive integer . The Laplacian of a twice differentiable realvalued function on is the function on defined by
The function is called harmonic if . A polynomial on is a linear combination (with coefficients in ) of functions of the form , where are nonnegative integers.
Suppose is a polynomial on . Prove that there exists a harmonic polynomial on such that for every with .
The only fact about harmonic functions that you need for this exercise is that if is a harmonic function on and for all with , then .
Suppose is a list of vectors in such that
for all . Show that is an orthonormal list. This exercise provides a converse to 6.24.
Suppose . Show that both
are orthonormal bases of .
Show that each orthonormal basis of is of the form given by one of the two possibilities in (a).
Suppose is an orthonormal list in and . Prove that
Suppose is a positive integer. Prove that
is an orthonormal list of vectors in , the vector space of continuous real-valued functions on with inner product
Suppose is continuous. For each nonnegative integer , define
Prove that
The inequality above is actually an equality for all continuous functions . However, proving that this inequality is an equality involves Fourier series techniques beyond the scope of this book.
Suppose is an orthonormal basis of .
Prove that if are vectors in such that
for each , then is a basis of .
Show that there exist such that
for each , but is not linearly independent. This exercise states in (a) that an appropriately small perturbation of an orthonormal basis is a basis. Then (b) shows that the number on the right side of the inequality in (a) cannot be improved upon.
Suppose has an upper-triangular matrix with respect to the basis . Find an orthonormal basis of with respect to which has an upper-triangular matrix.
Make into an inner product space by defining for all .
Apply the Gram-Schmidt procedure to the basis to produce an orthonormal basis of .
The differentiation operator (the operator that takes to ) on has an upper-triangular matrix with respect to the basis , which is not an orthonormal basis. Find the matrix of the differentiation operator on with respect to the orthonormal basis produced in (a) and verify that this matrix is upper triangular, as expected from the proof of 6.37.
Suppose is the result of applying the Gram-Schmidt procedure to a linearly independent list in . Prove that for each .
Suppose is a linearly independent list in . Explain why the orthonormal list produced by the formulas of the Gram-Schmidt procedure (6.32) is the only orthonormal list in such that and for each .
Theorem 6.32 (Gram-Schmidt procedure): suppose is a linearly independent list of vectors in . Let . For , define inductively by . For each , let . Then is an orthonormal list of vectors in such that for each .
The result in this exercise is used in the proof of 7.58. Theorem 7.58 (QR factorization): suppose is a square matrix with linearly independent columns. Then there exist unique matrices and such that is unitary, is upper triangular with only positive numbers on its diagonal, and .
Find a polynomial such that for every .
Find a polynomial such that
for every .
Show that a list of vectors in is linearly dependent if and only if the Gram-Schmidt formula in 6.32 produces for some .
The Gram-Schmidt formula in 6.32: and, for , inductively ; then .
This exercise gives an alternative to Gaussian elimination techniques for determining whether a list of vectors in an inner product space is linearly dependent.
Suppose is a real inner product space and is a linearly independent list of vectors in . Prove that there exist exactly orthonormal lists of vectors in such that
for all .
Suppose and are inner products on such that if and only if . Prove that there is a positive number such that for every .
This exercise shows that if two inner products have the same pairs of orthogonal vectors, then each of the inner products is a scalar multiple of the other inner product.
Suppose is finite-dimensional. Suppose are inner products on with corresponding norms and . Prove that there exists a positive number such that for every .
Suppose and is finite-dimensional. Prove that if is an operator on such that 1 is the only eigenvalue of and for all , then is the identity operator.
Suppose is a linearly independent list in . Show that there exists such that for all .
Suppose is a basis of . Prove that there exists a basis of such that
Suppose is finite-dimensional, and is such that
for all . Prove that there is an orthonormal basis of with respect to which every element of has an upper-triangular matrix.
This exercise strengthens Exercise in Section (in the context of inner product spaces) by asserting that the basis in that exercise can be chosen to be orthonormal.
Suppose is finite-dimensional, , and all eigenvalues of have absolute value less than 1. Let . Prove that there exists a positive integer such that for every .
Suppose is the vector space of continuous real-valued functions on the interval with inner product given by
for all . Let be the linear functional on defined by . Show that there does not exist such that
for every . This exercise shows that the Riesz representation theorem (6.42) does not hold on infinite-dimensional vector spaces without additional hypotheses on and .
For all , define .
Show that is a metric on .
Show that if is finite-dimensional, then is a complete metric on (meaning that every Cauchy sequence converges).
Show that every finite-dimensional subspace of is a closed subset of (with respect to the metric ).
This exercise requires familiarity with metric spaces.
Suppose . Prove that
Suppose is a subspace of with basis and
is a basis of . Prove that if the Gram-Schmidt procedure is applied to the basis of above, producing a list , then is an orthonormal basis of and is an orthonormal basis of .
Suppose is the subspace of defined by
Find an orthonormal basis of and an orthonormal basis of .
Suppose is a list of vectors in with for each and
for all . Prove that is an orthonormal basis of . This exercise provides a converse to .
Suppose that is finite-dimensional and is a subspace of . Show that , where is the identity operator on .
Suppose is finite-dimensional and . Show that
Suppose that and are finite-dimensional subspaces of . Prove that if and only if for all and all .
Suppose is a finite-dimensional subspace of and . Define a linear functional by
for all . By the Riesz representation theorem (6.42) as applied to the inner product space , there exists a unique vector such that
for all . Show that .
Suppose is finite-dimensional. Suppose is such that and every vector in is orthogonal to every vector in range . Prove that there exists a subspace of such that .
Suppose is finite-dimensional and is such that and
for every . Prove that there exists a subspace of such that .
Suppose and is a finite-dimensional subspace of . Prove that
Suppose is finite-dimensional, , and is a subspace of . Prove that
Suppose and is finite-dimensional. For each , let denote the linear functional on defined by
for all .
Show that is an injective linear map from to .
Use (a) and a dimension-counting argument to show that is an isomorphism from onto .
The purpose of this exercise is to give an alternative proof of the Riesz representation theorem (6.42 and 6.58) when . Thus you should not use the Riesz representation theorem as a tool in your solution.
Suppose that is an orthonormal basis of . Explain why the dual basis (see 3.112) of is under the identification of with provided by the Riesz representation theorem (6.58).
Definition 3.112 (dual basis): if is a basis of , then the dual basis of is the list of elements of , where each is the linear functional on such that if and if .
Theorem 6.58 (Riesz representation theorem, revisited): suppose is finite-dimensional. For each , define by for each . Then is a one-to-one function from onto .
In , let
Find such that is as small as possible.
Suppose is the vector space of continuous real-valued functions on the interval with inner product given by
for all . Let be the subspace of defined by
Show that .
Show that 6.49 and 6.52 do not hold without the finite-dimensional hypothesis.
Theorem 6.49 (direct sum of a subspace and its orthogonal complement): suppose is a finite-dimensional subspace of . Then .
Theorem 6.52 (orthogonal complement of the orthogonal complement): suppose is a finite-dimensional subspace of . Then .
Find such that , and is as small as possible.
Find that makes as small as possible. The polynomial 6.65 is an excellent approximation to the answer to this exercise, but here you are asked to find the exact solution, which involves powers of . A computer that can perform symbolic integration should help.
Suppose is finite-dimensional and is an orthogonal projection of onto some subspace of . Prove that .
Suppose is finite-dimensional and . Show that
Suppose is defined by
For , find a formula for .
Verify that the equation from 6.69(b) holds with the formula for obtained in (a).
Verify that the equation from 6.69 (c) holds with the formula for obtained in (a).
Suppose is finite-dimensional and . Prove that
Both formulas above clearly hold if is invertible because in that case we can replace with .
Suppose and are finite-dimensional and . Prove that
The equation above is analogous to the equation that holds if is invertible.