Linear Algebra II: Transformations & Matrices
Linear Algebra II: Transformations & Matrices
Similar matrices A and B share the same eigenvalues because they have the same characteristic polynomial. The characteristic polynomial is defined by det(A - λI) and is preserved under similarity transformations. Since eigenvalues are roots of this polynomial, their values remain unchanged between similar matrices, thereby preserving their spectral properties .
For two n × n matrices A and B, if A ∼ B (A is similar to B), then det(A) = det(B). This is significant because it implies that the determinant, which provides geometric insight into volume scaling and invertibility, remains unchanged under similarity transformations, affirming that similar matrices describe the same linear transformation under different bases .
Under similarity transformations, matrices preserve several important characteristics, including the determinant, trace, characteristic polynomial, eigenvalues, and the invertibility of the matrix. These properties ensure that while the representation of a transformation may change depending on the basis, the fundamental behavior of the transformation remains the same .
The composition of two linear transformations S and T results in another linear transformation because it satisfies the two main properties of linearity: additivity and scalar multiplication. Given vectors u and v, and a scalar c, ST(u + v) = ST(u) + ST(v) and ST(cu) = cST(u), satisfying the conditions for linearity by distributing both operations over the combined effect of S and T .
The set of all linear transformations from a vector space V to another vector space W forms a vector space under the operations of pointwise addition and scalar multiplication. This means that given two transformations S and T, and a scalar c, the operations (S + T)(v) = S(v) + T(v) and (cS)(v) = cS(v) satisfy the axioms of vector spaces, including closure, associativity, distributivity, and the existence of an additive identity and inverses .
The transformation matrix for reflection in the line y = x is given by the permutation matrix: \( \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \). This matrix swaps the x and y coordinates of any vector it multiplies with, effectively reflecting it across the line y = x .
The differentiation operator D: P2 → P1 with respect to standard bases for P2 (1, x, x^2) and P1 (1, x) is represented as a matrix \( \begin{bmatrix} 0 & 0 & 0\\ 1 & 0 & 0\\ 0 & 2 & 0 \end{bmatrix} \). This matrix multiplies vectors in the P2 space and effectively differentiates their polynomial representation .
Similarity defines an equivalence relation between square matrices by satisfying the following three properties: Reflexivity, Symmetry, and Transitivity. If A is a square matrix, then it is similar to itself, satisfying reflexivity. If A is similar to B, then B is similar to A, satisfying symmetry. If A is similar to B and B is similar to C, then A is similar to C, satisfying transitivity .
For ST to be an isomorphism, it must be both injective (one-to-one) and surjective (onto). If ST is injective, then its kernel is zero, implying both S and T must be injective. If ST is surjective, the image covers the entire space, implying both S and T must be surjective; hence they are invertible, meeting the definition of isomorphisms on their respective domains .
R3 and P2 are isomorphic as vector spaces, meaning there exists a bijective linear transformation between them. This isomorphism can be represented with a matrix that serves two functions: forwards and backwards transformation (invertible). The specific structure of this matrix depends on the chosen bases for each space but typically results in a full-rank 3x3 matrix confirming the dimensions and basis elements are equatable .