06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

248 LINEAR TRANSFORMATIONS CANONICAL FORMS<br />

10.2 Direct Sums, Block Diagonal Matrices<br />

Let V be a finite dimensional vector space with field of scalars F. Here I will make no<br />

assumption on F. Also suppose A ∈L(V,V ) .<br />

Recall Lemma 9.4.3 which gives the existence of the minimal polynomial for a linear<br />

transformation A. This is the monic polynomial p which has smallest possible degree such<br />

that p(A) =0. It is stated again for convenience.<br />

Lemma 10.2.1 Let A ∈L(V,V ) where V is a finite dimensional vector space of dimension<br />

n with field of scalars F. Then there exists a unique monic polynomial of the form<br />

p (λ) =λ m + c m−1 λ m−1 + ···+ c 1 λ + c 0<br />

such that p (A) =0and m is as small as possible for this to occur.<br />

Now here is a useful lemma which will be used below.<br />

Lemma 10.2.2 Let L ∈L(V,V ) where V is an n dimensional vector space. Then if L<br />

is one to one, it follows that L is also onto. In fact, if {v 1 , ··· ,v n } is a basis, then so is<br />

{Lv 1 , ··· ,Lv n }.<br />

Proof: Let {v 1 , ··· ,v n } be a basis for V . Then I claim that {Lv 1 , ··· ,Lv n } is also a<br />

basis for V . First of all, I show {Lv 1 , ··· ,Lv n } is linearly independent. Suppose<br />

Then<br />

and since L is one to one, it follows<br />

n∑<br />

c k Lv k =0.<br />

k=1<br />

( n<br />

)<br />

∑<br />

L c k v k =0<br />

k=1<br />

n∑<br />

c k v k =0<br />

k=1<br />

which implies each c k = 0. Therefore, {Lv 1 , ··· ,Lv n } is linearly independent. If there<br />

exists w not in the span of these vectors, then by Lemma 8.2.10, {Lv 1 , ··· ,Lv n ,w} would<br />

be independent and this contradicts the exchange theorem, Theorem 8.2.4 because it would<br />

be a linearly independent set having more vectors than the spanning set {v 1 , ··· ,v n } . <br />

Now it is time to consider the notion of a direct sum of subspaces. Recall you can<br />

always assert the existence of a factorization of the minimal polynomial into a product of<br />

irreducible polynomials. This fact will now be used to show how to obtain such a direct<br />

sum of subspaces.<br />

Definition 10.2.3 For A ∈L(V,V ) where dim (V )=n, suppose the minimal polynomial<br />

is<br />

q∏<br />

p (λ) = (φ k (λ)) r k<br />

k=1<br />

where the polynomials φ k have coefficients in F and are irreducible. Now define the generalized<br />

eigenspaces<br />

V k ≡ ker ((φ k (A)) r k<br />

)<br />

Note that if one of these polynomials (φ k (λ)) r k<br />

is a monic linear polynomial, then the generalized<br />

eigenspace would be an eigenspace.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!