Choose a basis for . Extend it to a basis of , and separately to a basis of . The combined list spans .
To prove linear independence, suppose a linear combination of the combined list is zero. Then the combination of the lies in , so it can be expressed using the . Independence of the chosen basis of forces every coefficient to vanish. Independence of the chosen basis of then forces the remaining coefficients to vanish. Thus the combined list is a basis, with elements. This proves the dimension formula for a sum of subspaces:
For every , , so . Taking dimensions and applying the preceding dimension formula for a sum of subspaces givesThis proves the upper rank bounds for a sum of linear maps, without assuming the two images have zero intersection.
Apply the preceding rank bounds for a sum of linear maps to . Since multiplying a linear map by does not change its image, . Thus . Interchanging the maps gives the other difference, proving
Use the standard basis . For the smallest possible rank, set for and zero otherwise, and set for and zero otherwise. Then the maps have ranks , while their sum has nonzero diagonal entries only for . HenceFor full rank when , instead take for and zero otherwise, and for and zero otherwise. Their supports cover every basis index because . The sum has diagonal entries one where just one map is nonzero and two where both are nonzero. None vanish over , so these linear maps have ranks and
Articles by others on the same topic
There are currently no matching articles.