Exercise 11.1.9

Let f [ x ] be monic and irreducible, and let α be a root of f . Then let f ¯ 𝔽 p [ x ] be the reduction of f modulo the prime p , and let p , f be as in (11.4):

p , f = pℤ [ x ] + fℤ [ x ] = { pR ( x ) + f ( x ) S ( x ) | R ( x ) , S ( x ) [ x ] } .

(a)
Prove that the map q ( x ) + fℤ [ x ] q ( α ) is a well-defined ring isomorphism [ x ] fℤ [ x ] [ α ] .

(b)
Use Exercise 8 to prove that [ x ] p , f [ α ] pℤ [ α ] .
(c)
Similarly prove that [ x ] p , f 𝔽 p [ x ] f ¯ .

Answers

Proof.

(a)
If q 1 , q 2 [ x ] are such that q 1 ( x ) + fℤ [ x ] = q 2 ( x ) + fℤ [ x ] , then there exist u 1 , u 2 [ x ] such that q 1 ( x ) + f ( x ) u 1 ( x ) = q 2 ( x ) + f ( x ) u 2 ( x ) . Since f ( α ) = 0 , then q 1 ( α ) = q 2 ( α ) , so the map φ : { [ x ] fℤ [ x ] [ α ] q ( x ) + fℤ [ x ] q ( α )

is well defined.

Let q ~ = q ( x ) + fℤ [ x ] , r ~ = r ( x ) + fℤ [ x ] be elements of [ x ] fℤ [ x ] . Then

φ ( q ~ ) + φ ( r ~ ) = q ( α ) + r ( α ) = ( q + r ) ( α ) = φ ( q ( x ) + r ( x ) + fℤ [ x ] ) = φ ( q ~ + r ~ ) .

Similarly, φ ( q ~ ) φ ( r ~ ) = φ ( q ~ r ~ ) , and φ ( 1 ~ ) = 1 , so φ is a ring homomorphism.

If φ ( q ~ ) = 0 , then q ( α ) = 0 . As f is the minimal polynomial of α over , f divides q in [ x ] , so q = uf , where u [ x ] . But f is a monic polynomial in [ x ] , so the algorithm of the Euclidean division gives a quotient u [ x ] , therefore q fℤ [ x ] , and q ~ = 0 . ker ( φ ) = { 0 ~ } , so φ is injective.

Any element z of [ α ] is of the form z = q ( α ) , q [ x ] , so z = q ( α ) = φ ( q ~ ) : φ is surjective.

φ is a ring isomorphism:

[ x ] fℤ [ x ] [ α ] .

(b)
Let R be the ring [ x ] , and I = pℤ [ x ] , J = fℤ [ x ] be the principal ideals of [ x ] generated by p and f . By Exercise 8, I ¯ = { r + J | r I } = { pq ( x ) + fℤ [ x ] | q ( x ) [ x ] }

is an ideal of [ x ] fℤ [ x ] , and

[ x ] p , f = [ x ] ( pℤ [ x ] + fℤ [ x ] ) ( [ x ] fℤ [ x ] ) I ¯ .

The isomorphism φ of part (a) sends [ x ] fℤ [ x ] on [ α ] and the ideal I ¯ on pℤ [ α ] , since φ ( pq ( x ) + fℤ [ x ] ) = pq ( α ) for all q [ x ] .

Therefore ( [ x ] fℤ [ x ] ) I ¯ [ α ] pℤ [ α ] , so

[ x ] p , f [ α ] pℤ [ α ] .

(c)
If we switch I , J , then by Exercise 8, R ( I + J ) = R ( J + I ) ( R I ) J ¯ , where J ¯ = { s + I | s J } = { f ( x ) v ( x ) + pℤ [ x ] | v ( x ) [ x ] } ,

so

[ x ] p , f ( [ x ] pℤ [ x ] ) J ¯ .

Let

ψ : { [ x ] pℤ [ x ] 𝔽 p [ x ] u + pℤ [ x ] u ¯ ,

where u ¯ is the reduction of u [ x ] modulo the prime p .

As in part (a), ψ is a well-defined ring isomorphism, and ψ sends J ¯ on f ¯ , since for all v ( x ) [ x ] , ψ ( f ( x ) v ( x ) + pℤ [ x ] ) = f ¯ v ¯ , and v ¯ takes all possible values in 𝔽 p [ x ] when v [ x ] . Therefore ( [ x ] pℤ [ x ] ) J ¯ 𝔽 p [ x ] f ¯ , so

[ x ] p , f 𝔽 p [ x ] f ¯ .

Finally, if α is a root of the irreducible polynomial f [ x ] ,

[ α ] pℤ [ α ] 𝔽 p [ x ] f ¯ ,

and so [ α ] pℤ [ α ] is a finite field. □

User profile picture
2022-07-19 00:00
Comments