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.

8.3. LOTS OF FIELDS 213<br />

Then, since the l i are independent, it follows that<br />

m∑<br />

f ji k j =0<br />

j=1<br />

and since {k j } is independent, each f ji = 0 for each j for a given arbitrary i. Therefore,<br />

{k j l i } is a basis. <br />

Theorem 8.3.22 The set of all equivalence classes G ≡ F/ (p (x)) described above with<br />

the multiplicative identity given by [1] and the additive identity given by [0] along with the<br />

operations of Definition 8.3.17, is a field and p ([x]) = [0] . (Thus p has a root in this new<br />

field.) In addition to this, [G : F] =n, thedegreeofp (x) .<br />

Proof: Everything is obvious except for the existence of the multiplicative inverse and<br />

the assertion that p ([x]) = 0. Suppose then that [a (x)] ≠[0]. That is, a (x) is not a multiple<br />

of p (x). Why does [a (x)] −1 exist? By Theorem 8.3.6, a (x) ,p(x) are relatively prime and<br />

so there exist polynomials ψ (x) ,φ(x) such that<br />

1=ψ (x) p (x)+a (x) φ (x)<br />

and so<br />

which, by definition implies<br />

1 − a (x) φ (x) =ψ (x) p (x)<br />

[1 − a (x) φ (x)] = [1] − [a (x) φ (x)] = [1] − [a (x)] [φ (x)] = [0]<br />

and so [φ (x)] = [a (x)] −1 . This shows G is a field.<br />

Now if p (x) =a n x n + a n−1 x n−1 + ···+ a 1 x + a 0 ,p([x]) = 0 by (8.7) and the definition<br />

which says [p (x)] = [0].<br />

Consider the claim about the dimension. It was just shown that [1] , [x] , [ x 2] , ··· , [x n ]<br />

is linearly dependent. Also [1] , [x] , [ x 2] , ··· , [ x n−1] is independent because if not, there<br />

would exist a polynomial q (x) ofdegreen−1 which is a multiple of p (x) which is impossible.<br />

Now for [q (x)] ∈ G, youcanwrite<br />

q (x) =p (x) l (x)+r (x)<br />

where the degree of r (x) is less than n or else it equals 0. Either way, [q (x)] = [r (x)] which<br />

is a linear combination of [1] , [x] , [ x 2] , ··· , [ x n−1] . Thus [G : F] =n as claimed. <br />

Note that if p (x) were not irreducible, then you could find a field extension G such that<br />

[G : F] ≤ n. You could do this by working with an irreducible factor of p (x).<br />

Usually, people simply write b rather than [b] ifb ∈ F. Then with this convention,<br />

[bφ (x)] = [b][φ (x)] = b [φ (x)] .<br />

This shows how to enlarge a field to get a new one in which the polynomial has a root.<br />

By using a succession of such enlargements, called field extensions, there will exist a field<br />

in which the given polynomial can be factored into a product of polynomials having degree<br />

one. The field you obtain in this process of enlarging in which the given polynomial factors<br />

in terms of linear factors is called a splitting field.

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

Saved successfully!

Ooh no, something went wrong!