2017 Spring Qualifying Exam in Algebra (AI-generated)
Problem 1.
Suppose
Proof.
Since
Thus
Suppose
elements of
Problem 2.
Prove that the additive group
Proof.
Define
Then
The first isomorphism theorem therefore gives
Problem 3.
Let
(a) Show that every prime element is irreducible.
(b) Show that in a UFD every irreducible element is prime.
Proof.
(a) Suppose
Cancellation in the domain gives
(b) Let
Problem 4.
Let
Proof.
Let
and similarly
Pure tensors generate the tensor product, so
Problem 5.
Let
be the dihedral group of order
(a) Compute its center.
(b) Compute its commutator subgroup.
(c) Compute its conjugacy classes.
Proof.
(a) A rotation
(b) The defining relation gives
Also
(c) The conjugacy classes are
They have total size
Problem 6.
Let
Proof.
Let
generate
Comparing first coordinates gives
Thus
Problem 7.
(a) Find
(b) Find
(c) Find
Proof.
(a) Take
Its splitting field is
(b) Take
It is irreducible by Eisenstein's criterion. Its discriminant is
(c) Let
The splitting field
The two Galois extensions are linearly disjoint, so the splitting field of
Problem 8.
Suppose
Proof.
The perfectness assumption is necessary: without it, an irreducible inseparable polynomial gives a quotient that is a field although the polynomial is not separable.
Factor
where
This is a product of fields exactly when every
Over a perfect field every irreducible polynomial is separable, so
Problem 9.
Let
(a) Show that all matrices
(b) Show that they all have the same minimal polynomial, and find it.
Proof.
Since
Thus the minimal polynomial of
The only eigenvalue is
The minimal polynomial has degree at most
Problem 10.
Let
(a) Show that
(b) Find a generator
(c) Express the roots of
Proof.
Let
Set
Then
and hence
Therefore
The roots of
They all lie in
