Similarity & Change of Basis - Linear Algebra
- Let and be matrices such that for some invertible matrix . Which of the following properties is NOT necessarily shared by both and ? Answer: They have the same eigenspaces. Similarity transformations preserve determinant, trace, and eigenvalues. However, eigenspaces are not generally preserved. If is an eigenvector of corresponding to eigenvalue , then is the corresponding eigenvector of . The eigenspace of for is the set of all vectors where is in the eigenspace of for . This new set of vectors, , is generally a different subspace from unless is a multiple of the identity matrix.
- Consider two matrices and where with for some scalar . If , which statement about is always true regardless of the value of ? Answer: has the same eigenvalues as with the same algebraic multiplicities When you see matrices related by , you're dealing with similarity transformations — one of the most important concepts in linear algebra. Similar matrices represent the same linear transformation under different coordinate systems. Let's examine what similarity preserves. First, we'll compute and find . Notice that depends on , but its eigenvalues come from , giving with algebraic multiplicity 2 — exactly the same as matrix . This confirms (C) is correct: similar matrices always have identical eigenvalues with the same algebraic multiplicities. Here's why the other options fail: (A) is wrong because when . (B) is incorrect because eigenvectors change under similarity transformations. If is an eigenvector of , then is the corresponding eigenvector of . (D) is backwards. Matrix has only one linearly independent eigenvector , making it non-diagonalizable. Since similarity preserves diagonalizability, is also non-diagonalizable regardless of . Key takeaway: Similar matrices are like the same person wearing different clothes — the fundamental properties (eigenvalues, determinant, trace, diagonalizability) remain unchanged, but the specific representation varies.
- A matrix is similar to . If is the matrix such that and , what is the characteristic polynomial of ? Answer: When you encounter matrix similarity problems, remember that similar matrices share the same eigenvalues and therefore the same characteristic polynomial. This is a powerful property that often provides the quickest path to the solution. Since is similar to , matrix has the same eigenvalues as . The eigenvalues of a diagonal matrix are simply the diagonal entries, so the eigenvalues are and . For any matrix with eigenvalues and , the characteristic polynomial is . Substituting our eigenvalues: . Looking at the wrong answers: Choice A gives , which would correspond to eigenvalues that don't match our diagonal matrix. Choice B gives , which has the wrong sign on the middle term. Choice D gives , which would correspond to completely different eigenvalues. The answer is C: . Study tip: When you see matrix similarity, immediately think "same eigenvalues, same characteristic polynomial." You don't need to compute explicitly—the diagonal matrix gives you the eigenvalues directly, which is all you need for the characteristic polynomial.
- A matrix has eigenvalues and with corresponding eigenvectors and . If is the matrix whose columns are these eigenvectors, what is the entry of ? Answer: 0 When P has eigenvectors as columns, P⁻¹AP is the diagonal matrix with eigenvalues on the diagonal: [[2,0],[0,-1]]. The (2,1) entry is 0. This is a fundamental property of diagonalization. Choice B gives the second eigenvalue. Choice C gives the first eigenvalue. Choice D might result from confusing row and column indexing or misunderstanding the diagonalization process.
- Matrices and are similar. If is invertible, what can be concluded about matrix ? Answer: is also invertible, and its inverse is similar to . If and are similar, then for some invertible matrix . The determinant is an invariant of similarity, so . Since is invertible, . Therefore, , which means is also invertible. To find the relationship between the inverses, we take the inverse of the similarity equation: . This equation shows, by definition, that is similar to .
- A linear transformation is defined by . Consider the basis . What is the matrix representation of with respect to the basis , denoted ? Answer: The standard matrix for is . The change of basis matrix from to the standard basis is . Its inverse is . The matrix is given by the similarity transformation . First, compute : . Then, compute : . Distractor C is the standard matrix . Distractor B is the intermediate matrix .
- Let be a matrix with eigenvalues and . Let be a matrix similar to . What is the trace of the matrix , where is the identity matrix? Answer: 6 When you encounter eigenvalues and similar matrices, remember that similarity preserves eigenvalues—this is one of the most important properties in linear algebra. If matrix B is similar to matrix A, then B has exactly the same eigenvalues as A. Since A has eigenvalues and , matrix B also has eigenvalues 3 and -1. The trace of any matrix equals the sum of its eigenvalues, so . Now, when you add to matrix B, you're adding 2 to each diagonal element. This shifts each eigenvalue by 2, giving B + 2I eigenvalues of and . Therefore, . Looking at the wrong answers: Choice (A) gives 2, which is just the trace of B itself—this ignores the part entirely. Choice (B) gives 4, which you might get if you incorrectly thought adding means adding 2 to the trace rather than adding 2 to each eigenvalue. Choice (C) suggests the answer can't be determined, but similarity relationships give us enough information since they preserve eigenvalues. Key strategy: Remember that similar matrices share eigenvalues, and adding a scalar multiple of the identity matrix shifts all eigenvalues by that scalar. The trace always equals the sum of eigenvalues, making these calculations straightforward once you recognize the pattern.
- Let and be two bases for . If the coordinate vector of relative to basis is , what is ? Answer: First, find the vector in the standard basis . . Next, find the coordinates of relative to the basis . We need to solve , which means . The matrix for basis is . Its inverse is . Finally, calculate . Distractor B is the vector in standard coordinates.
- Let matrix . An eigenvector of is . Let and . Which of the following is an eigenvector of matrix ? Answer: First, find the eigenvalue corresponding to for matrix : . The eigenvalue is . If is an eigenvector of for eigenvalue , then the corresponding eigenvector of is . First, we find the inverse of : . Now, we compute : . Distractor C is the result of mistakenly calculating .
- Let and be two bases for a vector space . Let be the change-of-coordinates matrix from to , denoted . Which of the following correctly describes the columns of ? Answer: The columns of are the coordinate vectors of and with respect to the basis . By definition, the change-of-coordinates matrix transforms -coordinates into -coordinates. The matrix is constructed by applying this transformation to the standard basis vectors in the coordinate space, which correspond to the basis vectors of . Specifically, the -th column of is the coordinate vector . Therefore, the columns are the coordinate vectors of the vectors from the 'from' basis () expressed in the 'to' basis ().
- Consider the change of basis from the standard basis to the basis where and . If a linear transformation has matrix with respect to the standard basis, what is the sum of the diagonal entries of the matrix representing with respect to the basis ? Answer: 7 The trace is invariant under similarity transformations. If A represents T in the standard basis and B represents T in the new basis, then B = P⁻¹AP where P = [[2,1],[1,3]]. Since tr(B) = tr(A), and tr(A) = 4 + 3 = 7, the sum of diagonal entries in the new basis is 7. Choice B subtracts instead of adding the diagonal entries. Choice C adds an arithmetic error. Choice D might come from incorrectly computing with the change of basis matrix entries.
- Which of the following statements is always true for any two similar matrices and ? Answer: and are similar for any positive integer . When you encounter questions about similar matrices, focus on properties that are preserved under similarity transformations. Two matrices and are similar if there exists an invertible matrix such that . The correct answer is D because similarity is preserved under matrix powers. If , then , making and similar. This follows from the fact that , which you can verify by repeatedly applying the associative property of matrix multiplication. Let's examine why the other options fail. Option A is incorrect because similar matrices don't necessarily share eigenvectors. While they have the same eigenvalues, their eigenvectors are generally different. For example, if is an eigenvector of , then (not ) is the corresponding eigenvector of . Option B is wrong because similar matrices don't preserve null spaces. The null space of is , not the null space of itself. The dimensions are equal, but the actual subspaces differ. Option C fails because adding different matrices ( to one, to another) breaks the similarity relationship. If , then . Remember: similar matrices preserve eigenvalues, determinants, traces, and ranks, but not eigenvectors or specific subspaces. Operations that "commute" with similarity transformations (like taking powers) preserve similarity.
- Let be the linear transformation that reflects vectors across the line . What is the matrix of with respect to the basis ? Answer: The basis is chosen to be geometrically significant. The first basis vector, , lies on the line of reflection . Any vector on the line of reflection is unchanged by the reflection, so . In -coordinates, this is . The second basis vector, , is orthogonal to the line of reflection (its dot product with is ). A vector orthogonal to the line of reflection is mapped to its negative, so . In -coordinates, this is . The matrix of the transformation with respect to this basis, , has these coordinate vectors as its columns: . Choice C is the standard matrix for this transformation.
- The fundamental reason that similar matrices share the same eigenvalues is that: Answer: they represent the same linear transformation, and eigenvalues are geometric properties of the transformation itself, independent of the coordinate system. Similarity of matrices is fundamentally about representing the same linear transformation with respect to different bases (coordinate systems). An eigenvalue of a linear transformation is a scalar such that for some nonzero vector , . This property—that the transformation acts on by simple scaling—is an intrinsic, geometric feature of the transformation. It does not depend on how we choose to write down coordinates for vectors or the matrix for the transformation. Since similar matrices represent the same transformation, they must capture the same intrinsic scaling factors, which are the eigenvalues. The other options are either incorrect statements (C is false, is not always orthogonal) or describe properties that are consequences, not the fundamental reason (A, D).
- The matrix is similar to a diagonal matrix . Which of the following could be an invertible matrix such that ? Answer: If , the columns of must be the eigenvectors of , and the diagonal entries of must be the corresponding eigenvalues. The eigenvalues are given as 4 and 1. We need to find the eigenvectors of . For : . This gives , or . An eigenvector is . For : . This gives , or . An eigenvector is . The matrix is formed by these eigenvectors. The order must correspond to the order of eigenvalues in . Since and , the first column of must be an eigenvector for , and the second column must be an eigenvector for . Thus, . Choice C reverses the order of the eigenvectors, which would correspond to .
- Let and be matrices where for some invertible matrix . If has eigenvalues and , what is ? Answer: -6 When you encounter matrices related by similarity (), remember that similar matrices share many fundamental properties, including determinants of shifted matrices. Since , we can find by substituting: . Using the determinant property , we get: . Since , this simplifies to . The wrong answers represent common misconceptions. Choice (A) -24 likely comes from incorrectly multiplying by 4, perhaps thinking the shift affects the determinant multiplicatively. Choice (B) 6 makes the sign error of taking the absolute value of the given determinant. Choice (C) 24 combines both errors: taking the absolute value and then multiplying by 4. The key insight is that similarity transformations preserve the determinant of any shifted matrix. You don't need to calculate from the eigenvalues since it's already given. When studying similar matrices, focus on which properties are invariant (eigenvalues, determinant, trace) versus which can change (eigenvectors, individual entries). This will help you recognize when complex calculations aren't necessary.
- Let be a matrix representing a linear transformation with respect to the standard basis. Let be another basis for . The matrix of the same transformation with respect to basis is . Which conclusion is guaranteed to be true? Answer: The determinant of is . The matrices and represent the same linear transformation with respect to different bases, which means they are similar. Similar matrices have the same determinant. The determinant of is the product of its diagonal entries: . Therefore, must also be . (A) is incorrect; is similar to a diagonal matrix, meaning it is diagonalizable, but it is not necessarily diagonal itself. (B) is incorrect; the basis vectors are eigenvectors of , but eigenvectors corresponding to different eigenvalues are only guaranteed to be linearly independent, not necessarily orthogonal. (D) is incorrect; the eigenvalues of (and thus ) are . There are only two distinct eigenvalues, not three.
- A linear transformation has matrix in the standard basis with and . After a change of basis, has matrix where is upper triangular with diagonal entries . What is ? Answer: 29 This question tests your understanding of how matrix properties behave under change of basis, particularly the relationship between eigenvalues and matrix traces. When a matrix undergoes a change of basis, it becomes similar to its original form, meaning for some invertible matrix . Crucially, similar matrices share the same eigenvalues. Since is upper triangular with diagonal entries 2, 3, 4, these are the eigenvalues of both and . You can verify this makes sense with the given information: the trace equals the sum of eigenvalues ( ✓), and the determinant equals their product ( ✓). For , the eigenvalues are the squares of 's eigenvalues: , , and . Therefore, , which is answer (B). The wrong answers represent common calculation errors: (A) 45 comes from incorrectly computing (perhaps mixing trace, determinant, and products). (C) 81 is simply , the square of the trace—but in general. (D) 57 might result from adding the eigenvalues incorrectly or miscomputing their squares. Remember: when you see eigenvalue problems involving traces, use the fact that eigenvalues determine both the trace (sum) and determinant (product), and that equals the sum of the th powers of the eigenvalues.
- Let and suppose for some invertible matrix . If the first column of is , what is the first column of ? Answer: When you encounter similarity transformations like , focus on what each column of represents. The key insight is that the -th column of any matrix product can be found by multiplying the left matrix by the -th column of the right matrix. To find the first column of , you need the first column of . Since means " times ," the first column of is times the first column of . Given that the first column of is , the first column of is . Therefore, the first column of is times this result, which gives us . This matches answer choice B. Answer choice A assumes is in some standard form, which isn't necessarily true. Answer choice C gives you the first column of , not — you're missing the crucial multiplication. Answer choice D appears to be the result of computing , but again, this ignores the factor. Remember: for matrix products, think column by column. The -th column of equals times the -th column of . This systematic approach prevents you from getting lost in complex similarity transformations.