2010 Spring Qualifying Exam in Algebra (AI-generated)
Problem 1.
Classify all groups of order
Proof.
Let
so the Sylow
where
Since
the image of the action
If
Thus the four groups are
and
The first two are abelian, and the last two are nonabelian.
Problem 2.
Determine whether each statement is true or false.
(a)
(b) The center
(c) The map
Proof.
(a) False. Conjugating
(b) True. If
(c) False. In general,
need not equal
Problem 3.
Let
(a) Show that
(b) Factor the ideal
Proof.
(a) In
Use the norm
There are no elements of norm
(b) Put
Each quotient is respectively
Therefore
Problem 4.
For every positive integer
is irreducible over
Proof.
Irreducibility is unchanged by translation, so consider
Every intermediate binomial coefficient
is even. Thus every nonleading coefficient of
which is not divisible by
Problem 5.
Let
Proof.
The minimal polynomial of a nilpotent operator is
Equivalently, in Jordan form every nilpotent block has size at most
Problem 6.
Construct the character table of the dihedral group
Proof.
Write
Its conjugacy classes are
There are four linear characters because the abelianization is
The squared degrees sum to
Problem 7.
Determine whether each quotient is a field:
Proof.
Over
A cubic is reducible if and only if it has a root, so the polynomial is irreducible and the quotient is a field, namely
Over
Thus the polynomial is reducible and its ideal is not maximal. The quotient is not a field.
Problem 8.
List one representative of each similarity class of matrices
Proof.
The Jordan form must be unchanged when every nonzero eigenvalue is replaced by its reciprocal. The complete list is
and the family
where parameters
Problem 9.
Determine the splitting field and Galois group of
Proof.
Let
The polynomial is Eisenstein at
Define
Then
so
The complete subgroup--fixed-field correspondence is
The subgroup lattice has
Problem 10.
Find one representative of each similarity class of rational matrices with characteristic polynomial
Proof.
Factor
The factor
representatives are
and
Their distinct invariant-factor data show that they are pairwise nonsimilar and exhaustive.
