Rank-Nullity Theorem: Let T:V→W be a linear map
between finite-dimensional vector spaces
over the same field. Define
- ker(T)={v∈V:T(v)=0} (kernel / null space),
- im(T)={T(v):v∈V} (image),
- nullity(T)=dim(ker(T)),
- rank(T)=dim(im(T)),
where dim(U) denotes the number of vectors in any basis of U.
Then
dim(V)=nullity(T)+rank(T).This theorem is the basic dimension-counting tool for linear maps. For example, T is injective
if and only if ker(T)={0}, and it is surjective
if and only if rank(T)=dim(W) (in finite dimensions). Standard proofs ultimately rely on the existence of bases, guaranteed in general by basis existence
.
Proof sketch:
Choose a basis (k1,…,km) of ker(T) and extend it to a basis (k1,…,km,vm+1,…,vn) of V. Then (T(vm+1),…,T(vn)) is a basis of im(T): it spans by construction, and linear independence follows because any dependence lifts to an element of ker(T). Counting basis elements gives n=m+(n−m), i.e. dim(V)=dim(ker(T))+dim(im(T)).