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.

252 LINEAR TRANSFORMATIONS CANONICAL FORMS<br />

Lemma 10.3.2 Let W be an A invariant (AW ⊆ W ) subspace of ker (φ (A) m ) for m a<br />

positive integer where φ (λ) is an irreducible monic polynomial of degree d. Thenifη (λ) is<br />

a monic polynomial of smallest degree such that for<br />

then<br />

x ∈ ker (φ (A) m ) \{0} ,<br />

η (A) x =0,<br />

η (λ) =φ (λ) k<br />

for some positive integer k. Thus if r is the degree of η, then r = kd. Also, for a cyclic set,<br />

β x ≡ { x, Ax, ··· ,A r−1 x }<br />

is linearly independent. Recall that r is the smallest such that A r x is a linear combination<br />

of { x, Ax, ··· ,A r−1 x } .<br />

Now let U be an A invariant subspace of ker (φ (A)) .<br />

If {v 1 , ··· ,v s } is a basis for W then if x ∈ U \ W,<br />

{v 1 , ··· ,v s ,β x }<br />

is linearly independent.<br />

There exist vectors x 1 , ··· ,x p each in U such that<br />

{v 1 , ··· ,v s ,β x1<br />

, ··· ,β xp<br />

}<br />

is a basis for<br />

U + W.<br />

Proof: Consider the first claim. If η (A) x =0, then writing<br />

φ (λ) m = η (λ) g (λ)+r (λ)<br />

where either r (λ) = 0 or the degree of r (λ) is less than that of η (λ) , the latter possibility<br />

cannot occur because if it did, r (A) x = 0 and this would contradict the definition of η (λ).<br />

Therefore r (λ) =0andsoη (λ) divides φ (λ) m . From Corollary 8.3.11,<br />

η (λ) =φ (λ) k<br />

for some integer, k ≤ m. Since x ≠0, it follows k>0. In particular, the degree of η (λ)<br />

equals kd.<br />

Now consider x ≠0,x ∈ ker (φ (A) m ) and the vectors β x . Do these vectors yield a<br />

linearly independent set? The vectors are { x, Ax, A 2 x, ··· ,A r−1 x } where A r x is in<br />

span ( x, Ax, A 2 x, ··· ,A r−1 x )<br />

and r is as small as possible for this to happen. Suppose then that there are scalars d j ,not<br />

all zero such that<br />

∑r−1<br />

d j A j x =0,x≠0. (10.3)<br />

j=0<br />

Suppose m is the largest nonzero scalar in the above linear combination. d m ≠0,m≤ r − 1.<br />

Then A m x is a linear combination of the preceeding vectors in the list, which contradicts<br />

the definition of r. Thus from the first part, r = kd for some positive integer k.

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

Saved successfully!

Ooh no, something went wrong!