Projections & Decompositions - Linear Algebra
- Let be a finite-dimensional inner product space and a subspace of . If satisfies , which of the following must be true? Answer: and Since (unless ), we have . By the orthogonal decomposition, , so . Therefore, . Choice A is wrong because . Choice C has the wrong coefficient. Choice D is wrong because if , then , not .
- Let be an inner product space and be subspaces of such that (orthogonal direct sum). For any , if and , what is ? Answer: Since (orthogonal direct sum), we have where the projections onto and are orthogonal to each other. Given that . By the Pythagorean theorem for orthogonal components: . Substituting: , so . Therefore , which gives .
- Let be the plane in spanned by the vectors and . Let . Find the orthogonal projection of onto . Answer: The basis vectors and are not orthogonal, since . Therefore, we cannot use the simple sum-of-projections formula directly. A correct method is to find the orthogonal complement , project onto it, and subtract this from . 1. Find a basis for . The vector is orthogonal to both and and thus spans . . 2. Project onto (which is the line spanned by ): . 3. The projection onto is . . (A) is incorrect; this is the result of incorrectly applying the projection formula for an orthogonal basis. (B) is incorrect; this is the projection onto the orthogonal complement , not onto . (D) is incorrect; this results from a sign error, calculating .
- Let and . The vector can be written as the sum , where is parallel to and is orthogonal to . What is the vector ? Answer: The vector is the orthogonal projection of onto . The formula is . First, compute the dot products: . . Now, find the projection : . The vector is the component of orthogonal to , which is found by . . (A) is incorrect because it is the projection vector , not the orthogonal component . (C) is incorrect because it is the negative of the correct answer, which would result from calculating . (D) is incorrect because it results from a sign error in the dot product calculation: , leading to and .
- In with the standard inner product, let . If , which vector represents ? Answer: We need to find an orthogonal basis for U using Gram-Schmidt. Let , , . First, with . Next, with . For , we get . Computing and subtracting from gives .
- Let be the subspace of with orthogonal basis . Let . If , what is the coordinate vector ? Answer: The coordinate vector consists of the scalar coefficients used to build from the orthogonal basis vectors of . These scalars are found using the projection formula. Let . The coefficients are: and . Calculate : . . . Calculate : . . . So, the coordinate vector is . (A) is incorrect; these are the numerators of the coefficient fractions () before division by the squared norms. (C) is incorrect; this vector is itself, not its coordinate vector with respect to . It is calculated as (note: choice in question was slightly different from this calculation, but represents the same type of error). (D) is incorrect; this results from a sign error in the dot product for , i.e., , leading to .
- In , the orthogonal projection of the vector onto a line is . What is the orthogonal projection of onto the plane ? Answer: The Orthogonal Decomposition Theorem states that any vector can be written as the sum of its projection onto a subspace and its projection onto the orthogonal complement . That is: We are given and , and we want to find . We can rearrange the formula: Substituting the given values: . (B) is incorrect because it is the result of the incorrect subtraction . (C) is incorrect; it is the result of adding the two vectors instead of subtracting. (D) is incorrect; it is the projection onto , not .
- Let be the subspace of spanned by the orthogonal basis , where and . Let . Find the orthogonal projection of onto . Answer: Since is an orthogonal basis for , the projection of onto is the sum of the projections of onto each basis vector: . Calculate the dot products: . . . . Now substitute these values into the formula: . Sum the vectors: . (B) is incorrect because it is the orthogonal component . (C) is incorrect because it results from forgetting to divide by the norms squared ( and ). (D) is incorrect because it results from an arithmetic error, such as calculating the second scalar as instead of .
- Let be an inner product space with orthonormal basis . If and , what is ? Answer: First, we need an orthogonal basis for W. Let and apply Gram-Schmidt to . We have , and . So . Now . We have , , and . Thus . Therefore .
- Let be the standard matrix for the orthogonal projection onto a proper subspace of (where and ). Which of the following matrix equations must be true? Answer: A projection matrix has the property that applying it a second time does not change the result. Geometrically, once a vector is projected into the subspace , its image is already in . Projecting it again will leave it unchanged. Therefore, for all in . This implies that the matrix equation must hold. This property is called idempotence. (A) is incorrect. Since is a proper subspace, maps some non-zero vectors to zero (any vector in ), so its null space is non-trivial. Thus, is singular and not invertible. (B) is incorrect. The property defines an involution, such as a reflection matrix. A projection is not generally a reflection. (D) is incorrect. This would imply , which is not a projection matrix.
- Let be the subspace of spanned by and . For which vector is the orthogonal projection onto equal to ? Answer: When you encounter orthogonal projections in linear algebra, remember that the projection of a vector onto a subspace is zero if and only if that vector is orthogonal (perpendicular) to the entire subspace. This means the vector must be orthogonal to every vector that spans the subspace. To find which vector has zero projection onto , you need to check which option is orthogonal to both spanning vectors and . Two vectors are orthogonal when their dot product equals zero. For option D, : - - Since both dot products are zero, option D is orthogonal to the subspace . Options A, B, and C all fail this test. For example, option A gives dot products of 1 and 1 with the spanning vectors, option B gives 6 and 0, and option C gives 4 and 0. Since these vectors aren't orthogonal to both spanning vectors, their projections onto are non-zero. Key strategy: When asked about zero projections, immediately think "orthogonal to the subspace" and test dot products with all spanning vectors.
- Let be a subspace of . Suppose a vector is decomposed as , where is in and is in . If and , what is ? Answer: The Orthogonal Decomposition Theorem states that any vector can be uniquely decomposed into the sum of a vector in a subspace and a vector in its orthogonal complement . This decomposition is given by , where is in and is in . The problem provides such a decomposition: , with and . By the uniqueness of this decomposition, we can directly identify the components: and the orthogonal component is . Therefore, . No calculation is needed. (B) is incorrect because it is the component in , not the projection onto . (C) is incorrect because it is the vector itself, which is the sum of the two components. (D) is incorrect; it is the result of overthinking the problem and incorrectly calculating the projection of onto the line spanned by the single vector .
- Consider the vector space with the standard inner product. Let and . If , what is ? Answer: First, we find orthogonal bases for both subspaces using Gram-Schmidt. For span(S): Starting with , then orthogonalizing and , we get an orthogonal basis. For span(T): The vectors and are already orthogonal since their inner product is . Computing the projections: and . The difference is , so .
- In the inner product space with inner product , consider the subspace . What is the projection of onto ? Answer: We use the Gram-Schmidt process to orthogonalize the basis . Let with . Then . We have . The projection is . Computing: and . Thus .
- Let be the column space of the matrix . Which vector is the orthogonal projection of onto ? Answer: When you encounter orthogonal projection problems, you're finding the closest point in a subspace to a given vector. Here, you need to project onto the column space of . The projection formula is . First, calculate . Next, since the determinant is 3. Then . Computing . Finally, , which is answer D. Answer A gives a vector not in the column space of A. Answer B fails the projection formula calculation. Answer C represents an incorrect computation of the inverse or matrix multiplication. Always verify your projection lies in the subspace by checking it's a linear combination of the column vectors. Here, confirms our answer.
- In , let be the plane passing through the origin with normal vector . If is the matrix representing the orthogonal projection onto , which of the following is true about the eigenvalues of ? Answer: Two eigenvalues equal and one eigenvalue equals When you encounter orthogonal projection matrices, think about their geometric meaning: they map vectors onto a subspace while preserving distances within that subspace. This geometric insight directly determines the eigenvalue structure. For the orthogonal projection onto plane with normal vector , consider what happens to different types of vectors. Any vector lying in the plane gets mapped to itself, so these vectors are eigenvectors with eigenvalue . Since is a 2-dimensional subspace of , there are two linearly independent eigenvectors with eigenvalue . The normal vector is perpendicular to plane , so projecting it onto gives the zero vector. This means is an eigenvector with eigenvalue . Since the projection eliminates the component perpendicular to , there's exactly one such eigenvalue. Therefore, the matrix has two eigenvalues equal to and one eigenvalue equal to , making (D) correct. Looking at the wrong answers: (A) incorrectly suggests eigenvalues of , which would indicate some kind of scaling rather than true projection. (B) reverses the multiplicities—this would describe projection onto a line rather than a plane. (C) suggests all eigenvalues equal , which would make this a scaling transformation, not a projection. Study tip: Remember that orthogonal projections onto -dimensional subspaces always have eigenvalues equal to and eigenvalues equal to .
- In , let be the line through the origin with direction vector , and let be the plane . If , what is the distance from to ? Answer: First, . For the plane with normal vector , we have . The distance between these projections is .
- Let be the line in defined by the equation for . What is the shortest distance from the point to the line ? Answer: The shortest distance from a point to a line is the length of the vector component orthogonal to the line. Let be the position vector of point , and let be the direction vector of the line . 1. Find the projection of onto , let's call it : . . . . 2. Find the orthogonal component, : . 3. The shortest distance is the magnitude of : . (A) is incorrect because 2 is the length of the projection vector, . This represents the distance from the origin to the point of projection on the line. (C) is incorrect because is the length of the original vector , which is the distance from the origin to point P. (D) is incorrect; would result from a sign error in the dot product calculation, i.e., , leading to a different orthogonal vector.
- Let be an orthogonal basis for a subspace , where and . The vector is in . What is the coordinate vector ? Answer: For an orthogonal basis , the coordinates of a vector in the subspace are the scalars from the projection formula. If , then the coordinate vector is , where . Calculate : . . . Calculate : . . . Therefore, the coordinate vector is . (A) is incorrect; it consists of the dot products , forgetting to divide by . (B) is incorrect; it results from dividing the dot products by the norms () instead of the norms squared. (C) is incorrect; it is the correct coordinates but in the wrong order.
- Let be a subspace of and let be a vector in . Let . Which of the following statements is always true? Answer: The vector is orthogonal to every vector in . The Orthogonal Decomposition Theorem states that any vector can be uniquely written as the sum of a vector in a subspace and a vector in its orthogonal complement . Specifically, , where is in and is in . By definition, a vector in is orthogonal to every vector in . Therefore, the statement that is orthogonal to every vector in is always true. (A) is incorrect. The projection is not generally orthogonal to . This would only happen if , which means is in . (B) is incorrect. The vector is the component of orthogonal to , so it lies in , not . (D) is incorrect. The length of the projection is less than or equal to the length of the original vector. Equality holds only if is already in the subspace , in which case .