Column Space Calculator
Solve column space problems step-by-step with our free calculator. See formulas, worked examples, and clear explanations.
Formula
Column Space = span of pivot columns of original matrix A after row reducing A to RREF
Row reduce the matrix to RREF to identify pivot columns. The corresponding columns from the original matrix form a basis for the column space. The dimension of the column space equals the rank of the matrix. By the rank-nullity theorem, rank + nullity = number of columns.
Worked Examples
Example 1: Finding Column Space of a Rank-2 Matrix
Problem: Find the column space of A = [[1, 2, 3], [4, 5, 6], [7, 8, 9]].
Solution: Row reduce A:\nR2 = R2 - 4R1: [[1, 2, 3], [0, -3, -6], [7, 8, 9]]\nR3 = R3 - 7R1: [[1, 2, 3], [0, -3, -6], [0, -6, -12]]\nR3 = R3 - 2R2: [[1, 2, 3], [0, -3, -6], [0, 0, 0]]\nPivot columns: 1 and 2\nBasis = {[1, 4, 7], [2, 5, 8]} from original matrix
Result: Rank = 2 | Column space basis: {[1, 4, 7], [2, 5, 8]} | Nullity = 1
Example 2: Full Rank 3x3 Matrix
Problem: Find the column space of A = [[1, 0, 0], [0, 1, 0], [0, 0, 1]] (identity matrix).
Solution: The identity matrix is already in RREF.\nAll three columns are pivot columns.\nBasis = {[1, 0, 0], [0, 1, 0], [0, 0, 1]}\nThe column space is all of R3.\nDeterminant = 1 (nonzero confirms full rank)
Result: Rank = 3 | Column space = R3 | Nullity = 0
Frequently Asked Questions
What is the column space of a matrix?
The column space of a matrix is the set of all possible linear combinations of its column vectors. It forms a subspace of the vector space where the matrix columns reside. In practical terms, the column space tells you what outputs are achievable when you multiply the matrix by any input vector. If a vector b is in the column space of A, then the system Ax = b has at least one solution. The dimension of the column space equals the rank of the matrix, which is fundamental to understanding the solvability of linear systems.
How do you find the column space of a matrix?
To find the column space, you perform row reduction (Gaussian elimination) on the matrix to obtain its row echelon form or reduced row echelon form (RREF). The pivot columns in the RREF indicate which columns of the original matrix form a basis for the column space. It is critical to use the original columns, not the reduced columns, as the basis vectors. For example, if columns 1 and 3 are pivot columns in the RREF, then columns 1 and 3 of the original matrix span the column space. The number of pivot columns equals the rank of the matrix.
What is the difference between column space and row space?
The column space is spanned by the columns of a matrix, while the row space is spanned by its rows. Despite being different subspaces (column space lives in the output space, row space in the input space), they always have the same dimension, which equals the rank of the matrix. The column space of A is the row space of the transpose A-transpose. For a 3x3 matrix of rank 2, the column space is a plane in 3D output space and the row space is a plane in 3D input space. Both spaces are essential for understanding the geometry of linear transformations.
What is the relationship between rank and column space?
The rank of a matrix is exactly the dimension of its column space. By the rank-nullity theorem, rank plus nullity equals the number of columns. If a 3x3 matrix has rank 2, its column space is a 2-dimensional plane in three-dimensional space, and the null space is a 1-dimensional line. A matrix has full rank when its column space spans the entire output space, meaning every possible output vector can be achieved. The rank also equals the number of linearly independent columns and the number of pivot positions in row echelon form.
How does the column space relate to the solvability of Ax = b?
The equation Ax = b has a solution if and only if b lies in the column space of A. This is because Ax is always a linear combination of the columns of A, so the set of all achievable right-hand sides is exactly the column space. If b is not in the column space, the system is inconsistent and has no solution. When the column space spans all of the output space (full rank), the system Ax = b has a solution for every b. Understanding the column space allows you to determine which systems of equations are solvable before attempting to solve them.
What is the null space and how does it relate to the column space?
The null space (or kernel) of a matrix A contains all vectors x such that Ax = 0. The rank-nullity theorem connects these two concepts: rank (dimension of column space) plus nullity (dimension of null space) equals the number of columns. When the null space is trivial (contains only the zero vector), every column is linearly independent, and the column space has maximum dimension. A larger null space means more linear dependencies among columns, resulting in a smaller column space. Together, these two subspaces provide a complete picture of what a matrix transformation does.