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.

450 FIELDS AND FIELD EXTENSIONS<br />

Theorem F.2.3 Let p (x) ≡ a n x n + a n−1 x n−1 + ···+ a 1 x + a 0 be any complex polynomial,<br />

n ≥ 1,a n ≠0. Then it has a complex root. Furthermore, there exist complex numbers<br />

z 1 , ··· ,z n such that<br />

p (x) =a n<br />

n ∏<br />

k=1<br />

(x − z k )<br />

Proof: First suppose a n =1. Consider the polynomial<br />

q (x) ≡ p (x) p (x)<br />

this is a polynomial and it has real coefficients. This is because it equals<br />

(<br />

x n + a n−1 x n−1 + ···+ a 1 x + a 0<br />

)<br />

·<br />

(<br />

x n + a n−1 x n−1 + ···+ a 1 x + a 0<br />

)<br />

The x j+k term of the above product is of the form<br />

and<br />

a k x k a j x j + a k x k a j x j = x k+j (a k a j + a k a j )<br />

a k a j + a k a j = a k a j + a k a j<br />

so it is of the form of a complex number added to its conjugate. Hence q (x) has real<br />

coefficients as claimed. Therefore, by by Lemma F.2.2 it has a complex root z. Hence either<br />

p (z) =0orp (z) =0. Thusp (x) has a complex root.<br />

Next suppose a n ≠0. Then simply divide by it and get a polynomial in which a n =1.<br />

Denote this modified polynomial as q (x). Then by what was just shown and the Euclidean<br />

algorithm, there exists z 1 ∈ C such that<br />

q (x) =(x − z 1 ) q 1 (x)<br />

where q 1 (x) has complex coefficients. Now do the same thing for q 1 (x) to obtain<br />

and continue this way. Thus<br />

q (x) =(x − z 1 )(x − z 2 ) q 2 (x)<br />

p (x)<br />

a n<br />

=<br />

n∏<br />

(x − z j ) <br />

j=1<br />

Obviously this is a harder proof than the other proof of the fundamental theorem of<br />

algebra presented earlier. However, this is a better proof. Consider the algebraic numbers<br />

A consisting of the real numbers which are roots of some polynomial having rational<br />

coefficients. By Theorem 8.3.32 they are a field. Now consider the field A + iA with the<br />

usual conventions for complex arithmetic. You could repeat the above argument with small<br />

changes and conclude that every polynomial having coefficients in A + iA has a root in<br />

A + iA. Recall from Problem 41 on Page 223 that A is countable and so this is also the case<br />

for A + iA. Thus this gives an algebraically complete field which is countable and so very<br />

different than C. Of course there are other situations in which the above harder proof will<br />

work and yield interesting results.

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

Saved successfully!

Ooh no, something went wrong!