For a linear map , its rank of a linear map is , and its nullity is . The rank-nullity theorem states . One obtains it by extending a basis of the kernel to a basis of ; the images of the added vectors form a basis of the image.
Restrict to . Its image is and its kernel is . Thus
The intersection dimension is at most , proving the lower bound. It is nonnegative, proving the upper bound by , while proves the other upper bound. Consequently the rank inequality for a composition is

Articles by others on the same topic (0)

There are currently no matching articles.