Column Space Calculator
Solve column space problems step-by-step with our free calculator. See formulas, worked examples, and clear explanations.
Calculator
Adjust values & calculateFormula
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.
Last reviewed: December 2025
Worked Examples
Example 1: Finding Column Space of a Rank-2 Matrix
Example 2: Full Rank 3x3 Matrix
Background & Theory
The Column Space Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Column Space Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
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.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy