Study guide

9.3 Eigenvalues, Eigenvectors, and Diagonalization

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

9.3 Eigenvalues, Eigenvectors, and Diagonalization

Key Takeaways Explain This Topic AI

Eigenvalues satisfy the characteristic equation det(A - lambda I) = 0, with sum equal to tr(A) and product equal to det(A).

The geometric multiplicity of an eigenvalue satisfies 1 <= m_geo(lambda) <= m_alg(lambda); defectiveness (m_geo < m_alg) is the sole barrier to matrix diagonalizability.

An n x n matrix A is diagonalizable over a field F if and only if its characteristic polynomial splits over F and m_geo(lambda) = m_alg(lambda) for each distinct eigenvalue, or equivalently, its minimal polynomial factors into distinct linear factors.

The Cayley-Hamilton Theorem asserts that every square matrix satisfies its own characteristic polynomial, p_A(A) = 0, facilitating efficient computation of matrix powers, inverses, and matrix polynomials.

Last updated: September 2026

9.3 Eigenvalues, Eigenvectors, and Diagonalization

Spectral theory investigates how linear operators act invariantly on specific one-dimensional subspaces. On the GRE Mathematics Subject Test, questions test eigenvalue calculations via trace and determinant tricks, algebraic versus geometric multiplicity inequalities, diagonalizability criteria, matrix powers, and the Cayley-Hamilton Theorem.

Eigenvalue Equation and the Characteristic Polynomial

Let A ∈ M n × n ( F ) A \in M_{n \times n}(\mathbb{F}) A ∈ M n × n ​ ( F ) where F \mathbb{F} F is R \mathbb{R} R or C \mathbb{C} C . A scalar λ ∈ F \lambda \in \mathbb{F} λ ∈ F is an eigenvalue of A A A if there exists a non-zero vector v ∈ F n \mathbf{v} \in \mathbb{F}^n v ∈ F n such that: A v = λ v ⟺ ( A − λ I n ) v = 0. A\mathbf{v} = \lambda \mathbf{v} \iff (A - \lambda I_n)\mathbf{v} = \mathbf{0}. A v = λ v ⟺ ( A − λ I n ​ ) v = 0 .

Because non-zero solutions exist if and only if the operator ( A − λ I n ) (A - \lambda I_n) ( A − λ I n ​ ) has a non-trivial null space, eigenvalues are precisely the roots of the characteristic equation : p A ( λ ) = det ⁡ ( λ I n − A ) = 0. p_A(\lambda) = \det(\lambda I_n - A) = 0. p A ​ ( λ ) = det ( λ I n ​ − A ) = 0.

Characteristic Polynomial Expansion

The characteristic polynomial of an n × n n \times n n × n matrix is a monic polynomial of degree n n n : p A ( λ ) = λ n − tr ⁡ ( A ) λ n − 1 + ⋯ + ( − 1 ) n det ⁡ ( A ) . p_A(\lambda) = \lambda^n - \operatorname{tr}(A) \lambda^{n-1} + \dots + (-1)^n \det(A). p A ​ ( λ ) = λ n − tr ( A ) λ n − 1 + ⋯ + ( − 1 ) n det ( A ) .

From Vieta's formulas, the roots λ 1 , … , λ n \lambda_1, \dots, \lambda_n λ 1 ​ , … , λ n ​ (counted with multiplicity) satisfy:

Trace Formula : tr ⁡ ( A ) = ∑ i = 1 n a i i = ∑ i = 1 n λ i \operatorname{tr}(A) = \sum_{i=1}^n a_{ii} = \sum_{i=1}^n \lambda_i tr ( A ) = ∑ i = 1 n ​ a ii ​ = ∑ i = 1 n ​ λ i ​ .

Determinant Formula : det ⁡ ( A ) = ∏ i = 1 n λ i \det(A) = \prod_{i=1}^n \lambda_i det ( A ) = ∏ i = 1 n ​ λ i ​ .

These two scalar identities allow candidates to find unknown eigenvalues without expanding determinants.

Eigenspaces, Algebraic Multiplicity, and Geometric Multiplicity

For each eigenvalue λ \lambda λ :

The eigenspace E λ = null ⁡ ( A − λ I n ) E_\lambda = \operatorname{null}(A - \lambda I_n) E λ ​ = null ( A − λ I n ​ ) is the subspace of all eigenvectors corresponding to λ \lambda λ , together with the zero vector.

The algebraic multiplicity , m alg ( λ ) m_{\text{alg}}(\lambda) m alg ​ ( λ ) , is the multiplicity of λ \lambda λ as a root of p A ( λ ) p_A(\lambda) p A ​ ( λ ) .

The geometric multiplicity , m geo ( λ ) m_{\text{geo}}(\lambda) m geo ​ ( λ ) , is the dimension of the eigenspace: m geo ( λ ) = dim ⁡ ( E λ ) = n − rank ⁡ ( A − λ I n ) . m_{\text{geo}}(\lambda) = \operatorname{dim}(E_\lambda) = n - \operatorname{rank}(A - \lambda I_n). m geo ​ ( λ ) = dim ( E λ ​ ) = n − rank ( A − λ I n ​ ) .

The Fundamental Multiplicity Inequality

For every eigenvalue λ \lambda λ of any square matrix A A A : 1 ≤ m geo ( λ ) ≤ m alg ( λ ) . 1 \le m_{\text{geo}}(\lambda) \le m_{\text{alg}}(\lambda). 1 ≤ m geo ​ ( λ ) ≤ m alg ​ ( λ ) .

An eigenvalue is termed defective if m geo ( λ ) < m alg ( λ ) m_{\text{geo}}(\lambda) < m_{\text{alg}}(\lambda) m geo ​ ( λ ) < m alg ​ ( λ ) .

Linear Independence of Eigenvectors

Eigenvectors corresponding to mutually distinct eigenvalues are linearly independent . If A A A has n n n distinct eigenvalues, the corresponding eigenvectors form a complete basis for F n \mathbb{F}^n F n .

Criterion for Matrix Diagonalizability

A matrix A ∈ M n × n ( F ) A \in M_{n \times n}(\mathbb{F}) A ∈ M n × n ​ ( F ) is diagonalizable over F \mathbb{F} F if there exists an invertible matrix P P P and a diagonal matrix D D D such that: A = P D P − 1 . A = P D P^{-1}. A = P D P − 1 .

The columns of P = [ v 1 … v n ] P = [\mathbf{v}_1 \dots \mathbf{v}_n] P = [ v 1 ​ … v n ​ ] are linearly independent eigenvectors of A A A , and the diagonal entries of D = diag ⁡ ( λ 1 , … , λ n ) D = \operatorname{diag}(\lambda_1, \dots, \lambda_n) D = diag ( λ 1 ​ , … , λ n ​ ) are the corresponding eigenvalues.

Necessary and Sufficient Conditions for Diagonalizability

A matrix A A A is diagonalizable over F \mathbb{F} F if and only if:

The characteristic polynomial p A ( λ ) p_A(\lambda) p A ​ ( λ ) splits completely into linear factors over F \mathbb{F} F .

For every distinct eigenvalue λ i \lambda_i λ i ​ , the geometric multiplicity equals the algebraic multiplicity: m geo ( λ i ) = m alg ( λ i ) . m_{\text{geo}}(\lambda_i) = m_{\text{alg}}(\lambda_i). m geo ​ ( λ i ​ ) = m alg ​ ( λ i ​ ) .

Equivalently, the sum of geometric multiplicities equals the matrix dimension: ∑ m geo ( λ i ) = n \sum m_{\text{geo}}(\lambda_i) = n ∑ m geo ​ ( λ i ​ ) = n .

Case Condition Diagonalizable? Diagnostic Summary

Distinct Roots n n n distinct roots in F \mathbb{F} F Always Automatic since 1 ≤ m geo ≤ m alg = 1 1 \le m_{\text{geo}} \le m_{\text{alg}} = 1 1 ≤ m geo ​ ≤ m alg ​ = 1

Full Eigenspaces m geo ( λ ) = m alg ( λ ) m_{\text{geo}}(\lambda) = m_{\text{alg}}(\lambda) m geo ​ ( λ ) = m alg ​ ( λ ) for all λ \lambda λ Always Eigenbasis spans the full space F n \mathbb{F}^n F n

Defective Roots m geo ( λ ) < m alg ( λ ) m_{\text{geo}}(\lambda) < m_{\text{alg}}(\lambda) m geo ​ ( λ ) < m alg ​ ( λ ) for some λ \lambda λ Never Lacks sufficient eigenvectors; requires Jordan form

Unsplit Polynomial p A ( λ ) p_A(\lambda) p A ​ ( λ ) has roots outside F \mathbb{F} F Not over F \mathbb{F} F Diagonalizable only over algebraic extension (e.g. C \mathbb{C} C )

Matrix Powers and Matrix Exponentials

Diagonalization drastically simplifies computing matrix powers and functions: A k = ( P D P − 1 ) k = P D k P − 1 = P ( λ 1 k 0 ⋱ 0 λ n k ) P − 1 . A^k = (P D P^{-1})^k = P D^k P^{-1} = P \begin{pmatrix} \lambda_1^k & & 0 \\ & \ddots & \\ 0 & & \lambda_n^k \end{pmatrix} P^{-1}. A k = ( P D P − 1 ) k = P D k P − 1 = P ​ λ 1 k ​ 0 ​ ⋱ ​ 0 λ n k ​ ​ ​ P − 1 .

Similarly, the matrix exponential e A t e^{At} e A t is given by: ≠ A t = P e D t P − 1 = P diag ⁡ ( e λ 1 t , … , e λ n t ) P − 1 . \ne^{At} = P e^{Dt} P^{-1} = P \operatorname{diag}(e^{\lambda_1 t}, \dots, e^{\lambda_n t}) P^{-1}.  = A t = P e D t P − 1 = P diag ( e λ 1 ​ t , … , e λ n ​ t ) P − 1 .

  • The Cayley-Hamilton Theorem and Minimal Polynomials
  • The Cayley-Hamilton Theorem

Every square matrix satisfies its own characteristic equation: p A ( A ) = O n . p_A(A) = O_n. p A ​ ( A ) = O n ​ .

If p A ( λ ) = λ n + c n − 1 λ n − 1 + ⋯ + c 1 λ + c 0 p_A(\lambda) = \lambda^n + c_{n-1}\lambda^{n-1} + \dots + c_1 \lambda + c_0 p A ​ ( λ ) = λ n + c n − 1 ​ λ n − 1 + ⋯ + c 1 ​ λ + c 0 ​ , then: A n + c n − 1 A n − 1 + ⋯ + c 1 A + c 0 I n = O n . A^n + c_{n-1} A^{n-1} + \dots + c_1 A + c_0 I_n = O_n. A n + c n − 1 ​ A n − 1 + ⋯ + c 1 ​ A + c 0 ​ I n ​ = O n ​ .

Application to Matrix Inverses and Powers

When det ⁡ ( A ) = ( − 1 ) n c 0 ≠ 0 \det(A) = (-1)^n c_0 \neq 0 det ( A ) = ( − 1 ) n c 0 ​  = 0 , multiplying by A − 1 A^{-1} A − 1 yields: A − 1 = − 1 c 0 ( A n − 1 + c n − 1 A n − 2 + ⋯ + c 1 I n ) . A^{-1} = -\frac{1}{c_0} (A^{n-1} + c_{n-1}A^{n-2} + \dots + c_1 I_n). A − 1 = − c 0 ​ 1 ​ ( A n − 1 + c n − 1 ​ A n − 2 + ⋯ + c 1 ​ I n ​ ) .

Furthermore, any high power A m A^m A m ( m ≥ n m \ge n m ≥ n ) can be reduced to a polynomial in A A A of degree at most n − 1 n - 1 n − 1 by polynomial long division: x m = q ( x ) p A ( x ) + r ( x ) ⟹ A m = r ( A ) x^m = q(x) p_A(x) + r(x) \implies A^m = r(A) x m = q ( x ) p A ​ ( x ) + r ( x ) ⟹ A m = r ( A ) .

The Minimal Polynomial

The minimal polynomial m A ( λ ) m_A(\lambda) m A ​ ( λ ) is the unique monic polynomial of lowest degree annihilating A A A ( m A ( A ) = O n m_A(A) = O_n m A ​ ( A ) = O n ​ ).

m A ( λ ) m_A(\lambda) m A ​ ( λ ) divides p A ( λ ) p_A(\lambda) p A ​ ( λ ) .

m A ( λ ) m_A(\lambda) m A ​ ( λ ) and p A ( λ ) p_A(\lambda) p A ​ ( λ ) have identical roots (ignoring multiplicities).

Diagonalizability Criterion : A A A is diagonalizable over F \mathbb{F} F if and only if m A ( λ ) m_A(\lambda) m A ​ ( λ ) factors into distinct linear factors over F \mathbb{F} F (contains no repeated roots).

  • Step-by-Step Worked Problems
  • Problem 1: Matrix Powers via Diagonalization

Compute A 8 A^8 A 8 for A = ( 1 4 2 3 ) A = \begin{pmatrix} 1 & 4 \\ 2 & 3 \end{pmatrix} A = ( 1 2 ​ 4 3 ​ ) .

Solution :

Find eigenvalues of A A A : tr ⁡ ( A ) = 1 + 3 = 4 , det ⁡ ( A ) = 1 ( 3 ) − 4 ( 2 ) = 3 − 8 = − 5. \operatorname{tr}(A) = 1 + 3 = 4, \quad \det(A) = 1(3) - 4(2) = 3 - 8 = -5. tr ( A ) = 1 + 3 = 4 , det ( A ) = 1 ( 3 ) − 4 ( 2 ) = 3 − 8 = − 5. Roots of λ 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 . Thus λ 1 = 5 , λ 2 = − 1 \lambda_1 = 5, \lambda_2 = -1 λ 1 ​ = 5 , λ 2 ​ = − 1 .

Find eigenvectors:

For λ 1 = 5 \lambda_1 = 5 λ 1 ​ = 5 : A − 5 I = ( − 4 4 2 − 2 ) ⟹ − x 1 + x 2 = 0 ⟹ v 1 = ( 1 1 ) A - 5I = \begin{pmatrix} -4 & 4 \\ 2 & -2 \end{pmatrix} \implies -x_1 + x_2 = 0 \implies \mathbf{v}_1 = \begin{pmatrix} 1 \\ 1 \end{pmatrix} A − 5 I = ( − 4 2 ​ 4 − 2 ​ ) ⟹ − x 1 ​ + x 2 ​ = 0 ⟹ v 1 ​ = ( 1 1 ​ ) .

For λ 2 = − 1 \lambda_2 = -1 λ 2 ​ = − 1 : A − ( − 1 ) I = ( 2 4 2 4 ) ⟹ x 1 + 2 x 2 = 0 ⟹ v 2 = ( − 2 1 ) A - (-1)I = \begin{pmatrix} 2 & 4 \\ 2 & 4 \end{pmatrix} \implies x_1 + 2x_2 = 0 \implies \mathbf{v}_2 = \begin{pmatrix} -2 \\ 1 \end{pmatrix} A − ( − 1 ) I = ( 2 2 ​ 4 4 ​ ) ⟹ x 1 ​ + 2 x 2 ​ = 0 ⟹ v 2 ​ = ( − 2 1 ​ ) .

Construct P P P and P − 1 P^{-1} P − 1 : P = ( 1 − 2 1 1 ) , det ⁡ ( P ) = 1 ( 1 ) − ( − 2 ) ( 1 ) = 3 ⟹ P − 1 = 1 3 ( 1 2 − 1 1 ) . P = \begin{pmatrix} 1 & -2 \\ 1 & 1 \end{pmatrix}, \quad \det(P) = 1(1) - (-2)(1) = 3 \implies P^{-1} = \frac{1}{3} \begin{pmatrix} 1 & 2 \\ -1 & 1 \end{pmatrix}. P = ( 1 1 ​ − 2 1 ​ ) , det ( P ) = 1 ( 1 ) − ( − 2 ) ( 1 ) = 3 ⟹ P − 1 = 3 1 ​ ( 1 − 1 ​ 2 1 ​ ) .

Compute A 8 = P D 8 P − 1 A^8 = P D^8 P^{-1} A 8 = P D 8 P − 1 with D 8 = diag ⁡ ( 5 8 , ( − 1 ) 8 ) = diag ⁡ ( 5 8 , 1 ) D^8 = \operatorname{diag}(5^8, (-1)^8) = \operatorname{diag}(5^8, 1) D 8 = diag ( 5 8 , ( − 1 ) 8 ) = diag ( 5 8 , 1 ) : A 8 = ( 1 − 2 1 1 ) ( 5 8 0 0 1 ) 1 3 ( 1 2 − 1 1 ) = 1 3 ( 5 8 + 2 2 ⋅ 5 8 − 2 5 8 − 1 2 ⋅ 5 8 + 1 ) . A^8 = \begin{pmatrix} 1 & -2 \\ 1 & 1 \end{pmatrix} \begin{pmatrix} 5^8 & 0 \\ 0 & 1 \end{pmatrix} \frac{1}{3} \begin{pmatrix} 1 & 2 \\ -1 & 1 \end{pmatrix} = \frac{1}{3} \begin{pmatrix} 5^8 + 2 & 2 \cdot 5^8 - 2 \\ 5^8 - 1 & 2 \cdot 5^8 + 1 \end{pmatrix}. A 8 = ( 1 1 ​ − 2 1 ​ ) ( 5 8 0 ​ 0 1 ​ ) 3 1 ​ ( 1 − 1 ​ 2 1 ​ ) = 3 1 ​ ( 5 8 + 2 5 8 − 1 ​ 2 ⋅ 5 8 − 2 2 ⋅ 5 8 + 1 ​ ) .

Problem 2: Minimal Polynomial and Matrix Exponents via Cayley-Hamilton

Let A A A be a 2 × 2 2 \times 2 2 × 2 matrix satisfying tr ⁡ ( A ) = 3 \operatorname{tr}(A) = 3 tr ( A ) = 3 and det ⁡ ( A ) = 2 \det(A) = 2 det ( A ) = 2 . Express A 4 A^4 A 4 in the form c 1 A + c 0 I c_1 A + c_0 I c 1 ​ A + c 0 ​ I .

Solution :

The characteristic polynomial is p A ( λ ) = λ 2 − 3 λ + 2 = ( λ − 1 ) ( λ − 2 ) p_A(\lambda) = \lambda^2 - 3\lambda + 2 = (\lambda - 1)(\lambda - 2) p A ​ ( λ ) = λ 2 − 3 λ + 2 = ( λ − 1 ) ( λ − 2 ) .

By the Cayley-Hamilton Theorem, A 2 − 3 A + 2 I = 0 A^2 - 3A + 2I = 0 A 2 − 3 A + 2 I = 0 , so A 2 = 3 A − 2 I A^2 = 3A - 2I A 2 = 3 A − 2 I .

Divide λ 4 \lambda^4 λ 4 by ( λ − 1 ) ( λ − 2 ) (\lambda - 1)(\lambda - 2) ( λ − 1 ) ( λ − 2 ) : λ 4 = q ( λ ) ( λ 2 − 3 λ + 2 ) + ( c 1 λ + c 0 ) . \lambda^4 = q(\lambda)(\lambda^2 - 3\lambda + 2) + (c_1 \lambda + c_0). λ 4 = q ( λ ) ( λ 2 − 3 λ + 2 ) + ( c 1 ​ λ + c 0 ​ ) .

Evaluate at the roots λ = 1 \lambda = 1 λ = 1 and λ = 2 \lambda = 2 λ = 2 :

λ = 1 ⟹ 1 4 = c 1 ( 1 ) + c 0 ⟹ c 1 + c 0 = 1 \lambda = 1 \implies 1^4 = c_1(1) + c_0 \implies c_1 + c_0 = 1 λ = 1 ⟹ 1 4 = c 1 ​ ( 1 ) + c 0 ​ ⟹ c 1 ​ + c 0 ​ = 1 .

λ = 2 ⟹ 2 4 = c 1 ( 2 ) + c 0 ⟹ 2 c 1 + c 0 = 16 \lambda = 2 \implies 2^4 = c_1(2) + c_0 \implies 2c_1 + c_0 = 16 λ = 2 ⟹ 2 4 = c 1 ​ ( 2 ) + c 0 ​ ⟹ 2 c 1 ​ + c 0 ​ = 16 .

Subtract the equations: c 1 = 15 c_1 = 15 c 1 ​ = 15 , and c 0 = 1 − 15 = − 14 c_0 = 1 - 15 = -14 c 0 ​ = 1 − 15 = − 14 .

Therefore, A 4 = 15 A − 14 I A^4 = 15A - 14I A 4 = 15 A − 14 I .

GRE Exam Traps & Pitfalls

Trap 1: Confusing Multiplicity Types An algebraic multiplicity m alg ( λ ) > 1 m_{\text{alg}}(\lambda) > 1 m alg ​ ( λ ) > 1 does not prevent diagonalizability! The identity matrix I n I_n I n ​ has λ = 1 \lambda = 1 λ = 1 with m alg = n m_{\text{alg}} = n m alg ​ = n , yet it is already diagonal because m geo ( 1 ) = n m_{\text{geo}}(1) = n m geo ​ ( 1 ) = n .

Trap 2: Ignoring the Underlying Field The rotation matrix R π / 2 = ( 0 − 1 1 0 ) R_{\pi/2} = \begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix} R π /2 ​ = ( 0 1 ​ − 1 0 ​ ) has eigenvalues ± i \pm i ± i . It is diagonalizable over C \mathbb{C} C , but non-diagonalizable over R \mathbb{R} R because its characteristic polynomial λ 2 + 1 \lambda^2 + 1 λ 2 + 1 does not split over R \mathbb{R} R .

Trap 3: Sign Errors in Cayley-Hamilton for 3x3 Matrices For 3 × 3 3 \times 3 3 × 3 matrices, the characteristic polynomial is λ 3 − tr ⁡ ( A ) λ 2 + c 1 λ − det ⁡ ( A ) = 0 \lambda^3 - \operatorname{tr}(A)\lambda^2 + c_1 \lambda - \det(A) = 0 λ 3 − tr ( A ) λ 2 + c 1 ​ λ − det ( A ) = 0 . Forgetting the negative sign on det ⁡ ( A ) \det(A) det ( A ) disrupts polynomial division and inverse calculations.

Loading diagram... Decision Tree for Matrix Diagonalizability