Rank–nullity theorem
From Wikipedia, the free encyclopedia
In mathematics, the rank–nullity theorem of linear algebra, in its simplest form, states that the rank and the nullity of a matrix add up to the number of columns of the matrix. Specifically, if A is an m-by-n matrix over the field F, then
- rank A + nullity A = n. [1]
This applies to linear maps as well. Let V and W be vector spaces over the field F and let T : V → W be a linear map. Then the rank of T is the dimension of the image of T, the nullity the dimension of the kernel of T, and we have
- dim (im T) + dim (ker T) = dim V
or, equivalently,
- rank T + nullity T = dim V.
This is in fact more general than the matrix statement above, because here V and W may even be infinite-dimensional.
One can refine this statement (via the splitting lemma or the below proof) to be a statement about an isomorphism of spaces, not just dimensions: in addition to:
one in fact also has:
More generally, one can consider the image, kernel, coimage, and cokernel, which are related by the fundamental theorem of linear algebra.
Contents |
[edit] Proof
Suppose
forms a basis of ker T. We can extend this to form a basis of V:
.
Since the dimension of ker T is m and the dimension of V is m+n, it suffices to show that the dimension of image T is n.
Let us conjecture that
forms a basis of image T.
Let v be an arbitrary vector in V. There exist unique scalars such that:
Thus,
spans image T.
We only now need to show that this list is not redundant; that is, that
are linearly independent. We can do this by showing that a linear combination of these vectors is zero iff. the coefficient on each vector is zero. Let:
Then, since
span ker T, there exists a set of scalars di such that:
But, since
form a basis of V, all
must be zero.
Therefore,
is linearly independent and indeed a basis of image T. This proves that the dimension of image T is n, as desired.
In more abstract terms, the map
splits.
[edit] Reformulations and generalizations
This theorem is a statement of the first isomorphism theorem of algebra to the case of vector spaces; it generalizes to the splitting lemma.
In more modern language, the theorem can also be phrased as follows: if
- 0 → U → V → R → 0
is a short exact sequence of vector spaces, then
- dim(U) + dim(R) = dim(V)
Here R plays the role of im T and U is ker T.
In the finite-dimensional case, this formulation is susceptible to a generalization: if
- 0 → V1 → V2 → ... → Vr → 0
is an exact sequence of finite-dimensional vector spaces, then
The rank–nullity theorem for finite-dimensional vector spaces may also be formulated in terms of the index of a linear map. The index of a linear map T : V → W, where V and W are finite-dimensional, is defined by
- index T = dim(ker T) − dim(coker T).
Intuitively, dim(ker T) is the number of independent solutions x of the equation Tx = 0, and dim(coker T) is the number of independent restrictions that have to be put on y to make Tx = y solvable. The rank–nullity theorem for finite-dimensional vector spaces is equivalent to the statement
- index T = dim(V) − dim(W).
We see that we can easily read off the index of the linear map T from the involved spaces, without any need to analyze T in detail. This effect also occurs in a much deeper result: the Atiyah–Singer index theorem states that the index of certain differential operators can be read off the geometry of the involved spaces.
[edit] See also
[edit] Notes
- ^ Meyer (2000), page 199.
[edit] References
- Meyer, Carl D. (2000), Matrix Analysis and Applied Linear Algebra, SIAM, ISBN 978-0-89871-454-8, http://www.matrixanalysis.com/.










