Math 520B
Written Assignment No. 1

due Friday, September 16, 2005

Directions. It is intended that you work these as exercises. Although you may refer to books for definitions and standard theorems, searching for solutions to these written exercises either in books or in online references should not be required and is undesirable. If you make use of a reference other than class notes, you must properly cite that use. You may not seek help from others.


  1. Let K be the splitting field over Q of the polynomial t8-1, and let L=K218.

    1. Show that L is the splitting field of t8-2 over Q.

    2. Find the Galois group of K over Q.

    3. Find the Galois group of L over K.

    4. Find the Galois group of L over Q.

  2. Let K be a field, L a (finite) Galois extension of K, G the Galois group, and R=KG the group ring of G with coefficients in K. Observe that L and R have the same dimension as vector spaces over K.

    1. Show that there is an obvious R-module structure on L.

    2. Formulate in terms of the study of L as an extension of K without reference to the notion of group ring what it means for L to be isomorphic as an R-module to R.

  3. How small can a non-commutative ring be? Prove the following:

    1. Every ring R with |R|7 is commutative.

    2. If F2=Z/2Z is the field of 2 elements, there is a subring of the 2×2 matrix ring M2F2 over F2 that is non-commutative and has 8 elements.

  4. In Hungerford's text at p. 227, Defn. 7.1, an “algebra” A over a commutative ring K is defined to be a ring A, not necessarily commutative, that is also a K-module where it is required that the K-module structure K×A·A is related to the ring multiplication of A by the formulae k·a1a2=k·a1a2=a1k·a2.

    Prove that there is a ring homomorphism KφA such that for all kK and aA one has k·a=φka=aφk. (Be sure to begin by defining φ.)

  5. Let F be any field, and let L=Ft1,,tn be the field of rational functions in n variables over F. Find a subfield K of L with the property that L is a cyclic extension of K of degree n.