11.07.2015 Views

Abstract Algebra Theory and Applications - Computer Science ...

Abstract Algebra Theory and Applications - Computer Science ...

Abstract Algebra Theory and Applications - Computer Science ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

20.1 STRUCTURE OF A FINITE FIELD 349Proof. Let f(x) = x pn −x <strong>and</strong> let F be the splitting field of f(x). Then byLemma 20.4, f(x) has p n distinct zeros in F , since f ′ (x) = p n x pn−1 −1 = −1is relatively prime to f(x). We claim that the roots of f(x) form a subfieldof F . Certainly 0 <strong>and</strong> 1 are zeros of f(x). If α <strong>and</strong> β are zeros of f(x),then α + β <strong>and</strong> αβ are also zeros of f(x), since α pn + β pn = (α + β) pn<strong>and</strong> α pn β pn = (αβ) pn . We also need to show that the additive inverse <strong>and</strong>the multiplicative inverse of each root of f(x) are roots of f(x). For anyzero α of f(x), −α = (p − 1)α is also a zero of f(x). If α ≠ 0, then(α −1 ) pn = (α pn ) −1 = α −1 . Since the zeros of f(x) form a subfield of F <strong>and</strong>f(x) splits in this subfield, the subfield must be all of F .Let E be any other field of order p n . To show that E is isomorphicto F , we must show that every element in E is a root of f(x). Certainly0 is a root of f(x). Let α be a nonzero element of E. The order of themultiplicative group of nonzero elements of E is p n − 1; hence, α pn−1 = 1or α pn − α = 0. Since E contains p n elements, E must be a splitting fieldof f(x); however, by Corollary 19.20, the splitting field of any polynomial isunique up to isomorphism.□The unique finite field with p n elements is called the Galois field oforder p n . We will denote this field by GF(p n ).Theorem 20.6 Every subfield of the Galois field GF(p n ) has p m elements,where m divides n. Conversely, if m | n for m > 0, then there exists aunique subfield of GF(p n ) isomorphic to GF(p m ).Proof. Let F be a subfield of E = GF(p n ). Then F must be a fieldextension of K that contains p m elements, where K is isomorphic to Z p .Then m | n, since [E : K] = [E : F ][F : K].To prove the converse, suppose that m | n for some m > 0. Then p m − 1divides p n −1. Consequently, x pm−1 −1 divides x pn−1 −1. Therefore, x pm −xmust divide x pn − x, <strong>and</strong> every zero of x pm − x is also a zero of x pn − x.Thus, GF(p n ) contains, as a subfield, a splitting field of x pm −x, which mustbe isomorphic to GF(p m ).□Example 2. The lattice of subfields of GF(p 24 ) is given inFigure 20.1.With each field F we have a multiplicative group of nonzero elements ofF which we will denote by F ∗ . The multiplicative group of any finite fieldis cyclic. This result follows from the more general result that we will provein the next theorem.

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

Saved successfully!

Ooh no, something went wrong!