The rank-nullity theorem for a linear map , with a finite-dimensional vector space over a field , is
Here the nullity is the dimension of the kernel of a linear map, and the rank of a linear map is the dimension of its image of a linear map.
Define the linear functional by . The given hyperplane is . Choose with . For any , the vector whose only nonzero coordinate is satisfies . Hence is surjective and has rank of a linear map equal to .
Applying the rank-nullity theorem to this particular linear map gives
The nonzero-coefficient hypothesis is essential: if all were zero, the kernel of a linear map would instead be all of .
Over the finite field , a basis of the hyperplane has vectors by ii. Each vector on the hyperplane has a unique expression as a linear combination of that basis, and each coefficient has possibilities. Thus
Equivalently, choose freely all coordinates except , where , and solve uniquely for . For this counts just the zero vector, consistently with .
The transpose is a linear map, so is a linear map on the -dimensional vector space . Let denote a matrix unit. The answer depends on the characteristic of a field.
If , then means . Such skew-symmetric matrices have zero diagonal, and their entries above the diagonal can be chosen freely. A basis of the kernel of a linear map is for , giving nullity . The image of a linear map consists of all symmetric matrices: is symmetric, and every symmetric matrix is . Its basis comprises and for , giving rank of a linear map .
If , then , so consists of all symmetric matrices, with dimension . Every is symmetric with zero diagonal, and every symmetric zero-diagonal matrix arises by taking for and all other entries zero. The image of a linear map therefore has basis for , and dimension . This is the symmetrization map in characteristic two.
In both cases the rank-nullity theorem is verified explicitly:

Articles by others on the same topic (0)

There are currently no matching articles.