Geometric Applications - Linear Algebra
- The vector can be written as the sum , where is in the subspace spanned by and is in the orthogonal complement . What is the vector ? Answer: First, find the projection of onto the subspace , which is the vector . . . . . The vector is the component of orthogonal to , which is calculated as . . (A) is the vector in the subspace , not the vector in . (C) results from forgetting to divide by the squared norm in the projection formula. (D) is the vector , a sign error.
- Which matrix performs an orthogonal projection of vectors in onto the line spanned by the vector ? Answer: The projection matrix that projects onto the column space of a matrix is . For a line spanned by a single vector , we let . The formula simplifies to . First, calculate . Next, calculate the outer product : . Finally, . (A) is incorrect because it omits the normalization factor . (C) incorrectly divides by instead of . (D) is the matrix , which projects onto the orthogonal complement of the line.
- Let be the subspace of spanned by the vectors and . Which vector in is closest to the vector ? Answer: The vector in closest to is the orthogonal projection of onto . Since the basis vectors and are not orthogonal (), we must solve the normal equations where . . . . We solve , which yields . The projection is . (A) is incorrect because it is the sum of projections onto and as if they were an orthogonal basis. (C) is the error vector . (D) is the least-squares solution vector , not the projection itself.
- To find the best-fit parabola of the form for the data points , , , and , one sets up a least-squares problem . What is the design matrix ? Answer: The model is . We substitute each data point to form a row of the system , where . The columns of correspond to the coefficients of , , and , which are , , and respectively. For : . Row is . For : . Row is . For : . Row is . For : . Row is . Assembling these rows gives the matrix . (B) incorrectly calculates the third column () by not squaring the x-values. (C) incorrectly constructs the matrix using data vectors as columns. (D) omits the first column of ones, which corresponds to the constant term .
- To find the best-fit line of the form for the data points , , and , one must solve the normal equations for . Which of the following is the correct system? Answer: The linear system is constructed from the data points: This gives and . Next, we compute and . . . The resulting normal equations are . (B) results from defining the vector of unknowns as and swapping the columns of . (C) uses an incorrect calculation for . (D) incorrectly sets up the equation as , which is dimensionally incorrect.
- In a 3D graphics application, a camera positioned at the origin looks along the negative -axis. A 3D point is projected onto the plane (the image plane). Using perspective projection with the camera at the origin, what are the coordinates of the projected point on the image plane? Answer: The projected point has coordinates because perspective projection scales coordinates proportionally to depth In perspective projection from the origin onto the plane , a point is projected to . This is because the line from the origin through has parametric form , and we need , giving . For point , we have . The projected point is . Note that . Choice B incorrectly uses the image plane distance in the denominator instead of the object's -coordinate. Choice C makes an error in the perspective division formula. Choice D uses an incorrect scaling relationship.
- Let be the subspace of spanned by and . Let . If is the orthogonal projection of onto , which statement is true about the error vector ? Answer: and . By the definition of an orthogonal projection, the error vector is orthogonal to the subspace . This means must be orthogonal to every vector in , including the basis vectors that span . Therefore, and . (A) is not necessarily true. The orthogonal complement is two-dimensional, so could be any linear combination of a basis for , not just a multiple of a single vector. (B) is false. Any vector in is a linear combination of and and must have a fourth component of 0. Thus, the fourth component of is . (C) is false because is not in (its fourth component is 4, while all vectors in have a fourth component of 0), so its projection is not equal to itself.
- If is the least-squares solution to an inconsistent system , which of the following vectors must lie in the null space of , which is also the orthogonal complement of the column space of ? Answer: The residual (or error) vector, . The least-squares solution is defined by the property that the vector is the orthogonal projection of onto the column space of , denoted . The definition of an orthogonal projection implies that the difference between the original vector and its projection, which is the residual vector , must be orthogonal to the subspace being projected onto. Therefore, is in . The fundamental subspaces theorem states that . (A) is in the domain of the transformation, not necessarily in . (B) is in , not its orthogonal complement. (D) is generally not in ; if it were, its projection would be the zero vector.
- Let be a plane through the origin in , and let be a vector representing a point not in . If is the orthogonal projection of onto , what is the geometric meaning of the quantity ? Answer: The shortest distance from the point represented by the vector to the plane . The orthogonal decomposition theorem states that can be uniquely written as , where is in (the projection) and is in (the orthogonal component). Here, . The vector is a normal vector from the plane to the point represented by . Its length, , represents the shortest possible distance from the point to the plane. (A) describes , not . (B) is incorrect; the area would be . (D) is incorrect; the sine of the angle between and the plane is given by .
- What is the shortest distance from the point to the plane in spanned by the orthogonal vectors and ? Answer: The distance is the magnitude of the component of orthogonal to the subspace spanned by and . This component is . Since the basis is orthogonal, the projection is: ; . ; . . The orthogonal component is . The distance is . (A) is the magnitude of the projection vector . (B) is the magnitude of the original vector . (C) results from ignoring one of the basis vectors during the projection calculation.
- Consider the linear system where and . What is the least-squares solution ? Answer: The least-squares solution is found by solving the normal equations . First, compute : . Next, compute : . Now, solve the system . This gives , and . So, . (A) is the projection vector , not the solution vector . (B) is the vector . (D) results from a sign error when computing .
- A structural engineer analyzes stress distribution in a beam by decomposing the stress vector into components along two orthogonal directions: and . After projecting onto the subspace spanned by , what is the magnitude of the component of that lies outside this subspace? Answer: The magnitude of the external component is because this equals the norm of the rejection vector from the spanned subspace Since and both lie in the -plane (), the subspace they span is exactly the -plane. The component of that lies outside this subspace is simply the -component, which is the vector . The magnitude of this external component is . Alternatively, we can verify this by computing the projection of onto the subspace. First, check if and are orthogonal: . Yes, they are orthogonal. The projection of onto the subspace is . Computing: , , , . So . The component outside the subspace is , which has magnitude . Choices B, C, D represent computational errors in the projection process.
- Let be a vector in and let be a subspace of . Let be the orthogonal projection of onto . Which of the following statements is NOT always true? Answer: The projection of onto is the zero vector. Let's analyze each statement. (A) True. This is the definition of the orthogonal projection; the error vector is orthogonal to the subspace . (B) True. This is the Pythagorean theorem applied to the orthogonal decomposition . (C) False. Since is already in , its projection onto is itself, i.e., . This is the zero vector only in the trivial case where . (D) True. This is the Best Approximation Theorem, which states that the orthogonal projection is the unique vector in closest to .