Since a group of prime power order has normal subgroups of order m
for all m dividing the
order of the group, we see that A has a normal subgroup
H of order 25. From the previous paragraph, B centralizes H and
so certainly normalizes H. Thus A and B normalize H, hence
| A| and | B| divide the order of the
normalizer of H in G and we conclude
that H G. This completes the solution.
f (D) = {f (bdb-1) = f (b)f (d )f (b)-1 | b f-1(C)}.
| K|| f-1(C)/ker f| = | C|
For each prime p, let e(p) denote the largest integer such that
pe(p)R I. If p is not an associate of one of the
pi, then e(p) = 0. Set
y = p1e1... pnen. We
claim that I = yR.
First we show that
I yR. If z
I,
then by unique factorization we may write
z = qp1f1... pnfn, where the fi are nonnegative
integers and q is a product of primes which are not associate to
any of the pi. Again using unique factorization, we must have
fi
ei for all i and we deduce that z
yR.
Finally we show that
yR I. Set
J = {r
R | yr
I} (so
J = y-1I). Clearly J is an ideal of R and yJ = I. If J
R, then by Zorn's lemma J is
contained in a maximal ideal of R, which we may assume is of the
form pR where p is a prime of R. It would follow that
ypR
I, which contradicts the maximality of the e(p).
Therefore J = R and we deduce that
yR
I. Thus I = yR
and the proof is complete.
0 N
M
M/N
0