Scribd
Upload
711 views

Annihilators: Linear Algebra Notes: Satya Mandal September 21, 2005

This document contains notes on linear algebra concepts including: 1. The definition of the annihilator of a subset S of a vector space V as the set of linear functionals in the dual space V* that map all elements of S to 0. 2. Properties of annihilators including that the annihilator of S is a subspace of V* and the annihilator of the span of S is equal to the annihilator of S. 3. The identification of two different annihilators of a subset S of the dual space V* - one as a subspace of the double dual space V** and one as a subspace of V, and a proof that these

Uploaded by

Cherry Mae Balingit
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
711 views

Annihilators: Linear Algebra Notes: Satya Mandal September 21, 2005

This document contains notes on linear algebra concepts including: 1. The definition of the annihilator of a subset S of a vector space V as the set of linear functionals in the dual space V* that map all elements of S to 0. 2. Properties of annihilators including that the annihilator of S is a subspace of V* and the annihilator of the span of S is equal to the annihilator of S. 3. The identification of two different annihilators of a subset S of the dual space V* - one as a subspace of the double dual space V** and one as a subspace of V, and a proof that these

Uploaded by

Cherry Mae Balingit
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Annihilators : Linear Algebra Notes

Satya Mandal
September 21, 2005

Let F be a filed and V be vector space over F with dim(V ) = n <


∞. As usual V ∗ will denote the dual space of V and V ∗∗ = (V ∗ )∗ .

1. Definition 0.1 For a subset S ⊆ V define the annihilator

ann(S) = {f ∈ V ∗ : f (v) = 0 f or allv ∈ S}.

We also use the notation S 0 = ann(S).


We may also, temporarily, use the notation

ann(V ∗ : S) = ann(S)

to underscore the fact that ann(V ∗ : S) is a subspece of V ∗ .

2. First note that for S ⊆ V, the annihilator ann(S) ⊆ V ∗ is a


subspace of the dual space.

3. Also note for S ⊆ V, if W = Span(S) then

ann(S) = ann(W ).

4. Now let S ⊆ V ∗ . Then according to above definition, annihi-


lator of S is ann(S) = ann(V ∗∗ : S) is a subspace of V ∗∗ .
In this case, there is another natural annihilator of S as a
subspace of V as follows:

ann(V : S) = {v ∈ V : f (v) = 0 f or all f ∈ S}.

1
It is possible to mix up two annihilator of S. The first one is
a subspace of the double dual V ∗∗ and the second one is the
subspace of V.
We will justify that these two annihilators are same
via the natural identification of V and V ∗∗ .
∼
5. Let L : V → V ∗∗ be the natural isomorphism.

6. Let S ⊆ V ∗ . Then

L(ann(V : S)) = ann(V ∗∗ : S).

Proof. Let v ∈ ann(V : S). Then f (v) = 0 for all f ∈ S.


Hence L(v)(f ) = f (v) = 0 for all f ∈ S.
So, L(v) ∈ ann(V ∗∗ : S). Therefore

L(ann(V : S)) ⊆ ann(V ∗∗ : S).

Now let G ∈ ann(V ∗∗ : S). Since L is an isomorphism, we have


G = L(v) for some v ∈ V. We need to show that v ∈ ann(V :
S). But for f ∈ S we have 0 = G(f ) = L(v)(f ) = f (v).
Therefore v ∈ ann(V : S). So,

ann(V ∗∗ : S) ⊆ L(ann(V : S)).

Hence the proof is complete.

7. Now, for a subspace W ⊆ V, the annihilator W 0 = ann(V : W )


has two annihilators. They are ann(V : W 0 ) and ann(V ∗∗ :
W 0 ).
It follows from above that

L(ann(V : W 0 )) = ann(V ∗∗ : W 0 ).

Since, L is a linear isomorphism, we also have

dim(ann(V : W 0 )) = dim(ann(V ∗∗ : W 0 )).

2
8. Theorem 0.1 For a subspace W ⊆ V, we have

W = ann(V : ann(V, W ))

also written as
W = W 00 .

Proof. Write U = ann(V : ann(V : W )). It is easy to see


that W ⊆ U. Therefore, it is enough to show that dim(W ) =
dim(U ). We have

dim(W ) + dim(ann(V : W )) = dim(V ).

Also, by the same theorem,

dim(ann(V : W ))+dim(ann(V ∗∗ : ann(V, W )) = dim(V ∗∗ ) = dim(V ).

It follows that

dim(W ) = dim(ann(V ∗∗ : ann(V, W )) = dim(ann(V : ann(V : W )) = dim(U ).

So the proof is complete.

3
Lemma 0.1 Suppose V is vector space of finite dimension, dim V =
n, over F. Let f, g ∈ V ∗ be two linear functionals. let Nf be the null
space of f and Ng be the null space of g.
Then, Nf ⊆ Ng if and only if g = cf for some c ∈ F.

Proof. (⇐:) Obvious.


(⇒:) If g = 0 then g = cf with c = 0. So, we assume that g 6= 0. So,
dim(Ng ) = n−1. Since Nf ⊆ Ng , we have f 6= 0 and dim(Nf ) = n−1.
Therefore, Nf = Ng = N (say).
Now, pick e ∈ / N. Since dim(V ) = n, it follows that V = N + Fe.
Also, f (e) 6= 0 and g(e) 6= 0. Write c = g(e)/f (e). Claim that

g = cf.

First note, g(e) = cf (e). Now, for x ∈ V, we have x = y + λe for


some y ∈ N and λ ∈ F. Therefore

g(x) = g(y) + λg(e) = λg(e) = λcf (e) = c(f (y + λe)) = cf (x).

So, the proof is complete.

4
Following is Theorem 20, page 110.
Theorem 0.2 Suppose V is vector space of finite dimension, dim V =
n, over F. Let g, f1 , . . . , fr ∈ V ∗ be linear functionals. Let N be the
null space of g and Ni be the null space of fi .
P
Then, N1 ∩ N2 ∩ · · · ∩ Nr ⊆ N if and only if g = ri=1 ci fi for
some ci ∈ F.

Proof. (⇐:) Obvious.


(⇒:) We use induction on r to prove this part. Case r = 1, is the
above Lemma 0.1.
Now, we assume the validity of the thoerem for r − 1 functionals
and prove it for r. Write V 0 = Nr .
Let
g 0 = G|V 0 , f10 = (f1 )|V 0 , . . . , fr−1
0
= (fr−1 )|V 0 ,
be the restrictions of the respective functionals to V 0 . Induction ap-
plies for these functionals and it follows that
X
r−1
0
g = ci fi0
i=1

for some ci ∈ F. This means, for all x ∈ V 0 = Nr , we have


X
r−1
g(x) = ci fi (x).
i=1

This means, for all x ∈ V 0 = Nr , we have


X
r−1
g(x) = ci fi (x).
i=1

Write
X
r−1
h=g− ci fi .
i=1
Then Nr = V 0 ⊆ N ull − Space(h). By the case r = 1 (or by
Lemma 0.1) It follows that h = cr fr for some cr ∈ F. Hence
X
r−1 X
r
g= ci fi + h = ci fi
i=1 i=1

and the proof is complete.

You might also like