For the linear map , its image of a linear map and kernel of a linear map are
Both contain the zero vector, since . If and belong to the image of a linear map, then for any real numbers ,
Thus is a vector subspace of . If , then
so is a vector subspace of .
The rank of a linear map and nullity of a linear map are
The rank-nullity theorem states that
To prove it, choose a basis of the kernel of a linear map and use basis extension to obtain a basis
of . The vectors span the image of a linear map: applying to an arbitrary linear combination of the displayed basis removes all the terms. They are also linearly independent. Indeed,
so for some scalars . The linear independence of the extended basis forces every and to vanish. Consequently and , proving the identity. The same argument covers an empty basis when one of these dimensions is zero.
Here . By the rank-nullity theorem, , and a dimension is a nonnegative integer. All three possibilities occur:
The images of a linear map in these examples have dimensions , respectively, while the corresponding kernel of a linear map is , and . The identity above excludes all other pairs.
If , every would satisfy , so would be a surjective linear map. But its image of a linear map has dimension at most , whereas . Therefore no such exists. This is the obstruction to a right inverse: cannot reach every target vector.
The necessary and sufficient condition is
For necessity, if and , then .
For sufficiency, let be a basis of and suppose the kernel of a linear map is trivial. The vectors are linearly independent, since implies . Extend them to a basis of . Define a linear map by
Then agrees with the identity operator on a basis, hence on all of . Thus a left inverse exists precisely when is injective; this is the linear left inverse criterion.

Articles by others on the same topic (0)

There are currently no matching articles.