2000 Winter Qualifying Exam in Algebra (AI-generated)
Problem 1.
Let a finite group
(a) Prove
(b) Prove Burnside's formula
Proof.
Count the set of pairs
For each orbit
Summing over all orbits and using (a) proves Burnside's formula.
Problem 2.
Let
Proof.
Put
possibly nonzero entries. It consequently has at least
zero entries. For
and the assertion is immediate for
Problem 3.
Let
Proof.
The operator is nilpotent because
Problem 4.
Let
Proof.
Conjugation gives a homomorphism
Since
Problem 5.
A subgroup
Proof.
Discreteness implies that there is a shortest nonzero vector
Because
for integers
Problem 6.
Show that
Proof.
If
The action is transitive and hence nontrivial. Since
into
Problem 7.
Let
Proof.
All complex eigenvalues of a real orthogonal matrix have absolute value
Without the determinant hypothesis, the rotation
is orthogonal with determinant
Problem 8.
Show that
Proof.
Every representation of a compact group is completely reducible. Let
and
Uniqueness of irreducible decomposition makes them pairwise nonisomorphic.
Problem 9.
Let
(a) Show that
(b) Factor
Proof.
Using
gives two inequivalent factorizations into irreducibles. The needed irreducibility follows because the norm equations
Put
Then
and hence
The displayed ideals are prime because their quotients are
Problem 10.
Determine the direct-sum structure of the abelian group generated by
Proof.
The relation matrix
has rank
Consequently the group is
Problem 11.
Let
has a nontrivial solution in
Proof.
For
where the
For
in
Problem 12.
Let
Proof.
By Hilbert's basis theorem, each
where
Thus every ideal is finitely generated, so the product is Noetherian.
Problem 13.
Determine the Galois group of
Proof.
Let
Eisenstein at
The automorphisms are
with
where the second factor acts faithfully by multiplication on
Problem 14.
Let
is irreducible over
Proof.
Let
Every interior binomial coefficient
which is not divisible by
