Spaces with a Scalar Product
[140/66%]Prove that the requirement of bilinearity (sesquilinearity) in the axioms of a Euclidean (Hermitian) space can be replaced by linearity in the second argument.
Show that the function of the vectors and of the real plane, given by the formula
defines a Euclidean inner product on the plane. Find the inner product of the vectors and .
Consider the function of the vectors and of a two-dimensional space, defined as follows:
Prove that this formula defines a Euclidean inner product if and only if .
Find the lengths of the following vectors of the Hermitian space :
;
.
Check whether the following bilinear functions on the space of polynomials of degree at most are Euclidean inner products:
, where
, where ..., are arbitrary fixed pairwise distinct real numbers;
.
The polynomials and are given. Find their lengths and the angle between them in the Euclidean space of polynomials of degree at most 4 with the inner product given by the integral:
Check whether:
the following function of a pair of matrices and is a Euclidean inner product on the space of real square matrices of order :
the following function of a pair of matrices and is a Hermitian inner product on the space of complex square matrices of order :
Using the Cauchy--Bunyakovsky--Schwarz inequality, prove the following inequalities:
;
, where are arbitrary real numbers, and are arbitrary functions continuous on the interval .
Using the Cauchy--Bunyakovsky--Schwarz inequality, prove that the triangle inequalities
hold in a Euclidean (Hermitian) space, where the right-hand inequality becomes an equality if and only if the vectors and are collinear and equally directed.
(Pythagorean theorem). Prove that if the vectors and in a Euclidean (Hermitian) space are orthogonal, then
Is the converse statement true?
Prove that in the parallelogram spanned by the vectors and of a Euclidean space, the sum of the squares of the lengths of the diagonals equals the sum of the squares of the lengths of the sides. Is the analogous statement true for a Hermitian space?
Prove that every subspace of a Euclidean (Hermitian) space is a Euclidean (Hermitian) space with respect to the restriction to of the inner product from , i.e., the inner product defined as follows: the inner product of two vectors equals their inner product as vectors of . Such an inner product is called the inner product induced by the embedding of the subspace in the space .
On the external direct sum of two Euclidean (Hermitian) spaces and , introduce a Euclidean (Hermitian) inner product so that the inner products on and induced by the standard embeddings
coincide with their original inner products and respectively, and so that the subspaces and are orthogonal to each other.
Prove the Cauchy--Bunyakovsky--Schwarz inequality for a Hermitian space:
Let be a real Euclidean space with inner product . Show that its complexification can be turned into a Hermitian space by introducing on it the Hermitian inner product by the formula
The space with the Hermitian product defined in this way will be called the complexification of the Euclidean space . Which Hermitian space is obtained by complexifying the standard ?
Prove that if is an orthonormal basis in a real Euclidean space , then the vectors , form an orthonormal basis in the complexification with respect to the Hermitian inner product introduced in the previous problem.
Let be a Hermitian space with Hermitian inner product . Consider its realification . Prove that becomes a Euclidean space if one introduces on the Euclidean inner product by the formula
In the case , write the formula for the value in the standard coordinates of the realified space , given by the equalities . Show that if the standard Hermitian space is realified in this way, the result is the standard Euclidean space .
Show that, under the conditions of the previous problem, the vectors and are always orthogonal with respect to .
Problem 1284: is a Hermitian space with Hermitian inner product , is its realification with the Euclidean inner product .
Show that the imaginary part of a Hermitian inner product is a real skew-symmetric bilinear function on the Hermitian space , and that the form is invariant under multiplication by , i.e.,
Show that the Hermitian inner product is uniquely recovered both from its real part and from its imaginary part . To this end, express:
the imaginary part in terms of the real part and vice versa;
the inner product itself in terms of , and separately in terms of .
Prove that every orthogonal system of nonzero vectors in a Euclidean (Hermitian) space is linearly independent.
Check the orthogonality of the given vectors and extend them to an orthogonal basis of the entire space , .
Check the orthogonality of the pair of vectors ), of the Hermitian space and extend it to an orthogonal basis of the entire space .
With respect to the Euclidean inner product , check the orthogonality of the following system of matrices:
and extend it to an orthogonal basis of the entire space of real square matrices of order two.
Extend the given system of vectors to an orthonormal basis of the entire three-dimensional space:
Extend the system of vectors to an orthonormal basis of the entire space :
Extend the given system of vectors to an orthonormal basis of the entire Hermitian space :
Using the Gram-Schmidt orthogonalization method, construct an orthogonal basis of the subspace spanned by the vectors:
;
.
Using the Gram-Schmidt orthogonalization method, construct an orthogonal basis of the subspace of the space of polynomials spanned by the polynomials with the inner product given by the integral:
;
.
Using the Gram-Schmidt orthogonalization method, construct an orthogonal basis of the Hermitian space spanned by the vectors .
Prove that the orthogonalization process does not increase the lengths of the vectors being orthogonalized, i.e.,
where the vectors are obtained from the system by the orthogonalization process. Under what conditions does the equality hold for some ?
Prove that a zero vector arises in the orthogonalization process applied to a system of vectors of a Euclidean space if and only if the original system was linearly dependent. More precisely, if and only if the vector is a linear combination of the vectors .
A sequence of polynomials is given by the recurrence formula
Find explicit expressions for .
Prove that .
Prove that the polynomials defined in this way form an orthogonal basis in the space of polynomials of degree at most with the inner product given by the integral
Find the square of the length of the polynomial .
The polynomials defined in this way are called the Chebyshev polynomials (of the first kind).
A sequence of polynomials is given by the recurrence formula
Find explicit expressions for .
The polynomials defined in this way are called the Legendre polynomials.
Prove that the polynomials defined by the formulas
form an orthogonal basis in the space of polynomials of degree at most with the inner product given by the integral ;
coincide with the Legendre polynomials introduced in the previous problem.
Find the square of the length of the polynomial .
Prove that the orthogonal basis , in the space of polynomials of degree at most with the inner product given by the integral
can be obtained from the Legendre polynomials by some linear change of variable (i.e., ).
Find this change of variable.
How are the lengths and related? (Here is the length of a polynomial with respect to the inner product .)
Prove that the transition matrix from the basis to the basis , obtained from the basis by the orthogonalization process, is always upper triangular, with all diagonal entries of this matrix equal to one.
Let a linearly independent system of vectors , and an orthogonal system be given such that the transition matrix from the first system to the second is upper triangular. Prove that the vectors of the orthogonal system obtained from by the orthogonalization process differ from the vectors of the system only by constant factors: , .
Prove that applying the orthogonalization process to the polynomials in the Euclidean space of polynomials of degree at most with the inner product yields polynomials that differ from the Legendre polynomials only by constant factors. Find these factors.
An orthogonal (unitary) matrix is the transition matrix from one orthonormal basis to another in a Euclidean (Hermitian) space. Prove that:
the columns (rows) of the matrix form an orthonormal system with respect to the standard inner product of columns (rows);
, where is the identity matrix.
Prove that an arbitrary nondegenerate matrix can be represented as the product of an orthogonal (unitary) matrix and an upper triangular matrix . To what extent is such a representation unique?
Represent the matrix
as the product of an orthogonal matrix and an upper triangular matrix with positive numbers on the diagonal.
Represent the matrix
as the product of a unitary matrix and an upper triangular matrix .
Prove that the coordinates , of an arbitrary vector with respect to an orthogonal basis can be found by the formulas
Such coordinates are called the Fourier coefficients of the vector with respect to the orthogonal basis .
In the Euclidean space of functions continuous on the interval with the inner product
check the pairwise orthogonality of the functions of the following system:
.
In the subspace spanned by the functions
of the Euclidean space of trigonometric polynomials with the inner product
find the Fourier coefficients of the function with respect to the orthogonal basis .
Let be an orthonormal system of vectors of the Euclidean space . Prove that Bessel's inequality
holds for all , where equality (Parseval's equality) is attained for all if and only if the system is an orthonormal basis of , i.e., .
Show that the number equals the length of the projection of the vector onto the one-dimensional space spanned by the vector , and that if the system forms a basis of , then is simply equal to the -th coordinate of the vector with respect to this basis.
Find the Gram matrix of the system of vectors in the Euclidean space of polynomials of degree at most 2 with the inner product defined as follows:
, where
.
Prove that the Gram matrix of a system of vectors of a Hermitian space is Hermitian, i.e., .
Prove that a system of vectors is linearly dependent if and only if the Gram determinant of this system equals zero.
Two systems of vectors and are called dual (reciprocal) if
Prove that each of two dual systems of vectors is linearly independent.
Prove that for any basis of a Euclidean space there exists a unique dual basis. If the original basis is orthonormal, then its dual basis coincides with it.
Let two dual systems of vectors and , be given. Prove that for the system of vectors is a basis of the orthogonal complement of the linear span of the system .
Find the dual basis for the system in the Euclidean space of polynomials of degree at most 2 with the inner product defined as follows:
, where
;
.
A basis of a Euclidean space and its Gram matrix are given. Find the transition matrix from the basis to its dual basis.
Let be the transition matrix from the basis to the basis . Find the transition matrix from the basis , dual to , to the basis , dual to :
in a Euclidean space;
in a Hermitian space.
Prove that the square of the length of the orthogonal component of a vector with respect to a space given by its basis , can be computed using the Gram determinant:
Prove that the Gram determinant of a system of vectors does not change under the orthogonalization process, i.e.,
where the vectors are obtained from the system by the orthogonalization process.
Prove that all principal minors of the Gram matrix of a linearly independent system of vectors are always positive, and, in the case of a linearly dependent system, nonnegative.
Express, in terms of the Gram determinants of the subsystems of the system of vectors , the squares of the lengths , of the vectors obtained from by the orthogonalization process.
Prove that the formulas of the orthogonalization process (up to multiplication of the orthogonal vectors by certain constants , i.e., the formulas for ) can be rewritten in the form
Prove that the -th Legendre polynomial (see problem 1302) equals, up to some numerical factor , the following expression:
where is the Gram determinant of the system of vector-polynomials obtained by removing the polynomial from the standard basis of polynomials of degree at most . Recall that the inner product is given by the formula
for arbitrary polynomials and .
Prove that for the Gram determinant the following inequality (Hadamard's inequality) holds
where equality holds if and only if the vectors are pairwise orthogonal or at least one of them is zero.
Prove that a real symmetric matrix is the Gram matrix of some system of vectors of a Euclidean space, i.e., , if and only if all principal minors of the matrix are nonnegative.
Prove that any Hermitian matrix with nonnegative principal minors is the Gram matrix of some system of vectors of a Hermitian space .
Can the matrix
be the Gram matrix of:
some linearly independent system of vectors of a Euclidean space;
some (not necessarily linearly independent) system of vectors?
Can the matrix
be the Gram matrix of some linearly independent system of vectors?
Can the matrix
be the Gram matrix of some system of vectors (not necessarily linearly independent)?
Prove that the definition of the -dimensional volume is well-posed (i.e., that it does not depend on the choice of order in the system of vectors ), by relating it to the Gram determinant via the formula
Prove that if the vectors are given by their coordinates in some orthonormal basis, then the volume of the parallelepiped built on the vectors , can be found by the formula
where is the determinant of the matrix whose columns (or rows) contain the coordinates of the vectors .
Determine the geometric meaning of Hadamard's inequality
and of its becoming an equality.
Prove the generalized Hadamard inequality
and determine its geometric meaning. In what case does the inequality become an equality?
Consider the Euclidean space with the standard inner product. Writing Hadamard's inequality explicitly in coordinates, find an upper bound for the square of the determinant of an arbitrary real matrix .
Prove that the determinant of the matrix of a positive-definite quadratic form satisfies the inequality
Compute the volume of the 4-dimensional parallelepiped given by the vectors , if:
, ;
, ;
, ;
, .
Prove that the orthogonal complement of a linear subspace of a Euclidean (Hermitian) space is a linear subspace. In the case of an -dimensional Euclidean space , find the dimension of , if the dimension of equals .
Let be a subspace of a finite-dimensional Euclidean space . Prove that the entire space is the direct sum of and its orthogonal complement .
Prove the following properties of the orthogonal complement of a linear subspace in a finite-dimensional Euclidean space :
;
;
.
Find a basis of the orthogonal complement of the subspace spanned by the vectors:
;
.
Find the equations defining the orthogonal complement of the subspace , if is given by a system of linear homogeneous equations:
In the Euclidean space of polynomials of degree at most with the inner product given by the integral
find the orthogonal complement to the subspace (the subspace of even polynomials).
In the Euclidean space of square matrices with the inner product
find the orthogonal complement to the subspace of:
upper triangular matrices;
symmetric matrices.
Find the orthogonal projection and the orthogonal component of the vector when projecting onto the subspace .
Find the orthogonal projection and the orthogonal component of the vector when projecting onto the subspace .
Find the orthogonal projection and the orthogonal component of the matrix in the Euclidean space of real square matrices of order two with the inner product when projecting onto the subspace , where
We call the distance between two vectors and of a Euclidean (Hermitian) space the quantity . The distance from a vector to a linear subspace is the number equal to — the infimum of the distances from the vector to the vectors of the subspace .
Prove that the distance equals the length of the orthogonal component of the vector with respect to the subspace .
Find the distance between the vector ) and the subspace .
Find the distance between the vector and the subspace given by a system of homogeneous linear equations:
In the space of polynomials of degree at most , consider three distinct inner products:
With respect to each inner product (i.e., in each of these three Euclidean spaces), find the distances from the polynomial to the subspace of polynomials of degree less than .
Define the angle between a vector and a subspace in a Euclidean space as the smallest angle that makes with the vectors of , i.e., . Prove that this angle equals the angle between the vector and its orthogonal projection onto the subspace , if , and equals , if .
Find the angle between the vector and the subspace , if:
;
;
;
.
Find the angle between the vector and the subspace given by a system of linear equations:
;
,
The definition of the angle between a line and a plane, the angle between two lines, and the angle between planes in three-dimensional space can be generalized to the multidimensional case as follows.
Let and be two subspaces of some finite-dimensional Euclidean space intersecting only in the zero vector: . We take the maximum of the function
on the Cartesian product to be the cosine of the angle between the subspaces and . On the other hand, this angle is the smallest among the angles between all pairs of nonzero vectors and .
Prove that if the subspaces and are not orthogonal, then for the angle defined in this way the equalities
hold, where is the orthogonal projection of the vector on , and is the orthogonal projection of the vector on .
Prove that if the subspaces and are orthogonal, then the angle between them equals .
If and , the angle is defined as the angle between the subspaces and .
If, however, or (i.e., one of the subspaces is contained in the other), then the value of the angle is set equal to zero.
Two subspaces and are given as linear spans: and .
Prove that all vectors of the subspace make the same angle with the subspace ; find this angle.
Prove that the angle between subspaces can be found as follows.
Let and be two subspaces of the Euclidean space intersecting only in the zero vector: — an arbitrary vector of the subspace , and its orthogonal projection onto the subspace . Prove that:
the functions and are quadratic functions defined on the subspace , and the function is positive-definite;
the cosine of the angle between the subspaces and equals , where is the largest root of the equation , where are the matrices (in some basis of the subspace ) of the quadratic functions and respectively.
Find the angle between the subspace and the subspace , where and , in each of the following cases:
;
;
;
;
.
Find the angle between the subspaces and of a four-dimensional space, where
Find the lengths of the sides and the interior angles of the triangle given by its vertices .
Find the length and the foot of the perpendicular dropped from the point to the plane passing through the three points .
Find the length and the foot of the perpendicular dropped from the point to the plane given by the system of equations
Find the angle between the line and the plane
Prove that the distance between two affine subspaces and of an affine Euclidean space can be found as the length of the orthogonal component of the vector with respect to the subspace .
The plane passes through the points , , and the line passes through the two points .
Determine the relative position of the line and the plane , write down the equations, and find the length of the common perpendicular.
The plane passes through the points , , and the line passes through the two points . Determine the relative position of the line and the plane and find the distance between them.
Find the distance between two planes, if the first passes through the points , and the second through the points .
Prove that the distance from a point of an affine Euclidean space to a plane passing through a point parallel to a subspace given by its basis , can be found using the Gram determinant by the formula
Find the distance between the point and the two-dimensional plane given by the system of inhomogeneous linear equations
Find the distance between the line and the plane , if:
,
,
.
Find the distance between the line and the plane given by the system of equations:
,
,
Find the distance between the polynomial and the affine subspace of polynomials of the form , where is an arbitrary polynomial of degree at most 2, in the affine Euclidean space of polynomials of degree at most 3 with the inner product given by the integral
Find the distance between the affine subspace of polynomials of the form , where is the linear subspace of polynomials spanned by the polynomials and , and the affine line of polynomials of the form const in the affine Euclidean space of polynomials of degree at most 3 with the inner product given as in the previous problem.
Find the distance from the point of the affine Euclidean space to the hyperplane .
In the triangle of the Euclidean plane:
express the entries of the Gram matrix in terms of the lengths of the sides of the triangle;
determine the geometric meaning of the condition that the determinant of the Gram matrix is positive.
A set of numbers indexed by two indices is given: . For which values of :
can any triple of numbers of this set be realized as a set of side lengths of some triangle of a Euclidean space;
can this set of numbers be a set of edge lengths of some tetrahedron in a three-dimensional affine Euclidean space;
can this set of numbers be realized as a set of distances between some four points of a two-dimensional Euclidean plane?
A set of nonnegative numbers , indexed by two indices , is given. Find conditions, necessary and sufficient, for the given set to be a set of
edge lengths of some -dimensional simplex embedded in an -dimensional affine Euclidean space;
pairwise distances between points of some Euclidean space.
In the latter case, determine the smallest dimension of such a space.
Find the shortest distance between a two-dimensional face of the unit four-dimensional cube and its diagonal not intersecting this face.
Prove that the orthogonal projections of the vertices of an -dimensional cube onto any of its diagonals divide it into equal parts.
Find the angle between the diagonal of a four-dimensional cube and its one-, two-, and three-dimensional faces.
(Pythagorean theorem in -dimensional space). Prove that the square of the diagonal of an -dimensional rectangular parallelepiped equals the sum of the squares of its edges emanating from one vertex.
Find the angle between the diagonal of an -dimensional cube and its -dimensional face.
Find the number of:
diagonals of an -dimensional cube;
diagonals of an -dimensional cube orthogonal to a given diagonal.
Find the length of the diagonal of an -dimensional cube with edge .
What three-dimensional solids are obtained in the cross-section of the four-dimensional cube by the three-dimensional hyperplane for the values ? Compare the results with the analogous three-dimensional problem.
In the -dimensional cube , we ``push out'' its walls by , i.e., obtain a new cube , . Find the dimension at which the volume of the cube is at least twice the volume of the original cube .
Prove that the line joining the centers of two opposite faces of a regular simplex is perpendicular to these faces.
Find the distance between a -dimensional face of a regular -dimensional simplex with edge of unit length and the opposite -dimensional face.
Find the angle between the two-dimensional faces of a regular four-dimensional simplex.
Consider some vector and a subspace in the Euclidean space . Prove that among the vectors of the subspace , the orthogonal projection of the vector onto ``deviates least'' from the given vector , i.e.,
Prove that a pseudosolution can be found as the solution of a new inhomogeneous system of equations formed using the Gram matrix :
What is the geometric meaning of the constants found in this way?
Using the method of least squares, find the pseudosolution of the following inconsistent systems of linear equations:
Prove that the system of polynomials , from (13.1) forms an orthonormal basis of the space of polynomials of degree at most with respect to the inner product
Given pairwise distinct points , of the interval . In the space of trigonometric polynomials
find trigonometric polynomials such that
Show that form an orthonormal basis of the space with respect to the inner product
Prove that in the space of trigonometric polynomials there exists a unique solution of the system of equations
where pairwise distinct points of the interval , and is some function.
Find a polynomial of minimal degree such that, at the given pairwise distinct points , its values and derivatives coincide with the values and derivatives of a given function:
Using the Lagrange interpolation polynomial , one can interpolate an arbitrary function on the real line from the table of its values , where .
Prove that if the set of interpolation nodes is symmetric with respect to zero, then from the evenness (oddness) of the function it follows that the function is even (odd).
Introduce the space of discrete functions on the finite set . Show that is a Euclidean space with respect to the inner product . Exhibit some orthonormal basis of the space .
Prove that the solution of the least-squares interpolation problem in the space exists and is unique, and that the coefficients , are found from the system of inhomogeneous linear equations
where is the Gram matrix of the system of functions in the Euclidean space .
Using the method of least squares, find the interpolation (best mean-square approximation) of the function given by the values :
by a linear polynomial (i.e., interpolate using the system of functions );
by a quadratic polynomial ;
by a polynomial of degree 3, .
Find the quadratic deviation in each of these cases.
Prove that in the case of an orthonormal system of functions , the coefficients , equal the Fourier coefficients of the function , i.e., the linear combination with the Fourier coefficients of the function is the best interpolation of the function .
Using the method of least squares, find, in the Euclidean space of continuously differentiable functions with the inner product
the interpolation (best mean-square approximation) of a continuously differentiable function using the system of functions .