Skip to content

Chapter 29. Annihilators

An annihilator is a subspace of the dual space consisting of all linear functionals that vanish on a given set of vectors. If VV is a vector space over a field FF, and SVS\subseteq V, then the annihilator of SS is

S0={φV:φ(s)=0 for all sS}. S^0=\{\varphi\in V^*:\varphi(s)=0 \text{ for all } s\in S\}.

The elements of S0S^0 are linear measurements that give zero on every vector in SS. When SS is a subspace, its annihilator records all linear equations that are satisfied by every vector in SS. The annihilator is always a subspace of VV^*.

29.1 Definition

Let VV be a vector space over FF. Let SVS\subseteq V. The annihilator of SS is

S0={φV:φ(s)=0 for every sS}. S^0=\{\varphi\in V^*:\varphi(s)=0 \text{ for every } s\in S\}.

The notation S0S^0 is common. Some books use SS^\circ or Ann(S)\operatorname{Ann}(S).

If UVU\subseteq V is a subspace, then U0U^0 is the set of all linear functionals on VV that vanish on UU.

Thus

U0V. U^0 \subseteq V^*.

The annihilator lives in the dual space, not in the original vector space.

29.2 First Example

Let

V=R2 V=\mathbb{R}^2

and let

U=span([10]). U=\operatorname{span} \left( \begin{bmatrix} 1\\ 0 \end{bmatrix} \right).

Then UU is the xx-axis.

A linear functional on R2\mathbb{R}^2 has the form

φ(x,y)=ax+by. \varphi(x,y)=ax+by.

For φ\varphi to vanish on UU, we need

φ(t,0)=0 \varphi(t,0)=0

for every tRt\in\mathbb{R}. But

φ(t,0)=at. \varphi(t,0)=at.

This is zero for every tt exactly when

a=0. a=0.

Therefore

U0={φ(x,y)=by:bR}. U^0=\{\varphi(x,y)=by:b\in\mathbb{R}\}.

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 SVS\subseteq V, the annihilator S0S^0 is a subspace of VV^*.

First, the zero functional belongs to S0S^0, because

0(s)=0 0(s)=0

for every sSs\in S.

Next, let

φ,ψS0. \varphi,\psi\in S^0.

Then for every sSs\in S,

(φ+ψ)(s)=φ(s)+ψ(s)=0+0=0. (\varphi+\psi)(s)=\varphi(s)+\psi(s)=0+0=0.

Thus

φ+ψS0. \varphi+\psi\in S^0.

For a scalar cc,

(cφ)(s)=cφ(s)=c0=0. (c\varphi)(s)=c\varphi(s)=c0=0.

Thus

cφS0. c\varphi\in S^0.

Therefore S0S^0 is a subspace of VV^*.

29.4 Extreme Cases

There are two useful extreme cases.

First,

{0}0=V. \{0\}^0=V^*.

Every linear functional sends the zero vector to zero, so every functional vanishes on {0}\{0\}.

Second,

V0={0}. V^0=\{0\}.

The only linear functional that vanishes on every vector of VV 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

STV, S\subseteq T\subseteq V,

then

T0S0. T^0\subseteq S^0.

Indeed, if a functional vanishes on all of TT, then it certainly vanishes on all of SS. Thus it belongs to S0S^0.

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:

S0=(spanS)0. S^0=(\operatorname{span} S)^0.

If a functional vanishes on every vector of SS, then by linearity it vanishes on every linear combination of vectors from SS. Hence it vanishes on spanS\operatorname{span} S.

Conversely, if it vanishes on spanS\operatorname{span} S, then it vanishes on SS, since

SspanS. S\subseteq \operatorname{span} S.

Therefore the annihilator depends only on the subspace generated by the set.

29.7 Computing an Annihilator in Coordinates

Let URnU\subseteq \mathbb{R}^n be spanned by columns of a matrix

A=[u1u2uk]. A= \begin{bmatrix} |&|&&|\\ u_1&u_2&\cdots&u_k\\ |&|&&| \end{bmatrix}.

A functional φ(Rn)\varphi\in(\mathbb{R}^n)^* can be represented by a row vector

yT. y^T.

The condition φ(ui)=0\varphi(u_i)=0 for every ii becomes

yTui=0. y^Tu_i=0.

Equivalently,

yTA=0. y^TA=0.

Transposing,

ATy=0. A^Ty=0.

Thus the annihilator of the column space of AA corresponds to the null space of ATA^T:

(Col(A))0Null(AT). (\operatorname{Col}(A))^0 \cong \operatorname{Null}(A^T).

This is the coordinate form of the left null space.

29.8 Example in R3\mathbb{R}^3

Let

U=span([110],[011])R3. U=\operatorname{span} \left( \begin{bmatrix} 1\\ 1\\ 0 \end{bmatrix}, \begin{bmatrix} 0\\ 1\\ 1 \end{bmatrix} \right) \subseteq \mathbb{R}^3.

A linear functional has the form

φ(x,y,z)=ax+by+cz. \varphi(x,y,z)=ax+by+cz.

We require

φ(1,1,0)=0 \varphi(1,1,0)=0

and

φ(0,1,1)=0. \varphi(0,1,1)=0.

These give

a+b=0, a+b=0, b+c=0. b+c=0.

Hence

a=b,c=b. a=-b, \qquad c=-b.

Let

b=t. b=t.

Then

(a,b,c)=(t,t,t)=t(1,1,1). (a,b,c)=(-t,t,-t)=t(-1,1,-1).

Therefore

U0=span{φ(x,y,z)=x+yz}. U^0= \operatorname{span} \{\varphi(x,y,z)=-x+y-z\}.

The annihilator is one-dimensional. This agrees with the dimension formula:

dimU0=32=1. \dim U^0=3-2=1.

29.9 Dimension Formula

If VV is finite-dimensional and UVU\subseteq V is a subspace, then

dimU0=dimVdimU. \dim U^0=\dim V-\dim U.

The number on the right is the codimension of UU in VV. Thus

dimU0=codimU. \dim U^0=\operatorname{codim} U.

An annihilator contains one independent linear condition for each direction missing from UU. Equivalently, it measures how many independent functionals can vanish on UU.

29.10 Proof of the Dimension Formula

Let

dimV=n,dimU=k. \dim V=n, \qquad \dim U=k.

Choose a basis of UU:

u1,,uk. u_1,\ldots,u_k.

Extend it to a basis of VV:

u1,,uk,vk+1,,vn. u_1,\ldots,u_k,v_{k+1},\ldots,v_n.

Let the dual basis be

u1,,uk,vk+1,,vn. u^1,\ldots,u^k,v^{k+1},\ldots,v^n.

A functional in U0U^0 must vanish on

u1,,uk. u_1,\ldots,u_k.

The dual basis functionals

vk+1,,vn v^{k+1},\ldots,v^n

vanish on all of UU, and they form a basis of U0U^0. There are nkn-k of them.

Therefore

dimU0=nk=dimVdimU. \dim U^0=n-k=\dim V-\dim U.

29.11 Annihilator of a Sum

If UU and WW are subspaces of VV, then

(U+W)0=U0W0. (U+W)^0=U^0\cap W^0.

A functional vanishes on U+WU+W exactly when it vanishes on every vector of UU and every vector of WW.

Indeed, if

φ(U+W)0, \varphi\in (U+W)^0,

then UU+WU\subseteq U+W and WU+WW\subseteq U+W, so

φU0W0. \varphi\in U^0\cap W^0.

Conversely, if

φU0W0, \varphi\in U^0\cap W^0,

then for any

u+wU+W, u+w\in U+W,

we have

φ(u+w)=φ(u)+φ(w)=0. \varphi(u+w)=\varphi(u)+\varphi(w)=0.

Thus

φ(U+W)0. \varphi\in (U+W)^0.

29.12 Annihilator of an Intersection

For finite-dimensional spaces,

(UW)0=U0+W0. (U\cap W)^0=U^0+W^0.

This identity is dual to the previous one. The annihilator changes intersections into sums and sums into intersections.

The inclusion

U0+W0(UW)0 U^0+W^0\subseteq (U\cap W)^0

is immediate: if a functional vanishes on UU, and another vanishes on WW, 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 VV is finite-dimensional and UVU\subseteq V, then

U00=U, U^{00}=U,

after identifying VV with its double dual VV^{**}.

Here

U00 U^{00}

means the annihilator of U0U^0 inside VV^{**}. Under the natural identification

VV, V\cong V^{**},

it returns the original subspace UU.

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

(V/U)U0. (V/U)^*\cong U^0.

A functional on the quotient V/UV/U is the same as a functional on VV that vanishes on UU.

To see this, let

λ:V/UF \lambda:V/U\to F

be linear. Define

φ(v)=λ(v+U). \varphi(v)=\lambda(v+U).

Then φ\varphi is a linear functional on VV. If uUu\in U, then

u+U=U, u+U=U,

so

φ(u)=λ(U)=0. \varphi(u)=\lambda(U)=0.

Thus

φU0. \varphi\in U^0.

Conversely, if φU0\varphi\in U^0, define

λ(v+U)=φ(v). \lambda(v+U)=\varphi(v).

This is well-defined because φ\varphi vanishes on UU.

29.15 Annihilators and Linear Equations

A subspace can often be described as the common zero set of linear functionals.

For example, in R3\mathbb{R}^3,

U={(x,y,z):x+y+z=0} U=\{(x,y,z):x+y+z=0\}

is the kernel of the functional

φ(x,y,z)=x+y+z. \varphi(x,y,z)=x+y+z.

Thus

U=kerφ. U=\ker \varphi.

The annihilator U0U^0 is the set of all linear functionals that vanish on this plane. Since the plane has dimension 22, its annihilator has dimension 11. Hence

U0=span(φ). U^0=\operatorname{span}(\varphi).

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 aVa\in V defines a functional

φa(v)=v,a. \varphi_a(v)=\langle v,a\rangle.

Under this identification, the annihilator of a subspace corresponds to its orthogonal complement:

U0U. U^0 \cong U^\perp.

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 AA, the null space is the annihilator of the row space.

Let the rows of AA be

r1,,rm. r_1,\ldots,r_m.

Then xNull(A)x\in \operatorname{Null}(A) means

rix=0 r_i x=0

for every row rir_i.

Thus xx is annihilated by every row functional. In dual language,

Null(A)=Row(A)0, \operatorname{Null}(A) = \operatorname{Row}(A)^0,

after identifying row vectors with linear functionals on FnF^n.

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 AA is the annihilator of the column space.

The left null space is

Null(AT). \operatorname{Null}(A^T).

A vector yFmy\in F^m lies in Null(AT)\operatorname{Null}(A^T) exactly when

ATy=0. A^Ty=0.

Equivalently,

yTa=0 y^Ta=0

for every column aa of AA.

Thus yy defines a functional that vanishes on Col(A)\operatorname{Col}(A). Hence

Null(AT)Col(A)0. \operatorname{Null}(A^T) \cong \operatorname{Col}(A)^0.

29.19 Practical Computation

To compute U0U^0 for a subspace UFnU\subseteq F^n:

StepOperation
1Put spanning vectors of UU as columns of a matrix AA
2Write a general functional as yTy^T
3Solve yTA=0y^TA=0, equivalently ATy=0A^Ty=0
4Convert the solution vectors yy into functionals yTxy^Tx
5The resulting functionals form a basis for U0U^0

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:

ConceptMeaning
AnnihilatorS0={φ:φ(s)=0 for all sS}S^0=\{\varphi:\varphi(s)=0\text{ for all }s\in S\}
Ambient spaceS0VS^0\subseteq V^*
Inclusion reversalSTS\subseteq T implies T0S0T^0\subseteq S^0
Dimension formuladimU0=dimVdimU\dim U^0=\dim V-\dim U
Sum rule(U+W)0=U0W0(U+W)^0=U^0\cap W^0
Intersection rule(UW)0=U0+W0(U\cap W)^0=U^0+W^0 in finite dimensions
Double annihilatorU00=UU^{00}=U in finite dimensions
Quotient relation(V/U)U0(V/U)^*\cong U^0
Matrix computationU0U^0 is found by solving ATy=0A^Ty=0

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.