The most important concepts we encountered for matrices were secretly built from linear transformations.
For example, the null space and range of a matrix. We have the following definitions.
Definition. Let T:V→W be a linear transformation. The null space of T is the set Z(T):={v∈V∣T(v)=0} and the range of T is the set R(T):={w∈W∣w=T(v)}
The nullity of T is dimZ(T) and the rank of T is dimR(T).
Lemma. The null space Z(T) is a subspace of V and the range R(T) is a subspace of W.
Proof. (Expand to view)
We check that each are closed under linear combinations of two vectors.
Let v1,v2∈Z(T). Then, T(c1v1+c2v2)=c1T(v1)+c2T(v2)=0 so c1v1+c2v2∈Z(T).
Let w1,w2∈R(T). We can therefore write wi=T(vi). Now c1w1+c2w2=c1T(v1)+c2T(v2)=T(c1v1+c2v2) so c1w1+c2w2∈R(T). ■
Proposition. Assume that dimV,dimW<∞ and that A is a matrix representation for T in some bases for V and W. Then, Z(T)≅Z(A) and R(T)≅R(A)
Proof. (Expand to view)
Let’s choose bases v1,…,vn for V and w1,…,wm for W and have A be the matrix representation of T in these bases.
Take v∈Z(T) and write it in the basis v=i=1∑ncivi Denote c:=⎝⎛c1c2⋮cn⎠⎞ Let’s write out Ac(Ac)j=j=1∑mAjici Applying T directly to v gives T(v)=i=1∑nciT(vi)=i=1∑nci(j=1∑mAjiwj)=j=1∑m(i=1∑nAjici)wj If T(v)=0, then, as w1,…,wj is a basis, we see that i=1∑nAjici=0 for all 1≤j≤m. In other words, c∈Z(A).
In the other direction, if c∈Z(A), then T(v)=0. Thus, Z(T)v→Z(A)↦c is an isomorphism.
Next we turn to the ranges. Given w∈W, we write it in the vector representation for the basis w1,…,wmw=j=1∑mdjwj We will check that R(T)w→R(A)↦d is an isomorphism. From the computation above, T(v)=i=1∑nciT(vi)=i=1∑nci(j=1∑mAjiwj)=j=1∑m(i=1∑nAjici)wj we see that T(v) in vector representation has Ac as coefficients. Thus, w=T(v) if and only if d=Ac so the above map is an isomorphism. ■
The previous statement tells us that we can use our familiar tools for matrices to understand null spaces and ranges for linear transformations once we choose a basis.
As an application of this principle, we can quickly deduce the Rank-Nullity Theorem for linear transformations.
Theorem. (Rank-Nullity) Let T:V→W be a linear transformation with dimV,dimW<∞. Then, rankT+nullityT=dimV.
Proof. (Expand to view)
Since Z(T)≅Z(A) and R(T)≅R(A), we have nullityT=dimZ(T)=dimZ(A)=nullityA and rankT=dimR(T)=dimR(A)=rankA The dimension of V is equal to number of columns of A so we know rankA+nullityA=dimV from the Rank-Nullity Theorem for A. ■