Annihilator of a vector subspace Created 2026-09-24 Updated 2026-10-14
For a vector subspace ,
In finite dimension, .
An annihilator of a vector subspace collects the linear functionals that ignore every input from that vector subspace. For , a linear functional vanishes on exactly when . Hence is the one-dimensional span of . The zero level set in the linear functional diagram is precisely .
Dual image and kernel annihilator identity Created 2026-10-06 Updated 2026-11-05
For a linear map between finite-dimensional vector spaces, the image of its dual map is the annihilator of a vector subspace given by its kernel. Inclusion follows by composition. Conversely a linear functional vanishing on the kernel descends to the image and extends to the target by basis extension. The identity and the rank-nullity theorem show that a linear map and its dual have equal rank.
Duals of a subspace and its quotient Created 2026-09-24 Updated 2026-11-05
For a vector subspace of a finite-dimensional vector space, there are canonical linear isomorphisms
where is the annihilator of a vector subspace.
For the first identity, let be the quotient map of vector spaces. Composing a linear functional on with gives a linear functional on that vanishes on . Conversely, if , the formula is well-defined: changing the representative adds an element on which is zero. These operations are inverse.
For the second identity, restriction is surjective by basis extension, and its kernel is exactly . Two linear functionals therefore have the same restriction precisely when their difference belongs to this annihilator of a vector subspace. Taking the quotient vector space gives the identity.
For example, if and is the span of , then consists of . These linear functionals descend to . Restricting a general to instead remembers only ; the terms in disappear in the quotient of the dual.
For a vector subspace of a finite-dimensional vector space , its annihilator of a vector subspace determines exactly: . Indeed, a basis of can be extended to one of . If , include among the added basis vectors and define a linear functional taking value one at and zero on all the other basis vectors. This functional vanishes on but not at , excluding every outside vector from the intersection.
It suffices to intersect the kernels of any basis of : every other annihilating functional is their linear combination. The dual basis for a basis of extending a basis of shows . If , the empty intersection is . This translates a subspace description by spanning vectors into an exact description by independent linear equations.
Fredholm alternative for a matrix Created 2026-09-24 Updated 2026-11-05
For a complex -by- matrix , the linear system has a solution precisely when is orthogonal to every vector in , where is the conjugate transpose. For a real matrix, use the transpose instead. Indeed,
because the defining adjoint operator identity turns orthogonality to every into . Taking the orthogonal complement again recovers in finite dimensions. Thus a linear functional in the annihilator of a vector subspace gives the exact obstruction to solvability, rather than just a necessary test.
For , its image of a linear map is the first coordinate axis and is the second. Consequently is solvable exactly when .
Invariant subspaces and annihilators Created 2026-10-25 Updated 2026-10-31
For a linear map , an invariant subspace has an annihilator of a vector subspace invariant under the dual map . Indeed, for and ,
For a finite-dimensional vector space, the converse also holds. If , every vanishes on for each . The dual basis description of shows that the common zero set of its linear functionals is exactly , so . Thus
The dimension identity exchanges a one-dimensional invariant subspace with an invariant hyperplane in the dual space.
For a bilinear form on a finite-dimensional vector space , let send to . Under the bidual evaluation map, is the annihilator of a vector subspace , so . The rank-nullity theorem on now gives the displayed equality. In particular the sum of dimensions is at least . If , the dimension formula for a sum of subspaces forces . The exact formula records the extra dimensions contributed by the left radical , and does not assume an inner product.
Orthogonal complement for a bilinear form Created 2026-10-14 Updated 2026-11-05
For a bilinear form on a finite-dimensional vector space , the right bilinear orthogonal complement of a vector subspace is
It is a vector subspace by linearity in the second argument. For a general nonsymmetric bilinear form, left and right complements must be distinguished.
If is a nondegenerate bilinear form, the map is a linear isomorphism from to its dual space. It identifies with the annihilator of a vector subspace , giving
If is also a symmetric bilinear form or an alternating bilinear form, reversing a zero pairing preserves zero. Hence , and the dimension formula gives equality. Nondegeneracy of the ambient form is required for this double-complement conclusion. For the zero bilinear form, every complement is all of , so a proper cannot be recovered that way.
Even in a nondegenerate ambient space, the restricted form can be degenerate. For on , the line equals . In general, for a symmetric bilinear form or an alternating bilinear form, the restricted radical of a bilinear form is ; quotienting by this radical of a bilinear form gives a nondegenerate bilinear form.
The annihilator of a vector subspace is
If , extend a basis of to one of . In the resulting dual basis of , the last coordinate functionals span . Hence .
The bidual evaluation map is . It is a linear isomorphism in finite dimension. Its inverse image of the annihilator is
This identification uses evaluation only; no choice of inner product is involved.
The span is the coordinate plane . Consequently its annihilator of a vector subspace is . The dual map is composition with , so
It follows that
Equivalently, sends to .
The annihilator of a vector subspace consists of the linear functionals that vanish on every element of that vector subspace:
For the dimension identity, choose a basis of and use basis extension to obtain for . A linear functional is determined by its values on these basis vectors. Belonging to the annihilator of a vector subspace sets its first values to zero and leaves its last values arbitrary. Equivalently the last elements of the dual basis form a basis of .
For a linear functional , the definition of the dual map gives
Thus the kernel of a linear map is precisely the annihilator of a vector subspace
Write , and . The rank-nullity theorem, the dimension formula for an annihilator of a vector subspace, and give
Applying the same dimension formula in gives
Finally, if and , then . Therefore . These are finite-dimensional vector subspaces of equal dimension, so inclusion is equality:
This is the dual image and kernel annihilator identity.
Choose a basis of . Because , the list is linearly independent. Extend it to a basis of . A linear functional is specified uniquely by its values on a basis, so define to be zero on the and on every added basis vector other than , and set .
Then vanishes on every linear combination of the , so , while
This proves that the annihilator of a vector subspace separates every vector outside the subspace from that subspace; no inner product or preferred coordinates are needed.
The dual basis is , where and each coordinate linear functional extends linearly. Thus . These functionals are a basis of because a linear functional is uniquely determined by its values on .
For a linear subspace of dimension , extend a basis to one of . In its dual basis, the annihilator of a vector subspace is spanned by the last coordinate functionals. Hence .
The transpose in the source is the algebraic dual map defined by . Composition of linear maps is linear, so is a linear functional; and , proving linearity in its input. If , then
The coefficient of in is consequently , so . No inner product is involved.
A linear functional annihilates exactly when for all , equivalently . Thus . If , then , giving . The first equality and the dimension formula give . By the rank-nullity theorem,
The inclusion is therefore an equality:
Write for the dual space. Define . For fixed , this is a linear functional on ; evaluation is also linear in , so is a linear map. If , extend to a basis and take its first coordinate linear functional ; then . Thus is injective. A dual basis has the same number of elements as the original basis, so . The rank-nullity theorem now makes an linear isomorphism.
The annihilator of a vector subspace of a linear subspace is
Extend a basis of to a basis of , with dual basis . A linear functional belongs to exactly when its first coordinates in this dual basis vanish. Hence has basis , proving
The dual map is ; here this is the algebraic dual map, denoted in the source. If , then . Consequently . Moreover,
because coordinate linear functionals separate vectors. This proves , including the requested second inclusion. Taking dimensions gives
The first inclusion has equal dimensions on both sides, so
For a matrix representing , the matrix of in the corresponding dual bases is : its entry is . Thus the column rank of is the row rank of , while the column rank of is . Applying the established equality to these two linear maps proves row rank equals column rank over every field.
Choose a basis of . Because , the list is linearly independent. Extend it to a basis of . A linear functional is specified uniquely by its values on a basis, so define to be zero on the and on every added basis vector other than , and set .
Then vanishes on every linear combination of the , so , while
This proves that the annihilator of a vector subspace separates every vector outside the subspace from that subspace; no inner product or preferred coordinates are needed.
If and , then . Thus , using the annihilator of a vector subspace.
Conversely, let vanish on the kernel of a linear map . Define a linear functional on by . This is well-defined: implies , so . Extend to a linear functional on , using the extension argument from part (i). Then , proving
The dimension formula from part (i) and the rank-nullity theorem now give
To deduce the eigenvalue statement, apply this equality of rank of a linear map to . Its dual map is , so their kernel of a linear map dimensions agree. Thus the same are eigenvalues, with the same geometric multiplicities.
For algebraic multiplicities as well, part (a)(iii) gives
so equality of rank applies to every power. Hence
After extending to a field where the characteristic polynomials split, take . These kernel of a linear map spaces are the generalized eigenspaces; the primary decomposition theorem for linear maps identifies their dimensions with the algebraic multiplicities. The same proof works over the original field for every eigenvalue in it. We obtain
In fact the argument also includes the zero eigenvalue.