Study guide

9.2 Determinants, Matrix Inverses, and Cramer's Rule

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.2 Determinants, Matrix Inverses, and Cramer's Rule

Key Takeaways Explain This Topic AI

The determinant is the unique alternating, multilinear n-form D: (R^n)^n -> R normalized by det(I) = 1, governing algebraic invertibility and orientable volume scaling.

Key algebraic multiplicative identities include det(AB) = det(A)det(B), det(A^T) = det(A), det(A^{-1}) = 1/det(A), and det(cA) = c^n det(A) for an n x n matrix.

The adjugate matrix satisfies A adj(A) = adj(A) A = (det A) I_n, providing the closed-form inverse A^{-1} = (1/det A) adj(A).

Cramer's Rule resolves regular linear systems Ax = b component-wise via x_i = det(A_i)/det(A), where A_i replaces the i-th column of A with b.

Last updated: September 2026

9.2 Determinants, Matrix Inverses, and Cramer's Rule

The determinant is an indispensable scalar invariant associated with square matrices. On the GRE Mathematics Subject Test, questions frequently test axiomatic determinant properties, efficient computation via row operations or block decompositions, the classical adjugate inverse formula, and Cramer's Rule for isolated variables.

Axiomatic Characterization and the Leibniz Formula

For a matrix A ∈ M n × n ( R ) A \in M_{n \times n}(\mathbb{R}) A ∈ M n × n ​ ( R ) , the determinant is the unique function det ⁡ : M n × n ( R ) → R \det: M_{n \times n}(\mathbb{R}) \to \mathbb{R} det : M n × n ​ ( R ) → R satisfying three foundational axioms on its rows r 1 , … , r n \mathbf{r}_1, \dots, \mathbf{r}_n r 1 ​ , … , r n ​ :

Multilinearity : det ⁡ \det det is linear in each row vector when all other rows remain fixed: det ⁡ ( r 1 ⋮ c u + d v ⋮ r n ) = c det ⁡ ( r 1 ⋮ u ⋮ r n ) + d det ⁡ ( r 1 ⋮ v ⋮ r n ) . \det \begin{pmatrix} \mathbf{r}_1 \\ \vdots \\ c\mathbf{u} + d\mathbf{v} \\ \vdots \\ \mathbf{r}_n \end{pmatrix} = c \det \begin{pmatrix} \mathbf{r}_1 \\ \vdots \\ \mathbf{u} \\ \vdots \\ \mathbf{r}_n \end{pmatrix} + d \det \begin{pmatrix} \mathbf{r}_1 \\ \vdots \\ \mathbf{v} \\ \vdots \\ \mathbf{r}_n \end{pmatrix}. det ​ r 1 ​ ⋮ c u + d v ⋮ r n ​ ​ ​ = c det ​ r 1 ​ ⋮ u ⋮ r n ​ ​ ​ + d det ​ r 1 ​ ⋮ v ⋮ r n ​ ​ ​ .

Alternating Property : If two rows of A A A are interchanged, the determinant reverses sign. Consequently, if A A A contains two identical rows, det ⁡ ( A ) = 0 \det(A) = 0 det ( A ) = 0 .

Normalization : det ⁡ ( I n ) = 1 \det(I_n) = 1 det ( I n ​ ) = 1 .

These axioms uniquely imply the Leibniz expansion formula over the symmetric group S n S_n S n ​ : det ⁡ ( A ) = ∑ σ ∈ S n sgn ⁡ ( σ ) ∏ i = 1 n a i , σ ( i ) , \det(A) = \sum_{\sigma \in S_n} \operatorname{sgn}(\sigma) \prod_{i=1}^n a_{i, \sigma(i)}, det ( A ) = σ ∈ S n ​ ∑ ​ sgn ( σ ) i = 1 ∏ n ​ a i , σ ( i ) ​ ,

where sgn ⁡ ( σ ) ∈ { + 1 , − 1 } \operatorname{sgn}(\sigma) \in \{+1, -1\} sgn ( σ ) ∈ { + 1 , − 1 } denotes the parity (signature) of the permutation σ \sigma σ .

Essential Operational and Multiplicative Properties

Rigorous application of the following multiplicative identities resolves many theoretical GRE problems instantaneously:

Multiplicativity : det ⁡ ( A B ) = det ⁡ ( A ) det ⁡ ( B ) \det(AB) = \det(A)\det(B) det ( A B ) = det ( A ) det ( B ) . By induction, det ⁡ ( A k ) = ( det ⁡ A ) k \det(A^k) = (\det A)^k det ( A k ) = ( det A ) k .

Transpose Invariance : det ⁡ ( A T ) = det ⁡ ( A ) \det(A^T) = \det(A) det ( A T ) = det ( A ) . All properties holding for rows apply identically to columns.

Homogeneity of Degree n n n : For any scalar c ∈ R c \in \mathbb{R} c ∈ R and n × n n \times n n × n matrix A A A : det ⁡ ( c A ) = c n det ⁡ ( A ) . \det(cA) = c^n \det(A). det ( c A ) = c n det ( A ) .

Invertibility Criterion : A matrix A A A is invertible if and only if det ⁡ ( A ) ≠ 0 \det(A) \neq 0 det ( A )  = 0 . When invertible: det ⁡ ( A − 1 ) = 1 det ⁡ ( A ) . \det(A^{-1}) = \frac{1}{\det(A)}. det ( A − 1 ) = det ( A ) 1 ​ .

Block Triangular Matrices : If A A A is k × k k \times k k × k and C C C is ( n − k ) × ( n − k ) (n-k) \times (n-k) ( n − k ) × ( n − k ) : det ⁡ ( A B 0 C ) = det ⁡ ( A ) det ⁡ ( C ) . \det \begin{pmatrix} A & B \\ 0 & C \end{pmatrix} = \det(A) \det(C). det ( A 0 ​ B C ​ ) = det ( A ) det ( C ) .

Schur Complement : If A A A is invertible, the block matrix determinant expands as: det ⁡ ( A B C D ) = det ⁡ ( A ) det ⁡ ( D − C A − 1 B ) . \det \begin{pmatrix} A & B \\ C & D \end{pmatrix} = \det(A) \det(D - C A^{-1} B). det ( A C ​ B D ​ ) = det ( A ) det ( D − C A − 1 B ) .

Determinants via Elementary Row Operations

Computing determinants by definition is computationally prohibitive for n ≥ 4 n \ge 4 n ≥ 4 . Gaussian row reduction simplifies A A A to an upper triangular matrix U U U :

Row Swap ( R i ↔ R j R_i \leftrightarrow R_j R i ​ ↔ R j ​ ) : Multiplies the determinant by − 1 -1 − 1 .

Row Scaling ( c R i → R i c R_i \to R_i c R i ​ → R i ​ ) : Multiplies the determinant by c c c .

Row Addition ( R i + c R j → R i R_i + c R_j \to R_i R i ​ + c R j ​ → R i ​ ) : Leaves the determinant invariant .

Once in triangular form, the determinant is the product of diagonal entries: det ⁡ ( U ) = ∏ i = 1 n u i i \det(U) = \prod_{i=1}^n u_{ii} det ( U ) = ∏ i = 1 n ​ u ii ​ .

  • Row Operation Algebraic Multiplier on det ⁡ \det det Geometric Impact
  • R i ↔ R j R_i \leftrightarrow R_j R i ​ ↔ R j ​ − 1 -1 − 1 Reverses hyper-volume orientation
  • c R i → R i c R_i \to R_i c R i ​ → R i ​ c c c Scales dimension i i i by factor c c c

R i + k R j → R i R_i + k R_j \to R_i R i ​ + k R j ​ → R i ​ 1 1 1 (Invariant) Shearing deformation preserving volume

Cofactor Expansion and the Classical Adjugate

Let M i j M_{ij} M ij ​ denote the ( n − 1 ) × ( n − 1 ) (n-1) \times (n-1) ( n − 1 ) × ( n − 1 ) submatrix obtained by deleting row i i i and column j j j of A A A . The ( i , j ) (i, j) ( i , j ) -cofactor is: C i j = ( − 1 ) i + j det ⁡ ( M i j ) . C_{ij} = (-1)^{i+j} \det(M_{ij}). C ij ​ = ( − 1 ) i + j det ( M ij ​ ) .

Laplace expansion evaluates det ⁡ ( A ) \det(A) det ( A ) along any arbitrary row i i i or column j j j : det ⁡ ( A ) = ∑ k = 1 n a i k C i k = ∑ k = 1 n a k j C k j . \det(A) = \sum_{k=1}^n a_{ik} C_{ik} = \sum_{k=1}^n a_{kj} C_{kj}. det ( A ) = k = 1 ∑ n ​ a ik ​ C ik ​ = k = 1 ∑ n ​ a kj ​ C kj ​ .

The Adjugate Matrix Formula

The adjugate (or classical adjoint), denoted adj ⁡ ( A ) \operatorname{adj}(A) adj ( A ) , is the transpose of the cofactor matrix: ( adj ⁡ ( A ) ) i j = C j i . (\operatorname{adj}(A))_{ij} = C_{ji}. ( adj ( A ) ) ij ​ = C ji ​ .

The fundamental adjugate identity states: A adj ⁡ ( A ) = adj ⁡ ( A ) A = ( det ⁡ A ) I n . A \operatorname{adj}(A) = \operatorname{adj}(A) A = (\det A) I_n. A adj ( A ) = adj ( A ) A = ( det A ) I n ​ .

When det ⁡ ( A ) ≠ 0 \det(A) \neq 0 det ( A )  = 0 , this yields the explicit matrix inverse formula: A − 1 = 1 det ⁡ ( A ) adj ⁡ ( A ) . A^{-1} = \frac{1}{\det(A)} \operatorname{adj}(A). A − 1 = det ( A ) 1 ​ adj ( A ) .

Properties of the Adjugate

det ⁡ ( adj ⁡ ( A ) ) = ( det ⁡ A ) n − 1 \det(\operatorname{adj}(A)) = (\det A)^{n-1} det ( adj ( A )) = ( det A ) n − 1 .

For n ≥ 3 n \ge 3 n ≥ 3 , adj ⁡ ( adj ⁡ ( A ) ) = ( det ⁡ A ) n − 2 A \operatorname{adj}(\operatorname{adj}(A)) = (\det A)^{n-2} A adj ( adj ( A )) = ( det A ) n − 2 A .

  • Cramer's Rule and Geometric Interpretation
  • Cramer's Rule

For a system A x = b A\mathbf{x} = \mathbf{b} A x = b with A ∈ M n × n ( R ) A \in M_{n \times n}(\mathbb{R}) A ∈ M n × n ​ ( R ) and det ⁡ ( A ) ≠ 0 \det(A) \neq 0 det ( A )  = 0 , the unique solution components are: x i = det ⁡ ( A i ) det ⁡ ( A ) , x_i = \frac{\det(A_i)}{\det(A)}, x i ​ = det ( A ) det ( A i ​ ) ​ ,

where A i A_i A i ​ is the matrix formed by replacing the i i i -th column of A A A with b \mathbf{b} b . Cramer's Rule is especially powerful on the GRE when asked for only a single unknown, avoiding a full matrix inversion.

Geometric Interpretation: Hyper-Volume Scaling

The absolute value ∣ det ⁡ ( A ) ∣ |\det(A)| ∣ det ( A ) ∣ represents the n n n -dimensional volume of the parallelotope formed by the columns of A A A . Under the linear transformation T ( x ) = A x T(\mathbf{x}) = A\mathbf{x} T ( x ) = A x , the volume of any measurable set S ⊂ R n S \subset \mathbb{R}^n S ⊂ R n scales as Vol ⁡ ( T ( S ) ) = ∣ det ⁡ ( A ) ∣ Vol ⁡ ( S ) \operatorname{Vol}(T(S)) = |\det(A)| \operatorname{Vol}(S) Vol ( T ( S )) = ∣ det ( A ) ∣ Vol ( S ) . The sign of det ⁡ ( A ) \det(A) det ( A ) specifies whether the transformation preserves ( + 1 +1 + 1 ) or reverses ( − 1 -1 − 1 ) spatial orientation.

  • Step-by-Step Worked Problems
  • Problem 1: Determinant with Adjugate and Scaled Inverses

Let A A A be a 3 × 3 3 \times 3 3 × 3 real matrix with det ⁡ ( A ) = 4 \det(A) = 4 det ( A ) = 4 . Compute det ⁡ ( 2 A − 1 adj ⁡ ( A T ) ) \det(2 A^{-1} \operatorname{adj}(A^T)) det ( 2 A − 1 adj ( A T )) .

Solution :

Apply homogeneity of degree n = 3 n = 3 n = 3 to pull the scalar 2 2 2 outside: det ⁡ ( 2 M ) = 2 3 det ⁡ ( M ) = 8 det ⁡ ( M ) . \det(2 M) = 2^3 \det(M) = 8 \det(M). det ( 2 M ) = 2 3 det ( M ) = 8 det ( M ) .

Use the multiplicative property of the determinant: det ⁡ ( A − 1 adj ⁡ ( A T ) ) = det ⁡ ( A − 1 ) det ⁡ ( adj ⁡ ( A T ) ) . \det(A^{-1} \operatorname{adj}(A^T)) = \det(A^{-1}) \det(\operatorname{adj}(A^T)). det ( A − 1 adj ( A T )) = det ( A − 1 ) det ( adj ( A T )) .

Evaluate individual factors: det ⁡ ( A − 1 ) = 1 det ⁡ ( A ) = 1 4 . \det(A^{-1}) = \frac{1}{\det(A)} = \frac{1}{4}. det ( A − 1 ) = det ( A ) 1 ​ = 4 1 ​ . det ⁡ ( adj ⁡ ( A T ) ) = ( det ⁡ ( A T ) ) n − 1 = ( det ⁡ A ) 3 − 1 = 4 2 = 16. \det(\operatorname{adj}(A^T)) = (\det(A^T))^{n-1} = (\det A)^{3-1} = 4^2 = 16. det ( adj ( A T )) = ( det ( A T ) ) n − 1 = ( det A ) 3 − 1 = 4 2 = 16.

Combine all factors: det ⁡ ( 2 A − 1 adj ⁡ ( A T ) ) = 8 × ( 1 4 × 16 ) = 8 × 4 = 32. \det(2 A^{-1} \operatorname{adj}(A^T)) = 8 \times \left( \frac{1}{4} \times 16 \right) = 8 \times 4 = 32. det ( 2 A − 1 adj ( A T )) = 8 × ( 4 1 ​ × 16 ) = 8 × 4 = 32.

Problem 2: Cramer's Rule for a Single Variable

Solve for y y y in the system: ( 2 1 1 1 2 1 1 1 2 ) ( x y z ) = ( 4 1 7 ) \begin{pmatrix} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{pmatrix} \begin{pmatrix} x \\ y \\ z \end{pmatrix} = \begin{pmatrix} 4 \\ 1 \\ 7 \end{pmatrix} ​ 2 1 1 ​ 1 2 1 ​ 1 1 2 ​ ​ ​ x y z ​ ​ = ​ 4 1 7 ​ ​

Solution :

Compute det ⁡ ( A ) \det(A) det ( A ) : det ⁡ ( A ) = 2 ( 4 − 1 ) − 1 ( 2 − 1 ) + 1 ( 1 − 2 ) = 2 ( 3 ) − 1 ( 1 ) + 1 ( − 1 ) = 6 − 1 − 1 = 4. \det(A) = 2(4 - 1) - 1(2 - 1) + 1(1 - 2) = 2(3) - 1(1) + 1(-1) = 6 - 1 - 1 = 4. det ( A ) = 2 ( 4 − 1 ) − 1 ( 2 − 1 ) + 1 ( 1 − 2 ) = 2 ( 3 ) − 1 ( 1 ) + 1 ( − 1 ) = 6 − 1 − 1 = 4.

Form A 2 A_2 A 2 ​ by replacing the second column with b = ( 4 , 1 , 7 ) T \mathbf{b} = (4, 1, 7)^T b = ( 4 , 1 , 7 ) T : A 2 = ( 2 4 1 1 1 1 1 7 2 ) A_2 = \begin{pmatrix} 2 & 4 & 1 \\ 1 & 1 & 1 \\ 1 & 7 & 2 \end{pmatrix} A 2 ​ = ​ 2 1 1 ​ 4 1 7 ​ 1 1 2 ​ ​

Expand det ⁡ ( A 2 ) \det(A_2) det ( A 2 ​ ) along the first row: det ⁡ ( A 2 ) = 2 ( 2 − 7 ) − 4 ( 2 − 1 ) + 1 ( 7 − 1 ) = 2 ( − 5 ) − 4 ( 1 ) + 1 ( 6 ) = − 10 − 4 + 6 = − 8. \det(A_2) = 2(2 - 7) - 4(2 - 1) + 1(7 - 1) = 2(-5) - 4(1) + 1(6) = -10 - 4 + 6 = -8. det ( A 2 ​ ) = 2 ( 2 − 7 ) − 4 ( 2 − 1 ) + 1 ( 7 − 1 ) = 2 ( − 5 ) − 4 ( 1 ) + 1 ( 6 ) = − 10 − 4 + 6 = − 8.

Apply Cramer's Rule: y = det ⁡ ( A 2 ) det ⁡ ( A ) = − 8 4 = − 2. y = \frac{\det(A_2)}{\det(A)} = \frac{-8}{4} = -2. y = det ( A ) det ( A 2 ​ ) ​ = 4 − 8 ​ = − 2.

GRE Exam Traps & Pitfalls

Trap 1: Dropping the Exponent on Scalar Scaling Writing det ⁡ ( c A ) = c det ⁡ ( A ) \det(cA) = c \det(A) det ( c A ) = c det ( A ) is the single most common determinant blunder. For an n × n n \times n n × n matrix, every row is multiplied by c c c , yielding det ⁡ ( c A ) = c n det ⁡ ( A ) \det(cA) = c^n \det(A) det ( c A ) = c n det ( A ) .

Trap 2: Assuming Linearity Across Addition In general, det ⁡ ( A + B ) ≠ det ⁡ ( A ) + det ⁡ ( B ) \det(A + B) \neq \det(A) + \det(B) det ( A + B )  = det ( A ) + det ( B ) . For instance, det ⁡ ( I 2 + ( − I 2 ) ) = det ⁡ ( 0 ) = 0 \det(I_2 + (-I_2)) = \det(0) = 0 det ( I 2 ​ + ( − I 2 ​ )) = det ( 0 ) = 0 , but det ⁡ ( I 2 ) + det ⁡ ( − I 2 ) = 1 + ( − 1 ) 2 = 2 \det(I_2) + \det(-I_2) = 1 + (-1)^2 = 2 det ( I 2 ​ ) + det ( − I 2 ​ ) = 1 + ( − 1 ) 2 = 2 .

Trap 3: Forgetting the Transpose in the Adjugate Definition The adjugate is the transpose of the cofactor matrix: ( adj ⁡ ( A ) ) i j = C j i (\operatorname{adj}(A))_{ij} = C_{ji} ( adj ( A ) ) ij ​ = C ji ​ . If you calculate cofactors and fail to transpose before multiplying, the result will not equal ( det ⁡ A ) I n (\det A) I_n ( det A ) I n ​ unless the matrix is symmetric.

Loading diagram... Decision Tree for Matrix Determinant Evaluation