Study guide
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction
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.1 Systems of Linear Equations, Matrix Rank, and Row Reduction
Key Takeaways Explain This Topic AI
Row reduction via Gaussian elimination transforms an augmented matrix [A | b] to Reduced Row Echelon Form (RREF), uniquely revealing pivots, rank, and the complete solution geometry.
By the Rouché-Capelli Theorem, a linear system Ax = b is consistent if and only if rank(A) = rank([A | b]); consistency yields a unique solution when rank equals the column count n, and an affine solution space of dimension n - rank(A) otherwise.
The Rank Theorem establishes that the row rank of any m x n matrix equals its column rank, dim(row(A)) = dim(col(A)) = rank(A) = r.
The Fundamental Theorem of Linear Algebra partitions R^n and R^m into orthogonal complements: row(A)^perp = null(A) in R^n and col(A)^perp = null(A^T) in R^m.
Last updated: September 2026
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction
Linear systems of equations constitute the foundational algebraic machinery tested on the GRE Mathematics Subject Test. A system of m m m linear equations in n n n unknowns is represented compactly in matrix form as A x = b A\mathbf{x} = \mathbf{b} A x = b , where A ∈ R m × n A \in \mathbb{R}^{m \times n} A ∈ R m × n is the coefficient matrix, x ∈ R n \mathbf{x} \in \mathbb{R}^n x ∈ R n is the column vector of unknowns, and b ∈ R m \mathbf{b} \in \mathbb{R}^m b ∈ R m is the right-hand side vector. Evaluating the existence, uniqueness, and structural dimension of the solution set requires systematic row reduction, matrix rank theorems, and the geometric duality of the four fundamental subspaces.
Augmented Matrices and Elementary Row Operations
The entire algebraic data of the nonhomogeneous system A x = b A\mathbf{x} = \mathbf{b} A x = b is encoded within the augmented matrix [ A ∣ b ] ∈ R m × ( n + 1 ) [A \mid \mathbf{b}] \in \mathbb{R}^{m \times (n+1)} [ A ∣ b ] ∈ R m × ( n + 1 ) . Solving the system corresponds to executing a sequence of elementary row operations, each of which corresponds to left-multiplication by an invertible elementary matrix E E E :
Row Swap ( R i ↔ R j R_i \leftrightarrow R_j R i ↔ R j ) : Transposes row i i i and row j j j . The corresponding elementary matrix E i j E_{ij} E ij has determinant − 1 -1 − 1 .
Row Scaling ( c R i → R i c R_i \to R_i c R i → R i , c ≠ 0 c \neq 0 c = 0 ) : Multiplies every entry in row i i i by a non-zero scalar c c c . The corresponding elementary matrix has determinant 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 , j ≠ i j \neq i j = i ) : Adds c c c times row j j j to row i i i . The corresponding shear matrix has determinant 1 1 1 .
Because every elementary matrix is invertible, row equivalence preserves the solution set: A x = b A\mathbf{x} = \mathbf{b} A x = b and ( E k ⋯ E 1 A ) x = ( E k ⋯ E 1 b ) (E_k \cdots E_1 A)\mathbf{x} = (E_k \cdots E_1 \mathbf{b}) ( E k ⋯ E 1 A ) x = ( E k ⋯ E 1 b ) share identical solutions.
Row Echelon Form (REF) and Reduced Row Echelon Form (RREF)
Gaussian elimination systematically simplifies an augmented matrix into Row Echelon Form (REF) :
All all-zero rows reside strictly at the bottom of the matrix.
In each non-zero row, the leading non-zero coefficient (the pivot) appears strictly to the right of the leading coefficient of the row directly above it.
Gauss-Jordan elimination continues the reduction to produce the unique Reduced Row Echelon Form (RREF) :
Every pivot entry is scaled to 1 1 1 .
Each pivot column contains zeros in every entry except the pivot itself.
While an arbitrary matrix possesses infinitely many valid REFs depending on the choice of row operations, its RREF is strictly unique . Columns containing pivots correspond to basic (pivot) variables , whereas non-pivot columns correspond to free variables that parametrize the solution manifold.
The Rank Theorem and Solvability Criteria
The rank of a matrix A A A , denoted rank ( A ) \operatorname{rank}(A) rank ( A ) , is the number of pivots in its echelon form.
The Rank Theorem
For any m × n m \times n m × n matrix A A A , the dimension of the vector space spanned by its rows ( row rank ) equals the dimension of the vector space spanned by its columns ( column rank ): dim ( row ( A ) ) = dim ( col ( A ) ) = rank ( A ) = r ≤ min ( m , n ) . \operatorname{dim}(\operatorname{row}(A)) = \operatorname{dim}(\operatorname{col}(A)) = \operatorname{rank}(A) = r \le \min(m, n). dim ( row ( A )) = dim ( col ( A )) = rank ( A ) = r ≤ min ( m , n ) .
Elementary row operations preserve the row space row ( A ) \operatorname{row}(A) row ( A ) and preserve all linear dependence relations between columns, proving that row rank equals column rank.
The Rouché-Capelli Consistency Criterion
A linear system A x = b A\mathbf{x} = \mathbf{b} A x = b is consistent if and only if b ∈ col ( A ) \mathbf{b} \in \operatorname{col}(A) b ∈ col ( A ) , which holds if and only if: rank ( A ) = rank ( [ A ∣ b ] ) . \operatorname{rank}(A) = \operatorname{rank}([A \mid \mathbf{b}]). rank ( A ) = rank ([ A ∣ b ]) .
If rank ( [ A ∣ b ] ) = rank ( A ) + 1 \operatorname{rank}([A \mid \mathbf{b}]) = \operatorname{rank}(A) + 1 rank ([ A ∣ b ]) = rank ( A ) + 1 , the augmented column contains a pivot, producing the contradiction 0 = 1 0 = 1 0 = 1 (no solution).
When consistent ( rank ( A ) = rank ( [ A ∣ b ] ) = r \operatorname{rank}(A) = \operatorname{rank}([A \mid \mathbf{b}]) = r rank ( A ) = rank ([ A ∣ b ]) = r ):
Unique Solution : If r = n r = n r = n (full column rank), there are no free variables. If A A A is square ( n × n n \times n n × n ), A A A is invertible and x = A − 1 b \mathbf{x} = A^{-1}\mathbf{b} x = A − 1 b .
Infinitely Many Solutions : If r < n r < n r < n , there are n − r n - r n − r free variables. The complete solution set is the affine subspace x = x p + x h \mathbf{x} = \mathbf{x}_p + \mathbf{x}_h x = x p + x h , where x p \mathbf{x}_p x p is any particular solution and x h ∈ null ( A ) \mathbf{x}_h \in \operatorname{null}(A) x h ∈ null ( A ) .
For homogeneous systems A x = 0 A\mathbf{x} = \mathbf{0} A x = 0 , x = 0 \mathbf{x} = \mathbf{0} x = 0 is always a solution. Non-trivial solutions exist if and only if rank ( A ) < n \operatorname{rank}(A) < n rank ( A ) < n .
The Four Fundamental Subspaces
An m × n m \times n m × n matrix A A A of rank r r r defines four canonical vector subspaces:
Subspace Definition Ambient Space Dimension Orthogonal Complement
Column Space col ( A ) \operatorname{col}(A) col ( A ) { A x : x ∈ R n } \{A\mathbf{x} : \mathbf{x} \in \mathbb{R}^n\} { A x : x ∈ R n } R m \mathbb{R}^m R m r r r null ( A T ) \operatorname{null}(A^T) null ( A T )
Null Space null ( A ) \operatorname{null}(A) null ( A ) { x ∈ R n : A x = 0 } \{\mathbf{x} \in \mathbb{R}^n : A\mathbf{x} = \mathbf{0}\} { x ∈ R n : A x = 0 } R n \mathbb{R}^n R n n − r n - r n − r row ( A ) \operatorname{row}(A) row ( A )
Row Space row ( A ) \operatorname{row}(A) row ( A ) col ( A T ) = { A T y : y ∈ R m } \operatorname{col}(A^T) = \{A^T\mathbf{y} : \mathbf{y} \in \mathbb{R}^m\} col ( A T ) = { A T y : y ∈ R m } R n \mathbb{R}^n R n r r r null ( A ) \operatorname{null}(A) null ( A )
Left Null Space null ( A T ) \operatorname{null}(A^T) null ( A T ) { y ∈ R m : A T y = 0 } \{\mathbf{y} \in \mathbb{R}^m : A^T\mathbf{y} = \mathbf{0}\} { y ∈ R m : A T y = 0 } R m \mathbb{R}^m R m m − r m - r m − r col ( A ) \operatorname{col}(A) col ( A )
Fundamental Theorem of Linear Algebra
The row space and null space are orthogonal complements in R n \mathbb{R}^n R n : row ( A ) ⊥ = null ( A ) , R n = row ( A ) ⊕ null ( A ) . \operatorname{row}(A)^\perp = \operatorname{null}(A), \quad \mathbb{R}^n = \operatorname{row}(A) \oplus \operatorname{null}(A). row ( A ) ⊥ = null ( A ) , R n = row ( A ) ⊕ null ( A ) .
The column space and left null space are orthogonal complements in R m \mathbb{R}^m R m : col ( A ) ⊥ = null ( A T ) , R m = col ( A ) ⊕ null ( A T ) . \operatorname{col}(A)^\perp = \operatorname{null}(A^T), \quad \mathbb{R}^m = \operatorname{col}(A) \oplus \operatorname{null}(A^T). col ( A ) ⊥ = null ( A T ) , R m = col ( A ) ⊕ null ( A T ) .
The Rank-Nullity Theorem asserts that dim ( col ( A ) ) + dim ( null ( A ) ) = n \operatorname{dim}(\operatorname{col}(A)) + \operatorname{dim}(\operatorname{null}(A)) = n dim ( col ( A )) + dim ( null ( A )) = n .
- Step-by-Step Worked Problems
- Problem 1: Parameter-Dependent System Solvability
Determine all values of k ∈ R k \in \mathbb{R} k ∈ R for which the system has: (a) no solution, (b) a unique solution, and (c) infinitely many solutions. x + y + k z = 2 3 x + 4 y + 2 z = k 2 x + 3 y − z = 1 \begin{aligned} x + y + kz &= 2 \\ 3x + 4y + 2z &= k \\ 2x + 3y - z &= 1 \end{aligned} x + y + k z 3 x + 4 y + 2 z 2 x + 3 y − z = 2 = k = 1
Solution :
Form the augmented matrix and apply row operations: ( 1 1 k 2 3 4 2 k 2 3 − 1 1 ) → R 2 − 3 R 1 , R 3 − 2 R 1 ( 1 1 k 2 0 1 2 − 3 k k − 6 0 1 − 1 − 2 k − 3 ) \begin{pmatrix} 1 & 1 & k & 2 \\ 3 & 4 & 2 & k \\ 2 & 3 & -1 & 1 \end{pmatrix} \xrightarrow{R_2 - 3R_1, \; R_3 - 2R_1} \begin{pmatrix} 1 & 1 & k & 2 \\ 0 & 1 & 2 - 3k & k - 6 \\ 0 & 1 & -1 - 2k & -3 \end{pmatrix} 1 3 2 1 4 3 k 2 − 1 2 k 1 R 2 − 3 R 1 , R 3 − 2 R 1 1 0 0 1 1 1 k 2 − 3 k − 1 − 2 k 2 k − 6 − 3
Subtract R 2 R_2 R 2 from R 3 R_3 R 3 : → R 3 − R 2 ( 1 1 k 2 0 1 2 − 3 k k − 6 0 0 k − 3 3 − k ) \xrightarrow{R_3 - R_2} \begin{pmatrix} 1 & 1 & k & 2 \\ 0 & 1 & 2 - 3k & k - 6 \\ 0 & 0 & k - 3 & 3 - k \end{pmatrix} R 3 − R 2 1 0 0 1 1 0 k 2 − 3 k k − 3 2 k − 6 3 − k
Analyze the bottom row [ 0 0 k − 3 ∣ 3 − k ] [0 \quad 0 \quad k - 3 \mid 3 - k] [ 0 0 k − 3 ∣ 3 − k ] :
If k ≠ 3 k \neq 3 k = 3 : The pivot entry is k − 3 ≠ 0 k - 3 \neq 0 k − 3 = 0 . Thus rank ( A ) = rank ( [ A ∣ b ] ) = 3 = n \operatorname{rank}(A) = \operatorname{rank}([A \mid \mathbf{b}]) = 3 = n rank ( A ) = rank ([ A ∣ b ]) = 3 = n . The system has a unique solution .
If k = 3 k = 3 k = 3 : The bottom row becomes [ 0 0 0 ∣ 0 ] [0 \quad 0 \quad 0 \mid 0] [ 0 0 0 ∣ 0 ] . Thus rank ( A ) = rank ( [ A ∣ b ] ) = 2 < 3 \operatorname{rank}(A) = \operatorname{rank}([A \mid \mathbf{b}]) = 2 < 3 rank ( A ) = rank ([ A ∣ b ]) = 2 < 3 . The system has infinitely many solutions parameterized by 3 − 2 = 1 3 - 2 = 1 3 − 2 = 1 free variable.
There is no value of k k k for which the system has no solution.
Problem 2: Basis for the Left Null Space
Find a basis for null ( A T ) \operatorname{null}(A^T) null ( A T ) where A = ( 1 2 0 0 1 1 1 3 1 ) A = \begin{pmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 1 & 3 & 1 \end{pmatrix} A = 1 0 1 2 1 3 0 1 1 .
Solution :
Transpose A A A : A T = ( 1 0 1 2 1 3 0 1 1 ) A^T = \begin{pmatrix} 1 & 0 & 1 \\ 2 & 1 & 3 \\ 0 & 1 & 1 \end{pmatrix} A T = 1 2 0 0 1 1 1 3 1
Row-reduce [ A T ∣ 0 ] [A^T \mid \mathbf{0}] [ A T ∣ 0 ] : ( 1 0 1 2 1 3 0 1 1 ) → R 2 − 2 R 1 ( 1 0 1 0 1 1 0 1 1 ) → R 3 − R 2 ( 1 0 1 0 1 1 0 0 0 ) \begin{pmatrix} 1 & 0 & 1 \\ 2 & 1 & 3 \\ 0 & 1 & 1 \end{pmatrix} \xrightarrow{R_2 - 2R_1} \begin{pmatrix} 1 & 0 & 1 \\ 0 & 1 & 1 \\ 0 & 1 & 1 \end{pmatrix} \xrightarrow{R_3 - R_2} \begin{pmatrix} 1 & 0 & 1 \\ 0 & 1 & 1 \\ 0 & 0 & 0 \end{pmatrix} 1 2 0 0 1 1 1 3 1 R 2 − 2 R 1 1 0 0 0 1 1 1 1 1 R 3 − R 2 1 0 0 0 1 0 1 1 0
Express basic variables in terms of the free variable y 3 = t y_3 = t y 3 = t : y 1 = − t , y 2 = − t , y 3 = t ⟹ y = t ( − 1 − 1 1 ) . y_1 = -t, \quad y_2 = -t, \quad y_3 = t \implies \mathbf{y} = t \begin{pmatrix} -1 \\ -1 \\ 1 \end{pmatrix}. y 1 = − t , y 2 = − t , y 3 = t ⟹ y = t − 1 − 1 1 .
A basis for null ( A T ) \operatorname{null}(A^T) null ( A T ) is { ( − 1 , − 1 , 1 ) T } \{(-1, -1, 1)^T\} {( − 1 , − 1 , 1 ) T } . Notice that this vector is orthogonal to every column of A A A : ( − 1 ) ( 1 ) + ( − 1 ) ( 0 ) + 1 ( 1 ) = 0 (-1)(1) + (-1)(0) + 1(1) = 0 ( − 1 ) ( 1 ) + ( − 1 ) ( 0 ) + 1 ( 1 ) = 0 , ( − 1 ) ( 2 ) + ( − 1 ) ( 1 ) + 1 ( 3 ) = 0 (-1)(2) + (-1)(1) + 1(3) = 0 ( − 1 ) ( 2 ) + ( − 1 ) ( 1 ) + 1 ( 3 ) = 0 , and ( − 1 ) ( 0 ) + ( − 1 ) ( 1 ) + 1 ( 1 ) = 0 (-1)(0) + (-1)(1) + 1(1) = 0 ( − 1 ) ( 0 ) + ( − 1 ) ( 1 ) + 1 ( 1 ) = 0 .
GRE Exam Traps & Pitfalls
Trap 1: Extracting Column Space Basis from RREF Columns Elementary row operations change the column space! The pivot columns of the RREF identify which columns are linearly independent, but the basis vectors for col ( A ) \operatorname{col}(A) col ( A ) must be extracted from the original matrix A A A , not from the RREF.
Trap 2: Mismatching Ambient Dimensions in Fundamental Subspaces For an m × n m \times n m × n matrix A A A , null ( A ) \operatorname{null}(A) null ( A ) and row ( A ) \operatorname{row}(A) row ( A ) live in R n \mathbb{R}^n R n , whereas col ( A ) \operatorname{col}(A) col ( A ) and null ( A T ) \operatorname{null}(A^T) null ( A T ) live in R m \mathbb{R}^m R m . Never take inner products between vectors from null ( A ) \operatorname{null}(A) null ( A ) and col ( A ) \operatorname{col}(A) col ( A ) when m ≠ n m \neq n m = n .
Trap 3: Overlooking Inconsistency in Parameter Problems A system is inconsistent only if a pivot lands in the augmented column ( [ 0 … 0 ∣ c ] [0 \dots 0 \mid c] [ 0 … 0 ∣ c ] with c ≠ 0 c \neq 0 c = 0 ). Do not confuse a zero row in A A A with inconsistency unless the corresponding right-hand entry is non-zero.