Write a vector in the domain as . The first and third equations defining the kernel of a linear map imply . Substitution into the second equation then gives
For , this forces , and . Hence
The kernel of a linear map has dimension one, so the rank-nullity theorem gives rank three and proves the assertion about the image of a linear map. Alternatively, the minor formed from columns has determinant , including a nonzero value at .
For , the parameters are free and , . Thus
The third row is the first row minus the second. The image of a linear map is therefore contained in . The first and third columns, and , are linearly independent, so the matrix rank is two and this containment is equality:
This is the sole kernel jump in a parameter-dependent linear map; there is no further exceptional case at .
Let be the standard basis and define . By linearity,
Thus every linear functional has this form. Its representing vector is unique because evaluating at each gives .
For the prescribed kernel of a linear map, the third listed vector is the first minus the second, so it adds no independent constraint. The first two require
Taking and gives , . Consequently all possible representing vectors are
Conversely, every such vector is perpendicular to each of the three prescribed vectors, so its linear functional vanishes on them. This also includes the zero linear functional.

Articles by others on the same topic (0)

There are currently no matching articles.