Study guide
8.4 Matrix Representations of Transformations and Change of Basis
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
8.4 Matrix Representations of Transformations and Change of Basis
Key Takeaways Explain This Topic AI
The matrix representation [T]_{C, B} of a linear transformation T: V -> W with respect to ordered bases B and C has size dim W x dim V; its j-th column is the coordinate vector [T(v_j)]_C of the j-th basis vector of B.
Composition of linear transformations corresponds directly to matrix multiplication: [S o T] {D, B} = [S] {D, C} [T]_{C, B}.
Under a change of basis, the matrix of a linear operator transforms via similarity: [T]_C = P^-1 [T] B P, where P = P {B <- C} is the transition matrix from C to B.
Similar matrices represent the same geometric linear operator under different bases and share identical similarity invariants: determinant, trace, characteristic polynomial, minimal polynomial, eigenvalues, and rank.
Having identical trace, determinant, and eigenvalues is necessary but NOT sufficient for matrix similarity; geometric multiplicities and Jordan canonical forms must also align.
Last updated: September 2026
8.4 Matrix Representations of Transformations and Change of Basis
Every linear transformation between finite-dimensional vector spaces can be faithfully represented as a matrix once ordered bases are specified for both the domain and codomain. The GRE Subject Test tests your ability to construct transformation matrices, relate map composition to matrix multiplication, perform similarity transformations under a change of basis, and exploit similarity invariants (trace, determinant, characteristic polynomial, and rank).
Construction of Matrix Representations
Let V V V and W W W be finite-dimensional vector spaces over F \mathbb{F} F with ordered bases B = ( v 1 , … , v n ) \mathcal{B} = (v_1, \dots, v_n) B = ( v 1 , … , v n ) and C = ( w 1 , … , w m ) \mathcal{C} = (w_1, \dots, w_m) C = ( w 1 , … , w m ) , respectively.
Let T : V → W T: V \to W T : V → W be a linear transformation. The matrix representation of T T T with respect to bases B \mathcal{B} B and C \mathcal{C} C , denoted [ T ] C , B [T]_{\mathcal{C}, \mathcal{B}} [ T ] C , B , is the m × n m \times n m × n matrix whose columns are the C \mathcal{C} C -coordinate vectors of the images of the B \mathcal{B} B -basis vectors: [ T ] C , B = [ [ T ( v 1 ) ] C [ T ( v 2 ) ] C … [ T ( v n ) ] C ] ∈ M m × n ( F ) . [T]_{\mathcal{C}, \mathcal{B}} = \begin{bmatrix} [T(v_1)]_\mathcal{C} & [T(v_2)]_\mathcal{C} & \dots & [T(v_n)]_\mathcal{C} \end{bmatrix} \in M_{m \times n}(\mathbb{F}). [ T ] C , B = [ [ T ( v 1 ) ] C [ T ( v 2 ) ] C … [ T ( v n ) ] C ] ∈ M m × n ( F ) .
Fundamental Action Formula
For any vector v ∈ V v \in V v ∈ V , matrix multiplication reproduces transformation evaluation: [ T ( v ) ] C = [ T ] C , B [ v ] B . [T(v)]_\mathcal{C} = [T]_{\mathcal{C}, \mathcal{B}} [v]_\mathcal{B}. [ T ( v ) ] C = [ T ] C , B [ v ] B .
Linear Operators on a Single Space
When T : V → V T: V \to V T : V → V is a linear operator and B \mathcal{B} B is a single ordered basis for V V V , the operator matrix is denoted: [ T ] B = [ T ] B , B ∈ M n × n ( F ) . [T]_\mathcal{B} = [T]_{\mathcal{B}, \mathcal{B}} \in M_{n \times n}(\mathbb{F}). [ T ] B = [ T ] B , B ∈ M n × n ( F ) .
Matrix Composition and Operator Invertibility
Matrix representations establish an algebraic isomorphism between the algebra of linear maps L ( V , W ) \mathcal{L}(V, W) L ( V , W ) and the algebra of matrices M m × n ( F ) M_{m \times n}(\mathbb{F}) M m × n ( F ) .
Composition as Matrix Multiplication
Let T : V → W T: V \to W T : V → W and S : W → U S: W \to U S : W → U be linear transformations with ordered bases B \mathcal{B} B for V V V , C \mathcal{C} C for W W W , and D \mathcal{D} D for U U U . Then: [ S ∘ T ] D , B = [ S ] D , C [ T ] C , B . [S \circ T]_{\mathcal{D}, \mathcal{B}} = [S]_{\mathcal{D}, \mathcal{C}} [T]_{\mathcal{C}, \mathcal{B}}. [ S ∘ T ] D , B = [ S ] D , C [ T ] C , B .
For linear operators on V V V , powers of transformations correspond directly to matrix powers: [ T k ] B = ( [ T ] B ) k [T^k]_\mathcal{B} = ([T]_\mathcal{B})^k [ T k ] B = ([ T ] B ) k .
A linear operator T : V → V T: V \to V T : V → V is invertible if and only if [ T ] B [T]_\mathcal{B} [ T ] B is an invertible matrix, with: [ T − 1 ] B = ( [ T ] B ) − 1 . [T^{-1}]_\mathcal{B} = ([T]_\mathcal{B})^{-1}. [ T − 1 ] B = ([ T ] B ) − 1 .
Change of Basis for Linear Operators and Matrix Similarity
How does the matrix representation of an operator T : V → V T: V \to V T : V → V change when we replace ordered basis B \mathcal{B} B with a new ordered basis C \mathcal{C} C ?
The Similarity Transformation Formula
Let P = P B ← C P = P_{\mathcal{B} \leftarrow \mathcal{C}} P = P B ← C be the transition matrix from C \mathcal{C} C to B \mathcal{B} B , whose columns are [ w j ] B [w_j]_\mathcal{B} [ w j ] B (where C = ( w 1 , … , w n ) \mathcal{C} = (w_1, \dots, w_n) C = ( w 1 , … , w n ) ). Then: [ T ] C = P − 1 [ T ] B P = P C ← B [ T ] B P B ← C . [T]_\mathcal{C} = P^{-1} [T]_\mathcal{B} P = P_{\mathcal{C} \leftarrow \mathcal{B}} [T]_\mathcal{B} P_{\mathcal{B} \leftarrow \mathcal{C}}. [ T ] C = P − 1 [ T ] B P = P C ← B [ T ] B P B ← C .
Matrix Similarity
Two square matrices A , B ∈ M n × n ( F ) A, B \in M_{n \times n}(\mathbb{F}) A , B ∈ M n × n ( F ) are similar (written A ∼ B A \sim B A ∼ B ) if there exists an invertible matrix P ∈ M n × n ( F ) P \in M_{n \times n}(\mathbb{F}) P ∈ M n × n ( F ) such that: B = P − 1 A P . B = P^{-1} A P. B = P − 1 A P .
Geometric Meaning : A A A and B B B are similar if and only if they represent the exact same linear operator T : V → V T: V \to V T : V → V under two different choices of basis.
Similarity is an equivalence relation (reflexive, symmetric, and transitive).
Similarity Invariants
Because similar matrices represent the same geometric transformation, any intrinsic coordinate-free property of the operator must be shared by all similar matrices. These shared quantities are similarity invariants .
Catalog of Preserved Invariants
If B = P − 1 A P B = P^{-1} A P B = P − 1 A P :
Trace : tr ( B ) = tr ( P − 1 ( A P ) ) = tr ( ( A P ) P − 1 ) = tr ( A ) \operatorname{tr}(B) = \operatorname{tr}(P^{-1}(AP)) = \operatorname{tr}((AP)P^{-1}) = \operatorname{tr}(A) tr ( B ) = tr ( P − 1 ( A P )) = tr (( A P ) P − 1 ) = tr ( A ) .
Determinant : det ( B ) = det ( P − 1 ) det ( A ) det ( P ) = det ( A ) \det(B) = \det(P^{-1}) \det(A) \det(P) = \det(A) det ( B ) = det ( P − 1 ) det ( A ) det ( P ) = det ( A ) .
Characteristic Polynomial : p B ( λ ) = det ( λ I − P − 1 A P ) = det ( P − 1 ( λ I − A ) P ) = det ( λ I − A ) = p A ( λ ) . p_B(\lambda) = \det(\lambda I - P^{-1}AP) = \det(P^{-1}(\lambda I - A)P) = \det(\lambda I - A) = p_A(\lambda). p B ( λ ) = det ( λ I − P − 1 A P ) = det ( P − 1 ( λ I − A ) P ) = det ( λ I − A ) = p A ( λ ) .
Eigenvalues and Algebraic Multiplicities : Identical roots of the characteristic polynomial.
Geometric Multiplicities : dim ( ker ( B − λ I ) ) = dim ( ker ( A − λ I ) ) \dim(\ker(B - \lambda I)) = \dim(\ker(A - \lambda I)) dim ( ker ( B − λ I )) = dim ( ker ( A − λ I )) for every eigenvalue λ \lambda λ .
Minimal Polynomial : m B ( λ ) = m A ( λ ) m_B(\lambda) = m_A(\lambda) m B ( λ ) = m A ( λ ) .
Rank and Nullity : rank ( B ) = rank ( A ) \operatorname{rank}(B) = \operatorname{rank}(A) rank ( B ) = rank ( A ) and nullity ( B ) = nullity ( A ) \operatorname{nullity}(B) = \operatorname{nullity}(A) nullity ( B ) = nullity ( A ) .
Jordan Canonical Form : Identical up to permutation of Jordan blocks.
What Is NOT Invariant Under Similarity
Individual Matrix Entries : The numbers in the arrays generally differ.
Eigenvectors : If v v v is an eigenvector of A A A ( A v = λ v A v = \lambda v A v = λ v ), then P − 1 v P^{-1} v P − 1 v is the corresponding eigenvector of B B B : B ( P − 1 v ) = ( P − 1 A P ) ( P − 1 v ) = P − 1 A v = P − 1 ( λ v ) = λ ( P − 1 v ) . B(P^{-1} v) = (P^{-1} A P)(P^{-1} v) = P^{-1} A v = P^{-1} (\lambda v) = \lambda (P^{-1} v). B ( P − 1 v ) = ( P − 1 A P ) ( P − 1 v ) = P − 1 A v = P − 1 ( λ v ) = λ ( P − 1 v ) .
Row Space and Column Space : col ( B ) ≠ col ( A ) \operatorname{col}(B) \neq \operatorname{col}(A) col ( B ) = col ( A ) in general.
Invariant vs Non-Invariant Quantities
- Quantity Invariant Under Similarity? Mathematical Rationale
- Determinant & Trace Yes Cyclic property of trace; multiplicative determinant
Characteristic Polynomial Yes det ( λ I − P − 1 A P ) = det ( λ I − A ) \det(\lambda I - P^{-1}AP) = \det(\lambda I - A) det ( λ I − P − 1 A P ) = det ( λ I − A )
- Spectrum (Eigenvalues) Yes Roots of invariant characteristic polynomial
- Eigenspace Dimensions Yes Rank-nullity preservation on ( A − λ I ) (A - \lambda I) ( A − λ I )
Minimal Polynomial Yes Annihilating polynomials satisfy p ( P − 1 A P ) = P − 1 p ( A ) P p(P^{-1}AP) = P^{-1}p(A)P p ( P − 1 A P ) = P − 1 p ( A ) P
Eigenvectors No Basis change scales and rotates coordinate vectors: v B = P − 1 v A v_B = P^{-1} v_A v B = P − 1 v A
- Diagonal Entries No Entries depend entirely on coordinate frame
- Step-by-Step Worked Problems
- Problem 1: Matrix Representation of a Polynomial Operator
Let T : P 2 ( R ) → P 2 ( R ) T: P_2(\mathbb{R}) \to P_2(\mathbb{R}) T : P 2 ( R ) → P 2 ( R ) be defined by T ( p ( x ) ) = ( x + 1 ) p ′ ( x ) T(p(x)) = (x + 1) p'(x) T ( p ( x )) = ( x + 1 ) p ′ ( x ) . Find [ T ] B [T]_\mathcal{B} [ T ] B with respect to the standard basis B = ( 1 , x , x 2 ) \mathcal{B} = (1, x, x^2) B = ( 1 , x , x 2 ) .
Solution :
Apply T T T to each basis vector:
T ( 1 ) = ( x + 1 ) ( 0 ) = 0 = 0 ( 1 ) + 0 ( x ) + 0 ( x 2 ) ⟹ [ T ( 1 ) ] B = ( 0 0 0 ) T(1) = (x + 1)(0) = 0 = 0(1) + 0(x) + 0(x^2) \implies [T(1)]_\mathcal{B} = \begin{pmatrix} 0 \\ 0 \\ 0 \end{pmatrix} T ( 1 ) = ( x + 1 ) ( 0 ) = 0 = 0 ( 1 ) + 0 ( x ) + 0 ( x 2 ) ⟹ [ T ( 1 ) ] B = 0 0 0 .
T ( x ) = ( x + 1 ) ( 1 ) = 1 + x = 1 ( 1 ) + 1 ( x ) + 0 ( x 2 ) ⟹ [ T ( x ) ] B = ( 1 1 0 ) T(x) = (x + 1)(1) = 1 + x = 1(1) + 1(x) + 0(x^2) \implies [T(x)]_\mathcal{B} = \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix} T ( x ) = ( x + 1 ) ( 1 ) = 1 + x = 1 ( 1 ) + 1 ( x ) + 0 ( x 2 ) ⟹ [ T ( x ) ] B = 1 1 0 .
T ( x 2 ) = ( x + 1 ) ( 2 x ) = 2 x + 2 x 2 = 0 ( 1 ) + 2 ( x ) + 2 ( x 2 ) ⟹ [ T ( x 2 ) ] B = ( 0 2 2 ) T(x^2) = (x + 1)(2x) = 2x + 2x^2 = 0(1) + 2(x) + 2(x^2) \implies [T(x^2)]_\mathcal{B} = \begin{pmatrix} 0 \\ 2 \\ 2 \end{pmatrix} T ( x 2 ) = ( x + 1 ) ( 2 x ) = 2 x + 2 x 2 = 0 ( 1 ) + 2 ( x ) + 2 ( x 2 ) ⟹ [ T ( x 2 ) ] B = 0 2 2 .
Assemble columns: [ T ] B = ( 0 1 0 0 1 2 0 0 2 ) . [T]_\mathcal{B} = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 1 & 2 \\ 0 & 0 & 2 \end{pmatrix}. [ T ] B = 0 0 0 1 1 0 0 2 2 .
Notice that [ T ] B [T]_\mathcal{B} [ T ] B is upper triangular! Its eigenvalues are immediately readable from the diagonal: λ = 0 , 1 , 2 \lambda = 0, 1, 2 λ = 0 , 1 , 2 .
Problem 2: Exploiting Similarity Invariants
Let A = ( 1 4 2 3 ) A = \begin{pmatrix} 1 & 4 \\ 2 & 3 \end{pmatrix} A = ( 1 2 4 3 ) . Compute tr ( A 10 ) \operatorname{tr}(A^{10}) tr ( A 10 ) without computing A 10 A^{10} A 10 explicitly.
Solution :
Find eigenvalues of A A A :
tr ( A ) = 1 + 3 = 4 \operatorname{tr}(A) = 1 + 3 = 4 tr ( A ) = 1 + 3 = 4 .
det ( A ) = ( 1 ) ( 3 ) − ( 4 ) ( 2 ) = 3 − 8 = − 5 \det(A) = (1)(3) - (4)(2) = 3 - 8 = -5 det ( A ) = ( 1 ) ( 3 ) − ( 4 ) ( 2 ) = 3 − 8 = − 5 .
Characteristic equation: λ 2 − 4 λ − 5 = 0 ⟹ ( λ − 5 ) ( λ + 1 ) = 0 \lambda^2 - 4\lambda - 5 = 0 \implies (\lambda - 5)(\lambda + 1) = 0 λ 2 − 4 λ − 5 = 0 ⟹ ( λ − 5 ) ( λ + 1 ) = 0 .
Eigenvalues are λ 1 = 5 \lambda_1 = 5 λ 1 = 5 and λ 2 = − 1 \lambda_2 = -1 λ 2 = − 1 .
Since A A A has distinct eigenvalues, A A A is diagonalizable: A = P D P − 1 A = P D P^{-1} A = P D P − 1 with D = ( 5 0 0 − 1 ) D = \begin{pmatrix} 5 & 0 \\ 0 & -1 \end{pmatrix} D = ( 5 0 0 − 1 ) .
Then A 10 = P D 10 P − 1 A^{10} = P D^{10} P^{-1} A 10 = P D 10 P − 1 , which is similar to D 10 D^{10} D 10 .
By similarity invariance of trace: tr ( A 10 ) = tr ( D 10 ) = 5 10 + ( − 1 ) 10 = 5 10 + 1. \operatorname{tr}(A^{10}) = \operatorname{tr}(D^{10}) = 5^{10} + (-1)^{10} = 5^{10} + 1. tr ( A 10 ) = tr ( D 10 ) = 5 10 + ( − 1 ) 10 = 5 10 + 1.
GRE Exam Traps & Pitfalls
Trap 1: The Necessary vs. Sufficient Condition of Similarity Having identical trace, determinant, and characteristic polynomial is necessary for similarity, but not sufficient . For example, A = ( 3 0 0 3 ) A = \begin{pmatrix} 3 & 0 \\ 0 & 3 \end{pmatrix} A = ( 3 0 0 3 ) and B = ( 3 1 0 3 ) B = \begin{pmatrix} 3 & 1 \\ 0 & 3 \end{pmatrix} B = ( 3 0 1 3 ) have identical eigenvalues (3, 3), trace (6), determinant (9), and characteristic polynomial ( λ − 3 ) 2 (\lambda - 3)^2 ( λ − 3 ) 2 , yet they are NOT similar because A A A is scalar and only similar to itself.
Trap 2: Inverting Basis Transition Direction In the change-of-basis formula [ T ] C = P − 1 [ T ] B P [T]_\mathcal{C} = P^{-1} [T]_\mathcal{B} P [ T ] C = P − 1 [ T ] B P , P P P must be the transition matrix from C \mathcal{C} C to B \mathcal{B} B ( P = P B ← C P = P_{\mathcal{B} \leftarrow \mathcal{C}} P = P B ← C ). Inverting the placement of P P P and P − 1 P^{-1} P − 1 yields the matrix with respect to a different basis.
Trap 3: Mixing Input and Output Bases When computing [ T ] C , B [T]_{\mathcal{C}, \mathcal{B}} [ T ] C , B , remember that inputs come from basis B \mathcal{B} B while output coordinates must be decomposed along target basis C \mathcal{C} C .