Projections onto Lines & Subspaces - Linear Algebra
- Let , where and . Note that these basis vectors are not orthogonal. What is the orthogonal projection of onto ? Answer: When you encounter orthogonal projection problems, you need to determine how much of a given vector lies in the direction of a subspace. Since the basis vectors aren't orthogonal, you can't simply use the basic projection formula for each vector separately. The most systematic approach is using the projection matrix formula: , where has and as columns. However, there's a quicker insight here. Notice that can be written as . Since is already in the subspace , any scalar multiple of it is also in . Therefore, is already in the subspace, making its projection onto equal to itself. Answer D is correct: . Answer A gives just , which has no clear relationship to the projection. Answer B represents some arbitrary linear combination that doesn't correspond to the actual projection calculation. Answer C would only be correct if were orthogonal to the entire subspace , but since , it clearly lies within . Study tip: Before diving into complex projection formulas, always check if the vector you're projecting can be expressed as a linear combination of the basis vectors. If so, the vector is already in the subspace, and the projection is the vector itself.
- Let be the standard matrix of an orthogonal projection onto a proper subspace of (where and ). Which of the following statements about the matrix is NOT always true? Answer: is invertible. An orthogonal projection matrix projects vectors from onto the subspace . Since is a proper subspace, there are non-zero vectors in the orthogonal complement . For any non-zero vector , . This means has a non-trivial null space, and therefore is not invertible (i.e., it is a singular matrix). The only case where a projection matrix is invertible is when , in which case is the identity matrix, but the question specifies is a proper subspace. A is always true; projecting a vector a second time does not change the result, so for all , which implies . This property is called idempotence. C is always true for an orthogonal projection matrix; it is symmetric. D is always true; the set of all possible outputs of the transformation is precisely the subspace .
- Let be the plane in defined by the equation . According to the Best Approximation Theorem, which vector in is closest to the vector ? Answer: The vector in closest to is the orthogonal projection of onto , denoted . It is often easier to first project onto the orthogonal complement . The plane has a normal vector , which spans . Let's project onto the line spanned by : . By the Orthogonal Decomposition Theorem, . Therefore, the projection onto the plane is: . We can verify this vector is in : . B is the projection of onto the orthogonal complement , not onto . C is the original vector , which is not in the plane . D is the normal vector to the plane, which is not the closest vector in to .
- Let be the line in given by the equation for . Decompose the vector into a sum , where is a vector on the line and is a vector orthogonal to . What is the component ? Answer: The vector is the projection of onto the line , and is the orthogonal component. The line is spanned by the vector . First, we find : . Next, we find using the decomposition , which means : . A is the projection , not the orthogonal component . C is the original vector . D is an incorrect calculation.
- Let be a subspace of and let be a vector in . If the orthogonal projection of onto is the zero vector (i.e., ), what must be true about ? Answer: must be in the orthogonal complement of . The projection of onto is zero if and only if is orthogonal to every vector in . The set of all vectors orthogonal to is, by definition, the orthogonal complement of , denoted . Therefore, if , it must be that . A is a possible case, since if , its projection is . However, any non-zero vector in also has a zero projection onto , so this is not a necessary condition. B is incorrect. If is in (and ), its projection onto is itself, not . D is a specific case of B and is also incorrect.
- Consider the line in passing through the origin with direction vector . If and , which statement about the projections of these vectors onto is correct? Answer: but the projections have different lengths Projection is linear, so always holds. Computing: with length . with length . Since , the projections have different lengths.
- Let be the subspace of spanned by the vectors and . Find the orthogonal projection of onto . Answer: When finding orthogonal projections onto subspaces, you first need to identify a basis for the subspace, then use the projection formula. However, this problem has a key insight that can save you significant calculation time. Let's examine the given vectors that span : and . Notice that , meaning these vectors are linearly dependent. Therefore, is actually the one-dimensional subspace (line) spanned by just . To project onto this line, we use the formula: . Computing: and . Therefore: , which is answer D. Answer A incorrectly suggests the projection equals the original vector. Answer B appears to be , possibly from miscalculating the scalar multiple. Answer C seems to arise from sign errors or incorrect dot product calculations. Key strategy: Always check if the spanning vectors are linearly independent first. If they're dependent, reduce to a simpler basis before applying projection formulas—this prevents unnecessary matrix calculations.
- Let be the subspace of spanned by the orthogonal vectors and . Find the orthogonal projection of onto . Answer: Since the basis vectors and for are orthogonal, the projection of onto is the sum of the projections onto each basis vector: . Calculate the projection onto : . Calculate the projection onto : . Sum the two projections: . B is only the projection onto . C is only the projection onto . D is the orthogonal component .
- Let and . Find the orthogonal projection of onto the line spanned by . Answer: The formula for the orthogonal projection of a vector onto the line spanned by a vector is . First, calculate the dot products: . . Next, calculate the scalar coefficient: . Finally, multiply the scalar by the vector : . B is incorrect; it results from using the reciprocal of the correct scalar: . C is incorrect; it results from mistakenly using only the first component squared for the denominator: . D is incorrect; this is the orthogonal component .
- Consider the projection matrix that projects vectors in onto the line through the origin with direction vector . If and are vectors such that and , what is ? Answer: Since projection is a linear transformation, . Given that and , we have . Students might incorrectly try to multiply the coefficients (getting ), add them incorrectly, or forget the linearity property and attempt to compute the projection from scratch using the individual vectors.
- Let be a subspace of , and let . Let be the matrix for the orthogonal projection onto and be the matrix for the orthogonal projection onto its orthogonal complement . Which of the following expressions is always equal to ? Answer: The Orthogonal Decomposition Theorem states that any vector can be uniquely expressed as the sum of its projection onto a subspace and its projection onto the orthogonal complement . In matrix form, this is written as . Using the projection matrices, this becomes . This is true for all , which implies that the sum of the projection matrices is the identity matrix: . A is incorrect; it represents the difference between the parallel and orthogonal components, not their sum. B is incorrect. results in a vector in . When we then apply to this vector, the result is the zero vector, because any vector in is orthogonal to . So is the zero matrix. D is incorrect. The projection matrix is idempotent, meaning . So, , which is the projection of onto . This is only equal to if is already in .
- Let be a vector in and let be a subspace of . The orthogonal projection of onto is denoted by . Which of the following statements about the vector is always true? Answer: is orthogonal to every vector in the subspace . The Orthogonal Decomposition Theorem states that any vector can be written uniquely 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, statement B is always true. A is incorrect because (not ) is the vector in closest to . C is incorrect because is the zero vector only if is already in . D is incorrect because is generally not a scalar multiple of .
- Consider vectors and in . Let be the projection of onto the line spanned by , and let be the component of orthogonal to this line. What is ? Answer: By definition, is the projection of onto the line spanned by , and is the orthogonal component, meaning . The key property of orthogonal projection is that the projection is always orthogonal to the orthogonal component . Therefore, . This is true regardless of the specific vectors involved. Students might calculate and and get confused about the dot product, but the fundamental orthogonality property always gives zero.
- Find the shortest distance from the point represented by the vector to the subspace spanned by the orthogonal vectors and . Answer: When you encounter a distance-from-point-to-subspace problem, you're looking for the length of the component of your vector that's orthogonal to the subspace. This requires projecting the vector onto the subspace, then finding the distance to that projection. Since and are already orthogonal, you can project onto the subspace using the formula: Computing the dot products: , , , and . Therefore: The distance is Choice A () gives you the squared distance instead of taking the square root. Choice B () results from incorrectly using the magnitude of somehow. Choice C () comes from computational errors in the projection calculation. Always remember: distance to a subspace equals the length of the orthogonal component, which you find by subtracting the projection from the original vector.
- Let be the orthogonal projection matrix onto the plane in . If satisfies , which condition must hold? Answer: regardless of the magnitudes of , , and If , then is in the subspace onto which projects, namely the plane . This means must satisfy the plane equation . There is no restriction on the magnitude of - any vector in the plane, regardless of length, is unchanged by the projection. Choice A incorrectly adds a unit length requirement. Choice C gives an incorrect constraint equation. Choice D incorrectly specifies the normal vector relationship and adds an unnecessary unit length condition.