Mathematics
The Fundamental Theorem of Linear Algebra
Quick fact
The Fundamental Theorem of Linear Algebra is often associated with Gilbert Strang, who popularized the clear picture of the four fundamental subspaces and their orthogonality.
Why this is interesting
Imagine you have a matrix, a simple grid of numbers. How can this single object actually define two separate worlds—and why does knowing one helps you understand the other?
Read the full explanation
Understanding The Fundamental Theorem of Linear Algebra
Think of a matrix as a machine that transforms vectors. When you feed a vector into this machine, the output always lies in a certain set of possible vectors, called the column space (the space spanned by the columns). The set of inputs that get crushed to zero is called the null space (the space of solutions to Ax = 0). The theorem tells us that these two spaces are not independent. The null space is perpendicular to the row space—the space spanned by the rows of the matrix. This means every vector in the input space can be split into two parts: one that lives in the row space (which gets mapped to the column space) and one that lives in the null space (which gets zeroed out). This split is like separating a vector into an 'action' part and a 'wasted' part. Moreover, the dimensions add up: dimension of row space + dimension of null space = number of columns. Similarly, dimension of column space + dimension of left null space = number of rows. This is the rank-nullity theorem, and it shows how the 'rank' of a matrix (the dimension of the column space) controls the sizes of these spaces.
A deeper explanation
The deeper mechanism lies in the geometry of the four subspaces in R^n and R^m. For an m×n matrix A, the row space and null space are subspaces of R^n, and they are orthogonal complements: every vector in the row space is perpendicular to every vector in the null space, and together they span the entire R^n. Similarly, the column space and left null space are orthogonal complements in R^m. Why does this matter? Because solving Ax = b becomes clear: a solution exists if and only if b lies in the column space. When b is not in the column space, the best approximate solution—in the least squares sense—is found by projecting b onto the column space, which is possible because that projection is unique and the error is orthogonal to the column space. This theorem also explains the four fundamental spaces' roles in linear transformations: the row space maps to the column space bijectively (a one-to-one correspondence), while the null space represents the failure of injectivity. This structure is the backbone of many applications, from data fitting to signal processing, making it a truly foundational result.