Fundamental Theorem of Linear Algebra

The Fundamental Theorem of Linear Algebra is the set of relationships tying a matrix’s column space, row space, null space, and left null space together. In Linear Algebra and Differential Equations, it explains rank, nullity, and solution structure.

What is the Fundamental Theorem of Linear Algebra?

The Fundamental Theorem of Linear Algebra is the idea that a matrix’s four fundamental subspaces fit together in a very specific way: column space, row space, null space, and left null space. In this course, it gives you the big picture behind why row operations, solving systems, and dimensions all line up the way they do.

The theorem says the column space and row space have the same dimension, and that number is the rank of the matrix. That shared dimension tells you how many independent columns or rows the matrix really has, even if the matrix itself has more columns or rows on paper. So rank is not just a label, it measures the amount of independent information the matrix carries.

The null space is the set of all vectors x that satisfy Ax = 0. Its dimension is the nullity, and rank plus nullity equals the number of columns. That relationship is one of the fastest ways to check whether a matrix has “extra freedom” in its solutions. If nullity is large, there are more free variables. If nullity is 0, the only solution to Ax = 0 is the zero vector.

The left null space is the null space of A transpose. In practice, it tells you which vectors are orthogonal to every column of A, so it connects directly to the geometry of the matrix. That is one reason the theorem feels like a bridge between algebra and geometry, not just a collection of formulas.

A common way this shows up is in solving a consistent system Ax = b. If one solution exists, then every solution is that particular solution plus any vector from the null space. So the null space is what creates all the different solutions after you find one starting point. The theorem explains why linear systems can have one solution, infinitely many, or no solution, depending on how the subspaces line up.

Why the Fundamental Theorem of Linear Algebra matters in Linear Algebra and Differential Equations

This theorem is the backbone for reading matrices instead of treating them like random tables of numbers. Once you know how rank, nullity, and the four subspaces connect, you can predict whether a system has a solution, how many independent constraints it has, and where the free variables come from.

It also gives you a cleaner way to think about row reduction. When you reduce a matrix, you are not just chasing pivots, you are tracking rank and seeing which columns are independent. That matters in linear systems units, where you often need to describe solution sets in vector form rather than just produce a numeric answer.

In the differential equations part of the course, the theorem helps when you work with systems written in matrix form. The same matrix ideas behind solution spaces and independence show up again in matrix methods for systems, so this theorem gives you a language for understanding why those methods work.

It also connects directly to orthogonality. The row space and null space, and the column space and left null space, sit in complementary positions. That geometric picture makes later topics like projections and Gram-Schmidt feel less abstract, because you can see which vectors live in a subspace and which ones are perpendicular to it.

How the Fundamental Theorem of Linear Algebra connects across the course

Column Space

The column space is one of the four subspaces in the theorem, and its dimension is the rank of the matrix. When you ask whether Ax = b has a solution, you are really asking whether b lies in the column space. That makes column space the first place to check when a system is consistent.

Row Space

The row space has the same dimension as the column space, even though it comes from a different set of vectors. Row reduction is the easiest way to see row-space information because pivot rows stay independent. The theorem uses that match to connect algebraic elimination with matrix structure.

Null Space

The null space is where the free-variable part of a solution lives. If you solve Ax = 0, every solution vector is in the null space, and its dimension is the nullity. In the theorem, rank plus nullity equals the number of columns, so the null space tells you exactly how much freedom the matrix leaves.

Consistent System

A system is consistent when Ax = b has at least one solution, and the theorem helps you see why that matters. If the system is consistent, then the full solution set is a particular solution plus the null space. That means one solution gives you the starting point, and the null space gives you every other one.

Is the Fundamental Theorem of Linear Algebra on the Linear Algebra and Differential Equations exam?

A problem set or quiz usually asks you to identify the four subspaces from a matrix, find rank and nullity, or describe the solution set of Ax = b. You may be asked to tell whether a vector lies in the column space, or whether the only solution to Ax = 0 is the zero vector. Another common task is using row-reduced form to count pivots and then applying rank plus nullity equals the number of columns. For a matrix methods question in differential equations, you might use the same ideas to explain whether a linear system has one solution, infinitely many, or no solution. The move is always the same: find the pivots, read the rank, and connect that to the relevant subspaces.

The Fundamental Theorem of Linear Algebra vs Row Space

The row space is one part of the theorem, but the Fundamental Theorem of Linear Algebra is the full relationship among all four subspaces. If you mix them up, remember that row space is a specific subspace, while the theorem is the whole structure that explains how row space, column space, null space, and left null space fit together.

Key things to remember about the Fundamental Theorem of Linear Algebra

• The Fundamental Theorem of Linear Algebra connects the four fundamental subspaces of a matrix into one picture.

• Rank is the dimension of both the column space and the row space, so those two subspaces always match in size.

• Nullity measures the dimension of the null space, and rank plus nullity equals the number of columns.

• If a system Ax = b is consistent, every solution is a particular solution plus a vector from the null space.

• The theorem turns row reduction into geometry, so you can see what a matrix does instead of only computing with it.

Frequently asked questions about the Fundamental Theorem of Linear Algebra

What is the Fundamental Theorem of Linear Algebra in Linear Algebra and Differential Equations?

It is the set of relationships among a matrix’s column space, row space, null space, and left null space. The theorem says rank equals the dimension of both the row space and column space, and rank plus nullity equals the number of columns. It gives you the structure behind solving linear systems and reading matrix behavior.

How does the Fundamental Theorem of Linear Algebra relate to null space?

The null space is the part of the theorem that tells you how many free directions a matrix leaves in Ax = 0. Its dimension is the nullity, and nullity combines with rank to fill out the number of columns. If the null space is larger, the matrix has more dependent columns or more freedom in solutions.

What is the difference between row space and column space?

The row space is made from the rows of the matrix, while the column space is made from its columns. They are different subspaces, but the theorem says they have the same dimension. In practice, row reduction reveals the row space more directly, while the column space tells you which right-hand sides are reachable in Ax = b.

How do you use this theorem to solve a linear system?

First find a particular solution if the system is consistent. Then find the null space of the coefficient matrix, because every other solution is the particular solution plus a null-space vector. This is the cleanest way to describe infinitely many solutions in vector form.