An annihilator is a subspace of the dual space consisting of all linear functionals that vanish on a given set of vectors. If is a vector space over a field , and , then the annihilator of is
The elements of are linear measurements that give zero on every vector in . When is a subspace, its annihilator records all linear equations that are satisfied by every vector in . The annihilator is always a subspace of .
29.1 Definition
Let be a vector space over . Let . The annihilator of is
The notation is common. Some books use or .
If is a subspace, then is the set of all linear functionals on that vanish on .
Thus
The annihilator lives in the dual space, not in the original vector space.
29.2 First Example
Let
and let
Then is the -axis.
A linear functional on has the form
For to vanish on , we need
for every . But
This is zero for every exactly when
Therefore
So the annihilator is one-dimensional. It consists of all scalar multiples of the functional that reads the second coordinate.
29.3 Annihilators Are Subspaces
For every subset , the annihilator is a subspace of .
First, the zero functional belongs to , because
for every .
Next, let
Then for every ,
Thus
For a scalar ,
Thus
Therefore is a subspace of .
29.4 Extreme Cases
There are two useful extreme cases.
First,
Every linear functional sends the zero vector to zero, so every functional vanishes on .
Second,
The only linear functional that vanishes on every vector of is the zero functional.
These identities show the reversal built into annihilators: a smaller subset has a larger annihilator, and a larger subset has a smaller annihilator.
29.5 Inclusion Reversal
If
then
Indeed, if a functional vanishes on all of , then it certainly vanishes on all of . Thus it belongs to .
This reversal is important. Annihilators turn containment around.
A large subspace imposes many conditions on a functional, so fewer functionals vanish on it. A small subspace imposes fewer conditions, so more functionals vanish on it.
29.6 Annihilator of a Span
The annihilator of a set equals the annihilator of its span:
If a functional vanishes on every vector of , then by linearity it vanishes on every linear combination of vectors from . Hence it vanishes on .
Conversely, if it vanishes on , then it vanishes on , since
Therefore the annihilator depends only on the subspace generated by the set.
29.7 Computing an Annihilator in Coordinates
Let be spanned by columns of a matrix
A functional can be represented by a row vector
The condition for every becomes
Equivalently,
Transposing,
Thus the annihilator of the column space of corresponds to the null space of :
This is the coordinate form of the left null space.
29.8 Example in
Let
A linear functional has the form
We require
and
These give
Hence
Let
Then
Therefore
The annihilator is one-dimensional. This agrees with the dimension formula:
29.9 Dimension Formula
If is finite-dimensional and is a subspace, then
The number on the right is the codimension of in . Thus
An annihilator contains one independent linear condition for each direction missing from . Equivalently, it measures how many independent functionals can vanish on .
29.10 Proof of the Dimension Formula
Let
Choose a basis of :
Extend it to a basis of :
Let the dual basis be
A functional in must vanish on
The dual basis functionals
vanish on all of , and they form a basis of . There are of them.
Therefore
29.11 Annihilator of a Sum
If and are subspaces of , then
A functional vanishes on exactly when it vanishes on every vector of and every vector of .
Indeed, if
then and , so
Conversely, if
then for any
we have
Thus
29.12 Annihilator of an Intersection
For finite-dimensional spaces,
This identity is dual to the previous one. The annihilator changes intersections into sums and sums into intersections.
The inclusion
is immediate: if a functional vanishes on , and another vanishes on , then their sum vanishes on every vector belonging to both.
The reverse inclusion is deeper and follows from the dimension formula.
29.13 Double Annihilator
If is finite-dimensional and , then
after identifying with its double dual .
Here
means the annihilator of inside . Under the natural identification
it returns the original subspace .
This says that in finite dimensions, a subspace is completely determined by the linear functionals that vanish on it.
29.14 Annihilators and Quotient Spaces
There is a natural isomorphism
A functional on the quotient is the same as a functional on that vanishes on .
To see this, let
be linear. Define
Then is a linear functional on . If , then
so
Thus
Conversely, if , define
This is well-defined because vanishes on .
29.15 Annihilators and Linear Equations
A subspace can often be described as the common zero set of linear functionals.
For example, in ,
is the kernel of the functional
Thus
The annihilator is the set of all linear functionals that vanish on this plane. Since the plane has dimension , its annihilator has dimension . Hence
This shows that annihilators encode systems of homogeneous linear equations.
29.16 Orthogonal Complements and Annihilators
In a finite-dimensional inner product space, a vector defines a functional
Under this identification, the annihilator of a subspace corresponds to its orthogonal complement:
The annihilator is more general because it does not require an inner product. Orthogonal complements depend on a chosen inner product. Annihilators depend only on the vector space and its dual.
29.17 Row Space and Null Space
For a matrix , the null space is the annihilator of the row space.
Let the rows of be
Then means
for every row .
Thus is annihilated by every row functional. In dual language,
after identifying row vectors with linear functionals on .
This is one of the fundamental relationships between the four matrix subspaces.
29.18 Column Space and Left Null Space
Similarly, the left null space of is the annihilator of the column space.
The left null space is
A vector lies in exactly when
Equivalently,
for every column of .
Thus defines a functional that vanishes on . Hence
29.19 Practical Computation
To compute for a subspace :
| Step | Operation |
|---|---|
| 1 | Put spanning vectors of as columns of a matrix |
| 2 | Write a general functional as |
| 3 | Solve , equivalently |
| 4 | Convert the solution vectors into functionals |
| 5 | The resulting functionals form a basis for |
This procedure reduces annihilator computation to a null space computation.
29.20 Summary
An annihilator is the set of all linear functionals that vanish on a given set or subspace. It is a subspace of the dual space.
The key ideas are:
| Concept | Meaning |
|---|---|
| Annihilator | |
| Ambient space | |
| Inclusion reversal | implies |
| Dimension formula | |
| Sum rule | |
| Intersection rule | in finite dimensions |
| Double annihilator | in finite dimensions |
| Quotient relation | |
| Matrix computation | is found by solving |
Annihilators express subspaces through the linear functionals that vanish on them. They provide a coordinate-free way to describe linear equations, quotient duals, orthogonal complements, and the relationships among row spaces, column spaces, and null spaces.