Let be the finite field of elements.

  • When , show that , there exists some (including the zero element), such that .
  • Show that the above assertion is true for any .

\begin{proof} It suffices to show the second argument. Assume that the characteristic of is .

When , note that the Frobenius map is an field automorphism. Then for any , there exists such that and so .

Now consider the case of . Since is a cyclic group of order , there exists such that and so is a set of square elements. In addition, is also a square element, thus there are elements of square elements. For any , define

By the argument above, there is . Since , there exists where . It deduces that . By the arbitrary of , we finish the proof. \end{proof}

In the following exercises, means the fractional field of (here is the polynomial ring with a transcendental variable ).

6. Let with and relatively prime in and consider the extension of by .

  • (a) is algebraic over and . (Hint: is a root of the nonzero polynomial ; show that has degree . Show that is irreducible as follows: Since is transcendental over (why?) we may for convenience replace by ( an indeterminate) and consider . By Lemma III. is irreducible in provided it is irreducible in . The truth of this latter condition follows from the fact that is linear in and are relatively prime.)
  • (b) If is an intermediate field, then is finite.
  • (c) The assignment induces a homomorphism such that . is a automorphism of if and only if .
  • (d) consists of all those automorphisms induced (as in (c)) by the assignment , where and .

\begin{proof} a) To show is algebraic over , it suffices to show there exists such that . Define , then and so is algebraic. Notice that , thus to show it remains to show is irreducible in .

If is algebraic over , then there exists a polynomial with such that . It deduces that is a root of , which contradicts with transcendental. Therefore, is transcendental over . By Lemma 6.13 of Hungerford, to show is irreducible in , it suffices to show is irreducible in .

Assume that is reducible in , then there exist such that . Since is linear in , WLOG we assume and where . It deduces that and , which is impossible as . Therefore, is irreducible in . Now we finish the proof.

b) Take , then by a) . Since , we have .

c) Note that . If is a -automorphism, then and so . By a), we have . Conversely, if , then by a). It is easy to verify , then and so is an -automorphism.

d) For any , and so is defined as . By c), if is a -automorphism, then . If one of has degree , then are not relatively prime in . Thus . Assume that and . Since they are relatively prime, there is and . Therefore, consists of all those automorphisms induced by the assignment , where and . \end{proof}

Hungerford GTM Algebra.pdf